| Publication | Date of Publication | Type |
|---|
| Modern parallel algorithms (invited talk) | 2024-12-03 | Paper |
| Optimal (degree\(+1\))-coloring in congested clique | 2024-11-14 | Paper |
| Streaming algorithms for geometric Steiner forest | 2024-06-24 | Paper |
| Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph | 2024-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128570 | 2024-04-15 | Paper |
| Component stability in low-space massively parallel computation | 2024-04-09 | Paper |
| Improved Deterministic (Δ+1) Coloring in Low-Space MPC | 2024-03-26 | Paper |
| Component Stability in Low-Space Massively Parallel Computation | 2024-03-26 | Paper |
| Routing schemes for hybrid communication networks | 2024-01-11 | Paper |
| Routing schemes for hybrid communication networks | 2024-01-08 | Paper |
| Deterministic massively parallel connectivity | 2023-12-08 | Paper |
| Deterministic massively parallel connectivity | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084359 | 2023-10-31 | Paper |
| Haystack hunting hints and locker room communication | 2023-10-23 | Paper |
| Shared memory simulations with triple-logarithmic delay | 2023-05-08 | Paper |
| An optimal parallel algorithm for computing a near-optimal order of matrix multiplications | 2022-12-09 | Paper |
| Parallel and sequential approximation of shortest superstrings | 2022-12-09 | Paper |
| Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks | 2022-12-08 | Paper |
| On parallel time in population protocols | 2022-10-28 | Paper |
| Speeding up two string-matching algorithms | 2022-08-18 | Paper |
| Deterministic blind radio networks | 2022-07-21 | Paper |
| Detecting cliques in CONGEST networks | 2022-07-21 | Paper |
| Almost Tight Bounds for Reordering Buffer Management | 2022-06-08 | Paper |
| Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space | 2022-02-16 | Paper |
| Bounded degree spanning trees (extended abstract) | 2021-12-20 | Paper |
| Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC | 2021-11-19 | Paper |
| Online facility location with deletions | 2021-08-04 | Paper |
| Simple, Deterministic, Constant-Round Coloring in the Congested Clique | 2021-03-15 | Paper |
| Sublinear time approximation of the cost of a metric k-nearest neighbor graph | 2021-02-02 | Paper |
| Detecting cliques in CONGEST networks | 2021-01-22 | Paper |
| Round compression for parallel matching algorithms | 2020-10-29 | Paper |
| Planar graphs: random walks and bipartiteness testing | 2019-10-16 | Paper |
| Leader election in multi-hop radio networks | 2019-10-07 | Paper |
| Round compression for parallel matching algorithms | 2019-08-22 | Paper |
| \((1 + \varepsilon)\)-approximation for facility location in data streams | 2019-05-15 | Paper |
| An \(O(\log k)\)-competitive algorithm for generalized caching | 2019-05-10 | Paper |
| Problems on pairs of trees and the four colour problem of planar graphs (extended abstract) | 2019-03-29 | Paper |
| An \(O(\log k)\)-competitive algorithm for generalized caching | 2019-03-28 | Paper |
| Distributed methods for computing approximate equilibria | 2019-03-11 | Paper |
| Sublinear graph augmentation for fast query implementation | 2019-01-15 | Paper |
| Approximation schemes for capacitated geometric network design | 2018-11-28 | Paper |
| Testing Euclidean minimum spanning trees in the plane | 2018-11-05 | Paper |
| Deterministic communication in radio networks | 2018-02-22 | Paper |
| Faster deterministic communication in radio networks | 2017-12-19 | Paper |
| Fast generation of random permutations via networks simulation | 2017-12-05 | Paper |
| Exploiting spontaneous transmissions for broadcasting and leader election in radio networks | 2017-10-11 | Paper |
| Relating two property testing models for bounded degree directed graphs | 2017-09-29 | Paper |
| Communicating with beeps | 2017-09-29 | Paper |
| Brief announcement: Optimal leader election in multi-hop radio networks | 2017-09-29 | Paper |
| Fault-tolerant geometric spanners | 2017-09-29 | Paper |
| Distributed Methods for Computing Approximate Equilibria | 2017-02-10 | Paper |
| Transforming comparison model lower bounds to the parallel-random-access-machine | 2016-05-26 | Paper |
| Tight bounds for worst-case equilibria | 2015-09-02 | Paper |
| Computing equilibria for a service provider game with (Im)perfect information | 2015-09-02 | Paper |
| Random permutations using switching networks | 2015-08-21 | Paper |
| Testing cluster structure of graphs | 2015-08-21 | Paper |
| Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs | 2015-08-03 | Paper |
| On the expected payment of mechanisms for task allocation | 2015-08-03 | Paper |
| Computing equilibria for congestion games with (im)perfect information | 2015-08-03 | Paper |
| Approximate well-supported Nash equilibria in symmetric bimatrix games | 2015-01-14 | Paper |
| On testable properties in bounded degree graphs | 2014-12-18 | Paper |
| Finding a heaviest triangle is not harder than matrix multiplication | 2014-12-18 | Paper |
| Finding cycles and trees in sublinear time | 2014-10-16 | Paper |
| A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) | 2014-09-26 | Paper |
| Balanced allocations: the heavily loaded case | 2014-09-26 | Paper |
| Planar Graphs: Random Walks and Bipartiteness Testing | 2014-07-30 | Paper |
| Thorp shuffling, butterflies, and non-Markovian couplings | 2014-07-01 | Paper |
| Almost tight bounds for reordering buffer management | 2014-06-05 | Paper |
| Testing monotone continuous distributions on high-dimensional real cubes | 2014-05-22 | Paper |
| Optimal online buffer scheduling for block devices | 2014-05-13 | Paper |
| Fast message dissemination in random geometric networks | 2013-06-25 | Paper |
| Testing Expansion in Bounded-Degree Graphs | 2013-03-13 | Paper |
| Multiple-choice balanced allocation in (almost) parallel | 2012-11-02 | Paper |
| Approximation algorithms for buy-at-bulk geometric network design | 2012-03-13 | Paper |
| Approximation schemes for capacitated geometric network design | 2011-07-06 | Paper |
| PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\) | 2011-01-19 | Paper |
| Selfish Traffic Allocation for Server Farms | 2010-11-04 | Paper |
| Testing monotone continuous distributions on high-dimensional real cubes | 2010-10-12 | Paper |
| Sublinear-time Algorithms | 2010-10-12 | Paper |
| Local Graph Exploration and Fast Property Testing | 2010-09-06 | Paper |
| Estimating the weight of metric minimum spanning trees in sublinear-time | 2010-08-15 | Paper |
| Selfish traffic allocation for server farms | 2010-08-05 | Paper |
| Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time | 2010-07-07 | Paper |
| Perfectly balanced allocation | 2010-05-26 | Paper |
| Small space representations for metric min-sum \(k\)-clustering and their applications | 2010-05-05 | Paper |
| Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication | 2010-04-29 | Paper |
| Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs | 2010-01-06 | Paper |
| PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k\) | 2009-12-17 | Paper |
| Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth | 2009-12-04 | Paper |
| Approximation Algorithms for Buy-at-Bulk Geometric Network Design | 2009-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396583 | 2009-09-19 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks | 2009-03-05 | Paper |
| Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks | 2008-05-27 | Paper |
| Small Space Representations for Metric Min-Sum k-Clustering and Their Applications | 2007-09-03 | Paper |
| Faster algorithms for finding lowest common ancestors in directed acyclic graphs | 2007-07-16 | Paper |
| Sublinear‐time approximation algorithms for clustering via random sampling | 2007-02-07 | Paper |
| Broadcasting algorithms in radio networks with unknown topology | 2006-10-05 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Balanced Allocations: The Heavily Loaded Case | 2006-06-01 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time | 2005-10-28 | Paper |
| Abstract Combinatorial Programs and Efficient Property Testers | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Testing hypergraph colorability | 2005-04-06 | Paper |
| Fault-tolerant geometric spanners | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828962 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737224 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471376 | 2004-07-28 | Paper |
| On polynomial-time approximation algorithms for the variable length scheduling problem. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796180 | 2003-03-02 | Paper |
| Fast practical multi-pattern matching | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536939 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535042 | 2002-06-12 | Paper |
| Efficient web searching using temporal factors | 2002-03-03 | Paper |
| Soft kinetic data structures | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234122 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252299 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754202 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753932 | 2001-11-11 | Paper |
| Randomized allocation processes | 2001-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723970 | 2001-07-08 | Paper |
| Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma | 2001-07-08 | Paper |
| Recovery time of dynamic allocation processes | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952595 | 2001-02-05 | Paper |
| Delayed path coupling and generating random permutations | 2000-12-19 | Paper |
| Algorithms for the parallel alternating direction access machine | 2000-08-21 | Paper |
| Contention Resolution in Hashing Based Shared Memory Simulations | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252298 | 1999-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219046 | 1999-06-08 | Paper |
| Time and Cost Trade-Offs in Gossiping | 1998-09-21 | Paper |
| Simulating shared memory in real time: On the computation power of reconfigurable architectures | 1998-01-13 | Paper |
| Sequential and Parallel Approximation of Shortest Superstrings | 1997-07-06 | Paper |
| Guthrie's problem: new equivalences and rapid reductions | 1997-02-28 | Paper |
| Parallel maximum independent set in convex bipartite graphs | 1997-02-27 | Paper |
| Very Fast Approximation of the Matrix Chain Product Problem | 1996-10-16 | Paper |
| Speeding up two string-matching algorithms | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281529 | 1994-03-10 | Paper |
