388 search results - page 1 / 78 » Robust Lower Bounds for Communication and Stream Computation |
ECCC
2011
13 years 5 months ago
2011
COCO
2009
Springer
14 years 5 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
FMCAD
2004
Springer
14 years 4 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...