| Publication | Date of Publication | Type |
|---|
| Fully dynamic min-cut of superconstant size in subpolynomial time | 2024-11-28 | Paper |
| Optimal decremental connectivity in non-sparse graphs | 2024-11-14 | Paper |
| A sparse Johnson-Lindenstrauss transform using fast hashing | 2024-11-14 | Paper |
| Dijkstra's single source shortest path algorithm | 2024-10-28 | Paper |
| Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time | 2024-07-03 | Paper |
| Understanding the moments of tabulation hashing via chaoses | 2024-06-24 | Paper |
| Minimum-cost paths for electric cars | 2024-05-29 | Paper |
| Reconstructing the tree of life (fitting distances by tree metrics) (invited paper) | 2024-05-27 | Paper |
| Fully dynamic exact edge connectivity in sublinear time | 2024-05-14 | Paper |
| Edge sampling and graph parameter estimation via vertex neighborhood accesses | 2023-12-08 | Paper |
| Load balancing with dynamic set of balls and bins | 2023-11-14 | Paper |
| How to cut corners and get bounded convex curvature | 2023-05-12 | Paper |
| Computing the agreement of trees with bounded degrees | 2023-05-08 | Paper |
| On sums of monotone random integer variables | 2023-01-23 | Paper |
| Optimal pointer algorithms for finding nearest common ancestors in dynamic trees | 2022-12-09 | Paper |
| Efficient preprocessing of simple binary pattern forests | 2022-12-09 | Paper |
| Finding cores of limited length | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091256 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075822 | 2022-05-11 | Paper |
| Generalized dominators for structured programs | 2022-02-16 | Paper |
| Compact cactus representations of all non-trivial min-cuts | 2021-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002669 | 2021-07-28 | Paper |
| Faster Algorithms for Edge Connectivity via Random 2-Out Contractions | 2021-02-02 | Paper |
| Three-in-a-tree in near linear time | 2021-01-19 | Paper |
| Fast hashing with strong concentration bounds | 2021-01-19 | Paper |
| Disks in Curves of Bounded Convex Curvature | 2020-08-03 | Paper |
| Non-empty Bins with Simple Tabulation Hashing | 2019-10-15 | Paper |
| Three-in-a-Tree in Near Linear Time | 2019-09-16 | Paper |
| Tabulation Based 5-Universal Hashing and Linear Probing | 2019-09-11 | Paper |
| Fast fencing | 2019-08-22 | Paper |
| More Compact Oracles for Approximate Distances in Undirected Planar Graphs | 2019-05-15 | Paper |
| Twisted Tabulation Hashing | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633941 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633877 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633909 | 2019-05-06 | Paper |
| Deterministic Edge Connectivity in Near-Linear Time | 2019-02-25 | Paper |
| Adjacency Labeling Schemes and Induced-Universal Graphs | 2019-01-16 | Paper |
| Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 | 2018-12-19 | Paper |
| Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time | 2018-11-13 | Paper |
| Compact name-independent routing with minimum stretch | 2018-11-05 | Paper |
| Roundtrip spanners and roundtrip routing in directed graphs | 2018-11-05 | Paper |
| Union-Find with Constant Time Deletions | 2018-10-30 | Paper |
| On the k -Independence Required by Linear Probing and Minwise Independence | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584896 | 2018-09-04 | Paper |
| Coloring 3-Colorable Graphs with Less than n 1/5 Colors | 2018-08-02 | Paper |
| The Power of Two Choices with Simple Tabulation | 2018-07-16 | Paper |
| Minimizing diameters of dynamic trees | 2018-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607938 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607920 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607874 | 2018-03-15 | Paper |
| Faster worst case deterministic dynamic connectivity | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606317 | 2018-03-02 | Paper |
| Finding the Maximum Subset with Bounded Convex Curvature | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601879 | 2018-01-24 | Paper |
| Coloring 3-colorable graphs with o(n 1/5 ) colors | 2017-03-03 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2016-09-29 | Paper |
| Construction and impromptu repair of an MST in a distributed network with \(o(m)\) communication | 2016-03-23 | Paper |
| RAM-Efficient External Memory Sorting | 2016-02-19 | Paper |
| Maintaining information in fully dynamic trees with top trees | 2015-09-02 | Paper |
| Black box for constant-time insertion in priority queues (note) | 2015-09-02 | Paper |
| Melding priority queues | 2015-09-02 | Paper |
| Adjacency Labeling Schemes and Induced-Universal Graphs | 2015-08-21 | Paper |
| From Independence to Expansion and Back Again | 2015-08-21 | Paper |
| Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501808 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501813 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501316 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501240 | 2015-08-03 | Paper |
| Approximate distance oracles | 2015-02-27 | Paper |
| Fully-dynamic min-cut | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934638 | 2014-12-18 | Paper |
| Time-space trade-offs for predecessor search | 2014-11-25 | Paper |
| Discounted deterministic Markov decision processes and discounted all-pairs shortest paths | 2014-11-18 | Paper |
| Near-optimal fully-dynamic graph connectivity | 2014-09-26 | Paper |
| Tight(er) worst-case bounds on dynamic searching and priority queues | 2014-09-26 | Paper |
| Approximately Minwise Independence with Twisted Tabulation | 2014-09-02 | Paper |
| Changing base without losing space | 2014-08-13 | Paper |
| Bottom-k and priority sampling, set similarity and subset sums with minimal independence | 2014-08-07 | Paper |
| The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable | 2014-07-30 | Paper |
| Algorithms and estimators for summarization of unaggregated data streams | 2014-06-10 | Paper |
| The Power of Simple Tabulation Hashing | 2014-06-05 | Paper |
| Don't rush into a union | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417708 | 2014-05-22 | Paper |
| The Power of Simple Tabulation Hashing | 2014-02-17 | Paper |
| RAM-Efficient External Memory Sorting | 2014-01-14 | Paper |
| Intra-domain traffic engineering with shortest path routing protocols | 2013-08-08 | Paper |
| Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation | 2012-08-10 | Paper |
| Speeding up dynamic shortest-path algorithms | 2012-07-28 | Paper |
| Combinatorial coloring of 3-colorable graphs | 2012-05-06 | Paper |
| Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums | 2012-02-11 | Paper |
| Maximum Overhang | 2012-01-01 | Paper |
| On the k-Independence Required by Linear Probing and Minwise Independence | 2010-09-07 | Paper |
| Worst-case update times for fully-dynamic all-pairs shortest paths | 2010-08-16 | Paper |
| Integer priority queues with decrease key in constant time and the single source shortest paths problem | 2010-08-16 | Paper |
| Space efficient dynamic stabbing with fast queries | 2010-08-16 | Paper |
| OPT versus LOAD in dynamic storage allocation | 2010-08-16 | Paper |
| Spanners and emulators with sublinear distance errors | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579383 | 2010-08-06 | Paper |
| Intra-domain traffic engineering with shortest path routing protocols | 2010-06-16 | Paper |
| Higher Lower Bounds for Near-Neighbor and Further Rich Problems | 2010-04-29 | Paper |
| Faster Regular Expression Matching | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549696 | 2009-01-05 | Paper |
| Approximate distance oracles | 2008-12-21 | Paper |
| Priority sampling for estimation of arbitrary subset sums | 2008-12-21 | Paper |
| Dynamic ordered sets with exponential search trees | 2008-12-21 | Paper |
| Equivalence between priority queues and sorting | 2008-12-21 | Paper |
| Learn More, Sample Less: Control of Volume and Variance in Network Measurement | 2008-12-21 | Paper |
| Oracles for Distances Avoiding a Failed Node or Link | 2008-10-28 | Paper |
| On the Variance of Subset Sum Estimation | 2008-09-25 | Paper |
| Compact Oracles for Approximate Distances Around Obstacles in the Plane | 2008-09-25 | Paper |
| Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? | 2008-03-11 | Paper |
| Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity | 2008-02-11 | Paper |
| Compact oracles for reachability and approximate distances in planar digraphs | 2008-01-14 | Paper |
| Survivable IP network design with OSPF routing | 2007-02-02 | Paper |
| Fast comparison of evolutionary trees | 2006-10-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2005-11-11 | Paper |
| A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing | 2005-09-22 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms | 2005-08-04 | Paper |
| OPTVersusLOADin Dynamic Storage Allocation | 2005-02-21 | Paper |
| Quick k-Median, k-Center, and Facility Location for Sparse Graphs | 2005-02-21 | Paper |
| Undirected single-source shortest paths with positive integer weights in linear time | 2005-01-25 | Paper |
| Increasing internet capacity using local search | 2005-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829021 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829020 | 2004-11-29 | Paper |
| Integer priority queues with decrease key in constant time and the single source shortest paths problem | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818842 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471360 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471292 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411340 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553236 | 2002-11-04 | Paper |
| Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations | 2002-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535022 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234121 | 2002-02-03 | Paper |
| Dynamic string searching | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721962 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721967 | 2001-07-11 | Paper |
| An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees | 2001-03-19 | Paper |
| On RAM Priority Queues | 2000-10-18 | Paper |
| Generalized dominators for structured programs | 2000-08-27 | Paper |
| Floats, Integers, and Single Source Shortest Paths | 2000-06-05 | Paper |
| Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952657 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952658 | 2000-05-10 | Paper |
| Decremental Dynamic Connectivity | 2000-03-19 | Paper |
| Dominators in Linear Time | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250223 | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250200 | 1999-06-17 | Paper |
| Fusion trees can be implemented with \(AC^0\) instructions only | 1999-04-29 | Paper |
| On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics) | 1999-02-22 | Paper |
| All structured programs have small tree width and good register allocation | 1998-11-10 | Paper |
| String matching in Lempel-Ziv compressed strings | 1998-05-24 | Paper |
| Sampling to provide or to bound: With applications to fully dynamic graph algorithms | 1998-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373690 | 1998-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542523 | 1998-01-01 | Paper |
| Parallel Shortcutting of Rooted Trees | 1997-11-18 | Paper |
| Sparse Dynamic Programming for Evolutionary-Tree Comparison | 1997-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128909 | 1997-08-14 | Paper |
| On the agreement of many trees | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875208 | 1997-01-05 | Paper |
| Efficient Preprocessing of Simple Binary Pattern Forests | 1996-12-11 | Paper |
| Shortcutting Planar Digraphs | 1996-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875169 | 1996-04-28 | Paper |
| Disambiguating grammars by exclusion of sub-parse trees | 1995-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281646 | 1994-03-10 | Paper |
| On conservative extensions of syntax in system development | 1991-01-01 | Paper |
