| Publication | Date of Publication | Type |
|---|
| Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model | 2024-03-26 | Paper |
| Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems | 2021-12-20 | Paper |
| A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds | 2019-09-19 | Paper |
| Fine-grained complexity for sparse graphs | 2019-08-22 | Paper |
| Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs | 2018-11-12 | Paper |
| Randomized minimum spanning tree algorithms using exponentially fewer random bits | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636490 | 2018-04-19 | Paper |
| An optimal EREW PRAM algorithm for minimum spanning tree verification | 2016-06-01 | Paper |
| Fully Dynamic Betweenness Centrality | 2016-01-11 | Paper |
| Oblivious algorithms for multicores and networks of processors | 2015-12-17 | Paper |
| An optimal minimum spanning tree algorithm | 2015-10-30 | Paper |
| Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501352 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934627 | 2014-12-18 | Paper |
| Betweenness Centrality – Incremental and Faster | 2014-10-14 | Paper |
| External-memory exact and approximate all-pairs shortest-paths in undirected graphs | 2014-10-13 | Paper |
| Efficient Fetch-and-Increment | 2013-03-13 | Paper |
| Revisiting the Cache Miss Analysis of Multithreaded Algorithms | 2012-06-29 | Paper |
| The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation | 2010-12-17 | Paper |
| Resource Oblivious Sorting on Multicores | 2010-09-07 | Paper |
| Cache-oblivious dynamic programming | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579404 | 2010-08-06 | Paper |
| Oracles for Distances Avoiding a Failed Node or Link | 2008-10-28 | Paper |
| The diameter of sparse random graphs | 2008-01-08 | 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 |
| Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427873 | 2003-09-14 | Paper |
| A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest | 2003-08-17 | 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 |
| Quasi-fully dynamic algorithms for two-connectivity and cycle equivalence | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779603 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754133 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250982 | 2000-07-19 | Paper |
| Modeling parallel bandwidth: Local versus global restrictions | 2000-07-10 | Paper |
| Planarity testing in parallel | 2000-06-21 | Paper |
| Can a shared-memory model serve as a bridging model for parallel computation? | 2000-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252429 | 1999-07-08 | Paper |
| The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms | 1998-09-21 | Paper |
| ERCW PRAMs and optical communication | 1998-08-13 | Paper |
| The queue-read queue-write asynchronous PRAM model | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385522 | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128925 | 1997-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128927 | 1997-10-05 | Paper |
| Efficient low-contention parallel algorithms | 1997-09-15 | Paper |
| Efficient massively parallel implementation of some combinatorial algorithms | 1997-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352827 | 1997-09-04 | Paper |
| Parallel Algorithms for Reducible Flow Graphs | 1997-07-06 | Paper |
| An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem | 1996-08-18 | Paper |
| Computing Minimal Spanning Subgraphs in Linear Time | 1996-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763401 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763330 | 1995-04-11 | Paper |
| On Finding Minimal Two-Connected Subgraphs | 1995-04-09 | Paper |
| Parallel random access machines with both multiplication and shifts | 1994-05-05 | Paper |
| Finding the closed partition of a planar graph | 1994-05-05 | Paper |
| Finding a Smallest Augmentation to Biconnect a Graph | 1994-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138952 | 1993-10-20 | Paper |
| Finding Triconnected Components by Local Replacement | 1993-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035173 | 1993-05-18 | Paper |
| An Optimal Parallel Algorithm for Formula Evaluation | 1993-01-16 | Paper |
| A new graph triconnectivity algorithm and its parallelization | 1992-09-27 | Paper |
| Multiplication, division, and shift instructions in parallel random access machines | 1992-09-27 | Paper |
| Improved algorithms for graph four-connectivity | 1991-01-01 | Paper |
| Transitive compaction in parallel via branchings | 1991-01-01 | Paper |
| A Minimax Arc Theorem for Reducible Flow Graphs | 1990-01-01 | Paper |
| Linear Programming with Two Variables Per Inequality in Poly-Log Time | 1990-01-01 | Paper |
| Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits | 1988-01-01 | Paper |
| Finding a minimum feedback arc set in reducible flow graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795246 | 1988-01-01 | Paper |
| Efficient parallel circuits and algorithms for division | 1988-01-01 | Paper |
| The complexity of minimum cut and maximum flow problems in an acyclic network | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727384 | 1986-01-01 | Paper |
| On driving many long wires in a VLSI layout | 1986-01-01 | Paper |
| Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection | 1986-01-01 | Paper |
| Single Residue Error Correction in Residue Number Systems | 1983-01-01 | Paper |
| A cryptographic system based on finite field transforms | 1980-01-01 | Paper |
| Exact reduction of a polynomial matrix to the Smith normal form | 1979-01-01 | Paper |
