| Publication | Date of Publication | Type |
|---|
| Stable matching: choosing which proposals to make | 2024-11-14 | Paper |
| Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup | 2021-10-20 | Paper |
| Amortized Analysis of Asynchronous Price Dynamics | 2021-08-04 | Paper |
| On the existence of Pareto efficient and envy-free allocations | 2021-05-11 | Paper |
| Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism | 2021-02-02 | Paper |
| A Truthful Cardinal Mechanism for One-Sided Matching | 2021-02-02 | Paper |
| Tatonnement beyond gross substitutes? Gradient descent to the rescue | 2020-10-26 | Paper |
| Two-Dimensional Parameterized Matching | 2018-10-30 | Paper |
| Approximating the Nash Social Welfare with Indivisible Items | 2018-07-04 | Paper |
| Slowing down sorting networks to obtain faster sorting algorithms | 2018-01-25 | Paper |
| Applications of $$\alpha $$-Strongly Regular Distributions to Bayesian Auctions | 2016-01-08 | Paper |
| Approximating the Nash Social Welfare with Indivisible Items | 2015-08-21 | Paper |
| Decentralized utilitarian mechanisms for scheduling games | 2015-08-12 | Paper |
| Suffix trays and suffix trists: structures for faster text indexing | 2015-07-10 | Paper |
| The sample complexity of revenue maximization | 2015-06-26 | Paper |
| Multi-scale self-simulation | 2015-05-07 | Paper |
| Searching dynamic point sets in spaces with bounded doubling dimension | 2014-11-25 | Paper |
| Faster suffix tree construction with missing suffix links | 2014-09-26 | Paper |
| Tatonnement beyond gross substitutes? | 2014-08-07 | Paper |
| Fast Algorithms for Constructing Maximum Entropy Summary Trees | 2014-07-01 | Paper |
| Inner product spaces for MinSum coordination mechanisms | 2014-06-05 | Paper |
| Bottleneck links, variable demand, and the tragedy of the commons | 2013-08-06 | Paper |
| Revisiting the Cache Miss Analysis of Multithreaded Algorithms | 2012-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3007250 | 2011-06-21 | Paper |
| Resource Oblivious Sorting on Multicores | 2010-09-07 | Paper |
| A fast algorithm for computing steiner edge connectivity | 2010-08-16 | Paper |
| Pricing network edges for heterogeneous selfish users | 2010-08-16 | Paper |
| Bottleneck links, variable demand, and the tragedy of the commons | 2010-08-16 | Paper |
| Dictionary matching and indexing with errors and don't cares | 2010-08-15 | Paper |
| Verifying candidate matches in sparse and wildcard matching | 2010-08-05 | Paper |
| On special families of morphisms related to \(\delta \)-matching and don't care symbols | 2009-03-23 | Paper |
| Suffix trays and suffix trists: structures for faster text indexing | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549715 | 2009-01-05 | Paper |
| Prompt Mechanisms for Online Auctions | 2008-05-02 | Paper |
| New linear-time algorithms for edge-coloring planar graphs | 2008-04-03 | Paper |
| A Generalization of Kotzig’s Theorem and Its Application | 2008-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446124 | 2008-03-06 | Paper |
| A unified access bound on comparison-based dynamic dictionaries | 2007-09-18 | Paper |
| Edge-coloring bipartite multigraphs in \(O(E \log D)\) time | 2007-03-29 | Paper |
| Formal Concept Analysis | 2007-02-12 | Paper |
| Towards Operational Abduction from a Cognitive Perspective | 2006-11-30 | Paper |
| How much can taxes help selfish routing? | 2006-06-30 | Paper |
| Dynamic LCA Queries on Trees | 2005-09-16 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046822 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737157 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471382 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449230 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542556 | 2004-01-27 | Paper |
| Faster Suffix Tree Construction with Missing Suffix Links | 2004-01-08 | Paper |
| Tree Pattern Matching to Subset Matching in Linear Time | 2003-09-28 | Paper |
| Overlap matching. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411355 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411353 | 2003-07-08 | Paper |
| A faster implementation of the Goemans-Williamson clustering algorithm | 2003-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785572 | 2003-01-05 | Paper |
| Approximate String Matching: A Simpler Faster Algorithm | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3149793 | 2002-09-26 | Paper |
| Overlap matching | 2002-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228434 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754250 | 2001-12-09 | Paper |
| On the benefit of supporting virtual channels in wormhole routers | 2001-09-09 | Paper |
| An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526971 | 2001-02-28 | Paper |
| On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences | 2000-10-18 | Paper |
| On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252294 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252740 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252293 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250214 | 1999-06-17 | Paper |
| Reconfiguring Arrays with Faults Part I: Worst-Case Faults | 1998-02-10 | Paper |
| Tighter Upper Bounds on the Exact Complexity of String Matching | 1997-06-12 | Paper |
| A nearly optimal deterministic parallel Voronoi diagram algorithm | 1997-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875202 | 1996-10-31 | Paper |
| The expected advantage of asynchrony | 1995-10-25 | Paper |
| An Asynchronous Parallel Algorithm for Undirected Graph Connectivity | 1995-04-09 | Paper |
| Tighter Lower Bounds on the Exact Complexity of String Matching | 1995-03-27 | Paper |
| Correction: Parallel Merge Sort | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138957 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038709 | 1993-05-18 | Paper |
| ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS" | 1993-04-01 | Paper |
| RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS | 1993-01-16 | Paper |
| Optimal parallel algorithms for point-set and polygon problems | 1992-06-28 | Paper |
| Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms | 1991-01-01 | Paper |
| Faster optimal parallel prefix sums and list ranking | 1989-01-01 | Paper |
| An Optimal-Time Algorithm for Slope Selection | 1989-01-01 | Paper |
| Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms | 1989-01-01 | Paper |
| Parallel Merge Sort | 1988-01-01 | Paper |
| Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time | 1988-01-01 | Paper |
| An optimally efficient selection algorithm | 1988-01-01 | Paper |
| The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798227 | 1988-01-01 | Paper |
| Optimal VLSI circuits for sorting | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795242 | 1988-01-01 | Paper |
| Shape from probing | 1987-01-01 | Paper |
| On k-Hulls and Related Problems | 1987-01-01 | Paper |
| Partitioning point sets in arbitrary dimension | 1987-01-01 | Paper |
| Deterministic coin tossing with applications to optimal parallel list ranking | 1986-01-01 | Paper |
| New upper bounds for neighbor searching | 1986-01-01 | Paper |
| Searching and storing similar lists | 1986-01-01 | Paper |
| A parallel median algorithm | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687757 | 1985-01-01 | Paper |
| Geometric retrieval problems | 1984-01-01 | Paper |
| On Edge Coloring Bipartite Graphs | 1982-01-01 | Paper |
| Two series representations of the integral \(\int_ 0^\infty \exp[- s(\psi + y \cos\psi - z \sin\psi)] d\psi\) | 1981-01-01 | Paper |
| A method for predicting the stability characteristics of three-term homogeneous recurrence relations | 1980-01-01 | Paper |
| Complementary bivariational principles for linear problems involving non-self-adjoint operators | 1980-01-01 | Paper |
| Complementary variational principles for free molecular channel flow | 1979-01-01 | Paper |
| Possibility matrices | 1979-01-01 | Paper |
| Evaluation of the integral \(\int^\infty_0t^n \exp(-t^2-x/t)dt\) | 1979-01-01 | Paper |
| ON PROJECTION AND VARIATIONAL METHODS IN KINETIC THEORY | 1979-01-01 | Paper |
| Complementary variational principles and the Bubnov-Galerkin method | 1978-01-01 | Paper |
| Complementary Variational Principles for Knudsen Flow Rates | 1977-01-01 | Paper |
| Some complementary bivariational principles for linear integral equations of Fredholm type | 1975-01-01 | Paper |
| The leading edge signal on a flat plate in uniform shear | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4049292 | 1974-01-01 | Paper |
| ALIGNED-FIELD MAGNETOHYDRODYNAMIC FLOW PAST A FLAT PLATE | 1971-01-01 | Paper |
| Definitional boolean calculi | 1969-01-01 | Paper |
