Quantum lower bounds by polynomials
Journal of the ACM (JACM)
New Applications of the Incompressibility Method
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Information Processing Letters
Combinatorics, Probability and Computing
The plurality problem with three colors and more
Theoretical Computer Science
Information Processing Letters
Randomized Algorithms for Determining the Majority on Graphs
Combinatorics, Probability and Computing
ACM Transactions on Algorithms (TALG)
Average-case lower bounds for the plurality problem
ACM Transactions on Algorithms (TALG)
How to Play the Majority Game with Liars
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Randomized strategies for the plurality problem
Discrete Applied Mathematics
Average-case analysis of some plurality algorithms
ACM Transactions on Algorithms (TALG)
On randomized algorithms for the majority problem
Discrete Applied Mathematics
Information Processing Letters
Computing majority with triple queries
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Three optimal algorithms for balls of three colors
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The Complexity of Identifying Large Equivalence Classes
Fundamenta Informaticae
Computing majority with triple queries
Theoretical Computer Science
Majority and plurality problems
Discrete Applied Mathematics
Analysis of Boyer and Moore's MJRTY algorithm
Information Processing Letters
| Hi-index | 0.89 |