Skip to main content
Leszek Gasieniec

Professor Leszek Gasieniec
Professor

Professor in Computer Science
Computer Science
Part of
School of Electrical Engineering, Electronics and Computer Science
Faculty of Science and Engineering

Contact

L.A.Gasieniec@liverpool.ac.uk

Twitter account @LAGasieniec

+44 (0)151 795 4290

Publications

Selected publications

  1. When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots (Journal article - 2017)
  2. Robustness of the Rotor-Router Mechanism (Journal article - 2017)
  3. Distributed Alarming in the On-Duty and Off-Duty Models (Journal article - 2016)
  4. On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Conference Paper - 2015)
  5. Efficiently Correcting Matrix Products (Journal article - 2016)
What type of publication do you want to show?

2024

2023

Preface

Gąsieniec, L. (2023). Preface (Vol. 13878 LNCS).

Book

2022

Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020

Gasieniec, L., Klasing, R., & Radzik, T. (2022). Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. ALGORITHMICA, 84(10), 3103-3106. doi:10.1007/s00453-022-01029-4

DOI
10.1007/s00453-022-01029-4
Journal article

2021

Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority

Doty, D., Eftekhari, M., Gasieniec, L., Severson, E., Stachowiak, G., & Uznanski, P. (2021). Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority. In PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21) (pp. 77-80). doi:10.1145/3465084.3467942

DOI
10.1145/3465084.3467942
Conference Paper

Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

Gasieniec, L., & Stachowiak, G. (2021). Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election. Journal of the ACM, 68(1). doi:10.1145/3424659

DOI
10.1145/3424659
Journal article

New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive).

Preprint

2020

Predicting the Availability of Hematopoietic Stem Cell Donors Using Machine Learning

Li, Y., Masiliune, A., Winstone, D., Gasieniec, L., Wong, P., Lin, H., . . . Hadley, A. (n.d.). Predicting the Availability of Hematopoietic Stem Cell Donors Using Machine Learning. Biology of Blood and Marrow Transplantation. doi:10.1016/j.bbmt.2020.03.026

DOI
10.1016/j.bbmt.2020.03.026
Journal article

Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings

Gasieniec, L., Klasing, R., & Radzik, T. (Eds.) (2020). Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings. In IWOCA Vol. 12126. Springer.

Conference Paper

IWOCA 2020 in B ordeaux (Oops! On-L ine!) 31st International Workshop on Combinatorial Algorithms

Foucaud, F., Gasieniec, L., Klasing, R., Radzik, T., & Smyth, B. (2020). IWOCA 2020 in B ordeaux (Oops! On-L ine!) 31st International Workshop on Combinatorial Algorithms. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, (132), 73-76. Retrieved from https://www.webofscience.com/

Journal article

Preface

Gąsieniec, L., Klasing, R., & Radzik, T. (2020). Preface (Vol. 12126 LNCS).

Book

2019

Asynchronous rendezvous with different maps

Cicerone, S., Di Stefano, G., Gąsieniec, L., & Navarra, A. (2019). Asynchronous rendezvous with different maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11639 LNCS (pp. 154-169). doi:10.1007/978-3-030-24922-9_11

DOI
10.1007/978-3-030-24922-9_11
Conference Paper

Patrolling on Dynamic Ring Networks.

Das, S., Luna, G. A. D., & Gasieniec, L. A. (2019). Patrolling on Dynamic Ring Networks.. In B. Catania, R. Královic, J. R. Nawrocki, & G. Pighizzini (Eds.), SOFSEM Vol. 11376 (pp. 150-163). Springer. Retrieved from https://doi.org/10.1007/978-3-030-10801-4

Conference Paper

Preface

Gąsieniec, L. A., Jansson, J., & Levcopoulos, C. (2019). Preface (Vol. 11651 LNCS).

Book

2018

Searching with increasing speeds

Gąsieniec, L., Kijima, S., & Min, J. (2018). Searching with increasing speeds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11201 LNCS (pp. 126-138). Tokyo. doi:10.1007/978-3-030-03232-6_9

DOI
10.1007/978-3-030-03232-6_9
Conference Paper

Patrolling on Dynamic Ring Networks

Das, S., Di Luna, G. A., & Gasieniec, L. A. (2019). Patrolling on Dynamic Ring Networks. THEORY AND PRACTICE OF COMPUTER SCIENCE, SOFSEM 2019, 11376, 150-163. doi:10.1007/978-3-030-10801-4_13

Journal article

Fast Space Optimal Leader Election in Population Protocols

Gasieniec, L. A., & Stachowiak, G. (2018). Fast Space Optimal Leader Election in Population Protocols. In 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2018 (pp. 265-266). New Orleans. Retrieved from https://dl.acm.org/doi/10.5555/3174304.3175286

Conference Paper

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

Chuangpishit, H., Czyzowicz, J., Gasieniec, L., Georgiou, K., Jurdzinski, T., & Kranakis, E. (2018). Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits.. In A. M. Tjoa, L. Bellatreche, S. Biffl, J. V. Leeuwen, & J. Wiedermann (Eds.), SOFSEM Vol. 10706 (pp. 367-380). Springer. Retrieved from https://doi.org/10.1007/978-3-319-73117-9

Conference Paper

2017

Deterministic computations on a PRAM with static processor and memory faults

Chlebus, B. S., Gasieniec, L., & Pelc, A. (2003). Deterministic computations on a PRAM with static processor and memory faults. FUNDAMENTA INFORMATICAE, 55(3-4), 285-306. Retrieved from https://www.webofscience.com/

Journal article

Colored Point-set Embeddings of Acyclic Graphs

Giacomo, E. D., Gasieniec, L., Liotta, G., & Navarra, A. (2017). Colored Point-set Embeddings of Acyclic Graphs. Retrieved from http://arxiv.org/abs/1708.09167v1

Internet publication

Fast Space Optimal Leader Election in Population Protocols

Gasieniec, L., & Stachowiak, G. (2018). Fast Space Optimal Leader Election in Population Protocols. In SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (pp. 2653-2667). Retrieved from https://www.webofscience.com/

Conference Paper

The Impact of Hierarchical Structure on Efficiency of Cloud Monitoring

Alshamrani, S., Kowalski, D., & Gasieniec, L. (2016). The Impact of Hierarchical Structure on Efficiency of Cloud Monitoring. In 2016 2ND INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGIES AND APPLICATIONS (CLOUDTECH) (pp. 40-46). Retrieved from https://www.webofscience.com/

Conference Paper

Algorithms for Sensor Systems - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers

Chrobak, M., Anta, A. F., Gasieniec, L., & Klasing, R. (Eds.) (2017). Algorithms for Sensor Systems - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers. In ALGOSENSORS Vol. 10050. Springer.

Conference Paper

Colored Point-Set Embeddings of Acyclic Graphs.

Giacomo, E. D., Gasieniec, L., Liotta, G., & Navarra, A. (2017). Colored Point-Set Embeddings of Acyclic Graphs.. In F. Frati, & K. -L. Ma (Eds.), GD Vol. 10692 (pp. 413-425). Springer. Retrieved from https://doi.org/10.1007/978-3-319-73915-1

