Publication | Date of Publication | Type |
---|
Prefix graphs and their applications | 2024-01-05 | Paper |
Self-simulation for the Passive Optical Star model | 2023-05-08 | Paper |
Fast and optimal simulations between CRCW PRAMs | 2022-08-18 | Paper |
The log-star revolution | 2022-08-18 | Paper |
A perfect parallel dictionary | 2022-08-18 | Paper |
Merging and sorting strings in parallel | 2022-08-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5092427 | 2022-07-21 | Paper |
On-the-Fly Array Initialization in Less Space | 2020-11-25 | Paper |
Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster | 2020-02-28 | Paper |
Fast breadth-first search in still less space | 2020-02-24 | Paper |
Highly succinct dynamic data structures | 2020-01-30 | Paper |
Rank-select indices without tears | 2020-01-16 | Paper |
Fast integer merging on the EREW PRAM | 2019-12-04 | Paper |
Maintaining discrete probability distributions optimally | 2019-03-29 | Paper |
Parallel algorithms with optimal speedup for bounded treewidth | 2019-01-10 | Paper |
Space-efficient Euler partition and bipartite edge coloring | 2018-12-04 | Paper |
Dynamic algorithms for graphs of bounded treewidth | 2018-07-04 | Paper |
Space-Efficient Euler Partition and Bipartite Edge Coloring | 2017-07-21 | Paper |
Space-efficient Basic Graph Algorithms | 2017-01-24 | Paper |
Optimal parallel string algorithms | 2016-09-01 | Paper |
Easy Multiple-Precision Divisors and Word-RAM Constants | 2015-09-16 | Paper |
Trimming of Graphs, with Application to Point Labeling | 2013-03-19 | Paper |
Kernels for Edge Dominating Set: Simpler or Smaller | 2012-09-25 | Paper |
Simpler Linear-Time Kernelization for Planar Dominating Set | 2012-06-15 | Paper |
A strengthened analysis of an algorithm for dominating set in planar graphs | 2012-05-11 | Paper |
Finding the maximum suffix with fewer comparisons | 2011-08-23 | Paper |
Trimming of graphs, with application to point labeling | 2010-10-06 | Paper |
Finding the Maximum Suffix with Fewer Comparisons | 2010-05-28 | Paper |
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees | 2010-01-21 | Paper |
A Pictorial Description of Cole’s Parallel Merge Sort | 2009-11-12 | Paper |
Online and Offline Access to Short Lists | 2008-09-17 | Paper |
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs | 2008-07-01 | Paper |
STACS 2004 | 2007-10-01 | Paper |
Simpler computation of single-source shortest paths in linear average time | 2006-10-25 | Paper |
Fast parallel space allocation, estimation, and integer sorting | 2006-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3046471 | 2004-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4411344 | 2003-07-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4796170 | 2003-03-02 | Paper |
Parallel preprocessing for path queries without concurrent reading. | 2003-01-14 | Paper |
Deterministic Dictionaries | 2002-08-01 | Paper |
Routing flow through a strongly connected graph | 2002-05-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4228437 | 2002-01-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q2762514 | 2002-01-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q2754134 | 2001-12-09 | Paper |
Dynamic algorithms for graphs of bounded treewidth | 2001-04-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4322073 | 2000-07-06 | Paper |
Self-Simulation for the Passive Optical Star | 2000-03-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4252315 | 1999-06-17 | Paper |
Characterizing multiterminal flow networks and computing flows in networks of small treewidth | 1999-02-21 | Paper |
More general parallel tree contraction: Register allocation and broadcasting in a tree | 1999-01-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4218147 | 1998-11-11 | Paper |
Parallel Algorithms with Optimal Speedup for Bounded Treewidth | 1998-09-21 | Paper |
A Reliable Randomized Algorithm for the Closest-Pair Problem | 1997-11-25 | Paper |
Improved parallel integer sorting without concurrent writing | 1997-11-10 | Paper |
An $o(n^3 )$-Time Maximum-Flow Algorithm | 1997-06-09 | Paper |
The parallel complexity of integer prefix summation | 1997-02-27 | Paper |
Fast integer merging on the EREW PRAM | 1997-01-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4886100 | 1996-08-22 | Paper |
Fast Deterministic Processor Allocation | 1995-07-03 | Paper |
A Randomized Maximum-Flow Algorithm | 1995-05-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4763434 | 1995-04-11 | Paper |
Drawing Graphs in the Plane with High Resolution | 1994-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4284248 | 1994-03-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3140395 | 1993-12-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036581 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4038695 | 1993-05-18 | Paper |
On a compaction theorem of Ragde | 1992-12-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q3974857 | 1992-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3975142 | 1992-06-26 | Paper |
Improved deterministic parallel integer sorting | 1992-06-25 | Paper |
Optimal parallel algorithms on planar graphs | 1990-01-01 | Paper |
A guided tour of Chernoff bounds | 1990-01-01 | Paper |
Improved nonconservative sequential and parallel integer sorting | 1990-01-01 | Paper |
Planar Depth-First Search in $O(\log n)$ Parallel Time | 1990-01-01 | Paper |
Optimal merging and sorting on the EREW PRAM | 1989-01-01 | Paper |
Hybridsort revisited and parallelized | 1989-01-01 | Paper |
Optimal Parallel 5-Colouring of Planar Graphs | 1989-01-01 | Paper |
On saving space in parallel computation | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3795245 | 1988-01-01 | Paper |
Towards optimal parallel bucket sorting | 1987-01-01 | Paper |
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3783597 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3727396 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4727434 | 1986-01-01 | Paper |