7 citations · 17 across the 21 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Online matching games in bipartite expanders: applications to bitprobes and dictionaries with non-adaptive probing
Bruno Bauwens, Marius Zimand
A dictionary is a data structure which stores pairs (key, value). The operation query on input key returns value if the dictionary contains a pair (key, value) and nil otherwise. A…
cs.DS2022
Online matching games in bipartite expanders: Hall-type results and applications to non-blocking connectors
Bruno Bauwens, Marius Zimand
The classical Hall Theorem shows the equivalence between \emph{offline} matching in bipartite graphs and a certain expansion property. We show that lossless expansion implies effic…