Conference Paper

Preface

Butcher, K., & Ponting, M. (n.d.). Preface. Cambridge University Press. doi:10.1017/cbo9781139225274.001

DOI
10.1017/cbo9781139225274.001
Book

2016

Temporal flows in Temporal networks

Akrida, E. C., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. G. (2017). Temporal Flows in Temporal Networks. In ALGORITHMS AND COMPLEXITY (CIAC 2017) Vol. 10236 (pp. 43-54). doi:10.1007/978-3-319-57586-5_5

Conference Paper

Efficiently Correcting Matrix Products

Gasieniec, L., Levcopoulos, C., & Lingas, A. (2014). Efficiently Correcting Matrix Products. ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 53-64. doi:10.1007/978-3-319-13075-0_5

DOI
10.1007/978-3-319-13075-0_5
Journal article

Balancing Mobility Algorithm for Monitoring Virtual Machines in Clouds

Alshamrani, S., Kowalski, D., Gasieniec, L., & Abdulazeez, M. (2016). Balancing Mobility Algorithm for Monitoring Virtual Machines in Clouds. In PROCEEDINGS OF THE 15TH EUROPEAN CONFERENCE ON CYBER WARFARE AND SECURITY (ECCWS 2016) (pp. 9-17). Retrieved from https://www.webofscience.com/

Conference Paper

Deterministic Broadcasting in Radio Networks

Gąsieniec, L. (2016). Deterministic Broadcasting in Radio Networks. In Encyclopedia of Algorithms (pp. 529-530). Springer New York. doi:10.1007/978-1-4939-2864-4_105

DOI
10.1007/978-1-4939-2864-4_105
Chapter

Deterministic radio broadcasting

Chlebus, B. S., Gasieniec, L., Östlin, A., & Robson, J. M. (2000). Deterministic radio broadcasting. In AUTOMATA LANGUAGES AND PROGRAMMING Vol. 1853 (pp. 717-728). Retrieved from https://www.webofscience.com/

Conference Paper

Flows in Temporal networks.

Akrida, E. C., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. G. (2016). Flows in Temporal networks.. CoRR, abs/1606.01091.

Journal article

Linear Search by a Pair of Distinct-Speed Robots

Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Klasing, R., Kociumaka, T., & Pajak, D. (2016). Linear Search by a Pair of Distinct-Speed Robots. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2016 Vol. 9988 (pp. 195-211). doi:10.1007/978-3-319-48314-6_13

DOI
10.1007/978-3-319-48314-6_13
Conference Paper

Randomized Gossiping in Radio Networks

Ga̧sieniec, L. (2016). Randomized Gossiping in Radio Networks. In Encyclopedia of Algorithms (pp. 1745-1747). Springer New York. doi:10.1007/978-1-4939-2864-4_324

DOI
10.1007/978-1-4939-2864-4_324
Chapter

Routing in Geometric Networks

Durocher, S., Gasieniec, L., & Wong, P. W. H. (2016). Routing in Geometric Networks. In Encyclopedia of Algorithms (pp. 1871-1875). Springer New York. doi:10.1007/978-1-4939-2864-4_352

DOI
10.1007/978-1-4939-2864-4_352
Chapter

2015

Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines

Alshamrani, S. S., Kowalski, D. R., & Gasieniec, L. A. (2015). Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines. In CIT/IUCC/DASC/PICOM 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY - UBIQUITOUS COMPUTING AND COMMUNICATIONS - DEPENDABLE, AUTONOMIC AND SECURE COMPUTING - PERVASIVE INTELLIGENCE AND COMPUTING (pp. 1704-1711). doi:10.1109/CIT/IUCC/DASC/PICOM.2015.257

DOI
10.1109/CIT/IUCC/DASC/PICOM.2015.257
Conference Paper

Fundamentals of Computation Theory Preface

Gasieniec, L., Martin, R., Wolter, F., & Wong, P. W. H. (2015). Fundamentals of Computation Theory Preface. THEORETICAL COMPUTER SCIENCE, 590, 1. doi:10.1016/j.tcs.2015.05.040

DOI
10.1016/j.tcs.2015.05.040
Journal article

Deterministic Symmetry Breaking in Ring Networks

Gasieniec, L., Jurdzinski, T., Martin, R., & Stachowiak, G. (2015). Deterministic Symmetry Breaking in Ring Networks. In 2015 IEEE 35TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (pp. 517-526). doi:10.1109/ICDCS.2015.59

DOI
10.1109/ICDCS.2015.59
Conference Paper

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols

Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Spirakis, P. G., & Uznanski, P. (2015). On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. In Automata, Languages, and Programming, Pt I Vol. 9134 (pp. 393-405). doi:10.1007/978-3-662-47672-7_32

DOI
10.1007/978-3-662-47672-7_32
Conference Paper

On Temporally Connected Graphs of Small Cost

Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2015). On Temporally Connected Graphs of Small Cost. In APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2015 Vol. 9499 (pp. 84-96). doi:10.1007/978-3-319-28684-6_8

DOI
10.1007/978-3-319-28684-6_8
Conference Paper

Algorithms for Sensor Systems

Bose, P., Gąsieniec, L. A., Römer, K., & Wattenhofer, R. (Eds.) (2015). Algorithms for Sensor Systems. In . Springer International Publishing. doi:10.1007/978-3-319-28472-9

DOI
10.1007/978-3-319-28472-9
Conference Paper

Designing and Testing Temporally Connected Graphs.

Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2015). Designing and Testing Temporally Connected Graphs.. CoRR, abs/1502.04579.

Journal article

Deterministic Rendezvous in Restricted Graphs

Farrugia, A., Gasieniec, L., Kuszner, L., & Pacheco, E. (2015). Deterministic Rendezvous in Restricted Graphs. In SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 8939 (pp. 189-200). Retrieved from https://www.webofscience.com/

Conference Paper

Deterministic Symmetry Breaking in Ring Networks.

Gasieniec, L., Jurdzinski, T., Martin, R., & Stachowiak, G. (2015). Deterministic Symmetry Breaking in Ring Networks.. In ICDCS (pp. 517-526). IEEE Computer Society. doi:10.1109/ICDCS.2015.59

DOI
10.1109/ICDCS.2015.59
Conference Paper

Group Search on the Line

Chrobak, M., Gasieniec, L., Gorry, T., & Martin, R. (2015). Group Search on the Line. In SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 8939 (pp. 164-176). Retrieved from https://www.webofscience.com/

Conference Paper

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

Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Spirakis, P. G., & Uznanski, P. (2015). On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.. In M. M. Halldórsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), ICALP (1) Vol. 9134 (pp. 393-405). Springer. Retrieved from https://doi.org/10.1007/978-3-662-47672-7

Conference Paper

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

Czyzowicz, J., Gasieniec, L., Georgiou, K., Kranakis, E., & MacQuarrie, F. (2015). The Beachcombers' Problem: Walking and searching with mobile robots.. Theor. Comput. Sci., 608, 201-218. doi:10.1016/j.tcs.2015.09.011

