Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Journal of Computer and System Sciences
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Tight bounds for the partial-sums problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
On dynamic bit-probe complexity
Theoretical Computer Science
Integer representation and counting in the bit probe model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On dynamic bit-probe complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved methods for generating quasi-gray codes
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
The dynamic complexity of formal languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.01 |