Leszek Gasieniec

According to our database1, Leszek Gasieniec
  • authored at least 183 papers between 1992 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
The Complexity of Optimal Design of Temporally Connected Graphs.
Theory Comput. Syst., 2017

Collision-free network exploration.
J. Comput. Syst. Sci., 2017

Doing-it-All with bounded work and communication.
Inf. Comput., 2017

Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits.
CoRR, 2017

Colored Point-set Embeddings of Acyclic Graphs.
CoRR, 2017

Fast Space Optimal Leader Election in Population Protocols.
CoRR, 2017

Efficiently Correcting Matrix Products.
Algorithmica, 2017

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

Robustness of the Rotor-Router Mechanism.
Algorithmica, 2017

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Temporal Flows in Temporal Networks.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Randomized Gossiping in Radio Networks.
Encyclopedia of Algorithms, 2016

Deterministic Broadcasting in Radio Networks.
Encyclopedia of Algorithms, 2016

Routing in Geometric Networks.
Encyclopedia of Algorithms, 2016

Distributed Alarming in the On-Duty and Off-Duty Models.
IEEE/ACM Trans. Netw., 2016

Ephemeral networks with random availability of links: The case of fast networks.
J. Parallel Distrib. Comput., 2016

Efficiently Correcting Matrix Products.
CoRR, 2016

Flows in Temporal networks.
CoRR, 2016

Linear Search by a Pair of Distinct-Speed Robots.
Proceedings of the Structural Information and Communication Complexity, 2016

Deterministic Population Protocols for Exact Majority and Plurality.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Fundamentals of Computation Theory.
Theor. Comput. Sci., 2015

The Beachcombers' Problem: Walking and searching with mobile robots.
Theor. Comput. Sci., 2015

Position discovery for a system of bouncing robots.
Inf. Comput., 2015

Deterministic Symmetry Breaking in Ring Networks.
CoRR, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
CoRR, 2015

Designing and Testing Temporally Connected Graphs.
CoRR, 2015

On Temporally Connected Graphs of Small Cost.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

The Match-Maker: Constant-Space Distributed Majority via Random Walks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Deterministic Rendezvous in Restricted Graphs.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Group Search on the Line.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Deterministic Symmetry Breaking in Ring Networks.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines.
Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015

2014
Towards optimal packed string matching.
Theor. Comput. Sci., 2014

Information Gathering in Ad-Hoc Radio Networks with Tree Topology.
CoRR, 2014

Doing-it-All with Bounded Work and Communication.
CoRR, 2014

Evacuating Robots via Unknown Exit in a Disk.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Ephemeral networks with random availability of links: diameter and connectivity.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

The Beachcombers' Problem: Walking and Searching with Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2014

Collision-Free Network Exploration.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Efficiently Correcting Matrix Products.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Information Gathering in Ad-Hoc Radio Networks with Tree Topology.
Proceedings of the Combinatorial Optimization and Applications, 2014

The Multi-source Beachcombers' Problem.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
Efficient broadcasting in radio networks with long-range interference.
Distributed Computing, 2013

Fast message dissemination in random geometric networks.
Distributed Computing, 2013

The Beachcombers' Problem: Walking and Searching with Mobile Robots
CoRR, 2013

Optimal patrolling of fragmented boundaries.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012
Choosing the best among peers.
Theor. Comput. Sci., 2012

More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci., 2012

Position Discovery for a System of Bouncing Robots.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Observe and Remain Silent (Communication-Less Agent Location Discovery).
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Constant-Time Word-Size String Matching.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Consensus and Mutual Exclusion in a Multiple Access Channel.
IEEE Trans. Parallel Distrib. Syst., 2011

Tree exploration with logarithmic memory.
ACM Trans. Algorithms, 2011

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Int. J. Found. Comput. Sci., 2011

Synchronous Rendezvous for Location-Aware Agents.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Optimal Packed String Matching.
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.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Event Extent Estimation.
Proceedings of the Structural Information and Communication Complexity, 2010