DOI
10.1016/j.tcs.2015.09.011
Journal article

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

Gąsieniec, L., Hamilton, D. D., Martin, R., & Spirakis, P. G. (2015). The Match-Maker: Constant-Space Distributed Majority via Random Walks. In Unknown Conference (pp. 67-80). Springer International Publishing. doi:10.1007/978-3-319-21741-3_5

DOI
10.1007/978-3-319-21741-3_5
Conference Paper

The Multi-source Beachcombers' Problem

Czyzowicz, J., Gasieniec, L., Georgiou, K., Kranakis, E., & MacQuarrie, F. (2015). The Multi-source Beachcombers' Problem. In ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2014 Vol. 8847 (pp. 3-21). doi:10.1007/978-3-662-46018-4_1

DOI
10.1007/978-3-662-46018-4_1
Conference Paper

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

Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., & Taleb, N. (2015). When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots. In ALGORITHMS AND COMPUTATION, ISAAC 2015 Vol. 9472 (pp. 343-354). doi:10.1007/978-3-662-48971-0_30

DOI
10.1007/978-3-662-48971-0_30
Conference Paper

2014

Doing-it-All with Bounded Work and Communication

Chlebus, B. S., Gasieniec, L., Kowalski, D. R., & Schwarzmann, A. A. (2017). Doing-it-All with bounded work and communication. INFORMATION AND COMPUTATION, 254, 1-40. doi:10.1016/j.ic.2017.02.003

Journal article

Information Gathering in Ad-Hoc Radio Networks with Tree Topology

Chrobak, M., Costello, K., Gasieniec, L., & Kowalski, D. R. (2014). Information Gathering in Ad-Hoc Radio Networks with Tree Topology. COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 8881, 129-145. doi:10.1007/978-3-319-12691-3_11

DOI
10.1007/978-3-319-12691-3_11
Journal article

Ephemeral Networks with Random Availability of Links: Diameter and Connectivity

Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2014). Ephemeral Networks with Random Availability of Links: Diameter and Connectivity. In PROCEEDINGS OF THE 26TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'14) (pp. 267-276). doi:10.1145/2612669.2612693

DOI
10.1145/2612669.2612693
Conference Paper

Towards optimal packed string matching

Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R., & Weimann, O. (2014). Towards optimal packed string matching. THEORETICAL COMPUTER SCIENCE, 525, 111-129. doi:10.1016/j.tcs.2013.06.013

DOI
10.1016/j.tcs.2013.06.013
Journal article

Collision-Free Network Exploration

Czyzowicz, J., Dereniowski, D., Gasieniec, L., Klasing, R., Kosowski, A., & Pajak, D. (2014). Collision-Free Network Exploration. In LATIN 2014: THEORETICAL INFORMATICS Vol. 8392 (pp. 342-354). Retrieved from https://www.webofscience.com/

Conference Paper

Evacuating Robots via Unknown Exit in a Disk

Czyzowicz, J., Gasieniec, L., Gorry, T., Kranakis, E., Martin, R., & Pajak, D. (2014). Evacuating Robots via Unknown Exit in a Disk. In DISTRIBUTED COMPUTING (DISC 2014) Vol. 8784 (pp. 122-136). Retrieved from https://www.webofscience.com/

Conference Paper

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

Chrobak, M., Costello, K. P., Gasieniec, L., & Kowalski, D. (2014). Information Gathering in Ad-Hoc Radio Networks with Tree Topology.. In Z. Zhang, L. Wu, W. Xu, & D. -Z. Du (Eds.), COCOA Vol. 8881 (pp. 129-145). Springer. Retrieved from https://doi.org/10.1007/978-3-319-12691-3

Conference Paper

The Beachcombers' Problem: Walking and Searching with Mobile Robots

Czyzowicz, J., Gasieniec, L., Georgiou, K., Kranakis, E., & MacQuarrie, F. (2014). The Beachcombers' Problem: Walking and Searching with Mobile Robots. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2014 Vol. 8576 (pp. 23-36). Retrieved from https://www.webofscience.com/

Conference Paper

2013

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Ga̧sieniec, L., & Wolter, F. (2013). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (Vol. 8070 LNCS).

Book

Optimal patrolling of fragmented boundaries

Collins, A., Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., . . . Morales Ponce, O. (2013). Optimal patrolling of fragmented boundaries. In Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures. ACM. doi:10.1145/2486159.2486176

DOI
10.1145/2486159.2486176
Conference Paper

Preface

Gleirscher, M., Kugele, S., & Linker, S. (2018). Preface. Retrieved from https://www.webofscience.com/

Book

Rendezvous Problem

Gąsieniec, L. (2013). Rendezvous Problem. In Search Theory (pp. 167-174). Springer New York. doi:10.1007/978-1-4614-6825-7_11

DOI
10.1007/978-1-4614-6825-7_11
Chapter

The Beachcombers' Problem: Walking and searching with mobile robots

Czyzowicz, J., Gasieniec, L., Georgiou, K., Kranakis, E., & MacQuarrie, F. (2015). The Beachcombers' Problem: Walking and searching with mobile robots. THEORETICAL COMPUTER SCIENCE, 608, 201-218. doi:10.1016/j.tcs.2015.09.011

DOI
10.1016/j.tcs.2015.09.011
Journal article

Efficient broadcasting in radio networks with long-range interference

Galcik, F., Gasieniec, L., & Lingas, A. (2013). Efficient broadcasting in radio networks with long-range interference. DISTRIBUTED COMPUTING, 26(1), 59-74. doi:10.1007/s00446-012-0176-6

DOI
10.1007/s00446-012-0176-6
Journal article

Fast message dissemination in random geometric networks

Czumaj, A., Elsaesser, R., Gasieniec, L., Sauerwald, T., & Wang, X. (2013). Fast message dissemination in random geometric networks. DISTRIBUTED COMPUTING, 26(1), 1-24. doi:10.1007/s00446-011-0154-4

DOI
10.1007/s00446-011-0154-4
Journal article

Fundamentals of Computation Theory

Gąsieniec, L., & Wolter, F. (Eds.) (2013). Fundamentals of Computation Theory. In . Springer Berlin Heidelberg. doi:10.1007/978-3-642-40164-0

DOI
10.1007/978-3-642-40164-0
Conference Paper

One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata.

Balodis, K. (2013). One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata.. In L. Gasieniec, & F. Wolter (Eds.), FCT Vol. 8070 (pp. 40-47). Springer. Retrieved from https://doi.org/10.1007/978-3-642-40164-0

Conference Paper

2012

Position Discovery for a System of Bouncing Robots

Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Ponce, O. M., & Pacheco, E. (2012). Position Discovery for a System of Bouncing Robots. In DISTRIBUTED COMPUTING, DISC 2012 Vol. 7611 (pp. 341-355). Retrieved from https://www.webofscience.com/

Conference Paper

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

