| Publication | Date of Publication | Type |
|---|
| New clocks, optimal line formation and self-replication population protocols | 2024-10-08 | Paper |
| Towards the 5/6-density conjecture of pinwheel scheduling | 2024-05-24 | Paper |
Efficient assignment of identities in anonymous populations
(available as arXiv preprint) | 2024-04-15 | Paper |
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Perpetual maintenance of machines with different urgency requirements
Journal of Computer and System Sciences | 2023-10-24 | Paper |
Searching with increasing speeds
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Fast deterministic simulation of computations on faulty parallel machines
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Efficient parallel computing with memory faults
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Efficient algorithms for Lempel-Ziv encoding
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Parallel and sequential approximation of shortest superstrings
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
Journal of the ACM | 2022-12-08 | Paper |
Selected papers of the 31st international workshop on combinatorial algorithms, IWOCA 2020
Algorithmica | 2022-10-06 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Journal of Computer and System Sciences | 2022-08-26 | Paper |
Speeding up two string-matching algorithms
STACS 92 | 2022-08-18 | Paper |
Information gathering in ad-hoc radio networks
Information and Computation | 2021-11-25 | Paper |
Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases
Journal of Computer and System Sciences | 2021-03-10 | Paper |
Symmetry Breaking in the Plane
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Deterministic broadcasting in ad hoc radio networks
Distributed Computing | 2020-12-03 | Paper |
Randomized probe selection algorithm for microarray design
Journal of Theoretical Biology | 2020-11-11 | Paper |
On the curve complexity of 3-colored point-set embeddings
Theoretical Computer Science | 2020-11-06 | Paper |
Patrolling on dynamic ring networks
(available as arXiv preprint) | 2020-10-22 | Paper |
Patrolling a path connecting a set of points with unbalanced frequencies of visits
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
On realizing shapes in the theory of RNA neutral networks
Journal of Theoretical Biology | 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
Lecture Notes in Computer Science | 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
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Temporal flows in temporal networks
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Communication and location discovery in geometric ring networks
Information and Computation | 2019-05-02 | Paper |
Colored Point-Set Embeddings of Acyclic Graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Linear search by a pair of distinct-speed robots
Algorithmica | 2019-01-11 | Paper |
| Deterministic population protocols for exact majority and plurality | 2018-07-18 | Paper |
| Fast space optimal leader election in population protocols | 2018-03-15 | Paper |
Fast space optimal leader election in population protocols
(available as arXiv preprint) | 2018-03-15 | Paper |
Information gathering in ad-hoc radio networks with tree topology
Information and Computation | 2017-12-20 | Paper |
Two-dimensional pattern matching in linear time and small space
STACS 95 | 2017-12-04 | Paper |
When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Algorithmica | 2017-11-09 | Paper |
The complexity of optimal design of temporally connected graphs
Theory of Computing Systems | 2017-10-12 | Paper |
The complexity of optimal design of temporally connected graphs
Theory of Computing Systems | 2017-10-12 | Paper |
Efficiently correcting matrix products
Algorithmica | 2017-10-10 | Paper |
Robustness of the rotor-router mechanism
Algorithmica | 2017-10-09 | Paper |
Temporal flows in temporal networks
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Collision-free network exploration
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Doing-it-all with bounded work and communication
Information and Computation | 2017-05-18 | Paper |
Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Rendezvous problem
Search Theory | 2017-02-20 | Paper |
Linear search by a pair of distinct-speed robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
On Temporally Connected Graphs of Small Cost
Approximation and Online Algorithms | 2016-02-26 | Paper |
When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Algorithms and Computation | 2016-01-11 | Paper |
The beachcombers' problem: walking and searching with mobile robots
Theoretical Computer Science | 2015-12-11 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Automata, Languages, and Programming | 2015-10-27 | Paper |
Position discovery for a system of bouncing robots
Information and Computation | 2015-09-28 | Paper |
Information gathering in ad-hoc radio networks with tree topology
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Efficiently correcting matrix products
Algorithms and Computation | 2015-09-11 | Paper |
Efficiently correcting matrix products
Algorithms and Computation | 2015-09-11 | Paper |
| The wake-up problem in multi-hop radio networks | 2015-08-03 | Paper |
Minimizing congestion of layouts for ATM networks with faulty links
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Deterministic Rendezvous in Restricted Graphs
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Group search on the line
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Evacuating robots via unknown exit in a disk
Lecture Notes in Computer Science | 2015-02-10 | Paper |
| Tree exploration with logarithmic memory | 2014-12-18 | Paper |
Tree exploration with logarithmic memory
ACM Transactions on Algorithms | 2014-09-09 | Paper |
The beachcombers' problem: walking and searching with mobile robots
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Efficient broadcasting in known topology radio networks with long-range interference
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Collision-free network exploration
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Towards optimal packed string matching
Theoretical Computer Science | 2014-03-13 | Paper |
Broadcasting in UDG radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Time efficient \(k\)-shot broadcasting in known topology radio networks
Distributed Computing | 2013-07-04 | Paper |
Broadcasting in UDG radio networks with unknown topology
Distributed Computing | 2013-06-28 | Paper |
Fast message dissemination in random geometric networks
Distributed Computing | 2013-06-25 | Paper |
Efficient broadcasting in radio networks with long-range interference
Distributed Computing | 2013-06-25 | Paper |
Faster communication in known topology radio networks
Distributed Computing | 2013-06-20 | Paper |
Position discovery for a system of bouncing robots
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Observe and remain silent (communication-less agent location discovery)
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
| Optimal packed string matching | 2012-08-31 | Paper |
Constant-time word-size string matching
Combinatorial Pattern Matching | 2012-08-14 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Choosing the best among peers
Theoretical Computer Science | 2012-08-08 | Paper |
Approximation algorithms for buy-at-bulk geometric network design
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Synchronous rendezvous for location-aware agents
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Almost optimal asynchronous rendezvous in infinite multidimensional grids
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Efficient Information Exchange in the Random Phone-Call Model
Automata, Languages and Programming | 2010-09-07 | Paper |
Tell Me Where I Am So I Can Meet You Sooner
Automata, Languages and Programming | 2010-09-07 | Paper |
Event Extent Estimation
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Faster multi-witnesses for Boolean matrix multiplication
Information Processing Letters | 2010-06-16 | Paper |
An improved bound on Boolean matrix multiplication for highly clustered data.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Improved approximate common interval
Information Processing Letters | 2010-03-24 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
On Efficient Gossiping in Radio Networks
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Euler Tour Lock-In Problem in the Rotor-Router Model
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Consensus and Mutual Exclusion in a Multiple Access Channel
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Lecture Notes in Computer Science | 2009-10-20 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Gathering few fat mobile robots in the plane
Theoretical Computer Science | 2009-03-02 | Paper |
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
Lecture Notes in Computer Science | 2008-11-20 | Paper |
On Radio Broadcasting in Random Geometric Graphs
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Energy and Time Efficient Broadcasting in Known Topology Radio Networks
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Faster Algorithm for the Set Variant of the String Barcoding Problem
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Routing of single-source and multiple-source queries in static sensor networks
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Fast Periodic Graph Exploration with Constant Memory
Structural Information and Communication Complexity | 2007-11-15 | Paper |
The Wake‐Up Problem in MultiHop Radio Networks
SIAM Journal on Computing | 2007-10-22 | Paper |
Time efficient centralized gossiping in radio networks
Theoretical Computer Science | 2007-09-19 | Paper |
Approximation algorithms for Hamming clustering problems
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Deterministic communication in radio networks with large labels
Algorithmica | 2007-03-05 | Paper |
Collective tree exploration
Networks | 2007-02-15 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Deterministic M2M multicast in radio networks
Theoretical Computer Science | 2006-10-20 | Paper |
Radio communication in random graphs
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Optimal Two-Stage Algorithms for Group Testing Problems
SIAM Journal on Computing | 2005-09-16 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Space efficient search for maximal repetitions
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2119728 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2100932 (Why is no real title available?) | 2004-09-15 | Paper |
| scientific article; zbMATH DE number 2086637 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080232 (Why is no real title available?) | 2004-08-04 | Paper |
A randomized algorithm for gossiping in radio networks
Networks | 2004-03-15 | Paper |
| scientific article; zbMATH DE number 2051171 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2038701 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2013838 (Why is no real title available?) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 1998342 (Why is no real title available?) | 2003-10-29 | Paper |
scientific article; zbMATH DE number 1998328 (Why is no real title available?)
(available as arXiv preprint) | 2003-10-29 | Paper |
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1947418 (Why is no real title available?) | 2003-07-08 | Paper |
On adaptive deterministic gossiping in ad hoc radio networks.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1839439 (Why is no real title available?) | 2002-12-02 | Paper |
Fast broadcasting and gossiping in radio networks
Journal of Algorithms | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1796990 (Why is no real title available?) | 2002-09-05 | Paper |
Fast practical multi-pattern matching
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1418326 (Why is no real title available?) | 2002-03-04 | Paper |
Efficient web searching using temporal factors
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1263250 (Why is no real title available?) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1670865 (Why is no real title available?) | 2001-12-06 | Paper |
| scientific article; zbMATH DE number 1615297 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1615274 (Why is no real title available?) | 2001-07-08 | Paper |
The wakeup problem in synchronous broadcast systems
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1444316 (Why is no real title available?) | 2001-01-14 | Paper |
Algorithms for the parallel alternating direction access machine
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1445388 (Why is no real title available?) | 2000-05-10 | Paper |
On the complexity of constructing evolutionary trees
Journal of Combinatorial Optimization | 1999-11-21 | Paper |
Constant-space string-matching in sublinear average time
Theoretical Computer Science | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1305511 (Why is no real title available?) | 1999-06-17 | Paper |
Broadcasting with linearly bounded transmission faults
Discrete Applied Mathematics | 1998-11-19 | Paper |
Time and Cost Trade-Offs in Gossiping
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Constant-Time Randomized Parallel String Matching
SIAM Journal on Computing | 1998-02-10 | Paper |
| scientific article; zbMATH DE number 1088267 (Why is no real title available?) | 1997-12-15 | Paper |
The zooming method: A recursive approach to time-space efficient string-matching
Theoretical Computer Science | 1997-09-29 | Paper |
Efficient string matching on packed texts
RAIRO - Theoretical Informatics and Applications | 1997-07-27 | Paper |
Sequential and Parallel Approximation of Shortest Superstrings
Journal of Algorithms | 1997-07-06 | Paper |
Adaptive broadcasting with faulty nodes
Parallel Computing | 1997-02-27 | Paper |
Speeding up two string-matching algorithms
Algorithmica | 1996-02-26 | Paper |
Two-dimensional pattern matching by sampling
Information Processing Letters | 1993-12-01 | Paper |
