Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Parallel RAMs with owned global memory and deterministic context-free language recognition
Journal of the ACM (JACM)
Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Sampling algorithms: lower bounds and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Quantum lower bound for the collision problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Average-Case Quantum Query Complexity
STACS '00 Proceedings of the 17th 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
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Gossiping and broadcasting versus computing functions in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
Computing Boolean functions from multiple faulty copies of input bits
Theoretical Computer Science - Latin American theorotical informatics
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
ACM SIGACT News
Quantum certificate complexity
Journal of Computer and System Sciences
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the parity complexity measures of Boolean functions
Theoretical Computer Science
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Laced Boolean functions and subset sum problems in finite fields
Discrete Applied Mathematics
An improved lower bound on the sensitivity complexity of graph properties
Theoretical Computer Science
Quantum lower bounds for fanout
Quantum Information & Computation
Note: Block sensitivity of minterm-transitive functions
Theoretical Computer Science
Minterm-transitive functions with asymptotically smallest block sensitivity
Information Processing Letters
Block sensitivity of weakly symmetric functions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Sensitivity of Boolean formulas
European Journal of Combinatorics
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
Hi-index | 0.00 |