Friedetzky, T., Gasieniec, L., Gorry, T., & Martin, R. (2012). Observe and Remain Silent (Communication-Less Agent Location Discovery). In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012 Vol. 7464 (pp. 407-418). Retrieved from https://www.webofscience.com/

Conference Paper

More efficient periodic traversal in anonymous undirected graphs

Czyzowicz, J., Dobrev, S., Gasieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., . . . Sung, W. -K. (2012). More efficient periodic traversal in anonymous undirected graphs. THEORETICAL COMPUTER SCIENCE, 444, 60-76. doi:10.1016/j.tcs.2012.01.035

DOI
10.1016/j.tcs.2012.01.035
Journal article

Choosing the best among peers

Czyzowicz, J., Gasieniec, L., & Pelc, A. (2012). Choosing the best among peers. THEORETICAL COMPUTER SCIENCE, 440, 52-59. doi:10.1016/j.tcs.2012.04.005

DOI
10.1016/j.tcs.2012.04.005
Journal article

Constant-Time Word-Size String Matching

Breslauer, D., Gąsieniec, L., & Grossi, R. (2012). Constant-Time Word-Size String Matching. In Unknown Conference (pp. 83-96). Springer Berlin Heidelberg. doi:10.1007/978-3-642-31265-6_7

DOI
10.1007/978-3-642-31265-6_7
Conference Paper

2011

APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN

Czumaj, A., Czyzowicz, J., Gasieniec, L., Jansson, J., Lingas, A., & Zylinski, P. (2011). APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 22(8), 1949-1969. doi:10.1142/S0129054111009148

DOI
10.1142/S0129054111009148
Journal article

Optimal Packed String Matching

Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R., & Weimann, O. (2011). Optimal Packed String Matching. In IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011) Vol. 13 (pp. 423-432). doi:10.4230/LIPIcs.FSTTCS.2011.423

DOI
10.4230/LIPIcs.FSTTCS.2011.423
Conference Paper

Synchronous Rendezvous for Location-Aware Agents

Collins, A., Czyzowicz, J., Gasieniec, L., Kosowski, A., & Martin, R. (2011). Synchronous Rendezvous for Location-Aware Agents. In DISTRIBUTED COMPUTING Vol. 6950 (pp. 447-+). Retrieved from https://www.webofscience.com/

Conference Paper

Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds

Czyzowicz, J., Gasieniec, L., Kosowski, A., & Kranakis, E. (2011). Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. In ALGORITHMS - ESA 2011 Vol. 6942 (pp. 701-712). Retrieved from https://www.webofscience.com/

Conference Paper

Consensus and Mutual Exclusion in a Multiple Access Channel

Czyzowicz, J., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2011). Consensus and Mutual Exclusion in a Multiple Access Channel. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 22(7), 1092-1104. doi:10.1109/TPDS.2010.162

DOI
10.1109/TPDS.2010.162
Journal article

Tree Exploration with Logarithmic Memory

Ambuehl, C., Gasieniec, L., Pelc, A., Radzik, T., & Zhang, X. (2011). Tree Exploration with Logarithmic Memory. In ACM TRANSACTIONS ON ALGORITHMS Vol. 7. doi:10.1145/1921659.1921663

DOI
10.1145/1921659.1921663
Conference Paper

Tree exploration with logarithmic memory

Ambühl, C., Gąsieniec, L., Pelc, A., Radzik, T., & Zhang, X. (2011). Tree exploration with logarithmic memory. ACM Transactions on Algorithms, 7(2), 1-21. doi:10.1145/1921659.1921663

DOI
10.1145/1921659.1921663
Journal article

2010

Efficient Information Exchange in the Random Phone-Call Model

Berenbrink, P., Czyzowicz, J., Elsaesser, R., & Gasieniec, L. (2010). Efficient Information Exchange in the Random Phone-Call Model. In AUTOMATA, LANGUAGES AND PROGRAMMING, PT II Vol. 6199 (pp. 127-+). Retrieved from https://www.webofscience.com/

Conference Paper

Tell Me Where I Am So I Can Meet You Sooner

Collins, A., Czyzowicz, J., Gąsieniec, L., & Labourel, A. (2010). Tell Me Where I Am So I Can Meet You Sooner. In Unknown Conference (pp. 502-514). Springer Berlin Heidelberg. doi:10.1007/978-3-642-14162-1_42

DOI
10.1007/978-3-642-14162-1_42
Conference Paper

Event Extent Estimation

Bienkowski, M., Gasieniec, L., Klonowski, M., Korzeniowski, M., & Schmid, S. (2010). Event Extent Estimation. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS Vol. 6058 (pp. 57-+). Retrieved from https://www.webofscience.com/

Conference Paper

On Efficient Gossiping in Radio Networks

Gasieniec, L. (2010). On Efficient Gossiping in Radio Networks. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY Vol. 5869 (pp. 2-14). Retrieved from https://www.webofscience.com/

Conference Paper

Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids

Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., & Labourel, A. (2010). Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. In DISTRIBUTED COMPUTING Vol. 6343 (pp. 297-+). Retrieved from https://www.webofscience.com/

Conference Paper

More Efficient Periodic Traversal in Anonymous Undirected Graphs

Czyzowicz, J., Dobrev, S., Gasieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., . . . Sung, W. -K. (2010). More Efficient Periodic Traversal in Anonymous Undirected Graphs. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY Vol. 5869 (pp. 167-+). doi:10.1007/978-3-642-11476-2_14

DOI
10.1007/978-3-642-11476-2_14
Conference Paper

Tell Me Where I Am So I Can Meet You Sooner (Asynchronous Rendezvous with Location Information)

Collins, A., Czyzowicz, J., Gasieniec, L., & Labourel, A. (2010). Tell Me Where I Am So I Can Meet You Sooner (Asynchronous Rendezvous with Location Information). In AUTOMATA, LANGUAGES AND PROGRAMMING, PT II Vol. 6199 (pp. 502-+). Retrieved from https://www.webofscience.com/

Conference Paper

2009

Robustness of the Rotor-router Mechanism

Bampas, E., Gasieniec, L., Klasing, R., Kosowski, A., & Radzik, T. (2009). Robustness of the Rotor-router Mechanism. In PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS Vol. 5923 (pp. 345-+). Retrieved from https://www.webofscience.com/

Conference Paper

Consensus and Mutual Exclusion in a Multiple Access Channel

Czyzowicz, J., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2009). Consensus and Mutual Exclusion in a Multiple Access Channel. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 5805 (pp. 512-+). Retrieved from https://www.webofscience.com/

Conference Paper

Euler Tour Lock-In Problem in the Rotor-Router Model I Choose Pointers and You Choose Port Numbers

Bampas, E., Gasieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., & Kosowski, A. (2009). Euler Tour Lock-In Problem in the Rotor-Router Model I Choose Pointers and You Choose Port Numbers. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 5805 (pp. 423-+). Retrieved from https://www.webofscience.com/

Conference Paper

Approximation Algorithms for Buy-at-Bulk Geometric Network Design

