| Publication | Date of Publication | Type |
|---|
Efficient iterations for algebraic numbers
Complexity of Computer Computations | 2021-07-06 | Paper |
On nearest-neighbor graphs
Automata, Languages and Programming | 2019-12-04 | Paper |
Optimal layout of edge-weighted forests
Discrete Applied Mathematics | 1999-07-06 | Paper |
Shallow circuits and concise formulae for multiple addition and multiplication
Computational Complexity | 1994-11-29 | Paper |
Fishspear: a priority queue algorithm
Journal of the ACM | 1994-06-29 | Paper |
| scientific article; zbMATH DE number 432755 (Why is no real title available?) | 1994-01-02 | Paper |
The memory game
Theoretical Computer Science | 1993-08-30 | Paper |
Shrinkage of de Morgan formulae under restriction
Random Structures & Algorithms | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176877 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 53661 (Why is no real title available?) | 1992-09-18 | Paper |
Optimal binary space partitions for orthogonal objects
Journal of Algorithms | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4191563 (Why is no real title available?) | 1991-01-01 | Paper |
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry | 1990-01-01 | Paper |
Computing Euclidean maximum spanning trees
Algorithmica | 1990-01-01 | Paper |
Partitioning Space for Range Queries
SIAM Journal on Computing | 1989-01-01 | Paper |
Point retrieval for polygons
Journal of Algorithms | 1986-01-01 | Paper |
Impossibility of distributed consensus with one faulty process
Journal of the ACM | 1985-01-01 | Paper |
On log concavity for order-preserving maps of partial orders
Discrete Mathematics | 1984-01-01 | Paper |
Storage requirements for fair scheduling
Information Processing Letters | 1983-01-01 | Paper |
$\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
SIAM Journal on Computing | 1982-01-01 | Paper |
Efficient parallel algorithms for linear recurrence computation
Information Processing Letters | 1982-01-01 | Paper |
Optimal packing and covering in the plane are NP-complete
Information Processing Letters | 1981-01-01 | Paper |
Propositional dynamic logic is weaker without tests
Theoretical Computer Science | 1981-01-01 | Paper |
A faster algorithm computing string edit distances
Journal of Computer and System Sciences | 1980-01-01 | Paper |
Selection and sorting with limited storage
Theoretical Computer Science | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3608115 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3633715 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3635498 (Why is no real title available?) | 1977-01-01 | Paper |
Circuit size is nonlinear in depth
Theoretical Computer Science | 1976-01-01 | Paper |
Finding the median
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Completely Autoreducible Degrees
Mathematical Logic Quarterly | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3543939 (Why is no real title available?) | 1976-01-01 | Paper |
Complexity of monotone networks for Boolean matrix product
Theoretical Computer Science | 1975-01-01 | Paper |
Deterministic one-counter automata
Journal of Computer and System Sciences | 1975-01-01 | Paper |
Reversal-Bounded Acceptors and Intersections of Linear Languages
SIAM Journal on Computing | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3593487 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3471577 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3471609 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3562554 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3453571 (Why is no real title available?) | 1974-01-01 | Paper |
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
SIAM Journal on Computing | 1973-01-01 | Paper |
Optimal algorithms for parallel polynomial evaluation
Journal of Computer and System Sciences | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3532861 (Why is no real title available?) | 1973-01-01 | Paper |
Tape bounds for time-bounded Turing machines
Journal of Computer and System Sciences | 1972-01-01 | Paper |
Unsolvability in 3 × 3 Matrices
Studies in Applied Mathematics | 1970-01-01 | Paper |
