The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Journal of the ACM (JACM)
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Obtaining lower bounds using artificial components
Information Processing Letters
A tight lower bound for the complexity of path-planning for a disc
Information Processing Letters
On selecting the k largest with restricted quadratic queries
Information Processing Letters
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Lower Bounds for Problems Defined by Polynomial Inequalities
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Selecting the k Largest Elements with Parity Tests
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Hi-index | 0.00 |