Czumaj, A., Czyzowicz, J., Gasieniec, L., Jansson, J., Lingas, A., & Zylinski, P. (2009). Approximation Algorithms for Buy-at-Bulk Geometric Network Design. In ALGORITHMS AND DATA STRUCTURES Vol. 5664 (pp. 168-+). Retrieved from https://www.webofscience.com/

Conference Paper

Efficient Broadcasting in Known Topology Radio Networks with Long-range Interference

Galcik, F., Gasieniec, L., & Lingas, A. (2009). Efficient Broadcasting in Known Topology Radio Networks with Long-range Interference. In PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (pp. 230-239). doi:10.1145/1582716.1582754

DOI
10.1145/1582716.1582754
Conference Paper

Gathering few fat mobile robots in the plane

Czyzowicz, J., Gasieniec, L., & Pelc, A. (2009). Gathering few fat mobile robots in the plane. THEORETICAL COMPUTER SCIENCE, 410(6-7), 481-499. doi:10.1016/j.tcs.2008.10.005

DOI
10.1016/j.tcs.2008.10.005
Journal article

Broadcasting in UDG radio networks with unknown topology

Emek, Y., Gasieniec, L., Kantor, E., Pelc, A., Peleg, D., & Su, C. (2009). Broadcasting in UDG radio networks with unknown topology. DISTRIBUTED COMPUTING, 21(5), 331-351. doi:10.1007/s00446-008-0075-z

DOI
10.1007/s00446-008-0075-z
Journal article

Faster multi-witnesses for Boolean matrix multiplication

Gasieniec, L., Kowaluk, M., & Lingas, A. (2009). Faster multi-witnesses for Boolean matrix multiplication. INFORMATION PROCESSING LETTERS, 109(4), 242-247. doi:10.1016/j.ipl.2008.10.012

DOI
10.1016/j.ipl.2008.10.012
Journal article

More efficient periodic traversal in anonymous undirected graphs

Czyzowicz, J., Dobrev, S., Gasieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., . . . Sung, W. -K. (2009). More efficient periodic traversal in anonymous undirected graphs. In CoRR Vol. abs/0905.1737.

Conference Paper

2008

A robust randomized algorithm to perform independent tasks

Chlebus, B. S., Ga̧sieniec, L., Kowalski, D. R., & Shvartsman, A. A. (2008). A robust randomized algorithm to perform independent tasks. Journal of Discrete Algorithms, 6(4), 651-665. doi:10.1016/j.jda.2008.03.001

DOI
10.1016/j.jda.2008.03.001
Journal article

Memory Efficient Anonymous Graph Exploration

Gasieniec, L., & Radzik, T. (2008). Memory Efficient Anonymous Graph Exploration. In GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE Vol. 5344 (pp. 14-+). Retrieved from https://www.webofscience.com/

Conference Paper

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

Gasieniec, L., Kowalski, D. R., Lingas, A., & Wahlen, M. (2008). Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 5218 (pp. 274-+). Retrieved from https://www.webofscience.com/

Conference Paper

On Radio Broadcasting in Random Geometric Graphs

Elsaesser, R., Gasieniec, L., & Sauerwald, T. (2008). On Radio Broadcasting in Random Geometric Graphs. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 5218 (pp. 212-+). Retrieved from https://www.webofscience.com/

Conference Paper

Faster algorithm for the set variant of the string barcoding problem

Gasieniec, L., Li, C. Y., & Zhang, M. (2008). Faster algorithm for the set variant of the string barcoding problem. In COMBINATORIAL PATTERN MATCHING Vol. 5029 (pp. 82-+). Retrieved from https://www.webofscience.com/

Conference Paper

Time efficient k-shot broadcasting in known topology radio networks

Gasieniec, L., Kantor, E., Kowalski, D. R., Peleg, D., & Su, C. (2008). Time efficient k-shot broadcasting in known topology radio networks. DISTRIBUTED COMPUTING, 21(2), 117-127. doi:10.1007/s00446-008-0058-0

DOI
10.1007/s00446-008-0058-0
Journal article

Structural Information and Communication Complexity (SIROCCO 2006) - Preface

Flocchini, P., & Gasieniec, L. A. (2008). Structural Information and Communication Complexity (SIROCCO 2006) - Preface. THEORETICAL COMPUTER SCIENCE, 399(1-2), 1-2. doi:10.1016/j.tcs.2008.02.002

DOI
10.1016/j.tcs.2008.02.002
Journal article

Deterministic Broadcasting in Radio Networks

Gąsieniec, L. (2008). Deterministic Broadcasting in Radio Networks. In Encyclopedia of Algorithms (pp. 233-235). Springer US. doi:10.1007/978-0-387-30162-4_105

DOI
10.1007/978-0-387-30162-4_105
Chapter

Fast periodic graph exploration with constant memory

Gasieniec, L., Klasing, R., Martin, R., Navarra, A., & Zhang, X. (2008). Fast periodic graph exploration with constant memory. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 74(5), 808-822. doi:10.1016/j.jcss.2007.09.004

DOI
10.1016/j.jcss.2007.09.004
Journal article

Randomized Gossiping in Radio Networks

Gąsieniec, L. (2008). Randomized Gossiping in Radio Networks. In Encyclopedia of Algorithms (pp. 731-732). Springer US. doi:10.1007/978-0-387-30162-4_324

DOI
10.1007/978-0-387-30162-4_324
Chapter

Routing in Geometric Networks

Gąsieniec, L., Su, C., & Wong, P. (2008). Routing in Geometric Networks. In Encyclopedia of Algorithms (pp. 793-796). Springer US. doi:10.1007/978-0-387-30162-4_352

DOI
10.1007/978-0-387-30162-4_352
Chapter

2007

Preface

Movchan, N. V., & McPhedran, R. C. (2007). Preface (Vol. 17). Informa UK Limited. doi:10.1080/17455030701602295

DOI
10.1080/17455030701602295
Book

Randomized probe selection algorithm for microarray design

Gasieniec, L., Li, C. Y., Sant, P., & Wong, P. W. H. (2007). Randomized probe selection algorithm for microarray design. JOURNAL OF THEORETICAL BIOLOGY, 248(3), 512-521. doi:10.1016/j.jtbi.2007.05.036

DOI
10.1016/j.jtbi.2007.05.036
Journal article

Time efficient centralized gossiping in radio networks

Gasieniec, L., Potapov, I., & Xin, Q. (2007). Time efficient centralized gossiping in radio networks. THEORETICAL COMPUTER SCIENCE, 383(1), 45-58. doi:10.1016/j.tcs.2007.03.059

DOI
10.1016/j.tcs.2007.03.059
Journal article

Improved approximate common interval

Amir, A., Gasieniec, L., & Shalom, R. (2007). Improved approximate common interval. INFORMATION PROCESSING LETTERS, 103(4), 142-149. doi:10.1016/j.ipl.2007.03.006

DOI
10.1016/j.ipl.2007.03.006
Journal article

Broadcasting in UDG Radio Networks with Unknown Topology

