159 citations · 313 across the 22 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 4 cited
Asymptotically exact streaming algorithms
Marc Heinrich, Alexander Munteanu, Christian Sohler
We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of…
cs.DS2014
Planar Graphs: Random Walks and Bipartiteness Testing
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak +1
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqr…