| Publication | Date of Publication | Type |
|---|
A formal correctness proof of Edmonds' blossom shrinking algorithm
Journal of Automated Reasoning | 2026-03-31 | Paper |
| Pattern-avoiding access in binary search trees | 2025-08-05 | Paper |
EFX exists for three agents
Journal of the ACM | 2025-02-05 | Paper |
Improving envy freeness up to any good guarantees through rainbow cycle number
Mathematics of Operations Research | 2025-01-28 | Paper |
Satiation in Fisher markets and approximation of Nash social welfare
Mathematics of Operations Research | 2024-06-27 | Paper |
On the all-pairs shortest path algorithm of Moffat and Takaoka
Lecture Notes in Computer Science | 2023-05-08 | Paper |
A complete and efficient algorithm for the intersection of a general and a convex polyhedron
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Four results on randomized incremental constructions
STACS 92 | 2022-08-18 | Paper |
Fair Division of Indivisible Goods for a Class of Concave Valuations
Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
On fair division for indivisible items
(available as arXiv preprint) | 2022-07-21 | Paper |
Multi-Finger Binary Search Trees
(available as arXiv preprint) | 2022-07-21 | Paper |
Trustworthy Graph Algorithms (Invited Talk)
(available as arXiv preprint) | 2022-07-21 | Paper |
Combinatorial algorithms for general linear Arrow-Debreu markets
(available as arXiv preprint) | 2022-07-21 | Paper |
Physarum-inspired multi-commodity flow dynamics
Theoretical Computer Science | 2022-05-17 | Paper |
The maximum-level vertex in an arrangement of lines
Discrete & Computational Geometry | 2022-03-21 | Paper |
A Little Charity Guarantees Almost Envy-Freeness
SIAM Journal on Computing | 2021-09-10 | Paper |
A Little Charity Guarantees Almost Envy-Freeness
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Convergence of the non-uniform physarum dynamics
Theoretical Computer Science | 2020-03-20 | Paper |
Convergence of the non-uniform directed physarum model
Theoretical Computer Science | 2020-03-20 | Paper |
Ratio-balanced maximum flows
Information Processing Letters | 2019-09-20 | Paper |
The cost of address translation
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Sequential and parallel algorithms and data structures. The basic toolbox | 2019-09-05 | Paper |
Two results on slime mold computations
Theoretical Computer Science | 2019-05-21 | Paper |
\textit{Physarum} can compute shortest paths
Journal of Theoretical Biology | 2019-05-14 | Paper |
| \textit{Physarum} can compute shortest paths | 2019-05-10 | Paper |
The query complexity of a permutation-based variant of mastermind
Discrete Applied Mathematics | 2019-05-03 | Paper |
Maintaining discrete probability distributions optimally
Automata, Languages and Programming | 2019-03-29 | Paper |
AT/sup 2/-optimal Galois field multiplier for VLSI
IEEE Transactions on Computers | 2018-09-14 | Paper |
On testing substitutability
Information Processing Letters | 2018-07-17 | Paper |
An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Approximating the Nash social welfare with budget-additive valuations | 2018-03-15 | Paper |
| A note on spectral clustering | 2018-03-02 | Paper |
Computing equilibria in markets with budget-additive utilities
(available as arXiv preprint) | 2018-03-02 | Paper |
| Earning limits in Fisher markets with spending-constraint utilities | 2018-02-13 | Paper |
Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness''
Journal of Symbolic Computation | 2018-01-12 | Paper |
Look — a Lazy Object-Oriented Kernel for geometric computation
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Certifying 3-edge-connectivity
Algorithmica | 2017-03-03 | Paper |
| Fair matchings and related problems | 2017-02-21 | Paper |
From approximate factorization to root isolation
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Towards more practical linear programming-based techniques for algorithmic mechanism design
Theory of Computing Systems | 2017-02-01 | Paper |
A still simpler way of introducing interior-point method for linear programming
Computer Science Review | 2016-12-14 | Paper |
Opposition Frameworks
Logics in Artificial Intelligence | 2016-11-30 | Paper |
On a model of virtual address translation
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
Information Processing Letters | 2016-06-16 | Paper |
Improved balanced flow computation using parametric flow
Information Processing Letters | 2016-05-18 | Paper |
Fair matchings and related problems
Algorithmica | 2016-04-06 | Paper |
On the implementation of combinatorial algorithms for the linear exchange market
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Self-adjusting binary search trees: what makes them tick?
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Towards more practical linear programming-based techniques for algorithmic mechanism design
Algorithmic Game Theory | 2015-11-04 | Paper |
Greedy is an almost optimal deque
Lecture Notes in Computer Science | 2015-10-30 | Paper |
On randomized fictitious play for approximating saddle points over convex sets
Algorithmica | 2015-10-19 | Paper |
Rank-maximal matchings
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Computing real roots of real polynomials
Journal of Symbolic Computation | 2015-08-24 | Paper |
| scientific article; zbMATH DE number 6472613 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472648 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469133 (Why is no real title available?) | 2015-08-03 | Paper |
| Point containment in the integer hull of a polyhedron | 2015-08-03 | Paper |
| Pattern-avoiding access in binary search trees | 2015-07-24 | Paper |
A framework for the verification of certifying computations
Journal of Automated Reasoning | 2015-06-23 | Paper |
A combinatorial polynomial algorithm for the linear Arrow-Debreu market
Information and Computation | 2015-06-09 | Paper |
Minimum cycle bases, faster and simpler
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Certifying algorithms
Computer Science Review | 2014-10-24 | Paper |
| Popular matchings | 2014-10-13 | Paper |
| Controlled perturbation for Delaunay triangulations | 2014-10-13 | Paper |
| New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners | 2014-10-13 | Paper |
Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review | 2014-10-07 | Paper |
Additive spanners and \(({\alpha}, {\beta})\)-spanners
ACM Transactions on Algorithms | 2014-09-09 | Paper |
New approximability results for the robust k-median problem
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
From approximate factorization to root isolation with application to cylindrical algebraic decomposition
Journal of Symbolic Computation | 2014-07-16 | Paper |
Improving the price of anarchy for selfish routing via coordination mechanisms
Algorithmica | 2014-07-03 | Paper |
| Weisfeiler-Lehman graph kernels | 2014-02-03 | Paper |
Certifying 3-edge-connectivity
Lecture Notes in Computer Science | 2013-12-06 | Paper |
The query complexity of finding a hidden permutation
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Physarum can compute shortest paths: convergence proofs and complexity bounds
Automata, Languages, and Programming | 2013-08-07 | Paper |
A combinatorial polynomial algorithm for the linear Arrow-Debreu market
Lecture Notes in Computer Science | 2013-08-06 | Paper |
On randomized fictitious play for approximating saddle points over convex sets
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
Journal of Graph Theory | 2013-03-07 | Paper |
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science | 2013-01-07 | Paper |
Counting arbitrary subgraphs in data streams
Automata, Languages, and Programming | 2012-11-01 | Paper |
Isolating real roots of real polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
Algorithmica | 2012-04-26 | Paper |
A general approach to the analysis of controlled perturbation algorithms
Computational Geometry | 2011-12-28 | Paper |
Approximate counting of cycles in streams
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Improving the price of anarchy for selfish routing via coordination mechanisms
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Online Graph Exploration: New Results on Old and New Algorithms
Automata, Languages and Programming | 2011-07-07 | Paper |
Reliable geometric computing
Operations Research Proceedings | 2011-04-07 | Paper |
New approximation algorithms for minimum cycle bases of graphs
Algorithmica | 2011-03-30 | Paper |
Arrangements on parametric surfaces. I: General framework and infrastructure
Mathematics in Computer Science | 2011-02-19 | Paper |
A deterministic algorithm for isolating real roots of a real polynomial
Journal of Symbolic Computation | 2010-11-19 | Paper |
Assigning papers to referees
Algorithmica | 2010-10-07 | Paper |
Reliable and efficient geometric computing
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
Progress on certifying algorithms
Frontiers in Algorithmics | 2010-09-07 | Paper |
Algorithmen und Datenstrukturen
eXamen.press | 2010-07-19 | Paper |
Faster algorithms for computing Hong's bound on absolute positiveness
Journal of Symbolic Computation | 2010-05-21 | Paper |
Boolean operations on 3D selective Nef complexes: data structure, algorithms, and implementation
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Cycle bases of graphs and sampled manifolds
Computer Aided Geometric Design | 2009-10-16 | Paper |
Faster Algorithms for Minimum Cycle Basis in Directed Graphs
SIAM Journal on Computing | 2009-08-20 | Paper |
Note on the paper ``K-vertex guarding simple polygons''
Computational Geometry | 2009-07-27 | Paper |
A separation bound for real algebraic expressions
Algorithmica | 2009-07-24 | Paper |
| LEDA. A platform for combinatorial and geometric computing. 2-part set | 2009-07-22 | Paper |
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
Algorithmica | 2009-03-24 | Paper |
Optimal search for rationals
Information Processing Letters | 2009-03-23 | Paper |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
Reliable and Efficient Computational Geometry Via Controlled Perturbation
Automata, Languages and Programming | 2009-03-12 | Paper |
Matchings in Graphs Variations of the Problem
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Reply to “Backward Error Analysis ...”
Computational Science and Its Applications - ICCSA 2006 | 2009-01-27 | Paper |
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Minimum Cycle Bases in Graphs Algorithms and Applications
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Popular Matchings
SIAM Journal on Computing | 2008-08-14 | Paper |
| Implementing minimum cycle basis algorithms | 2008-06-20 | Paper |
| Algorithms and Data Structures | 2008-05-28 | Paper |
Classroom examples of robustness problems in geometric computations
Computational Geometry | 2008-03-26 | Paper |
Reliable and Efficient Geometric Computing
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
New bounds for the Descartes method
Journal of Symbolic Computation | 2007-10-23 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
New Approximation Algorithms for Minimum Cycle Bases of Graphs
STACS 2007 | 2007-09-03 | Paper |
Algorithms to compute minimum cycle basis in directed graphs
Theory of Computing Systems | 2007-08-23 | Paper |
Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
Computational Geometry | 2007-07-04 | Paper |
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
SIAM Journal on Computing | 2007-05-03 | Paper |
Reliable and Efficient Geometric Computing
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Matching algorithms are fast in sparse random graphs
Theory of Computing Systems | 2006-10-25 | Paper |
Computer Algebra in Scientific Computing
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Maximum network flow with floating point arithmetic.
Information Processing Letters | 2006-01-17 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Structural filtering: a paradigm for efficient and exact geometric programs
Computational Geometry | 2005-08-05 | Paper |
Implementation of <i>O</i> ( <i>nm</i> log <i>n</i> ) weighted matchings in general graphs
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Infimaximal Frames: A Technique for Making Lines Look Like Segments
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2080315 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079335 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079347 (Why is no real title available?) | 2004-07-28 | Paper |
An efficient graph algorithm for dominance constraints
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1982189 (Why is no real title available?) | 2003-09-16 | Paper |
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
Algorithmica | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1951563 (Why is no real title available?) | 2003-07-21 | Paper |
| scientific article; zbMATH DE number 1947383 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947391 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947435 (Why is no real title available?) | 2003-07-08 | Paper |
Scanning multiple sequences via cache memory
Algorithmica | 2003-06-02 | Paper |
| scientific article; zbMATH DE number 1893557 (Why is no real title available?) | 2003-04-07 | Paper |
| scientific article; zbMATH DE number 1877048 (Why is no real title available?) | 2003-04-03 | Paper |
| scientific article; zbMATH DE number 1875420 (Why is no real title available?) | 2003-03-02 | Paper |
A polyhedral approach to sequence alignment problems
Discrete Applied Mathematics | 2002-11-13 | Paper |
A correctness certificate for the Stoer-Wagner min-cut algorithm
Information Processing Letters | 2002-07-25 | Paper |
LOOK: A lazy object-oriented kernel design for geometric computation
Computational Geometry | 2002-06-24 | Paper |
| An efficient algorithm for the configuration problem of dominance graphs | 2002-03-24 | Paper |
| scientific article; zbMATH DE number 1670670 (Why is no real title available?) | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1670853 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1639663 (Why is no real title available?) | 2001-11-05 | Paper |
| scientific article; zbMATH DE number 1629983 (Why is no real title available?) | 2001-10-23 | Paper |
Traveling salesman-based curve reconstruction in polynomial time
SIAM Journal on Computing | 2001-06-21 | Paper |
A strong and easily computable separation bound for arithmetic expressions involving radicals
Algorithmica | 2001-01-29 | Paper |
| scientific article; zbMATH DE number 1416161 (Why is no real title available?) | 2000-12-12 | Paper |
A lower bound for area-universal graphs
Information Processing Letters | 2000-08-02 | Paper |
Curve reconstruction: Connecting dots with good reason
Computational Geometry | 2000-07-27 | Paper |
| scientific article; zbMATH DE number 1424323 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1445366 (Why is no real title available?) | 2000-05-10 | Paper |
On the Expected Depth of Random Circuits
Combinatorics, Probability and Computing | 2000-03-07 | Paper |
| scientific article; zbMATH DE number 1368469 (Why is no real title available?) | 1999-11-24 | Paper |
| scientific article; zbMATH DE number 1354145 (Why is no real title available?) | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1305509 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1222607 (Why is no real title available?) | 1999-05-10 | Paper |
Checking geometric programs or verification of geometric structures
Computational Geometry | 1999-05-03 | Paper |
| scientific article; zbMATH DE number 1142295 (Why is no real title available?) | 1998-05-04 | Paper |
Maintaining dynamic sequences under equality tests in polylogarithmic time
Algorithmica | 1997-06-30 | Paper |
An $o(n^3 )$-Time Maximum-Flow Algorithm
SIAM Journal on Computing | 1997-06-09 | Paper |
| scientific article; zbMATH DE number 1003230 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 1003252 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 953278 (Why is no real title available?) | 1997-04-10 | Paper |
| scientific article; zbMATH DE number 986995 (Why is no real title available?) | 1997-03-05 | Paper |
A method for obtaining randomized algorithms with small tail probabilities
Algorithmica | 1997-03-03 | Paper |
Algorithms for dense graphs and networks on the random access computer
Algorithmica | 1996-10-21 | Paper |
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
Algorithmica | 1996-10-20 | Paper |
Lower bounds for set intersection queries
Algorithmica | 1995-10-09 | Paper |
Dynamic Point Location in General Subdivisions
Journal of Algorithms | 1995-09-26 | Paper |
A communication-randomness tradeoff for two-processor systems
Information and Computation | 1995-05-28 | Paper |
| scientific article; zbMATH DE number 742952 (Why is no real title available?) | 1995-04-11 | Paper |
| scientific article; zbMATH DE number 742971 (Why is no real title available?) | 1995-04-11 | Paper |
On local routing of two-terminal nets
Journal of Combinatorial Theory. Series B | 1995-02-07 | Paper |
| scientific article; zbMATH DE number 512838 (Why is no real title available?) | 1994-11-13 | Paper |
Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry | 1994-10-19 | Paper |
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing | 1994-10-17 | Paper |
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
SIAM Journal on Computing | 1994-05-10 | Paper |
| scientific article; zbMATH DE number 437544 (Why is no real title available?) | 1993-12-15 | Paper |
Dynamic interpolation search
Journal of the ACM | 1993-12-06 | Paper |
Four results on randomized incremental constructions
Computational Geometry | 1993-11-01 | Paper |
Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
Computational Geometry | 1993-11-01 | Paper |
| scientific article; zbMATH DE number 403949 (Why is no real title available?) | 1993-09-06 | Paper |
| scientific article; zbMATH DE number 192965 (Why is no real title available?) | 1993-06-05 | Paper |
| scientific article; zbMATH DE number 177817 (Why is no real title available?) | 1993-05-18 | Paper |
Simultaneous inner and outer approximation of shapes
Algorithmica | 1993-01-17 | Paper |
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Algorithmica | 1993-01-17 | Paper |
k versus k+1 index registers and modifiable versus non-modifiable programs
Information and Computation | 1993-01-17 | Paper |
A lower bound for the nondeterministic space complexity of context-free recognition
Information Processing Letters | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 18530 (Why is no real title available?) | 1992-06-26 | Paper |
Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves
SIAM Journal on Computing | 1992-06-25 | Paper |
On the construction of abstract Voronoi diagrams
Discrete & Computational Geometry | 1991-01-01 | Paper |
Faster algorithms for the shortest path problem
Journal of the ACM | 1990-01-01 | Paper |
Dynamic fractional cascading
Algorithmica | 1990-01-01 | Paper |
Bounded ordered dictionaries in O(log log N) time and O(n) space
Information Processing Letters | 1990-01-01 | Paper |
Hidden line elimination for isooriented rectangles
Information Processing Letters | 1990-01-01 | Paper |
Dynamic deferred data structuring
Information Processing Letters | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4191147 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4117868 (Why is no real title available?) | 1989-01-01 | Paper |
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters | 1988-01-01 | Paper |
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
Information Processing Letters | 1988-01-01 | Paper |
A Lower Bound on the Complexity of the Union-Split-Find Problem
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4083048 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062630 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4072377 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4079447 (Why is no real title available?) | 1988-01-01 | Paper |
Congruence, similarity, and symmetries of geometric objects
Discrete & Computational Geometry | 1988-01-01 | Paper |
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
SIAM Journal on Computing | 1987-01-01 | Paper |
A log log n data structure for three-sided range queries
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4039320 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4035134 (Why is no real title available?) | 1987-01-01 | Paper |
Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
Information and Computation | 1987-01-01 | Paper |
An Amortized Analysis of Insertions into AVL-Trees
SIAM Journal on Computing | 1986-01-01 | Paper |
On BF-orderable graphs
Discrete Applied Mathematics | 1986-01-01 | Paper |
Channel routing in knock-knee mode: Simplified algorithms and proofs
Algorithmica | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001488 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3984593 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3960996 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3958728 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3967879 (Why is no real title available?) | 1986-01-01 | Paper |
Sorting jordan sequences in linear time using level-linked search trees
Information and Control | 1986-01-01 | Paper |
Routing through a generalized switchbox
Journal of Algorithms | 1986-01-01 | Paper |
Searching Semisorted Tables
SIAM Journal on Computing | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3932954 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3909753 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3926242 (Why is no real title available?) | 1985-01-01 | Paper |
Fast triangulation of the plane with respect to simple polygons
Information and Control | 1985-01-01 | Paper |
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
Acta Informatica | 1984-01-01 | Paper |
Space sweep solves intersection of convex polyhedra
Acta Informatica | 1984-01-01 | Paper |
Partial match retrieval in implicit data structures
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3887059 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3887060 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3887061 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3887073 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3922543 (Why is no real title available?) | 1984-01-01 | Paper |
Cost Trade-offs in Graph Embeddings, with Applications
Journal of the ACM | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3825165 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3825161 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3874614 (Why is no real title available?) | 1983-01-01 | Paper |
The recognition of deterministic CFLs in small time and space
Information and Control | 1983-01-01 | Paper |
Area—Time optimal VLSI integer multiplier with minimum computation time
Information and Control | 1983-01-01 | Paper |
A new data structure for representing sorted lists
Acta Informatica | 1982-01-01 | Paper |
A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
SIAM Journal on Computing | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3852432 (Why is no real title available?) | 1982-01-01 | Paper |
The theory of fringe analysis and its application to 23 trees and b-trees
Information and Control | 1982-01-01 | Paper |
Optimal dynamization of decomposable searching problems
Information Processing Letters | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3878848 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3729460 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3716818 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3733237 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3711395 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3772947 (Why is no real title available?) | 1981-01-01 | Paper |
Lower bounds on the efficiency of transforming static data structures into dynamic structures
Mathematical Systems Theory | 1981-01-01 | Paper |
On the average number of rebalancing operations in weight-balanced trees
Theoretical Computer Science | 1980-01-01 | Paper |
Codes: Unequal Probabilities, Unequal Letter Cost
Journal of the ACM | 1980-01-01 | Paper |
An efficient algorithm for constructing nearly optimal prefix codes
IEEE Transactions on Information Theory | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3696500 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3688737 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3635945 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3640871 (Why is no real title available?) | 1979-01-01 | Paper |
Some remarks on Boolean sums
Acta Informatica | 1979-01-01 | Paper |
Dynamic Binary Search
SIAM Journal on Computing | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3614186 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3635512 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3635510 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3655354 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3619922 (Why is no real title available?) | 1979-01-01 | Paper |
Parsing macro grammars top down
Information and Control | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3596261 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3598360 (Why is no real title available?) | 1978-01-01 | Paper |
Effiziente Algorithmen: Ein Beispiel
Informatik Spektrum | 1978-01-01 | Paper |
A Best Possible Bound for The Weighted Path Length of Binary Search Trees
SIAM Journal on Computing | 1977-01-01 | Paper |
Van Wijngaarden grammars and space complexity class EXSPACE
Acta Informatica | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3557221 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3551888 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3562524 (Why is no real title available?) | 1976-01-01 | Paper |
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Bracket-languages are recognizable in logarithmic space
Information Processing Letters | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3575000 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3546709 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3553766 (Why is no real title available?) | 1976-01-01 | Paper |
Monotone switching circuits and Boolean matrix product
Computing | 1976-01-01 | Paper |
Nearly optimal binary search trees
Acta Informatica | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3497801 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3490460 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3566168 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3446413 (Why is no real title available?) | 1974-01-01 | Paper |