Emek, Y., Pelc, A., Gasieniec, L., Kantor, E., Peleg, D., & Su, C. (2007). Broadcasting in UDG Radio Networks with Unknown Topology. In PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (pp. 195-204). Retrieved from https://www.webofscience.com/

Conference Paper

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

Gąsieniec, L., Su, C., Wong, P. W. H., & Xin, Q. (2007). Routing of single-source and multiple-source queries in static sensor networks. Journal of Discrete Algorithms, 5(1), 1-11. doi:10.1016/j.jda.2006.03.012

DOI
10.1016/j.jda.2006.03.012
Journal article

Faster communication in known topology radio networks

Gasieniec, L., Peleg, D., & Xin, Q. (2007). Faster communication in known topology radio networks. DISTRIBUTED COMPUTING, 19(4), 289-300. doi:10.1007/s00446-006-0011-z

DOI
10.1007/s00446-006-0011-z
Journal article

Deterministic communication in radio networks with large labels

Gasieniec, L., Pagourtzis, A., Potapov, I., & Radzik, T. (2007). Deterministic communication in radio networks with large labels. ALGORITHMICA, 47(1), 97-117. doi:10.1007/s00453-006-1212-3

DOI
10.1007/s00453-006-1212-3
Journal article

Energy and time efficient broadcasting in known topology radio networks

Gasieniec, L., Kantor, E., Kowalski, D. R., Peleg, D., & Su, C. (2007). Energy and time efficient broadcasting in known topology radio networks. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 4731 (pp. 253-+). Retrieved from https://www.webofscience.com/

Conference Paper

Fast periodic graph exploration with constant memory

Gasieniec, L., Klasing, R., Martin, R., Navarra, A., & Zhangi, X. (2007). Fast periodic graph exploration with constant memory. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS Vol. 4474 (pp. 26-+). Retrieved from https://www.webofscience.com/

Conference Paper

Tree Exploration with Logarithmic Memory

Gasieniec, L., Pelc, A., Radzik, T., & Zhang, X. (2007). Tree Exploration with Logarithmic Memory. In PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (pp. 585-+). Retrieved from https://www.webofscience.com/

Conference Paper

2006

Collective tree exploration

Fraigniaud, P., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2006). Collective tree exploration. NETWORKS, 48(3), 166-177. doi:10.1002/net.20127

DOI
10.1002/net.20127
Journal article

Efficient Probe Selection in Microarray Design

Gasieniec, L., Li, C. Y., Sant, P., & Wong, P. W. H. (2006). Efficient Probe Selection in Microarray Design. In 2006 IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology (pp. 1-8). IEEE. doi:10.1109/cibcb.2006.331018

DOI
10.1109/cibcb.2006.331018
Conference Paper

THE WAKE-UP PROBLEM IN MULTIHOP RADIO NETWORKS

Chrobak, M., Gasieniec, L., & Kowalski, D. R. (2007). THE WAKE-UP PROBLEM IN MULTIHOP RADIO NETWORKS. SIAM JOURNAL ON COMPUTING, 36(5), 1453-1471. doi:10.1137/S0097539704442726

DOI
10.1137/S0097539704442726
Journal article

Deterministic M2M multicast in radio networks

Gasieniec, L., Kranakis, E., Pelc, A., & Xin, Q. (2006). Deterministic M2M multicast in radio networks. THEORETICAL COMPUTER SCIENCE, 362(1-3), 196-206. doi:10.1016/j.tcs.2006.06.017

DOI
10.1016/j.tcs.2006.06.017
Journal article

Foundations of computation theory (FCT 2003) - Preface

Lingas, A., & Gasieniec, L. (2006). Foundations of computation theory (FCT 2003) - Preface (Vol. 354). doi:10.1016/j.tcs.2005.11.028

DOI
10.1016/j.tcs.2005.11.028
Book

Gathering Few Fat Mobile Robots in the Plane.

Czyzowicz, J., Gasieniec, L., & Pelc, A. (2006). Gathering Few Fat Mobile Robots in the Plane.. In A. A. Shvartsman (Ed.), OPODIS Vol. 4305 (pp. 350-364). Springer. Retrieved from https://doi.org/10.1007/11945529

Conference Paper

Gathering few fat mobile robots in the plane

Czyzowicz, J., Gasieniec, L., & Pelc, A. (2006). Gathering few fat mobile robots in the plane. In PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS Vol. 4305 (pp. 350-364). Retrieved from https://www.webofscience.com/

Conference Paper

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Flocchini, P., & Ga̧sieniec, L. (2006). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (Vol. 4056 LNCS).

Book

Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring

Gasieniec, L., Kranakis, E., Krizanc, D., & Zhang, X. (2006). Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring. In SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS Vol. 3831 (pp. 282-292). Retrieved from https://www.webofscience.com/

Conference Paper

Radio communication in random graphs

Elsässer, R., & Gasieniec, L. (2006). Radio communication in random graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 72(3), 490-506. doi:10.1016/j.jcss.2005.09.003

DOI
10.1016/j.jcss.2005.09.003
Journal article

SIROCCO'2006

Flocchini, P., & Gasieniec, L. (Eds.) (2006). SIROCCO'2006. In 13th Colloquium on Structural Information and Communication Complexity, SIROCCO'2006 Vol. 4056 (pp. 1-360). Berlin / Heidelberg: Springer. Retrieved from http://www.springerlink.com/content/k36207172528/

Conference Paper

Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings

Flocchini, P., & Gasieniec, L. (Eds.) (2006). Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings. In SIROCCO Vol. 4056. Springer.

Conference Paper

2005

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

Gasieniec, L., Chang Su., Wong, P. W. H., & Qin Xin. (n.d.). Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks. In 19th IEEE International Parallel and Distributed Processing Symposium (pp. 237b). IEEE. doi:10.1109/ipdps.2005.384

DOI
10.1109/ipdps.2005.384
Conference Paper

Optimal two-stage algorithms for group testing problems

De Bonis, A., Gasieniec, L., & Vaccaro, U. (2005). Optimal two-stage algorithms for group testing problems. SIAM JOURNAL ON COMPUTING, 34(5), 1253-1270. doi:10.1137/S0097539703428002

DOI
10.1137/S0097539703428002
Journal article

Real-time traversal in grammar-based compressed files

Gasieniec, L., Kolpakov, R., Potapov, I., & Sant, P. (2005). Real-time traversal in grammar-based compressed files. In DCC 2005: Data Compression Conference, Proceedings (pp. 458). Retrieved from https://www.webofscience.com/

Conference Paper

On realizing shapes in the theory of RNA neutral networks

Clote, P., Gasieniec, L., Kolpakov, R., Kranakis, E., & Krizanc, D. (2005). On realizing shapes in the theory of RNA neutral networks. JOURNAL OF THEORETICAL BIOLOGY, 236(2), 216-227. doi:10.1016/j.jtbi.2005.03.006

DOI
10.1016/j.jtbi.2005.03.006
Journal article

Radio communication in random graphs

Elsässer, R., & Gasieniec, L. (2005). Radio communication in random graphs. In Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures (pp. 309-315). ACM. doi:10.1145/1073970.1074021

