Adrian Kosowski

Frederik Mallmann-Trenn

David Saulpic

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Improved Analysis of Deterministic Load-Balancing Schemes.

[BibT_eX]

[DOI]

Petra Berenbrink

Frederik Mallmann-Trenn

ACM Trans. Algorithms, 2019

Does adding more agents make a difference? A case study of cover time for the rotor-router.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond.

[BibT_eX]

[DOI]

Siddharth Gupta

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Exact Distance Oracles Using Hopsets.

[BibT_eX]

[DOI]

Siddharth Gupta

CoRR, 2018

Population Protocols Made Easy.

[BibT_eX]

[DOI]

CoRR, 2018

Universal protocols for information dissemination using emergent signals.

[BibT_eX]

[DOI]

Bartlomiej Dudek

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Ergodic Effects in Token Circulation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Brief Announcement: Population Protocols Are Fast.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Collision-free network exploration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Spreading a Confirmed Rumor: A Case for Oscillatory Dynamics.

[BibT_eX]

[DOI]

Bartlomiej Dudek

CoRR, 2017

When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.

[BibT_eX]

[DOI]

Algorithmica, 2017

Robustness of the Rotor-Router Mechanism.

[BibT_eX]

[DOI]

Algorithmica, 2017

Multiple Random Walks on Paths and Grids.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Robust Detection in Leak-Prone Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016

Bounds on the cover time of parallel rotor walks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Sublinear-Space Distance Labeling Using Hubs.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Sublinear-Space Distance Labeling Using Hubs.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Patrolling Trees with Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

Local Conflict Coloring.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Marc Heinrich

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Distinguishing views in symmetric networks: A tight lower bound.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Theor. Comput. Sci., 2015

Rendezvous of heterogeneous mobile agents in edge-weighted networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Fast collaborative graph exploration.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Position discovery for a system of bouncing robots.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Allowing each node to communicate only once in a distributed system: shared whiteboard models.

[BibT_eX]

[DOI]

Distributed Comput., 2015

Even Simpler Distance Labeling for (Sparse) Graphs.

[BibT_eX]

[DOI]

Pawel Gawrychowski

CoRR, 2015

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2015

Limit Behavior of the Multi-agent Rotor-Router System.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014

Time versus space trade-offs for rendezvous in trees.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Lock-in Problem for Parallel Rotor-router Walks.

[BibT_eX]

[DOI]

CoRR, 2014

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy.

[BibT_eX]

[DOI]

Petra Berenbrink

Frederik Mallmann-Trenn

CoRR, 2014

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

2013

Preface.

[BibT_eX]

[DOI]

Masafumi Yamashita

Theor. Comput. Sci., 2013

Maximum matching in multi-interface networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Lower Bounds on the Communication Complexity of Binary Local Quantum Measurement Simulation.

[BibT_eX]

[DOI]

Marcin Markiewicz

CoRR, 2013

Optimal patrolling of fragmented boundaries.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

A Õ (n2) Time-Space Trade-off for Undirected s-t Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network.

[BibT_eX]

[DOI]

, 2013

2012

How to meet when you forget: log-space rendezvous in arbitrary graphs.

[BibT_eX]

[DOI]

Distributed Comput., 2012

On the size of identifying codes in triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity

[BibT_eX]

[DOI]

CoRR, 2012

A Point Set Connection Problem for Autonomous Mobile Robots in a Grid.

[BibT_eX]

[DOI]

Ichiro Suzuki

Comput. Informatics, 2012

Graph Decomposition for Memoryless Periodic Exploration.

[BibT_eX]

[DOI]

Algorithmica, 2012

Time vs. space trade-offs for rendezvous in trees.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Allowing each node to communicate only once in a distributed system: shared whiteboard models.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

2011

Synchronous black hole search in directed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Review of SIROCCO 2011.

[BibT_eX]

[DOI]

Zuzanna Stamirowska

SIGACT News, 2011

Derandomizing random walks in undirected graphs using locally fair exploration strategies.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power

[BibT_eX]

[DOI]

CoRR, 2011

Synchronous Rendezvous for Location-Aware Agents.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Exploiting multi-interface networks: Connectivity and Cheapest Paths.

[BibT_eX]

[DOI]

Wirel. Networks, 2010

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences.

[BibT_eX]

[DOI]

Jérémie Chalopin

Shantanu Das

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009

Universal augmentation schemes for network navigability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Cost minimization in wireless networks with a bounded and unbounded number of interfaces.

[BibT_eX]

[DOI]

Networks, 2009

On the complexity of distributed graph coloring with local minimality constraints.

[BibT_eX]

[DOI]

Networks, 2009

Turbine stage design aided by artificial intelligence methods.

[BibT_eX]

[DOI]

Krzysztof Kosowski

Karol Tucki

Expert Syst. Appl., 2009

The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.

[BibT_eX]

[DOI]

Robert Janczewski

Discret. Math., 2009

Mixed graph edge coloring.

[BibT_eX]

[DOI]

Discret. Math., 2009

Approximating the maximum 2- and 3-edge-colorable subgraph problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

A note on the strength and minimum color sum of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Forwarding and optical indices of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

What Can Be Observed Locally?

[BibT_eX]

[DOI]

Cyril Gavoille

Marcin Markiewicz

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Euler Tour Lock-In Problem in the Rotor-Router Model.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

An Improved Strategy for Exploring a Grid Polygon.

[BibT_eX]

[DOI]

Agnieszka Kolenderska

Proceedings of the Structural Information and Communication Complexity, 2009

Synchronization Helps Robots to Detect Black Holes in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Robustness of the Rotor-router Mechanism.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Graph Decomposition for Improving Memoryless Periodic Exploration.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Forming a connected network in a grid by asynchronous and oblivious robots.

[BibT_eX]

[DOI]

Ichiro Suzuki

Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

2008

The maximum edge-disjoint paths problem in complete graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A note on mixed tree coloring.

[BibT_eX]

[DOI]

Hanna Furmanczyk

Inf. Process. Lett., 2008

Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Packing Three-Vertex Paths in 2-Connected Cubic Graphs.

[BibT_eX]

Ars Comb., 2008

Connectivity in Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007

Packing [1, Delta] -factors in graphs of small degree.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Cooperative mobile guards in grids.

[BibT_eX]

[DOI]

Comput. Geom., 2007

On the Complexity of Distributed Greedy Coloring.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Cost Minimisation in Unbounded Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2007

Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.

[BibT_eX]

[DOI]

Hanna Furmanczyk

Proceedings of the Parallel Processing and Applied Mathematics, 2007

Cost Minimisation in Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Network Control and Optimization, 2007

Application of an Online Judge & Contester System in Academic Tuition.

[BibT_eX]

[DOI]

Tomasz Noinski

Proceedings of the Advances in Web Based Learning, 2007

2006

An approximation algorithm for maximum P3-packing in subcubic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Energy Optimisation in Resilient Self-Stabilizing Processes.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Parallel Computing in Electrical Engineering (PARELEC 2006), 2006

Fault Tolerant Guarding of Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

An Efficient Algorithm for Mobile Guarded Guards in Simple Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Soft Computing, 2006

On Greedy Graph Coloring in the Distributed Model.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005

Parallel Processing Subsystems with Redundancy in a Distributed Environment.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2005

A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2005

On Bounded Load Routings for Modeling k-Regular Connection Topologies.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.

[BibT_eX]

[DOI]