Tell Me Where I Am So I Can Meet You Sooner.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Efficient Information Exchange in the Random Phone-Call Model.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Gathering few fat mobile robots in the plane.
Theor. Comput. Sci., 2009

Faster multi-witnesses for Boolean matrix multiplication.
Inf. Process. Lett., 2009

Broadcasting in UDG radio networks with unknown topology.
Distributed Computing, 2009

More efficient periodic traversal in anonymous undirected graphs
CoRR, 2009

Consensus and Mutual Exclusion in a Multiple Access Channel.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Euler Tour Lock-In Problem in the Rotor-Router Model.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

On Efficient Gossiping in Radio Networks.
Proceedings of the Structural Information and Communication Complexity, 2009

More Efficient Periodic Traversal in Anonymous Undirected Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

Efficient broadcasting in known topology radio networks with long-range interference.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Robustness of the Rotor-router Mechanism.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
Routing in Geometric Networks.
Proceedings of the Encyclopedia of Algorithms, 2008

Randomized Gossiping in Radio Networks.
Proceedings of the Encyclopedia of Algorithms, 2008

Deterministic Broadcasting in Radio Networks.
Proceedings of the Encyclopedia of Algorithms, 2008

Preface.
Theor. Comput. Sci., 2008

A robust randomized algorithm to perform independent tasks.
J. Discrete Algorithms, 2008

Fast periodic graph exploration with constant memory.
J. Comput. Syst. Sci., 2008

Time efficient k-shot broadcasting in known topology radio networks.
Distributed Computing, 2008

Memory Efficient Anonymous Graph Exploration.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On Radio Broadcasting in Random Geometric Graphs.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Faster Algorithm for the Set Variant of the String Barcoding Problem.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Time efficient centralized gossiping in radio networks.
Theor. Comput. Sci., 2007

The Wake-Up Problem in MultiHop Radio Networks.
SIAM J. Comput., 2007

Routing of single-source and multiple-source queries in static sensor networks.
J. Discrete Algorithms, 2007

Improved approximate common interval.
Inf. Process. Lett., 2007

Faster communication in known topology radio networks.
Distributed Computing, 2007

Deterministic Communication in Radio Networks with Large Labels.
Algorithmica, 2007

Energy and Time Efficient Broadcasting in Known Topology Radio Networks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Tree exploration with logarithmic memory.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Fast Periodic Graph Exploration with Constant Memory.
Proceedings of the Structural Information and Communication Complexity, 2007

Broadcasting in udg radio networks with unknown topology.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Preface.
Theor. Comput. Sci., 2006

Deterministic M2M multicast in radio networks.
Theor. Comput. Sci., 2006

Collective tree exploration.
Networks, 2006

Radio communication in random graphs.
J. Comput. Syst. Sci., 2006

Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Gathering Few Fat Mobile Robots in the Plane.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Efficient Probe Selection in Microarray Design.
Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2006

2005
Space efficient search for maximal repetitions.
Theor. Comput. Sci., 2005

Optimal Two-Stage Algorithms for Group Testing Problems.
SIAM J. Comput., 2005

Radio communication in random graphs: extended abstract.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Faster communication in known topology radio networks.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

On the Wake-Up Problem in Radio Networks.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Real-Time Traversal in Grammar-Based Compressed Files.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004
A randomized algorithm for gossiping in radio networks.
Networks, 2004

Approximation algorithms for Hamming clustering problems.
J. Discrete Algorithms, 2004

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.
Proceedings of the Algorithm Theory, 2004

The wake-up problem in multi-hop radio networks.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Time Efficient Gossiping in Known Radio Networks.
Proceedings of the Structural Information and Communication Complexity, 2004

