Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Information complexity: a tutorial
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM SIGACT News
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Everywhere-tight information cost tradeoffs for augmented index
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Edit distance to monotonicity in sliding windows
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Nearly private information retrieval
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.00 |