DOI
10.1145/1073970.1074021
Conference Paper

Faster communication in known topology radio networks

Gasieniec, L., Peleg, D., & Xin, Q. (2005). Faster communication in known topology radio networks. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (pp. 129-137). ACM. doi:10.1145/1073814.1073840

DOI
10.1145/1073814.1073840
Conference Paper

Space efficient search for maximal repetitions

Gasieniec, L., Kolpakov, R., & Potapov, I. (2005). Space efficient search for maximal repetitions. THEORETICAL COMPUTER SCIENCE, 339(1), 35-48. doi:10.1016/j.tcs.2005.01.006

DOI
10.1016/j.tcs.2005.01.006
Journal article

On the wake-up problem in radio networks

Chlebus, B. S., Gasieniec, L., Kowalski, D. R., & Radzik, T. (2005). On the wake-up problem in radio networks. In AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS Vol. 3580 (pp. 347-359). Retrieved from https://www.webofscience.com/

Conference Paper

Radio communication in random graphs: extended abstract.

Elsässer, R., & Gasieniec, L. (2005). Radio communication in random graphs: extended abstract.. In P. B. Gibbons, & P. G. Spirakis (Eds.), SPAA (pp. 309-315). ACM. Retrieved from https://doi.org/10.1145/1073970

Conference Paper

2004

The Wake-Up Problem in Multi-Hop Radio Networks

Chrobak, M., Ga̧sieniec, L., & Kowalski, D. (2004). The Wake-Up Problem in Multi-Hop Radio Networks. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms Vol. 15 (pp. 985-993).

Conference Paper

A randomized algorithm for gossiping in radio networks

Chrobak, M., Gasieniec, L., & Rytter, W. (2004). A randomized algorithm for gossiping in radio networks. NETWORKS, 43(2), 119-124. doi:10.1002/net.10109

DOI
10.1002/net.10109
Journal article

Approximation algorithms for Hamming clustering problems

Ga̧sieniec, L., Jansson, J., & Lingas, A. (2004). Approximation algorithms for Hamming clustering problems. Journal of Discrete Algorithms, 2(2), 289-301. doi:10.1016/s1570-8667(03)00079-0

DOI
10.1016/s1570-8667(03)00079-0
Journal article

Collective tree exploration

Fraigniaud, P., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2004). Collective tree exploration. In LATIN 2004: THEORETICAL INFORMATICS Vol. 2976 (pp. 141-151). doi:10.1007/978-3-540-24698-5_18

DOI
10.1007/978-3-540-24698-5_18
Conference Paper

Deterministic M2M Multicast in Radio Networks

Gasieniec, L., Kranakis, E., Pelc, A., & Xin, Q. (2004). Deterministic M2M Multicast in Radio Networks. In 31st International Colloquium on Automata, Languages and Programming, ICALP 2004 Vol. 3142 (pp. 670-682). Helsinki: Springer.

Conference Paper

Deterministic M2M multicast in radio networks - (Extended abstract)

Gasieniec, L., Kranakis, E., Pelc, A., & Xin, Q. (2004). Deterministic M2M multicast in radio networks - (Extended abstract). In AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS Vol. 3142 (pp. 670-682). Retrieved from https://www.webofscience.com/

Conference Paper

Faster deterministic gossiping in directed ad hoc radio networks

Gasieniec, L., Radzik, T., & Xin, Q. (2004). Faster deterministic gossiping in directed ad hoc radio networks. In ALGORITHM THEORY- SWAT 2004 Vol. 3111 (pp. 397-407). Retrieved from https://www.webofscience.com/

Conference Paper

Real-time string matching in sublinear space

Gasieniec, L., & Kolpakov, R. (2004). Real-time string matching in sublinear space. In COMBINATORIAL PATTERN MATCHING, PROCEEDINGS Vol. 3109 (pp. 117-129). Retrieved from https://www.webofscience.com/

Conference Paper

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

Chrobak, M., Gasieniec, L., & Kowalski, D. R. (2004). The wake-up problem in multi-hop radio networks.. In J. I. Munro (Ed.), SODA (pp. 992-1000). SIAM. Retrieved from http://dl.acm.org/citation.cfm?id=982792

Conference Paper

Time Efficient Gossiping in Known Radio Networks

Gąsieniec, L., Potapov, I., & Xin, Q. (2004). Time Efficient Gossiping in Known Radio Networks. In Unknown Conference (pp. 173-184). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27796-5_16

DOI
10.1007/978-3-540-27796-5_16
Conference Paper

Time efficient gossiping in known radio networks

Gasieniec, L., Potapov, I., & Xin, Q. (2004). Time efficient gossiping in known radio networks. In STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDING Vol. 3104 (pp. 173-184). Retrieved from https://www.webofscience.com/

Conference Paper

2003

Time/space efficient compressed pattern matching

Gasieniec, L., & Potapov, I. (2003). Time/space efficient compressed pattern matching. FUNDAMENTA INFORMATICAE, 56(1-2), 137-154. Retrieved from https://www.webofscience.com/

Journal article

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

Czumaj, A., Gasieniec, L., Gaur, D. R., Krishnamurti, R., Rytter, W., & Zito, M. (2003). On polynomial-time approximation algorithms for the variable length scheduling problem. THEORETICAL COMPUTER SCIENCE, 302(1-3), 489-495. doi:10.1016/S0304-3975(03)00141-5

DOI
10.1016/S0304-3975(03)00141-5
Journal article

An improved bound on Boolean matrix multiplication for highly clustered data

Gasieniec, L., & Lingas, A. (2003). An improved bound on Boolean matrix multiplication for highly clustered data. In ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS Vol. 2748 (pp. 329-339). Retrieved from https://www.webofscience.com/

Conference Paper

Generalized framework for selectors with applications in optimal group testing

De Bonis, A., Gasieniec, L., & Vaccaro, U. (2003). Generalized framework for selectors with applications in optimal group testing. In AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS Vol. 2719 (pp. 81-96). Retrieved from https://www.webofscience.com/

Conference Paper

Space efficient search for maximal repetitions

Gasieniec, L., Kolpakov, R., & Potapov, I. (2003). Space efficient search for maximal repetitions. In 4th International Conference on Words, WORDS'2003. Turku: Turku University.

Conference Paper

2002

On adaptive deterministic gossiping in ad hoc radio networks

Gasieniec, L., & Lingas, A. (2002). On adaptive deterministic gossiping in ad hoc radio networks. INFORMATION PROCESSING LETTERS, 83(2), 89-93. doi:10.1016/S0020-0190(01)00312-X

DOI
10.1016/S0020-0190(01)00312-X
Journal article

Bounding work and communication in robust cooperative computation

Chlebus, B. S., Gasieniec, L., Kowalski, D. R., & Shvartsman, A. A. (2002). Bounding work and communication in robust cooperative computation. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 2508 (pp. 295-310). Retrieved from https://www.webofscience.com/

Conference Paper

Deterministic broadcasting in ad hoc radio networks