Collective Tree Exploration.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Deterministic M2M Multicast in Radio Networks: (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Real-Time String Matching in Sublinear Space.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theor. Comput. Sci., 2003

Time/Space Efficient Compressed Pattern Matching.
Fundam. Inform., 2003

Deterministic Computations on a PRAM with Static Processor and Memory Faults.
Fundam. Inform., 2003

An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Generalized Framework for Selectors with Applications in Optimal Group Testing.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Fast broadcasting and gossiping in radio networks.
J. Algorithms, 2002

On adaptive deterministic gossiping in ad hoc radio networks.
Inf. Process. Lett., 2002

Deterministic broadcasting in ad hoc radio networks.
Distributed Computing, 2002

Bounding Work and Communication in Robust Cooperative Computation.
Proceedings of the Distributed Computing, 16th International Conference, 2002

On adaptive deterministic gossiping in ad hoc radio networks.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Gossiping with Unit Messages in Known Radio Networks.
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.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Deterministic Communication in Radio Networks with Large Labels.
Proceedings of the Algorithms, 2002

2001
Efficient web searching using temporal factors.
Theor. Comput. Sci., 2001

The Wakeup Problem in Synchronous Broadcast Systems.
SIAM J. Discrete Math., 2001

Time/Space Efficient Compressed Pattern Matching.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Oblivious gossiping in ad-hoc radio networks.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

A Randomized Algorithm for Gossiping in Radio Networks.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Algorithms for the parallel alternating direction access machine.
Theor. Comput. Sci., 2000

Deterministic broadcasting in unknown radio networks.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The wakeup problem in synchronous broadcast systems (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Strategies for Hotlink Assignments.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Deterministic Radio Broadcasting.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Fast Broadcasting and Gossiping in Radio Networks.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Approximation Algorithms for Hamming Clustering Problems.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

On the Complexity of Determining the Period of a String.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Constant-Space String-Matching in Sublinear Average Time.
Theor. Comput. Sci., 1999

On the Complexity of Constructing Evolutionary Trees.
J. Comb. Optim., 1999

Fast Practical Multi-Pattern Matching.
Inf. Process. Lett., 1999

Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
Int. J. Found. Comput. Sci., 1999

Efficient Web Searching Using Temporal Factors.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Efficient Approximation Algorithms for the Hamming Center Problem.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Almost Optimal Fully LZW-Compressed Pattern Matching.
Proceedings of the Data Compression Conference, 1999

Domino tilings of orthogonal polygons.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Time and Cost Trade-Offs in Gossiping.
SIAM J. Discrete Math., 1998

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.
SIAM J. Comput., 1998

Broadcasting with linearly bounded transmission faults.
Discrete Applied Mathematics, 1998

Inferring Ordered Trees from Local Constraints.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
Constant-Time Randomized Parallel String Matching.
SIAM J. Comput., 1997

Broadcasting with a Bounded Fraction of Faulty Nodes.
J. Parallel Distrib. Comput., 1997

Sequential and Parallel Approximation of Shortest Superstrings.
J. Algorithms, 1997

Efficient Parallel Computing with Memory Faults.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

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

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

On the Complexity of Computing Evolutionary Trees.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Adaptive Broadcasting with Faulty Nodes.
Parallel Computing, 1996

Efficient String Matching on Packed Texts.
ITA, 1996

Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).
Proceedings of the Algorithm Theory, 1996

Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Parallel Alternating-Direction Access Machine.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

Approximate Dictionary Queries.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching.
Theor. Comput. Sci., 1995

Work-time-optimal parallel algorithms for string problems.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

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

Fast Deterministic Simulation of Computations on Faulty Parallel Machines.
Proceedings of the Algorithms, 1995

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

Efficient String Matching on Coded Texts.
CPM, 1995

1994
Speeding Up Two String-Matching Algorithms.
Algorithmica, 1994

Parallel and Sequential Approximations of Shortest Superstrings.
Proceedings of the Algorithm Theory, 1994

Optimal Pattern Matching on Meshes.
Proceedings of the STACS 94, 1994

Work-Time Optimal Parallel Prefix Matching (Extended Abstract).
Proceedings of the Algorithms, 1994

1993
Two-Dimensional Pattern Matching by Sampling.
Inf. Process. Lett., 1993

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Speeding Up Two String-Matching Algorithms.
Proceedings of the STACS 92, 1992


  Loading...