Lower bounds on the complexity of graph properties
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Evasiveness of Subgraph Containment and Related Properties
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Property testing in massive graphs
Handbook of massive data sets
A generalization and proof of the Aanderaa-Rosenberg conjecture
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Determining graph properties from matrix representations
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds to randomized algorithms for graph properties
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A note on the query complexity of the Condorcet winner problem
Information Processing Letters
Adversary lower bounds for nonadaptive quantum algorithms
Journal of Computer and System Sciences
On the Aanderaa-Rosenberg Conjecture
ACM SIGACT News
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
On the sensitivity complexity of bipartite graph properties
Theoretical Computer Science
| Hi-index | 0.00 |