| Publication | Date of Publication | Type |
|---|
| Separating the power of EREW and CREW PRAMs with small communication width | 2023-01-18 | Paper |
| Tables should be sorted (on random access machines) | 2022-12-16 | Paper |
| Retrieval of scattered information by EREW, CREW and CRCW PRAMs | 2022-12-09 | Paper |
| Hundreds of impossibility results for distributed computing | 2020-12-04 | Paper |
| On the space complexity of randomized synchronization | 2017-09-29 | Paper |
| Optimal bounds for the predecessor problem | 2016-09-29 | Paper |
| The complexity of end-to-end communication in memoryless networks | 2015-09-11 | Paper |
| Lower bounds for adaptive collect and related objects | 2015-08-03 | Paper |
| On the inherent weakness of conditional synchronization primitives | 2015-08-03 | Paper |
| Efficient synchronous snapshots | 2015-08-03 | Paper |
| Time-space tradeoffs for implementations of snapshots | 2014-11-25 | Paper |
| Space-optimal multi-writer snapshot objects are slow | 2014-07-25 | Paper |
| On the inherent weakness of conditional primitives | 2013-06-13 | Paper |
| Relationships between broadcast and shared memory in reliable anonymous distributed systems | 2013-06-07 | Paper |
| A tight time lower bound for space-optimal implementations of multi-writer snapshots | 2010-08-16 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Graph Minors and Reliable Single Message Transmission | 2006-06-01 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems | 2005-08-17 | Paper |
| Estimating the maximum | 2005-02-22 | Paper |
| On the space complexity of randomized synchronization | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436054 | 2003-11-23 | Paper |
| Optimal bounds for the predecessor problem and related problems | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766858 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766891 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754194 | 2001-12-09 | Paper |
| Permuting in Place | 2000-07-04 | Paper |
| Separating the power of EREW and CREW PRAMs with small communication width | 1998-06-02 | Paper |
| Pointers versus arithmetic in PRAMs | 1997-03-31 | Paper |
| Limits on the power of parallel random access machines with weak forms of write conflict resolution | 1997-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281540 | 1996-07-29 | Paper |
| Retrieval of scattered information by EREW, CREW, and CRCW PRAMs | 1996-05-27 | Paper |
| Bounds on certain multiplications of affine combinations | 1995-01-09 | Paper |
| Toward Understanding Exclusive Read | 1990-01-01 | Paper |
| On the power of concurrent-write PRAMs with read-only memory | 1989-01-01 | Paper |
| Simulations among concurrent-write PRAMs | 1988-01-01 | Paper |
| The parallel complexity of exponentiating polynomials over finite fields | 1988-01-01 | Paper |
| Relations between Concurrent-Write Models of Parallel Computation | 1988-01-01 | Paper |
| A tradeoff between search and update time for the implicit dictionary problem | 1988-01-01 | Paper |
| A Time-Space Tradeoff for Element Distinctness | 1987-01-01 | Paper |
| Bounds for Width Two Branching Programs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745272 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725558 | 1986-01-01 | Paper |
| On generalized locally testable languages | 1984-01-01 | Paper |
| Lower bounds for the cycle detection problem | 1983-01-01 | Paper |
| A homomorphic characterization of regular languages | 1982-01-01 | Paper |
| Languages of R-trivial monoids | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4199560 | 1979-01-01 | Paper |
| A generalized setting for fixpoint theory | 1979-01-01 | Paper |
