| Publication | Date of Publication | Type |
|---|
| Communication in parallel systems | 2024-06-21 | Paper |
| Server cloud scheduling | 2024-04-02 | Paper |
| Hot-potato routing on multi-dimensional tori | 2024-02-28 | Paper |
| Unifying gathering protocols for swarms of mobile robots | 2023-10-04 | Paper |
| A Dynamic Distributed Data Structure for Top-k and k-Select Queries | 2023-06-30 | Paper |
| Routing with bounded buffers and hot-potato routing in vertex-symmetric networks | 2023-05-08 | Paper |
| Shared memory simulations with triple-logarithmic delay | 2023-05-08 | Paper |
| Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model | 2023-05-08 | Paper |
| The Max-Line-Formation Problem | 2023-04-21 | Paper |
| A Discrete and Continuous Study of the Max-Chain-Formation Problem | 2023-03-21 | Paper |
| Gathering Anonymous, Oblivious Robots on a Grid | 2022-12-09 | Paper |
| A Continuous Strategy for Collisionless Gathering | 2022-12-09 | Paper |
| Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation | 2022-11-17 | Paper |
| Server cloud scheduling | 2022-10-19 | Paper |
| Local Gathering of Mobile Robots in Three Dimensions | 2022-09-01 | Paper |
| On the performance of networks with multiple busses | 2022-08-18 | Paper |
| Computing minimum spanning forests on 1- and 2-dimensional processor arrays | 2022-08-16 | Paper |
| On genuinely time bounded computations | 2022-08-16 | Paper |
| Time-optimal simulations of networks by universal parallel computers | 2022-08-16 | Paper |
| Gathering a Euclidean closed chain of robots in linear time | 2022-06-24 | Paper |
| A discrete and continuous study of the \textsc{Max-Chain-Formation} problem | 2022-06-08 | Paper |
| Online facility location with mobile facilities | 2022-02-21 | Paper |
| Dynamic data structures for realtime management of large geometric scenes (extended abstract) | 2021-12-20 | Paper |
| Managing multiple mobile resources | 2021-09-28 | Paper |
| A continuous strategy for collisionless gathering | 2021-01-25 | Paper |
| The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots | 2021-01-25 | Paper |
| Managing multiple mobile resources | 2020-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3301010 | 2020-08-11 | Paper |
| Approximating Weighted Completion Time for Order Scheduling with Setup Times | 2020-07-20 | Paper |
| Gathering anonymous, oblivious robots on a grid | 2020-04-06 | Paper |
| Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks | 2019-09-05 | Paper |
| Efficient parallel algorithms for parameterized problems | 2019-08-20 | Paper |
| Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity | 2019-04-26 | Paper |
| Strongly adaptive token distribution | 2019-03-29 | Paper |
| The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots | 2018-12-07 | Paper |
| Scheduling with interjob communication on parallel processors | 2018-12-06 | Paper |
| Cost-efficient scheduling on machines from the cloud | 2018-12-06 | Paper |
| Scheduling shared continuous resources on many-cores | 2018-11-07 | Paper |
| Token dissemination in geometric dynamic networks | 2018-10-17 | Paper |
| A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks | 2018-10-17 | Paper |
| Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times | 2018-06-22 | Paper |
| A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries | 2018-06-22 | Paper |
| Towards flexible demands in online leasing problems | 2018-05-18 | Paper |
| Monitoring of domain-related problems in distributed data streams | 2018-04-12 | Paper |
| Price fluctuation in online leasing | 2018-03-26 | Paper |
| A packet routing protocol for arbitrary networks | 2017-12-04 | Paper |
| Exploiting storage redundancy to speed up randomized shared memory simulations | 2017-12-04 | Paper |
| Fault-tolerant shared memory simulations | 2017-11-16 | Paper |
| On the Parameterized Parallel Complexity and the Vertex Cover Problem | 2017-02-01 | Paper |
| Scheduling with Interjob Communication on Parallel Processors | 2017-02-01 | Paper |
| Cost-efficient scheduling on machines from the cloud | 2017-02-01 | Paper |
| Towards the price of leasing online | 2016-11-29 | Paper |
| The Monotone Circuit Value Problem with Bounded Genus Is in NC | 2016-09-02 | Paper |
| Transforming comparison model lower bounds to the parallel-random-access-machine | 2016-05-26 | Paper |
| Non-preemptive Scheduling on Machines with Setup Times | 2015-10-30 | Paper |
| Towards Flexible Demands in Online Leasing Problems | 2015-10-29 | Paper |
| Randomized Online Algorithms for Set Cover Leasing Problems | 2015-09-11 | Paper |
| Quality of Service in Network Creation Games | 2015-01-07 | Paper |
| A survey on relay placement with runtime and approximation guarantees | 2014-10-24 | Paper |
| Smoothed analysis of left-to-right maxima with applications | 2014-09-09 | Paper |
| Continuous Aggregation in Dynamic Ad-Hoc Networks | 2014-08-07 | Paper |
| Energy-efficient strategies for building short chains of mobile robots locally | 2014-01-13 | Paper |
| A New Approach for Analyzing Convergence Algorithms for Mobile Robots | 2011-07-07 | Paper |
| Collisionless Gathering of Robots with an Extent | 2011-02-15 | Paper |
| A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots | 2010-06-17 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Optimal algorithms for page migration in dynamic networks | 2009-12-10 | Paper |
| Optimal strategies for maintaining a chain of relays between an explorer and a base camp | 2009-08-21 | Paper |
| De Dictionariis Dynamicis Pauco Spatio Utentibus | 2008-09-18 | Paper |
| Smart Robot Teams Exploring Sparse Trees | 2007-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3443153 | 2007-05-31 | Paper |
| Parallel Processing and Applied Mathematics | 2007-05-02 | Paper |
| Deterministic routing with bounded buffers: turning offline into online protocols | 2007-03-29 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Congestion, dilation, and energy in radio networks | 2005-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813181 | 2004-08-12 | Paper |
| Optimal broadcast on parallel locality models | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448741 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542556 | 2004-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536900 | 2002-11-06 | Paper |
| Data management in networks: Experimental evaluation of a provably good strategy | 2002-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536936 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779604 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952649 | 2000-05-10 | Paper |
| Contention Resolution in Hashing Based Shared Memory Simulations | 2000-03-19 | Paper |
| Allocating weighted jobs in parallel | 2000-01-10 | Paper |
| Shortest-Path Routing in Arbitrary Networks | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228489 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228517 | 1999-10-04 | Paper |
| Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model | 1999-01-12 | Paper |
| Optimal tradeoffs between size and slowdown for universal parallel networks | 1998-08-24 | Paper |
| Routing on networks of optical crossbars | 1998-08-13 | Paper |
| A lower bound for randomized algebraic decision trees | 1998-05-13 | Paper |
| Simulating shared memory in real time: On the computation power of reconfigurable architectures | 1998-01-13 | Paper |
| Exploiting storage redundancy to speed up randomized shared memory simulations | 1997-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718227 | 1997-04-13 | Paper |
| The Tree Model for Hashing: Lower and Upper Bounds | 1997-03-25 | Paper |
| Efficient PRAM simulation on a distributed memory machine | 1997-02-18 | Paper |
| Strongly adaptive token distribution | 1996-09-22 | Paper |
| Trial and error: A new approach to space-bounded learning | 1995-11-15 | Paper |
| Dynamic Perfect Hashing: Upper and Lower Bounds | 1994-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281548 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038677 | 1993-05-18 | Paper |
| An optimal parallel dictionary | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976040 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357528 | 1990-01-01 | Paper |
| On computations with integer division | 1989-01-01 | Paper |
| A tradeoff between search and update time for the implicit dictionary problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796788 | 1988-01-01 | Paper |
| On the limits of computations with the floor function | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804186 | 1988-01-01 | Paper |
| The Complexity of Parallel Sorting | 1987-01-01 | Paper |
| A Time-Space Tradeoff for Element Distinctness | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745272 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3723703 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725558 | 1986-01-01 | Paper |
| Lower time bounds for solving linear diophantine equations on several parallel computational models | 1985-01-01 | Paper |
| Efficient Simulations among Several Models of Parallel Computers | 1985-01-01 | Paper |
| Lower time bounds for integer programming with two variables | 1985-01-01 | Paper |
| Lower bounds for solving linear diophantine equations on random access machines | 1985-01-01 | Paper |
| Simulating probabilistic by deterministic algebraic computation trees | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334991 | 1984-01-01 | Paper |
| A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem | 1984-01-01 | Paper |
| Efficiency of universal parallel computers | 1983-01-01 | Paper |
| A lower time bound for the knapsack problem on random access machines | 1983-01-01 | Paper |
| Infinite cube-connected cycles | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960123 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912026 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912027 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936199 | 1981-01-01 | Paper |
| A comparison of two variations of a pebble game on graphs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048639 | 1979-01-01 | Paper |
