Sciweavers

15033 search results - page 171 / 3007
» Complexity Theory and Algorithms
Sort
View
153
Voted
SODA
1998
ACM
71views Algorithms» more  SODA 1998»
15 years 8 months ago
On the Distributed Complexity of Computing Maximal Matchings
Michal Hanckowiak, Michal Karonski, Alessandro Pan...
199
Voted
DIALM
2011
ACM
274views Algorithms» more  DIALM 2011»
14 years 10 months ago
Low complexity set reconciliation using Bloom filters
Magnus Skjegstad, Torleiv Maseng
SODA
2012
ACM
199views Algorithms» more  SODA 2012»
13 years 9 months ago
On the communication and streaming complexity of maximum bipartite matching
Ashish Goel, Michael Kapralov, Sanjeev Khanna
216
Voted
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 7 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
178
Voted
COMPGEOM
2004
ACM
16 years 12 days ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir