| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128571 | 2024-04-15 | Paper |
| Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority | 2024-03-26 | Paper |
| Perpetual maintenance of machines with different urgency requirements | 2023-10-24 | Paper |
| Searching with increasing speeds | 2023-08-02 | Paper |
| Fast deterministic simulation of computations on faulty parallel machines | 2023-05-08 | Paper |
| Efficient algorithms for Lempel-Ziv encoding | 2022-12-09 | Paper |
| Efficient parallel computing with memory faults | 2022-12-09 | Paper |
| Parallel and sequential approximation of shortest superstrings | 2022-12-09 | Paper |
| Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election | 2022-12-08 | Paper |
| Selected papers of the 31st international workshop on combinatorial algorithms, IWOCA 2020 | 2022-10-06 | Paper |
| On convergence and threshold properties of discrete Lotka-Volterra population protocols | 2022-08-26 | Paper |
| Speeding up two string-matching algorithms | 2022-08-18 | Paper |
| Information gathering in ad-hoc radio networks | 2021-11-25 | Paper |
| Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases | 2021-03-10 | Paper |
| Symmetry Breaking in the Plane | 2021-01-20 | Paper |
| Deterministic broadcasting in ad hoc radio networks | 2020-12-03 | Paper |
| Randomized probe selection algorithm for microarray design | 2020-11-11 | Paper |
| On the curve complexity of 3-colored point-set embeddings | 2020-11-06 | Paper |
| Patrolling on dynamic ring networks | 2020-10-22 | Paper |
| Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits | 2020-10-21 | Paper |
| On realizing shapes in the theory of RNA neutral networks | 2020-07-09 | Paper |
| Asynchronous rendezvous with different maps | 2020-03-03 | Paper |
| Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements | 2020-02-06 | Paper |
| The Match-Maker: Constant-Space Distributed Majority via Random Walks | 2020-01-14 | Paper |
| Pushing the online matrix-vector conjecture off-line and identifying its easy cases | 2019-10-11 | Paper |
| Deterministic rendezvous with different maps | 2019-08-30 | Paper |
| Temporal flows in temporal networks | 2019-06-25 | Paper |
| Communication and location discovery in geometric ring networks | 2019-05-02 | Paper |
| Colored Point-Set Embeddings of Acyclic Graphs | 2019-02-20 | Paper |
| Linear search by a pair of distinct-speed robots | 2019-01-11 | Paper |
| Deterministic Population Protocols for Exact Majority and Plurality. | 2018-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607897 | 2018-03-15 | Paper |
| Information gathering in ad-hoc radio networks with tree topology | 2017-12-20 | Paper |
| Two-dimensional pattern matching in linear time and small space | 2017-12-04 | Paper |
| When patrolmen become corrupted: monitoring a graph using faulty mobile robots | 2017-11-09 | Paper |
| The complexity of optimal design of temporally connected graphs | 2017-10-12 | Paper |
| Efficiently correcting matrix products | 2017-10-10 | Paper |
| Robustness of the rotor-router mechanism | 2017-10-09 | Paper |
| Temporal flows in temporal networks | 2017-07-21 | Paper |
| Collision-free network exploration | 2017-05-26 | Paper |
| Doing-it-all with bounded work and communication | 2017-05-18 | Paper |
| Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) | 2017-04-04 | Paper |
| Rendezvous Problem | 2017-02-20 | Paper |
| Linear Search by a Pair of Distinct-Speed Robots | 2016-12-01 | Paper |
| On Temporally Connected Graphs of Small Cost | 2016-02-26 | Paper |
| When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots | 2016-01-11 | Paper |
| The beachcombers' problem: walking and searching with mobile robots | 2015-12-11 | Paper |
| On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols | 2015-10-27 | Paper |
| Position discovery for a system of bouncing robots | 2015-09-28 | Paper |
| Information Gathering in Ad-Hoc Radio Networks with Tree Topology | 2015-09-11 | Paper |
| Efficiently Correcting Matrix Products | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501363 | 2015-08-03 | Paper |
| MINIMIZING CONGESTION OF LAYOUTS FOR ATM NETWORKS WITH FAULTY LINKS | 2015-04-29 | Paper |
| Faster communication in known topology radio networks | 2015-03-10 | Paper |
| The wakeup problem in synchronous broadcast systems (extended abstract) | 2015-03-03 | Paper |
| Group Search on the Line | 2015-02-20 | Paper |
| Deterministic Rendezvous in Restricted Graphs | 2015-02-20 | Paper |
| Evacuating Robots via Unknown Exit in a Disk | 2015-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934641 | 2014-12-18 | Paper |
| Tree exploration with logarithmic memory | 2014-09-09 | Paper |
| The Beachcombers’ Problem: Walking and Searching with Mobile Robots | 2014-08-07 | Paper |
| Efficient broadcasting in known topology radio networks with long-range interference | 2014-07-23 | Paper |
| Collision-Free Network Exploration | 2014-03-31 | Paper |
| Broadcasting in udg radio networks with unknown topology | 2014-03-13 | Paper |
| Towards optimal packed string matching | 2014-03-13 | Paper |
| Time efficient \(k\)-shot broadcasting in known topology radio networks | 2013-07-04 | Paper |
| Broadcasting in UDG radio networks with unknown topology | 2013-06-28 | Paper |
| Efficient broadcasting in radio networks with long-range interference | 2013-06-25 | Paper |
| Fast message dissemination in random geometric networks | 2013-06-25 | Paper |
| Faster communication in known topology radio networks | 2013-06-20 | Paper |
| Position Discovery for a System of Bouncing Robots | 2013-03-13 | Paper |
| Observe and Remain Silent (Communication-Less Agent Location Discovery) | 2012-09-25 | Paper |
| Optimal Packed String Matching | 2012-08-31 | Paper |
| Constant-Time Word-Size String Matching | 2012-08-14 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| Choosing the best among peers | 2012-08-08 | Paper |
| APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN | 2012-03-13 | Paper |
| Synchronous Rendezvous for Location-Aware Agents | 2011-10-28 | Paper |
| Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds | 2011-09-16 | Paper |
| Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids | 2010-09-10 | Paper |
| Efficient Information Exchange in the Random Phone-Call Model | 2010-09-07 | Paper |
| Tell Me Where I Am So I Can Meet You Sooner | 2010-09-07 | Paper |
| Event Extent Estimation | 2010-06-17 | Paper |
| Faster multi-witnesses for Boolean matrix multiplication | 2010-06-16 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Improved approximate common interval | 2010-03-24 | Paper |
| On Efficient Gossiping in Radio Networks | 2010-02-24 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Euler Tour Lock-In Problem in the Rotor-Router Model | 2009-11-19 | Paper |
| Consensus and Mutual Exclusion in a Multiple Access Channel | 2009-11-19 | Paper |
| Approximation Algorithms for Buy-at-Bulk Geometric Network Design | 2009-10-20 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Gathering few fat mobile robots in the plane | 2009-03-02 | Paper |
| Memory Efficient Anonymous Graph Exploration | 2009-01-20 | Paper |
| On Radio Broadcasting in Random Geometric Graphs | 2008-11-20 | Paper |
| Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges | 2008-11-20 | Paper |
| Energy and Time Efficient Broadcasting in Known Topology Radio Networks | 2008-09-02 | Paper |
| Fast periodic graph exploration with constant memory | 2008-06-26 | Paper |
| Faster Algorithm for the Set Variant of the String Barcoding Problem | 2008-06-17 | Paper |
| Routing of single-source and multiple-source queries in static sensor networks | 2008-05-16 | Paper |
| Fast Periodic Graph Exploration with Constant Memory | 2007-11-15 | Paper |
| The Wake‐Up Problem in MultiHop Radio Networks | 2007-10-22 | Paper |
| Time efficient centralized gossiping in radio networks | 2007-09-19 | Paper |
| Approximation algorithms for Hamming clustering problems | 2007-04-26 | Paper |
| Deterministic communication in radio networks with large labels | 2007-03-05 | Paper |
| Collective tree exploration | 2007-02-15 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Deterministic M2M multicast in radio networks | 2006-10-20 | Paper |
| Radio communication in random graphs | 2006-06-30 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Optimal Two-Stage Algorithms for Group Testing Problems | 2005-09-16 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Space efficient search for maximal repetitions | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829002 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817650 | 2004-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737173 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472476 | 2004-08-04 | Paper |
| A randomized algorithm for gossiping in radio networks | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453462 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449166 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437132 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432977 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432962 | 2003-10-29 | Paper |
| On polynomial-time approximation algorithms for the variable length scheduling problem. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411387 | 2003-07-08 | Paper |
| On adaptive deterministic gossiping in ad hoc radio networks. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782704 | 2002-12-02 | Paper |
| Fast broadcasting and gossiping in radio networks | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551385 | 2002-09-05 | Paper |
| Fast practical multi-pattern matching | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941888 | 2002-03-04 | Paper |
| Efficient web searching using temporal factors | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234122 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754190 | 2001-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723944 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723970 | 2001-07-08 | Paper |
| The Wakeup Problem in Synchronous Broadcast Systems | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953346 | 2001-01-14 | Paper |
| Algorithms for the parallel alternating direction access machine | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952711 | 2000-05-10 | Paper |
| On the complexity of constructing evolutionary trees | 1999-11-21 | Paper |
| Constant-space string-matching in sublinear average time | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252402 | 1999-06-17 | Paper |
| Broadcasting with linearly bounded transmission faults | 1998-11-19 | Paper |
| Time and Cost Trade-Offs in Gossiping | 1998-09-21 | Paper |
| Constant-Time Randomized Parallel String Matching | 1998-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364583 | 1997-12-15 | Paper |
| The zooming method: A recursive approach to time-space efficient string-matching | 1997-09-29 | Paper |
| Efficient string matching on packed texts | 1997-07-27 | Paper |
| Sequential and Parallel Approximation of Shortest Superstrings | 1997-07-06 | Paper |
| Adaptive broadcasting with faulty nodes | 1997-02-27 | Paper |
| Speeding up two string-matching algorithms | 1996-02-26 | Paper |
| Two-dimensional pattern matching by sampling | 1993-12-01 | Paper |
