| Publication | Date of Publication | Type |
|---|
| Oblivious network RAM and leveraging parallelism to achieve obliviousness | 2019-08-13 | Paper |
| Trade-offs between communication throughput and parallel time | 2016-09-01 | Paper |
| Symmetry breaking for suffix tree construction | 2016-09-01 | Paper |
| Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness | 2016-06-10 | Paper |
| Parallel algorithms for Burrows-Wheeler compression and decompression | 2014-03-13 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism | 2005-08-04 | Paper |
| Deterministic resource discovery in distributed networks | 2004-09-22 | Paper |
| Towards a first vertical prototyping of an extremely fine-grained parallel programming approach | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547736 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2764055 | 2002-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234153 | 2001-08-28 | Paper |
| On the parallel complexity of digraph reachability | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952617 | 2000-05-10 | Paper |
| Trade-offs between communication throughput and parallel time | 1999-05-11 | Paper |
| Sorting strings and constructing digital search trees in parallel | 1997-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128924 | 1997-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128883 | 1997-04-23 | Paper |
| A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET | 1996-08-12 | Paper |
| Pattern matching in a digitized image | 1996-02-26 | Paper |
| Biconnectivity approximations and graph carvings | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763433 | 1995-04-11 | Paper |
| Almost fully-parallel parentheses matching | 1995-03-19 | Paper |
| A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers | 1994-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138911 | 1994-09-20 | Paper |
| Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima | 1994-08-14 | Paper |
| Finding level-ancestors in trees | 1994-06-29 | Paper |
| On parallel integer merging | 1993-12-20 | Paper |
| Randomized range-maxima in nearly-constant parallel time | 1993-09-16 | Paper |
| Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038730 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036578 | 1993-05-18 | Paper |
| Recursive Star-Tree Parallel Data Structure | 1993-05-17 | Paper |
| A parallel blocking flow algorithm for acyclic networks | 1993-01-16 | Paper |
| Efficient pattern matching with scaling | 1992-06-28 | Paper |
| On parallel hashing and integer sorting | 1992-06-28 | Paper |
| Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms | 1991-01-01 | Paper |
| Deterministic Sampling–A New Technique for Fast Pattern Matching | 1991-01-01 | Paper |
| Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206396 | 1990-01-01 | Paper |
| Faster optimal parallel prefix sums and list ranking | 1989-01-01 | Paper |
| Fast parallel and serial approximate string matching | 1989-01-01 | Paper |
| Parallel construction of a suffix tree with applications | 1988-01-01 | Paper |
| On Finding Lowest Common Ancestors: Simplification and Parallelization | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798229 | 1988-01-01 | Paper |
| Matching patterns in strings subject to multi-linear transformations | 1988-01-01 | Paper |
| Fast string matching with k differences | 1988-01-01 | Paper |
| Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time | 1988-01-01 | Paper |
| On finding a minimum dominating set in a tournament | 1988-01-01 | Paper |
| The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795246 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798227 | 1988-01-01 | Paper |
| Tight Comparison Bounds on the Complexity of Parallel Sorting | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783605 | 1987-01-01 | Paper |
| Efficient string matching with k mismatches | 1986-01-01 | Paper |
| Deterministic coin tossing with applications to optimal parallel list ranking | 1986-01-01 | Paper |
| Parallel ear decomposition search (EDS) and st-numbering in graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727398 | 1986-01-01 | Paper |
| An Efficient Parallel Biconnectivity Algorithm | 1985-01-01 | Paper |
| On efficient parallel strong orientation | 1985-01-01 | Paper |
| Efficient implementation of a shifting algorithm | 1985-01-01 | Paper |
| Trade-Offs between Depth and Width in Parallel Computation | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687751 | 1985-01-01 | Paper |
| Optimal parallel pattern matching in strings | 1985-01-01 | Paper |
| Optimal parallel generation of a computation tree form | 1985-01-01 | Paper |
| Solving NP-hard problems in 'almost trees': vertex cover | 1985-01-01 | Paper |
| Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories | 1984-01-01 | Paper |
| An optimal parallel connectivity algorithm | 1984-01-01 | Paper |
| Simulation of Parallel Random Access Machines by Circuits | 1984-01-01 | Paper |
| Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems | 1984-01-01 | Paper |
| Constant Depth Reducibility | 1984-01-01 | Paper |
| A parallel-design distributed-implementation (PDDI) general-purpose computer | 1984-01-01 | Paper |
| Finding Euler tours in parallel | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670587 | 1983-01-01 | Paper |
| Dynamic parallel memories | 1983-01-01 | Paper |
| Implementation of simultaneous memory address access in models that forbid it | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313267 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340151 | 1983-01-01 | Paper |
| An O(logn) parallel connectivity algorithm | 1982-01-01 | Paper |
| An O(n2log n) parallel max-flow algorithm | 1982-01-01 | Paper |
| Golden ratios in a pairs covering problem | 1982-01-01 | Paper |
| Complexity of finding k-path-free dominating sets in graphs | 1982-01-01 | Paper |
| Finding the maximum, merging, and sorting in a parallel computation model | 1981-01-01 | Paper |
