Lower bounds for dynamic algebraic problems
Information and Computation
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
Lower bounds for dynamic algebraic problems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Tradeoffs in depth-two superconcentrators
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |