1 citations · 1 across the 4 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
Edith Cohen, Mihir Singhal, Uri Stemmer
Cardinality sketches are compact data structures that efficiently estimate the number of distinct elements across multiple queries while minimizing storage, communication, and comp…
cs.DS2025
Locally computing edge orientations
Slobodan Mitrović, Ronitt Rubinfeld, Mihir Singhal
We consider the question of orienting the edges in a graph such that every vertex has bounded out-degree. For graphs of arboricity , there is an orientation in which every v…