| Publication | Date of Publication | Type |
|---|
| Sorting pattern-avoiding permutations via 0-1 matrices forbidding product patterns | 2024-11-28 | Paper |
| On the extremal functions of acyclic forbidden 0-1 matrices | 2024-11-28 | Paper |
| Simple contention resolution via multiplicative weight updates | 2024-08-26 | Paper |
| Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time | 2024-07-03 | Paper |
| Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147406 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083382 | 2023-12-08 | Paper |
| Byzantine agreement in polynomial time with near-optimal resilience | 2023-12-08 | Paper |
| Optimal vertex connectivity oracles | 2023-12-08 | Paper |
| Information theoretic limits of cardinality estimation: Fisher meets Shannon | 2023-11-14 | Paper |
| Incremental SCC maintenance in sparse graphs | 2023-09-20 | Paper |
| Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks | 2023-09-11 | Paper |
| Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns | 2023-07-05 | Paper |
| On the Extremal Functions of Acyclic Forbidden 0-1 Matrices | 2023-06-28 | Paper |
| Near-optimal Distributed Triangle Enumeration via Expander Decompositions | 2022-12-08 | Paper |
| Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection | 2022-06-30 | Paper |
| Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers | 2022-06-28 | Paper |
| A resource-competitive jamming defense | 2022-02-15 | Paper |
| Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts | 2021-10-18 | Paper |
| Fine-grained Lower Bounds on Cops and Robbers | 2021-08-04 | Paper |
| Improved bounds for multipass pairing heaps and path-balanced binary search trees | 2021-08-04 | Paper |
| The communication complexity of set intersection and multiple equality testing | 2021-04-14 | Paper |
| The Energy Complexity of BFS in Radio Networks | 2021-03-15 | Paper |
| The Structure of Minimum Vertex Cuts | 2021-02-12 | Paper |
| The communication complexity of set intersection and multiple equality testing | 2021-02-02 | Paper |
| Contention resolution without collision detection | 2021-01-19 | Paper |
| Connectivity oracles for graphs subject to vertex failures | 2021-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116490 | 2020-08-25 | Paper |
| Distributed \((\Delta+1)\)-coloring via ultrafast graph shattering | 2020-05-28 | Paper |
| Distributed edge coloring and a special case of the constructive Lovász local lemma | 2019-12-02 | Paper |
| Exponential Separations in the Energy Complexity of Leader Election | 2019-12-02 | Paper |
| Distributed triangle detection via expander decomposition | 2019-10-15 | Paper |
| The energy complexity of broadcast | 2019-09-19 | Paper |
| An optimal distributed \((\Delta+1)\)-coloring algorithm? | 2019-08-22 | Paper |
| Mind the gap! | 2019-05-17 | Paper |
| Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths | 2019-05-06 | Paper |
| Dual-failure distance and connectivity oracles | 2019-05-06 | Paper |
| An exponential separation between randomized and deterministic complexity in the LOCAL model | 2019-02-08 | Paper |
| A time hierarchy theorem for the LOCAL model | 2019-01-14 | Paper |
| Threesomes, degenerates, and love triangles | 2018-12-06 | Paper |
| Thorup-Zwick emulators are universally optimal hopsets | 2018-12-05 | Paper |
| A hierarchy of lower bounds for sublinear additive spanners | 2018-12-05 | Paper |
| Scaling algorithms for weighted matching in general graphs | 2018-11-12 | Paper |
| Randomized minimum spanning tree algorithms using exponentially fewer random bits | 2018-11-05 | Paper |
| A linear-size logarithmic stretch path-reporting distance oracle for general graphs | 2018-11-05 | Paper |
| Contention resolution with constant throughput and log-logstar channel accesses | 2018-10-11 | Paper |
| Improved Distributed Approximate Matching | 2018-08-02 | Paper |
| Sharp bounds on Davenport-Schinzel sequences of every order | 2018-08-02 | Paper |
| Connectivity oracles for graphs subject to vertex failures | 2018-07-16 | Paper |
| Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time | 2018-07-16 | Paper |
| A Hierarchy of Lower Bounds for Sublinear Additive Spanners | 2018-07-16 | Paper |
| Higher lower bounds from the 3SUM conjecture | 2018-07-16 | Paper |
| Scaling algorithms for weighted matching in general graphs | 2018-07-16 | Paper |
| Improved bounds for multipass pairing heaps and path-balanced binary search trees | 2018-06-22 | Paper |
| Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices | 2018-05-24 | Paper |
| Simultaneously load balancing for every \(p\)-norm, with reassignments | 2018-05-03 | Paper |
| Mind the gap: essentially optimal algorithms for online dictionary matching with one gap | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608064 | 2018-03-15 | Paper |
| Faster worst case deterministic dynamic connectivity | 2018-03-02 | Paper |
| Sharp bounds on formation-free sequences | 2017-10-05 | Paper |
| A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs | 2017-10-05 | Paper |
| \((2\Delta-1)\)-edge-coloring is much easier than maximal matching in the distributed setting | 2017-10-05 | Paper |
| Contention resolution with log-logstar channel accesses | 2017-09-29 | Paper |
| Brief announcement: An exponential separation between randomized and deterministic complexity in the LOCAL model | 2017-09-29 | Paper |
| Distributed algorithms for the Lovász local lemma and graph coloring | 2017-09-04 | Paper |
| Exponential separations in the energy complexity of leader election | 2017-08-17 | Paper |
| Three generalizations of Davenport-Schinzel sequences | 2015-11-18 | Paper |
| An optimal minimum spanning tree algorithm | 2015-10-30 | Paper |
| Dynamic set intersection | 2015-10-30 | Paper |
| Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time | 2015-10-29 | Paper |
| Distributed algorithms for the Lovász local lemma and graph coloring | 2015-09-03 | Paper |
| Distributed coloring algorithms for triangle-free graphs | 2015-06-09 | Paper |
| Sharp bounds on Davenport-Schinzel sequences of every order | 2015-02-17 | Paper |
| Distributed algorithms for ultrasparse spanners and linear size skeletons | 2014-12-12 | Paper |
| Low distortion spanners | 2014-11-18 | Paper |
| New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners | 2014-10-13 | Paper |
| Linear-time approximation for maximum weight matching | 2014-09-12 | Paper |
| Additive spanners and \(({\alpha}, {\beta})\)-spanners | 2014-09-09 | Paper |
| Connectivity oracles for failure prone graphs | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417722 | 2014-05-22 | Paper |
| On nonlinear forbidden 0--1 matrices, a refutation of a Füredi-Hajnal conjecture | 2014-05-22 | Paper |
| On the structure and composition of forbidden sequences, with geometric applications | 2014-03-24 | Paper |
| Fast distributed coloring algorithms for triangle-free graphs | 2013-08-07 | Paper |
| Distributed algorithms for ultrasparse spanners and linear size skeletons | 2013-06-28 | Paper |
| A simple reduction from maximum weight matching to maximum cardinality matching | 2012-10-23 | Paper |
| Connectivity Oracles for Planar Graphs | 2012-08-14 | Paper |
| Degrees of nonlinearity in forbidden 0-1 matrix problems | 2012-04-13 | Paper |
| Origins of nonlinearity in Davenport-Schinzel sequences | 2011-10-27 | Paper |
| Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579431 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579402 | 2010-08-06 | Paper |
| A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching | 2009-07-21 | Paper |
| Low Distortion Spanners | 2007-11-28 | Paper |
| An inverse-Ackermann type lower bound for online minimum spanning tree verification | 2007-01-08 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| A Shortest Path Algorithm for Real-Weighted Undirected Graphs | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829006 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828943 | 2004-11-29 | Paper |
| A new approach to all-pairs shortest paths on real-weighted graphs | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046491 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737147 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425938 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707795 | 2003-06-11 | Paper |
| A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754133 | 2001-12-09 | Paper |