Chlebus, B. S., Gasieniec, L., Gibbons, A., Pelc, A., & Rytter, W. (2002). Deterministic broadcasting in ad hoc radio networks. DISTRIBUTED COMPUTING, 15(1), 27-38. doi:10.1007/s446-002-8028-1

DOI
10.1007/s446-002-8028-1
Journal article

Deterministic communication in radio networks with large labels

Gasieniec, L., Pagourtzis, A., & Potapov, I. (2002). Deterministic communication in radio networks with large labels. In ALGORITHMS-ESA 2002, PROCEEDINGS Vol. 2461 (pp. 512-524). Retrieved from https://www.webofscience.com/

Conference Paper

Fast broadcasting and gossiping in radio networks

Chrobak, M., Gasieniec, L., & Rytter, W. (2002). Fast broadcasting and gossiping in radio networks. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 43(2), 177-189. doi:10.1016/S0196-6774(02)00004-4

DOI
10.1016/S0196-6774(02)00004-4
Journal article

Gossiping with Bounded Size Messages in ad hoc Radio Networks

Christersson, M., Gąsieniec, L., & Lingas, A. (2002). Gossiping with Bounded Size Messages in ad hoc Radio Networks. In Unknown Conference (pp. 377-389). Springer Berlin Heidelberg. doi:10.1007/3-540-45465-9_33

DOI
10.1007/3-540-45465-9_33
Conference Paper

Gossiping with bounded size messages in ad hoc radio networks - (Extended abstract)

Christersson, M., Gasieniec, L., & Lingas, A. (2002). Gossiping with bounded size messages in ad hoc radio networks - (Extended abstract). In AUTOMATA, LANGUAGES AND PROGRAMMING Vol. 2380 (pp. 377-389). Retrieved from https://www.webofscience.com/

Conference Paper

Gossiping with unit messages in known radio networks

Gasieniec, L., & Potapov, I. (2002). Gossiping with unit messages in known radio networks. In FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING Vol. 96 (pp. 193-205). Retrieved from https://www.webofscience.com/

Conference Paper

On adaptive deterministic gossiping in <i>ad hoc</i> radio networks

Gasieniec, L., & Lingas, A. (2002). On adaptive deterministic gossiping in <i>ad hoc</i> radio networks. In PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (pp. 689-690). Retrieved from https://www.webofscience.com/

Conference Paper

2001

Efficient web searching using temporal factors

Czumaj, A., Finch, I., Gasieniec, L., Gibbons, A., Leng, P., Rytter, W., & Zito, M. (2001). Efficient web searching using temporal factors. THEORETICAL COMPUTER SCIENCE, 262(1-2), 569-582. doi:10.1016/S0304-3975(00)00366-2

DOI
10.1016/S0304-3975(00)00366-2
Journal article

Oblivious gossiping in ad-hoc radio networks

Chlebus, B. S., Gąsieniec, L., Lingas, A., & Pagourtzis, A. T. (2001). Oblivious gossiping in ad-hoc radio networks. In Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications (pp. 44-51). ACM. doi:10.1145/381448.381454

DOI
10.1145/381448.381454
Conference Paper

The wakeup problem in synchronous broadcast systems

Gasieniec, L., Pelc, A., & Peleg, D. (2001). The wakeup problem in synchronous broadcast systems. SIAM JOURNAL ON DISCRETE MATHEMATICS, 14(2), 207-222. doi:10.1137/S0895480100376022

DOI
10.1137/S0895480100376022
Journal article

A randomized algorithm for gossiping in radio networks

Chrobak, M., Gasieniec, L., & Rytter, W. (2001). A randomized algorithm for gossiping in radio networks. In COMPUTING AND COMBINATORICS Vol. 2108 (pp. 483-492). Retrieved from https://www.webofscience.com/

Conference Paper

Time/Space Efficient Compressed Pattern Matching

Gasieniec, L., & Potapov, I. (2001). Time/Space Efficient Compressed Pattern Matching. In Unknown Conference (pp. 138-149). Springer Berlin Heidelberg. doi:10.1007/3-540-44669-9_15

DOI
10.1007/3-540-44669-9_15
Conference Paper

2000

Wakeup problem in synchronous broadcast systems

Gasieniec, L., Pelc, A., & Peleg, D. (2000). Wakeup problem in synchronous broadcast systems. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 113-121).

Conference Paper

Algorithms for the parallel alternating direction access machine

Chlebus, B. S., Czumaj, A., Gasieniec, L., Kowaluk, M., & Plandowski, W. (2000). Algorithms for the parallel alternating direction access machine. THEORETICAL COMPUTER SCIENCE, 245(2), 151-173. doi:10.1016/S0304-3975(99)00280-7

DOI
10.1016/S0304-3975(99)00280-7
Journal article

The wakeup problem in synchronous broadcast systems (extended abstract)

Gąsieniec, L., Pelc, A., & Peleg, D. (2000). The wakeup problem in synchronous broadcast systems (extended abstract). In Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (pp. 113-121). ACM. doi:10.1145/343477.343529

DOI
10.1145/343477.343529
Conference Paper

Approximation algorithms for Hamming clustering problems

Gasieniec, L., Jansson, J., & Lingas, A. (2000). Approximation algorithms for Hamming clustering problems. In COMBINATORIAL PATTERN MATCHING Vol. 1848 (pp. 108-118). Retrieved from https://www.webofscience.com/

Conference Paper

Deterministic Radio Broadcasting

Chlebus, B. S., Gçasieniec, L., Östlin, A., & Robson, J. M. (2000). Deterministic Radio Broadcasting. In Unknown Conference (pp. 717-729). Springer Berlin Heidelberg. doi:10.1007/3-540-45022-x_60

DOI
10.1007/3-540-45022-x_60
Conference Paper

Deterministic broadcasting in unknown radio networks

Chlebus, B. S., Gasieniec, L., Gibbons, A., Pelc, A., & Rytter, W. (2000). Deterministic broadcasting in unknown radio networks. In PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (pp. 861-870). Retrieved from https://www.webofscience.com/

Conference Paper

Fast broadcasting and gossiping in radio networks

Chrobak, M., Gasieniec, L., & Rytter, W. (2000). Fast broadcasting and gossiping in radio networks. In 41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS (pp. 575-581). doi:10.1109/SFCS.2000.892325

DOI
10.1109/SFCS.2000.892325
Conference Paper

On the complexity of determining the period of a string

Czumaj, A., & Gasieniec, L. (2000). On the complexity of determining the period of a string. In COMBINATORIAL PATTERN MATCHING Vol. 1848 (pp. 412-422). Retrieved from https://www.webofscience.com/

Conference Paper

Strategies for hotlink assignments

Bose, P., Czyzowicz, J., Gasieniec, L., Kranakis, E., Krizanc, D., Pelc, A., & Martin, M. V. (2001). Strategies for hotlink assignments. In ALGORITHM AND COMPUTATION, PROCEEDINGS Vol. 1969 (pp. 23-34). Retrieved from https://www.webofscience.com/

Conference Paper