| Publication | Date of Publication | Type |
|---|
| On the all-pairs shortest path algorithm of Moffat and Takaoka | 2023-05-08 | Paper |
| A complete and efficient algorithm for the intersection of a general and a convex polyhedron | 2023-01-18 | Paper |
| Four results on randomized incremental constructions | 2022-08-18 | Paper |
| Fair Division of Indivisible Goods for a Class of Concave Valuations | 2022-08-02 | Paper |
| On fair division for indivisible items | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090962 | 2022-07-21 | Paper |
| Multi-Finger Binary Search Trees | 2022-07-21 | Paper |
| Trustworthy Graph Algorithms (Invited Talk) | 2022-07-21 | Paper |
| Physarum-inspired multi-commodity flow dynamics | 2022-05-17 | Paper |
| The maximum-level vertex in an arrangement of lines | 2022-03-21 | Paper |
| A Little Charity Guarantees Almost Envy-Freeness | 2021-09-10 | Paper |
| A Little Charity Guarantees Almost Envy-Freeness | 2021-02-02 | Paper |
| Convergence of the non-uniform directed physarum model | 2020-03-20 | Paper |
| Convergence of the non-uniform physarum dynamics | 2020-03-20 | Paper |
| Ratio-balanced maximum flows | 2019-09-20 | Paper |
| The Cost of Address Translation | 2019-09-12 | Paper |
| Sequential and Parallel Algorithms and Data Structures | 2019-09-05 | Paper |
| Two results on slime mold computations | 2019-05-21 | Paper |
| \textit{Physarum} can compute shortest paths | 2019-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743394 | 2019-05-10 | Paper |
| The query complexity of a permutation-based variant of mastermind | 2019-05-03 | Paper |
| Maintaining discrete probability distributions optimally | 2019-03-29 | Paper |
| AT/sup 2/-optimal Galois field multiplier for VLSI | 2018-09-14 | Paper |
| On testing substitutability | 2018-07-17 | Paper |
| An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608045 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606277 | 2018-03-02 | Paper |
| A Note On Spectral Clustering | 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 | 2018-01-12 | Paper |
| Look — a Lazy Object-Oriented Kernel for geometric computation | 2017-09-29 | Paper |
| Certifying 3-edge-connectivity | 2017-03-03 | Paper |
| Fair Matchings and Related Problems | 2017-02-21 | Paper |
| From approximate factorization to root isolation | 2017-02-10 | Paper |
| Towards more practical linear programming-based techniques for algorithmic mechanism design | 2017-02-01 | Paper |
| A still simpler way of introducing interior-point method for linear programming | 2016-12-14 | Paper |
| Opposition Frameworks | 2016-11-30 | Paper |
| On a Model of Virtual Address Translation | 2016-10-24 | Paper |
| An analysis of the highest-level selection rule in the preflow-push max-flow algorithm | 2016-06-16 | Paper |
| Improved balanced flow computation using parametric flow | 2016-05-18 | Paper |
| Fair matchings and related problems | 2016-04-06 | Paper |
| On the Implementation of Combinatorial Algorithms for the Linear Exchange Market | 2016-01-27 | Paper |
| Self-Adjusting Binary Search Trees: What Makes Them Tick? | 2015-11-19 | Paper |
| Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design | 2015-11-04 | Paper |
| Greedy Is an Almost Optimal Deque | 2015-10-30 | Paper |
| On randomized fictitious play for approximating saddle points over convex sets | 2015-10-19 | Paper |
| Rank-maximal matchings | 2015-09-02 | Paper |
| Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem | 2015-09-02 | Paper |
| Computing real roots of real polynomials | 2015-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501816 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501850 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501244 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501355 | 2015-08-03 | Paper |
| Pattern-avoiding access in binary search trees | 2015-07-24 | Paper |
| A framework for the verification of certifying computations | 2015-06-23 | Paper |
| A combinatorial polynomial algorithm for the linear Arrow-Debreu market | 2015-06-09 | Paper |
| Minimum cycle bases | 2014-11-18 | Paper |
| Certifying algorithms | 2014-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921697 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921727 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921776 | 2014-10-13 | Paper |
| Cycle bases in graphs characterization, algorithms, complexity, and applications | 2014-10-07 | Paper |
| Additive spanners and (α, β)-spanners | 2014-09-09 | Paper |
| New Approximability Results for the Robust k-Median Problem | 2014-09-02 | Paper |
| From approximate factorization to root isolation with application to cylindrical algebraic decomposition | 2014-07-16 | Paper |
| Improving the price of anarchy for selfish routing via coordination mechanisms | 2014-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396694 | 2014-02-03 | Paper |
| Certifying 3-edge-connectivity | 2013-12-06 | Paper |
| The Query Complexity of Finding a Hidden Permutation | 2013-09-13 | Paper |
| Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds | 2013-08-07 | Paper |
| A combinatorial polynomial algorithm for the linear Arrow-Debreu market | 2013-08-06 | Paper |
| On randomized fictitious play for approximating saddle points over convex sets | 2013-06-11 | Paper |
| Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge | 2013-03-07 | Paper |
| Online graph exploration: New results on old and new algorithms | 2013-01-07 | Paper |
| Counting Arbitrary Subgraphs in Data Streams | 2012-11-01 | Paper |
| Isolating real roots of real polynomials | 2012-05-13 | Paper |
| An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs | 2012-04-26 | Paper |
| A general approach to the analysis of controlled perturbation algorithms | 2011-12-28 | Paper |
| Improving the price of anarchy for selfish routing via coordination mechanisms | 2011-09-16 | Paper |
| Approximate Counting of Cycles in Streams | 2011-09-16 | Paper |
| Online Graph Exploration: New Results on Old and New Algorithms | 2011-07-07 | Paper |
| Reliable Geometric Computing | 2011-04-07 | Paper |
| New approximation algorithms for minimum cycle bases of graphs | 2011-03-30 | Paper |
| Arrangements on parametric surfaces. I: General framework and infrastructure | 2011-02-19 | Paper |
| A deterministic algorithm for isolating real roots of a real polynomial | 2010-11-19 | Paper |
| Assigning papers to referees | 2010-10-07 | Paper |
| Reliable and Efficient Geometric Computing | 2010-09-14 | Paper |
| Progress on Certifying Algorithms | 2010-09-07 | Paper |
| Algorithmen und Datenstrukturen | 2010-07-19 | Paper |
| Faster algorithms for computing Hong's bound on absolute positiveness | 2010-05-21 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Breaking the O(m 2 n) Barrier for Minimum Cycle Bases | 2009-10-29 | Paper |
| Cycle bases of graphs and sampled manifolds | 2009-10-16 | Paper |
| Faster Algorithms for Minimum Cycle Basis in Directed Graphs | 2009-08-20 | Paper |
| Note on the paper ``K-vertex guarding simple polygons | 2009-07-27 | Paper |
| A separation bound for real algebraic expressions | 2009-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5321074 | 2009-07-22 | Paper |
| An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs | 2009-03-24 | Paper |
| Optimal search for rationals | 2009-03-23 | Paper |
| A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs | 2009-03-12 | Paper |
| Reliable and Efficient Computational Geometry Via Controlled Perturbation | 2009-03-12 | Paper |
| Matchings in Graphs Variations of the Problem | 2009-03-03 | Paper |
| Reply to “Backward Error Analysis ...” | 2009-01-27 | Paper |
| Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step | 2008-09-25 | Paper |
| Minimum Cycle Bases in Graphs Algorithms and Applications | 2008-09-17 | Paper |
| Popular Matchings | 2008-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3507772 | 2008-06-20 | Paper |
| Algorithms and Data Structures | 2008-05-28 | Paper |
| Classroom examples of robustness problems in geometric computations | 2008-03-26 | Paper |
| Reliable and Efficient Geometric Computing | 2008-03-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| New bounds for the Descartes method | 2007-10-23 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| New Approximation Algorithms for Minimum Cycle Bases of Graphs | 2007-09-03 | Paper |
| Algorithms to compute minimum cycle basis in directed graphs | 2007-08-23 | Paper |
| Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments | 2007-07-04 | Paper |
| Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs | 2007-05-03 | Paper |
| Reliable and Efficient Geometric Computing | 2007-05-02 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Matching algorithms are fast in sparse random graphs | 2006-10-25 | Paper |
| Computer Algebra in Scientific Computing | 2006-07-07 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA | 2006-05-29 | Paper |
| Maximum network flow with floating point arithmetic. | 2006-01-17 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Structural filtering: a paradigm for efficient and exact geometric programs | 2005-08-05 | Paper |
| Implementation of O ( nm log n ) weighted matchings in general graphs | 2005-08-04 | Paper |
| FURTHEST SITE ABSTRACT VORONOI DIAGRAMS | 2005-06-10 | Paper |
| RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS | 2005-06-10 | Paper |
| Infimaximal Frames: A Technique for Making Lines Look Like Segments | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473034 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471290 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471306 | 2004-07-28 | Paper |
| An efficient graph algorithm for dominance constraints | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426358 | 2003-09-16 | Paper |
| A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413801 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411347 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411357 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411404 | 2003-07-08 | Paper |
| Scanning multiple sequences via cache memory | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801177 | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796707 | 2003-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796179 | 2003-03-02 | Paper |
| A polyhedral approach to sequence alignment problems | 2002-11-13 | Paper |
| A correctness certificate for the Stoer-Wagner min-cut algorithm | 2002-07-25 | Paper |
| LOOK: A lazy object-oriented kernel design for geometric computation | 2002-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768386 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753949 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754177 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2738489 | 2001-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729103 | 2001-10-23 | Paper |
| Traveling Salesman-Based Curve Reconstruction in Polynomial Time | 2001-06-21 | Paper |
| A strong and easily computable separation bound for arithmetic expressions involving radicals | 2001-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943352 | 2000-12-12 | Paper |
| A lower bound for area-universal graphs | 2000-08-02 | Paper |
| Curve reconstruction: Connecting dots with good reason | 2000-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945537 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952686 | 2000-05-10 | Paper |
| On the Expected Depth of Random Circuits | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4702188 | 1999-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268460 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252400 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218150 | 1999-05-10 | Paper |
| Checking geometric programs or verification of geometric structures | 1999-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385511 | 1998-05-04 | Paper |
| Maintaining dynamic sequences under equality tests in polylogarithmic time | 1997-06-30 | Paper |
| An $o(n^3 )$-Time Maximum-Flow Algorithm | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335189 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335212 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718223 | 1997-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3122914 | 1997-03-05 | Paper |
| A method for obtaining randomized algorithms with small tail probabilities | 1997-03-03 | Paper |
| Algorithms for dense graphs and networks on the random access computer | 1996-10-21 | Paper |
| On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm | 1996-10-20 | Paper |
| Lower bounds for set intersection queries | 1995-10-09 | Paper |
| Dynamic Point Location in General Subdivisions | 1995-09-26 | Paper |
| A communication-randomness tradeoff for two-processor systems | 1995-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763393 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763412 | 1995-04-11 | Paper |
| On local routing of two-terminal nets | 1995-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281533 | 1994-11-13 | Paper |
| Randomized incremental construction of abstract Voronoi diagrams | 1994-10-19 | Paper |
| Dynamic Perfect Hashing: Upper and Lower Bounds | 1994-10-17 | Paper |
| A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | 1994-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140421 | 1993-12-15 | Paper |
| Dynamic interpolation search | 1993-12-06 | Paper |
| Four results on randomized incremental constructions | 1993-11-01 | Paper |
| Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | 1993-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201933 | 1993-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4039849 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038695 | 1993-05-18 | Paper |
| \(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs | 1993-01-17 | Paper |
| Simultaneous inner and outer approximation of shapes | 1993-01-17 | Paper |
| Approximate motion planning and the complexity of the boundary of the union of simple geometric figures | 1993-01-17 | Paper |
| A lower bound for the nondeterministic space complexity of context-free recognition | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975933 | 1992-06-26 | Paper |
| Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves | 1992-06-25 | Paper |
| On the construction of abstract Voronoi diagrams | 1991-01-01 | Paper |
| Dynamic fractional cascading | 1990-01-01 | Paper |
| Hidden line elimination for isooriented rectangles | 1990-01-01 | Paper |
| Bounded ordered dictionaries in O(log log N) time and O(n) space | 1990-01-01 | Paper |
| Dynamic deferred data structuring | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210199 | 1990-01-01 | Paper |
| Faster algorithms for the shortest path problem | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732119 | 1989-01-01 | Paper |
| Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees | 1988-01-01 | Paper |
| Congruence, similarity, and symmetries of geometric objects | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796788 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804189 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809814 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813339 | 1988-01-01 | Paper |
| A Lower Bound on the Complexity of the Union-Split-Find Problem | 1988-01-01 | Paper |
| A faster approximation algorithm for the Steiner problem in graphs | 1988-01-01 | Paper |
| Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) | 1987-01-01 | Paper |
| A log log n data structure for three-sided range queries | 1987-01-01 | Paper |
| Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3774943 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777475 | 1987-01-01 | Paper |
| On BF-orderable graphs | 1986-01-01 | Paper |
| Channel routing in knock-knee mode: Simplified algorithms and proofs | 1986-01-01 | Paper |
| An Amortized Analysis of Insertions into AVL-Trees | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727381 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730020 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735046 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747740 | 1986-01-01 | Paper |
| Routing through a generalized switchbox | 1986-01-01 | Paper |
| Sorting jordan sequences in linear time using level-linked search trees | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727434 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686050 | 1985-01-01 | Paper |
| Fast triangulation of the plane with respect to simple polygons | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700833 | 1985-01-01 | Paper |
| Searching Semisorted Tables | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707923 | 1985-01-01 | Paper |
| Space sweep solves intersection of convex polyhedra | 1984-01-01 | Paper |
| Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories | 1984-01-01 | Paper |
| Partial match retrieval in implicit data structures | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219751 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219752 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219753 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219764 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698708 | 1984-01-01 | Paper |
| The recognition of deterministic CFLs in small time and space | 1983-01-01 | Paper |
| Area—Time optimal VLSI integer multiplier with minimum computation time | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340151 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670555 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670558 | 1983-01-01 | Paper |
| Cost Trade-offs in Graph Embeddings, with Applications | 1983-01-01 | Paper |
| A new data structure for representing sorted lists | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3321472 | 1982-01-01 | Paper |
| A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions | 1982-01-01 | Paper |
| The theory of fringe analysis and its application to 23 trees and b-trees | 1982-01-01 | Paper |
| Optimal dynamization of decomposable searching problems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343921 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902501 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907100 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917501 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3920624 | 1981-01-01 | Paper |
| Lower bounds on the efficiency of transforming static data structures into dynamic structures | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3953170 | 1981-01-01 | Paper |
| On the average number of rebalancing operations in weight-balanced trees | 1980-01-01 | Paper |
| An efficient algorithm for constructing nearly optimal prefix codes | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883520 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3890112 | 1980-01-01 | Paper |
| Codes: Unequal Probabilities, Unequal Letter Cost | 1980-01-01 | Paper |
| Some remarks on Boolean sums | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3854627 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4178501 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182532 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195958 | 1979-01-01 | Paper |
| Dynamic Binary Search | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195960 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4196354 | 1979-01-01 | Paper |
| Parsing macro grammars top down | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4199523 | 1979-01-01 | Paper |
| Effiziente Algorithmen: Ein Beispiel | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162674 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4165285 | 1978-01-01 | Paper |
| Van Wijngaarden grammars and space complexity class EXSPACE | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125766 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133122 | 1977-01-01 | Paper |
| A Best Possible Bound for The Weighted Path Length of Binary Search Trees | 1977-01-01 | Paper |
| Monotone switching circuits and Boolean matrix product | 1976-01-01 | Paper |
| Polynomial and abstract subrecursive classes | 1976-01-01 | Paper |
| Bracket-languages are recognizable in logarithmic space | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4121394 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4127399 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134975 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144808 | 1976-01-01 | Paper |
| Nearly optimal binary search trees | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4072836 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079518 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138134 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4770482 | 1974-01-01 | Paper |
