A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The cost of the missing bit: communication complexity with help
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hypergraphs, quasi-randomness, and conditions for regularity
Journal of Combinatorial Theory Series A
Constructing set systems with prescribed intersection sizes
Journal of Algorithms
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On relations between counting communication complexity classes
Journal of Computer and System Sciences
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Information Processing Letters
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the Non-deterministic Communication Complexity of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
Quantum multiparty communication complexity and circuit lower bounds
Mathematical Structures in Computer Science
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Random Low Degree Polynomials are Hard to Approximate
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Pseudorandom Generators and Typically-Correct Derandomization
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Information Processing Letters
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
IEEE Transactions on Information Theory
ACM SIGACT News
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Pseudorandom Bits for Polynomials
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Correlation bounds for poly-size AC0 circuits with n1-o(1) symmetric gates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Lower bounds for circuits with few modular and symmetric gates
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The multiparty communication complexity of exact-T: improved bounds and new problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The NOF multiparty communication complexity of composed functions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Shielding circuits with groups
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
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
Tradeoff lower lounds for stack machines
Computational Complexity
| Hi-index | 0.06 |