| Publication | Date of Publication | Type |
|---|
Structural complexity theory: Recent surprises
SWAT 90 | 2022-12-09 | Paper |
On the complexity of incremental computation
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Space filling curves and their use in the design of geometric data structures
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Breaking symmetry in complete graphs by orienting edges: asymptotic bounds
Information Processing Letters | 2016-06-09 | Paper |
Efficient algorithms for the temporal precedence problem
Information Processing Letters | 2016-06-09 | Paper |
Vertex isoperimetric parameter of a computation graph
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
Upper and lower I/O bounds for pebbling \(r\)-pyramids
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Strong I/O lower bounds for binomial and FFT computation graphs
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Upper and lower I/O bounds for pebbling \(r\)-pyramids
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Logic Programming
Lecture Notes in Computer Science | 2009-08-06 | Paper |
The Level-Ancestor problem on pure pointer machines
Information Processing Letters | 2009-03-23 | Paper |
Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Positive Influence and Negative Dependence
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science | 2006-03-24 | Paper |
Identity orientation of complete bipartite graphs
Discrete Mathematics | 2005-04-18 | Paper |
A simple optimal solution for the temporal precedence problem on pure pointer machines
Theory of Computing Systems | 2005-02-24 | Paper |
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086234 (Why is no real title available?) | 2004-08-11 | Paper |
An optimal data structure to handle dynamic environments in non-deterministic computations
Computer Languages, Systems & Structures | 2003-05-04 | Paper |
The temporal precedence problem
Algorithmica | 2000-12-03 | Paper |
Data structures for order-sensitive predicates in parallel nondeterministic systems
Acta Informatica | 2000-10-10 | Paper |
| scientific article; zbMATH DE number 1508929 (Why is no real title available?) | 2000-09-18 | Paper |
| Balls and bins: A study in negative dependence | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1354145 (Why is no real title available?) | 1999-10-31 | Paper |
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science | 1998-07-22 | Paper |
The random oracle hypothesis is false
Journal of Computer and System Sciences | 1994-10-13 | Paper |
Improving known solutions is hard
Computational Complexity | 1993-10-18 | Paper |
| scientific article; zbMATH DE number 176749 (Why is no real title available?) | 1993-05-18 | Paper |
Quantifiers and approximation
Theoretical Computer Science | 1993-05-16 | Paper |
A tool for the analysis of manipulation
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 58312 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 17793 (Why is no real title available?) | 1992-06-26 | Paper |
Space bounded computations: Review and new separation results
Theoretical Computer Science | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4768 (Why is no real title available?) | 1992-06-25 | Paper |
