Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Processing set expressions over continuous update streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Towards proving strong direct product theorems
Computational Complexity
On the difficulty of scalably detecting network attacks
Proceedings of the 11th ACM conference on Computer and communications security
Tracking set-expression cardinalities over continuous update streams
The VLDB Journal — The International Journal on Very Large Data Bases
On the power of randomized multicounter machines
Theoretical Computer Science - Insightful theory
Join-distinct aggregate estimation over update streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Data streaming algorithms for estimating entropy of network traffic
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The communication complexity of the Hamming distance problem
Information Processing Letters
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational Complexity
Distributed computation of the mode
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Multi-party Quantum Communication Complexity with Routed Messages
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Finding duplicates in a data stream
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
On probabilistic pushdown automata
Information and Computation
Lower bounds for edit distance and product metrics via Poincaré-type inequalities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
SIAM Journal on Computing
Rewriting queries on SPARQL views
Proceedings of the 20th international conference on World wide web
Finding heavy distinct hitters in data streams
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the power of lower bound methods for one-way quantum communication complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Lower bounds for number-in-hand multiparty communication complexity, made easy
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Testing disjointness of private datasets
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Finding longest increasing and common subsequences in streaming data
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
New streaming algorithms for counting triangles in graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication
Information Processing Letters
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Streaming and communication complexity of clique approximation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Extended formulations, nonnegative factorizations, and randomized communication protocols
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
STRIP: stream learning of influence probabilities
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
| Hi-index | 0.00 |