A deterministic algorithm for the three-dimensional diameter problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computing roadmaps of semi-algebraic sets (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
Computer algebra handbook
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
The complexity of quantifier elimination and cylindrical algebraic decomposition
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Qualitative spatial reasoning about relative point position
Journal of Visual Languages and Computing
Compositional information flow security for concurrent programs
Journal of Computer Security
Computing correlated equilibria in multi-player games
Journal of the ACM (JACM)
Theoretical Computer Science
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Qualitative Reasoning about Convex Relations
Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Inclusion dynamics hybrid automata
Information and Computation
Hardness of embedding simplicial complexes in Rd
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximability and Parameterized Complexity of Minmax Values
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Hybrid Automata in Systems Biology: How Far Can We Go?
Electronic Notes in Theoretical Computer Science (ENTCS)
Representing Relative Direction as a Binary Relation of Oriented Points
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Fast simplifications for Tarski formulas
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computational complexity of diagram satisfaction in Euclidean geometry
Journal of Complexity
Quantum automata and algebraic groups
Journal of Symbolic Computation
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Bounding the radii of balls meeting every connected component of semi-algebraic sets
Journal of Symbolic Computation
On the joint spectral radius for bounded matrix languages
RP'10 Proceedings of the 4th international conference on Reachability problems
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fast simplifications for Tarski formulas based on monomial inequalities
Journal of Symbolic Computation
On searching for small kochen-specker vector systems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Model checking stochastic branching processes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |