Leszek Gasieniec

Grzegorz Stachowiak

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

2017

The Complexity of Optimal Design of Temporally Connected Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Collision-free network exploration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Doing-it-All with bounded work and communication.

[BibT_eX]

[DOI]

Alexander A. Schwarzmann

Inf. Comput., 2017

Efficiently Correcting Matrix Products.

[BibT_eX]

[DOI]

Algorithmica, 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

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Colored Point-Set Embeddings of Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Randomized Gossiping in Radio Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Deterministic Broadcasting in Radio Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Routing in Geometric Networks.

[BibT_eX]

[DOI]

Stephane Durocher

Prudence W. H. Wong

Encyclopedia of Algorithms, 2016

Distributed Alarming in the On-Duty and Off-Duty Models.

[BibT_eX]

[DOI]

Marcin Bienkowski

Marek Klonowski

Miroslaw Korzeniowski

Bernard Mans

Stefan Schmid

Roger Wattenhofer

IEEE/ACM Trans. Netw., 2016

Ephemeral networks with random availability of links: The case of fast networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2016

Flows in Temporal networks.

[BibT_eX]

[DOI]

CoRR, 2016

Deterministic Population Protocols for Exact Majority and Plurality.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015

Fundamentals of Computation Theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The Beachcombers' Problem: Walking and searching with mobile robots.

[BibT_eX]

[DOI]

Konstantinos Georgiou

Evangelos Kranakis

Fraser MacQuarrie

Theor. Comput. Sci., 2015

Position discovery for a system of bouncing robots.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Designing and Testing Temporally Connected Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

On Temporally Connected Graphs of Small Cost.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

The Match-Maker: Constant-Space Distributed Majority via Random Walks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Deterministic Rendezvous in Restricted Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Group Search on the Line.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Deterministic Symmetry Breaking in Ring Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines.

[BibT_eX]

[DOI]

Sultan S. Alshamrani

Leszek Antoni Gasieniec

Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015

2014

Towards optimal packed string matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Evacuating Robots via Unknown Exit in a Disk.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Ephemeral networks with random availability of links: diameter and connectivity.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Efficiently Correcting Matrix Products.

[BibT_eX]

[DOI]

Christos Levcopoulos

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

The Multi-source Beachcombers' Problem.

[BibT_eX]

[DOI]

Konstantinos Georgiou

Evangelos Kranakis

Fraser MacQuarrie

Proceedings of the Algorithms for Sensor Systems, 2014

2013

Efficient broadcasting in radio networks with long-range interference.

[BibT_eX]

[DOI]

Frantisek Galcík

Distributed Comput., 2013

Fast message dissemination in random geometric networks.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Optimal patrolling of fragmented boundaries.

[BibT_eX]

[DOI]

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

2012

Choosing the best among peers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

More efficient periodic traversal in anonymous undirected graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Observe and Remain Silent (Communication-Less Agent Location Discovery).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Constant-Time Word-Size String Matching.

[BibT_eX]

[DOI]

Dany Breslauer

Roberto Grossi

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Consensus and Mutual Exclusion in a Multiple Access Channel.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Tree exploration with logarithmic memory.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Synchronous Rendezvous for Location-Aware Agents.

[BibT_eX]

[DOI]

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

Optimal Packed String Matching.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Event Extent Estimation.

[BibT_eX]

[DOI]

Marcin Bienkowski

Marek Klonowski

Miroslaw Korzeniowski

Stefan Schmid

Proceedings of the Structural Information and Communication Complexity, 2010

Tell Me Where I Am So I Can Meet You Sooner.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Efficient Information Exchange in the Random Phone-Call Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Gathering few fat mobile robots in the plane.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Faster multi-witnesses for Boolean matrix multiplication.

[BibT_eX]

[DOI]

Miroslaw Kowaluk

Inf. Process. Lett., 2009

Broadcasting in UDG radio networks with unknown topology.

[BibT_eX]

[DOI]

Distributed Comput., 2009

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

[BibT_eX]

[DOI]

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

On Efficient Gossiping in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

Efficient broadcasting in known topology radio networks with long-range interference.

[BibT_eX]

[DOI]

Frantisek Galcík

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Robustness of the Rotor-router Mechanism.

[BibT_eX]

[DOI]

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

2008

Routing in Geometric Networks.

[BibT_eX]

[DOI]

Chang Su

Prudence W. H. Wong

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Randomized Gossiping in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Deterministic Broadcasting in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Preface.

[BibT_eX]

[DOI]

Paola Flocchini

Theor. Comput. Sci., 2008

A robust randomized algorithm to perform independent tasks.

[BibT_eX]

[DOI]

Alexander A. Shvartsman

J. Discrete Algorithms, 2008

Fast periodic graph exploration with constant memory.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Time efficient k-shot broadcasting in known topology radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Memory Efficient Anonymous Graph Exploration.

[BibT_eX]

[DOI]

Tomasz Radzik

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On Radio Broadcasting in Random Geometric Graphs.

[BibT_eX]

[DOI]

Robert Elsässer

Thomas Sauerwald

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Faster Algorithm for the Set Variant of the String Barcoding Problem.

[BibT_eX]

[DOI]

Cindy Y. Li

Meng Zhang

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Time efficient centralized gossiping in radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The Wake-Up Problem in MultiHop Radio Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Routing of single-source and multiple-source queries in static sensor networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Improved approximate common interval.

[BibT_eX]

[DOI]

Amihood Amir

B. Riva Shalom

Inf. Process. Lett., 2007

Faster communication in known topology radio networks.

[BibT_eX]

[DOI]

David Peleg

Distributed Comput., 2007

Deterministic Communication in Radio Networks with Large Labels.

[BibT_eX]

[DOI]

Algorithmica, 2007

Energy and Time Efficient Broadcasting in Known Topology Radio Networks.

[BibT_eX]

[DOI]

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

Tree exploration with logarithmic memory.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Deterministic M2M multicast in radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Collective tree exploration.

[BibT_eX]

[DOI]

Networks, 2006

Radio communication in random graphs.

[BibT_eX]

[DOI]

Robert Elsässer

J. Comput. Syst. Sci., 2006

Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Efficient Probe Selection in Microarray Design.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2006

2005

Space efficient search for maximal repetitions.

[BibT_eX]

[DOI]

Roman M. Kolpakov

Theor. Comput. Sci., 2005

Optimal Two-Stage Algorithms for Group Testing Problems.

[BibT_eX]

[DOI]

Annalisa De Bonis

Ugo Vaccaro

SIAM J. Comput., 2005

Radio communication in random graphs: extended abstract.

[BibT_eX]

[DOI]

Robert Elsässer

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

Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

On the Wake-Up Problem in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Real-Time Traversal in Grammar-Based Compressed Files.

[BibT_eX]

[DOI]

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004

A randomized algorithm for gossiping in radio networks.

[BibT_eX]

[DOI]

Networks, 2004

Approximation algorithms for Hamming clustering problems.

[BibT_eX]

[DOI]

Jesper Jansson

J. Discrete Algorithms, 2004

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

Tomasz Radzik

Proceedings of the Algorithm Theory, 2004

The wake-up problem in multi-hop radio networks.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Time Efficient Gossiping in Known Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Deterministic M2M Multicast in Radio Networks: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Real-Time String Matching in Sublinear Space.

[BibT_eX]

[DOI]

Roman M. Kolpakov

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

On polynomial-time approximation algorithms for the variable length scheduling problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Time/Space Efficient Compressed Pattern Matching.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Deterministic Computations on a PRAM with Static Processor and Memory Faults.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Generalized Framework for Selectors with Applications in Optimal Group Testing.

[BibT_eX]

[DOI]

Annalisa De Bonis

Ugo Vaccaro

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Fast broadcasting and gossiping in radio networks.

[BibT_eX]

[DOI]

J. Algorithms, 2002

On adaptive deterministic gossiping in ad hoc radio networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Deterministic broadcasting in ad hoc radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2002

