| Publication | Date of Publication | Type |
|---|
Communication in parallel systems
| 2024-06-21 | Paper |
Server cloud scheduling
Algorithmica | 2024-04-02 | Paper |
Hot-potato routing on multi-dimensional tori
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Unifying gathering protocols for swarms of mobile robots
Lecture Notes in Computer Science | 2023-10-04 | Paper |
A Dynamic Distributed Data Structure for Top-k and k-Select Queries
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Shared memory simulations with triple-logarithmic delay
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
Lecture Notes in Computer Science | 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
Algorithms for Sensor Systems | 2022-12-09 | Paper |
A Continuous Strategy for Collisionless Gathering
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
Theoretical Computer Science | 2022-11-17 | Paper |
Server cloud scheduling
| 2022-10-19 | Paper |
Local Gathering of Mobile Robots in Three Dimensions
Structural Information and Communication Complexity | 2022-09-01 | Paper |
On the performance of networks with multiple busses
STACS 92 | 2022-08-18 | Paper |
Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract)
STACS 89 | 2022-08-16 | Paper |
On genuinely time bounded computations
STACS 89 | 2022-08-16 | Paper |
Time-optimal simulations of networks by universal parallel computers
STACS 89 | 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
Information and Computation | 2022-06-08 | Paper |
Online facility location with mobile facilities
Theoretical Computer Science | 2022-02-21 | Paper |
Dynamic data structures for realtime management of large geometric scenes (extended abstract)
| 2021-12-20 | Paper |
Managing multiple mobile resources
Theory of Computing Systems | 2021-09-28 | Paper |
The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
Theoretical Computer Science | 2021-01-25 | Paper |
A continuous strategy for collisionless gathering
Theoretical Computer Science | 2021-01-25 | Paper |
Managing multiple mobile resources
Approximation and Online Algorithms | 2020-08-24 | Paper |
Pick, pack, \& survive: charging robots in a modern warehouse based on online connected dominating sets
| 2020-08-11 | Paper |
Approximating weighted completion time for order scheduling with setup times
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Gathering anonymous, oblivious robots on a grid
Theoretical Computer Science | 2020-04-06 | Paper |
Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks
Theory of Computing Systems | 2019-09-05 | Paper |
Efficient parallel algorithms for parameterized problems
Theoretical Computer Science | 2019-08-20 | Paper |
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
Frontiers in Algorithmics | 2019-04-26 | Paper |
Strongly adaptive token distribution
Automata, Languages and Programming | 2019-03-29 | Paper |
The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
Algorithms for Sensor Systems | 2018-12-07 | Paper |
Cost-efficient scheduling on machines from the cloud
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Scheduling with interjob communication on parallel processors
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Scheduling shared continuous resources on many-cores
Journal of Scheduling | 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
Algorithmica | 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
STACS 95 | 2017-12-04 | Paper |
Exploiting storage redundancy to speed up randomized shared memory simulations
STACS 95 | 2017-12-04 | Paper |
Fault-tolerant shared memory simulations
STACS 96 | 2017-11-16 | Paper |
On the parameterized parallel complexity and the vertex cover problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Cost-efficient scheduling on machines from the cloud
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Scheduling with interjob communication on parallel processors
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Towards the price of leasing online
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
The monotone circuit value problem with bounded genus is in NC
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Transforming comparison model lower bounds to the parallel-random-access-machine
Information Processing Letters | 2016-05-26 | Paper |
Non-preemptive scheduling on machines with setup times
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Towards Flexible Demands in Online Leasing Problems
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Randomized online algorithms for set cover leasing problems
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Quality of service in network creation games
Web and Internet Economics | 2015-01-07 | Paper |
A survey on relay placement with runtime and approximation guarantees
Computer Science Review | 2014-10-24 | Paper |
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Continuous aggregation in dynamic ad-hoc networks
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science | 2014-01-13 | Paper |
A new approach for analyzing convergence algorithms for mobile robots
Automata, Languages and Programming | 2011-07-07 | Paper |
Collisionless gathering of robots with an extent
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
A continuous, local strategy for constructing a short chain of mobile robots
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Theoretical Computer Science | 2009-08-21 | Paper |
De Dictionariis Dynamicis Pauco Spatio Utentibus
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Smart Robot Teams Exploring Sparse Trees
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Labeling smart dust
| 2007-05-31 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Deterministic routing with bounded buffers: turning offline into online protocols
Combinatorica | 2007-03-29 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Congestion, dilation, and energy in radio networks
Theory of Computing Systems | 2005-02-08 | Paper |
scientific article; zbMATH DE number 2090691 (Why is no real title available?)
| 2004-08-12 | Paper |
Optimal broadcast on parallel locality models
Journal of Discrete Algorithms | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2044915 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 1775423 (Why is no real title available?)
| 2004-01-27 | Paper |
scientific article; zbMATH DE number 1759986 (Why is no real title available?)
| 2002-11-06 | Paper |
Data management in networks: Experimental evaluation of a provably good strategy
Theory of Computing Systems | 2002-06-27 | Paper |
scientific article; zbMATH DE number 1760011 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1728439 (Why is no real title available?)
| 2002-04-15 | Paper |
scientific article; zbMATH DE number 1445331 (Why is no real title available?)
| 2000-05-10 | Paper |
Contention Resolution in Hashing Based Shared Memory Simulations
SIAM Journal on Computing | 2000-03-19 | Paper |
Allocating weighted jobs in parallel
Theory of Computing Systems | 2000-01-10 | Paper |
Shortest-Path Routing in Arbitrary Networks
Journal of Algorithms | 2000-01-09 | Paper |
scientific article; zbMATH DE number 1256753 (Why is no real title available?)
| 1999-10-04 | Paper |
scientific article; zbMATH DE number 1256781 (Why is no real title available?)
| 1999-10-04 | Paper |
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
Theoretical Computer Science | 1999-01-12 | Paper |
Optimal tradeoffs between size and slowdown for universal parallel networks
Theory of Computing Systems | 1998-08-24 | Paper |
Routing on networks of optical crossbars
Theoretical Computer Science | 1998-08-13 | Paper |
A lower bound for randomized algebraic decision trees
Computational Complexity | 1998-05-13 | Paper |
Simulating shared memory in real time: On the computation power of reconfigurable architectures
Information and Computation | 1998-01-13 | Paper |
Exploiting storage redundancy to speed up randomized shared memory simulations
Theoretical Computer Science | 1997-09-10 | Paper |
scientific article; zbMATH DE number 953281 (Why is no real title available?)
| 1997-04-13 | Paper |
The Tree Model for Hashing: Lower and Upper Bounds
SIAM Journal on Computing | 1997-03-25 | Paper |
Efficient PRAM simulation on a distributed memory machine
Algorithmica | 1997-02-18 | Paper |
Strongly adaptive token distribution
Algorithmica | 1996-09-22 | Paper |
Trial and error: A new approach to space-bounded learning
Acta Informatica | 1995-11-15 | Paper |
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing | 1994-10-17 | Paper |
scientific article; zbMATH DE number 512852 (Why is no real title available?)
| 1994-04-07 | Paper |
scientific article; zbMATH DE number 177800 (Why is no real title available?)
| 1993-05-18 | Paper |
An optimal parallel dictionary
Information and Computation | 1993-05-16 | Paper |
scientific article; zbMATH DE number 18636 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 4209577 (Why is no real title available?)
| 1990-01-01 | Paper |
On computations with integer division
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
A tradeoff between search and update time for the implicit dictionary problem
Theoretical Computer Science | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4062630 (Why is no real title available?)
| 1988-01-01 | Paper |
On the limits of computations with the floor function
Information and Computation | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4072374 (Why is no real title available?)
| 1988-01-01 | Paper |
The Complexity of Parallel Sorting
SIAM Journal on Computing | 1987-01-01 | Paper |
A Time-Space Tradeoff for Element Distinctness
SIAM Journal on Computing | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3980480 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3954278 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3956454 (Why is no real title available?)
| 1986-01-01 | Paper |
Lower time bounds for solving linear diophantine equations on several parallel computational models
Information and Control | 1985-01-01 | Paper |
Efficient Simulations among Several Models of Parallel Computers
SIAM Journal on Computing | 1985-01-01 | Paper |
Lower time bounds for integer programming with two variables
Information Processing Letters | 1985-01-01 | Paper |
Lower bounds for solving linear diophantine equations on random access machines
Journal of the ACM | 1985-01-01 | Paper |
Simulating probabilistic by deterministic algebraic computation trees
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3868619 (Why is no real title available?)
| 1984-01-01 | Paper |
A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
Journal of the ACM | 1984-01-01 | Paper |
Efficiency of universal parallel computers
Acta Informatica | 1983-01-01 | Paper |
A lower time bound for the knapsack problem on random access machines
Acta Informatica | 1983-01-01 | Paper |
Infinite cube-connected cycles
Information Processing Letters | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3782388 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3723867 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3723868 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3752223 (Why is no real title available?)
| 1981-01-01 | Paper |
A comparison of two variations of a pebble game on graphs
Theoretical Computer Science | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3643087 (Why is no real title available?)
| 1979-01-01 | Paper |
