| Publication | Date of Publication | Type |
|---|
| Prophet matching in the probe-commit model | 2024-08-22 | Paper |
| Any-order online interval selection | 2024-07-19 | Paper |
| Primarily about primaries | 2024-04-30 | Paper |
| Secretary Matching Meets Probing with Commitment. | 2023-11-20 | Paper |
| An Experimental Study of Algorithms for Online Bipartite Matching | 2023-05-23 | Paper |
| Online Bipartite Matching in the Probe-Commit Model | 2023-03-15 | Paper |
| Towards a better understanding of pure packet routing | 2023-01-18 | Paper |
| Greedy Bipartite Matching in Random Type Poisson Arrival Model | 2021-08-04 | Paper |
| Prophet Matching Meets Probing with Commitment | 2021-02-08 | Paper |
| Greedy Approaches to Online Stochastic Matching | 2020-08-20 | Paper |
| Advice complexity of priority algorithms | 2020-06-02 | Paper |
| On conceptually simple algorithms for variants of online bipartite matching | 2019-12-19 | Paper |
| A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version | 2019-10-25 | Paper |
| Advice complexity of priority algorithms | 2019-01-15 | Paper |
| Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates | 2018-11-12 | Paper |
| On conceptually simple algorithms for variants of online bipartite matching | 2018-06-22 | Paper |
| Strategyproof mechanisms for competitive influence in networks | 2017-07-07 | Paper |
| Equilibria of Greedy Combinatorial Auctions | 2017-05-30 | Paper |
| Lower bounds for high dimensional nearest neighbor search and related problems | 2016-09-29 | Paper |
| Subquadratic approximation algorithms for clustering problems in high dimensional spaces | 2016-09-29 | Paper |
| Sequential Posted Price Mechanisms with Correlated Valuations | 2016-01-08 | Paper |
| Adversarial queuing theory | 2015-09-20 | Paper |
| Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization | 2015-09-11 | Paper |
| How much can hardware help routing? | 2015-05-07 | Paper |
| Elimination graphs | 2014-09-09 | Paper |
| How well can primal-dual and local-ratio algorithms perform? | 2014-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417647 | 2014-05-22 | Paper |
| Weakly Submodular Functions | 2014-01-26 | Paper |
| Computing (and Life) Is All about Tradeoffs | 2013-09-13 | Paper |
| Toward a model for backtracking and dynamic programming | 2012-06-26 | Paper |
| Special issue in memory of Misha Alekhnovich. Foreword | 2012-06-26 | Paper |
| Criteria for Cluster-Based Personalized Search | 2012-04-18 | Paper |
| On sum coloring and sum multi-coloring for restricted families of graphs | 2012-03-13 | Paper |
| Perturbation of the Hyper-Linked Environment | 2011-03-18 | Paper |
| On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem | 2010-09-29 | Paper |
| On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions | 2010-09-07 | Paper |
| Randomized priority algorithms | 2010-06-07 | Paper |
| Priority algorithms for graph optimization problems | 2009-12-01 | Paper |
| Elimination Graphs | 2009-07-14 | Paper |
| Priority algorithms for the subset-sum problem | 2009-07-13 | Paper |
| Priority Algorithms for the Subset-Sum Problem | 2009-03-06 | Paper |
| Cluster Based Personalized Search | 2009-02-10 | Paper |
| Further Reflections on a Theory for Basic Algorithms | 2008-01-04 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715671 | 2006-01-04 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692700 | 2005-09-28 | Paper |
| (Incremental) priority algorithms | 2005-02-11 | Paper |
| Subquadratic approximation algorithms for clustering problems in high dimensional spaces | 2005-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829011 | 2004-11-29 | Paper |
| The power of priority algorithms for facility location and set cover | 2004-11-05 | Paper |
| Stability preserving transformations: Packet routing networks with edge capacities and speeds | 2004-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411275 | 2003-07-07 | Paper |
| On randomization in on-line computation. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508375 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228491 | 2000-04-04 | Paper |
| A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223058 | 1998-12-09 | Paper |
| Tribute to Roman Smolensky (1960--1995) | 1998-05-14 | Paper |
| How much can hardware help routing? | 1998-02-17 | Paper |
| Time-space tradeoffs for undirected graph traversal by graph automata | 1997-10-13 | Paper |
| Competitive paging with locality of reference | 1995-06-08 | Paper |
| An optimal on-line algorithm for metrical task system | 1994-08-21 | Paper |
| On the decidability of sparse univariate polynomial interpolation | 1993-10-10 | Paper |
| On lower bounds for read-\(k\)-times branching programs | 1993-08-30 | Paper |
| Lower bounds on the length of universal traversal sequences | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010318 | 1992-09-27 | Paper |
| Bounds on Universal Sequences | 1989-01-01 | Paper |
| Two Applications of Inductive Counting for Complementation Problems | 1989-01-01 | Paper |
| A tradeoff between search and update time for the implicit dictionary problem | 1988-01-01 | Paper |
| A Time-Space Tradeoff for Element Distinctness | 1987-01-01 | Paper |
| Bounds for Width Two Branching Programs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745272 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725558 | 1986-01-01 | Paper |
| Routing, merging, and sorting on parallel models of computation | 1985-01-01 | Paper |
| Decreasing the nesting depth of expressions involving square roots | 1985-01-01 | Paper |
| Parallel computation for well-endowed rings and space-bounded probabilistic machines | 1983-01-01 | Paper |
| Fast parallel matrix and GCD computations | 1982-01-01 | Paper |
| A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation | 1982-01-01 | Paper |
| Structured vs. general models in computational complexity | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3962468 | 1982-01-01 | Paper |
| A time-space tradeoff for sorting on non-oblivious machines | 1981-01-01 | Paper |
| Efficient searching using partial ordering | 1981-01-01 | Paper |
| On Relating Time and Space to Size and Depth | 1977-01-01 | Paper |
| On the Number of Additions to Compute Specific Polynomials | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190138 | 1975-01-01 | Paper |
| Fast modular transforms | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4164258 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184360 | 1973-01-01 | Paper |
| Computational Complexity and the Existence of Complexity Gaps | 1972-01-01 | Paper |
| Subrecursive Programming Languages, Part I | 1972-01-01 | Paper |
| Evaluating polynomials at many points | 1971-01-01 | Paper |