Bounding Work and Communication in Robust Cooperative Computation.

[BibT_eX]

[DOI]

Alexander A. Shvartsman

Proceedings of the Distributed Computing, 16th International Conference, 2002

Gossiping with Unit Messages in Known Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Gossiping with Bounded Size Messages in ad hoc Radio Networks.

[BibT_eX]

[DOI]

Malin Christersson

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Deterministic Communication in Radio Networks with Large Labels.

[BibT_eX]

[DOI]

Aris Pagourtzis

Proceedings of the Algorithms, 2002

2001

Efficient web searching using temporal factors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

The Wakeup Problem in Synchronous Broadcast Systems.

[BibT_eX]

[DOI]

David Peleg

SIAM J. Discret. Math., 2001

Oblivious gossiping in ad-hoc radio networks.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000

Algorithms for the parallel alternating direction access machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Deterministic broadcasting in unknown radio networks.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The wakeup problem in synchronous broadcast systems (extended abstract).

[BibT_eX]

[DOI]

David Peleg

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Strategies for Hotlink Assignments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Deterministic Radio Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

On the Complexity of Determining the Period of a String.

[BibT_eX]

[DOI]

Artur Czumaj

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

Constant-Space String-Matching in Sublinear Average Time.

[BibT_eX]

[DOI]

Maxime Crochemore

Theor. Comput. Sci., 1999

On the Complexity of Constructing Evolutionary Trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

Fast Practical Multi-Pattern Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Minimizing Congestion of Layouts for ATM Networks with Faulty Links.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

Efficient Approximation Algorithms for the Hamming Center Problem.

[BibT_eX]

[DOI]

Jesper Jansson

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.

[BibT_eX]

[DOI]

Alan Gibbons

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Almost Optimal Fully LZW-Compressed Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1999

Domino tilings of orthogonal polygons.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Time and Cost Trade-Offs in Gossiping.

[BibT_eX]

[DOI]

Artur Czumaj

SIAM J. Discret. Math., 1998

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Broadcasting with linearly bounded transmission faults.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Inferring Ordered Trees from Local Constraints.

[BibT_eX]

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997

Constant-Time Randomized Parallel String Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Broadcasting with a Bounded Fraction of Faulty Nodes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

Sequential and Parallel Approximation of Shortest Superstrings.

[BibT_eX]

[DOI]

J. Algorithms, 1997

The Architecture of a Software Library for String Processing.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

Efficient Parallel Computing with Memory Faults.

[BibT_eX]

[DOI]

Piotr Indyk

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

External Inverse Pattern Matching.

[BibT_eX]

[DOI]

Piotr Indyk

Piotr Krysta

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

Episode Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

On the Complexity of Computing Evolutionary Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Adaptive Broadcasting with Faulty Nodes.

[BibT_eX]

[DOI]

Parallel Comput., 1996

Efficient String Matching on Packed Texts.

[BibT_eX]

[DOI]

Dany Breslauer

RAIRO Theor. Informatics Appl., 1996

Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Parallel Alternating-Direction Access Machine.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

Approximate Dictionary Queries.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching.

[BibT_eX]

[DOI]

Wojciech Plandowski

Theor. Comput. Sci., 1995

Work-time-optimal parallel algorithms for string problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Two-Dimensional Pattern Matching in Linear Time and Small Space.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Fast Deterministic Simulation of Computations on Faulty Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling.

[BibT_eX]

[DOI]

Wojciech Plandowski

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

Efficient String Matching on Coded Texts.

[BibT_eX]

[DOI]

Dany Breslauer

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994

Speeding Up Two String-Matching Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 1994

Parallel and Sequential Approximations of Shortest Superstrings.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

Optimal Pattern Matching on Meshes.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Work-Time Optimal Parallel Prefix Matching (Extended Abstract).

[BibT_eX]

[DOI]

Kunsoo Park

Proceedings of the Algorithms, 1994

1993

Two-Dimensional Pattern Matching by Sampling.

[BibT_eX]

[DOI]

Maxime Crochemore