| Publication | Date of Publication | Type |
|---|
More general parallel tree contraction: register allocation and broadcasting in a tree
| 2024-06-05 | Paper |
Prefix graphs and their applications
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Self-simulation for the Passive Optical Star model
Lecture Notes in Computer Science | 2023-05-08 | Paper |
More efficient parallel flow algorithms
| 2023-03-21 | Paper |
The log-star revolution
STACS 92 | 2022-08-18 | Paper |
Merging and sorting strings in parallel
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Fast and optimal simulations between CRCW PRAMs
STACS 92 | 2022-08-18 | Paper |
A perfect parallel dictionary
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
scientific article; zbMATH DE number 7561708 (Why is no real title available?)
| 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
Algorithmica | 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
Automata, Languages and Programming | 2019-12-04 | Paper |
Maintaining discrete probability distributions optimally
Automata, Languages and Programming | 2019-03-29 | Paper |
Parallel algorithms with optimal speedup for bounded treewidth
Automata, Languages and Programming | 2019-01-10 | Paper |
Space-efficient Euler partition and bipartite edge coloring
Theoretical Computer Science | 2018-12-04 | Paper |
Dynamic algorithms for graphs of bounded treewidth
Automata, Languages and Programming | 2018-07-04 | Paper |
Space-Efficient Euler Partition and Bipartite Edge Coloring
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Space-efficient basic graph algorithms
| 2017-01-24 | Paper |
Optimal parallel string algorithms: sorting, merging and computing the minimum
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
The complexity of searching a sorted array of strings
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Easy multiple-precision divisors and word-RAM constants
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Trimming of graphs, with application to point labeling
| 2013-03-19 | Paper |
Kernels for edge dominating set: simpler or smaller
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Simpler linear-time kernelization for planar dominating set
Parameterized and Exact Computation | 2012-06-15 | Paper |
A strengthened analysis of an algorithm for dominating set in planar graphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Finding the maximum suffix with fewer comparisons
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Trimming of graphs, with application to point labeling
Theory of Computing Systems | 2010-10-06 | Paper |
Finding the maximum suffix with fewer comparisons
Lecture Notes in Computer Science | 2010-05-28 | Paper |
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
A Pictorial Description of Cole’s Parallel Merge Sort
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Online and Offline Access to Short Lists
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Simpler computation of single-source shortest paths in linear average time
Theory of Computing Systems | 2006-10-25 | Paper |
Fast parallel space allocation, estimation, and integer sorting
Information and Computation | 2006-10-10 | Paper |
scientific article; zbMATH DE number 2089203 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 1947380 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1875411 (Why is no real title available?)
| 2003-03-02 | Paper |
Parallel preprocessing for path queries without concurrent reading.
Information and Computation | 2003-01-14 | Paper |
Deterministic dictionaries
Journal of Algorithms | 2002-08-01 | Paper |
Routing flow through a strongly connected graph
Algorithmica | 2002-05-21 | Paper |
scientific article; zbMATH DE number 1256701 (Why is no real title available?)
| 2002-01-17 | Paper |
scientific article; zbMATH DE number 1688373 (Why is no real title available?)
| 2002-01-09 | Paper |
scientific article; zbMATH DE number 1670814 (Why is no real title available?)
| 2001-12-09 | Paper |
Dynamic algorithms for graphs of bounded treewidth
Algorithmica | 2001-04-24 | Paper |
Tight bounds for searching a sorted array of strings
SIAM Journal on Computing | 2001-03-19 | Paper |
scientific article; zbMATH DE number 720179 (Why is no real title available?)
| 2000-07-06 | Paper |
Self-Simulation for the Passive Optical Star
Journal of Algorithms | 2000-03-16 | Paper |
scientific article; zbMATH DE number 1305431 (Why is no real title available?)
| 1999-06-17 | Paper |
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Journal of Computer and System Sciences | 1999-02-21 | Paper |
More general parallel tree contraction: Register allocation and broadcasting in a tree
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1222605 (Why is no real title available?)
| 1998-11-11 | Paper |
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
SIAM Journal on Computing | 1998-09-21 | Paper |
A Reliable Randomized Algorithm for the Closest-Pair Problem
Journal of Algorithms | 1997-11-25 | Paper |
Improved parallel integer sorting without concurrent writing
Information and Computation | 1997-11-10 | Paper |
An $o(n^3 )$-Time Maximum-Flow Algorithm
SIAM Journal on Computing | 1997-06-09 | Paper |
The parallel complexity of integer prefix summation
Information Processing Letters | 1997-02-27 | Paper |
Fast integer merging on the EREW PRAM
Algorithmica | 1997-01-22 | Paper |
scientific article; zbMATH DE number 910923 (Why is no real title available?)
| 1996-08-22 | Paper |
Fast Deterministic Processor Allocation
Journal of Algorithms | 1995-07-03 | Paper |
A Randomized Maximum-Flow Algorithm
SIAM Journal on Computing | 1995-05-30 | Paper |
scientific article; zbMATH DE number 742994 (Why is no real title available?)
| 1995-04-11 | Paper |
Drawing Graphs in the Plane with High Resolution
SIAM Journal on Computing | 1994-10-10 | Paper |
scientific article; zbMATH DE number 522854 (Why is no real title available?)
| 1994-03-24 | Paper |
scientific article; zbMATH DE number 437523 (Why is no real title available?)
| 1993-12-15 | Paper |
scientific article; zbMATH DE number 176751 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 177817 (Why is no real title available?)
| 1993-05-18 | Paper |
On a compaction theorem of Ragde
Information Processing Letters | 1992-12-06 | Paper |
scientific article; zbMATH DE number 17801 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 17533 (Why is no real title available?)
| 1992-06-26 | Paper |
Improved deterministic parallel integer sorting
Information and Computation | 1992-06-25 | Paper |
Planar Depth-First Search in $O(\log n)$ Parallel Time
SIAM Journal on Computing | 1990-01-01 | Paper |
A guided tour of Chernoff bounds
Information Processing Letters | 1990-01-01 | Paper |
Optimal parallel algorithms on planar graphs
Information and Computation | 1990-01-01 | Paper |
Improved nonconservative sequential and parallel integer sorting
Information Processing Letters | 1990-01-01 | Paper |
Optimal Parallel 5-Colouring of Planar Graphs
SIAM Journal on Computing | 1989-01-01 | Paper |
Optimal merging and sorting on the EREW PRAM
Information Processing Letters | 1989-01-01 | Paper |
Hybridsort revisited and parallelized
Information Processing Letters | 1989-01-01 | Paper |
On saving space in parallel computation
Information Processing Letters | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4060742 (Why is no real title available?)
| 1988-01-01 | Paper |
Towards optimal parallel bucket sorting
Information and Computation | 1987-01-01 | Paper |
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
SIAM Journal on Computing | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4047151 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3958742 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4001488 (Why is no real title available?)
| 1986-01-01 | Paper |
