2023
Gąsieniec, L., Jurdziński, T., Klasing, R., Levcopoulos, C., Lingas, A., Min, J., & Radzik, T. (2023). Perpetual maintenance of machines with different urgency requirements. Journal of Computer and System Sciences, 103476. doi:10.1016/j.jcss.2023.103476DOI: 10.1016/j.jcss.2023.103476
Gąsieniec, L., Spirakis, P. G., & Stachowiak, G. (2023). New Clocks, Optimal Line Formation and Self-Replication Population Protocols. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 254. doi:10.4230/LIPIcs.STACS.2023.33DOI: 10.4230/LIPIcs.STACS.2023.33
Preface (Book)
Gąsieniec, L. (2023). Preface (Vol. 13878 LNCS).
2022
Spirakis, P., Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., & Uznanski, P. (n.d.). On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. Journal of Computer and System Sciences. doi:10.1016/j.jcss.2022.06.002DOI: 10.1016/j.jcss.2022.06.002
Gąsieniec, L., Spirakis, P., & Stachowiak, G. (2022). Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 246. doi:10.4230/LIPIcs.DISC.2022.44DOI: 10.4230/LIPIcs.DISC.2022.44
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020 (Journal article)
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-4DOI: 10.1007/s00453-022-01029-4
2021
Gąsieniec, L., Smith, B., & Wild, S. (2021). Towards the 5/6-Density Conjecture of Pinwheel Scheduling. Retrieved from http://arxiv.org/abs/2111.01784v1
Gasieniec, L., Jansson, J., & Levcopoulos, C. (2021). Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019). JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 120, 177-178. doi:10.1016/j.jcss.2021.04.002DOI: 10.1016/j.jcss.2021.04.002
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority (Conference Paper)
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.3467942DOI: 10.1145/3465084.3467942
Doty, D., Eftekhari, M., Gasieniec, L., Severson, E., Uznanski, P., & Stachowiak, G. (2022). A time and space optimal stable population protocol solving exact majority. 2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 1044-1055. doi:10.1109/FOCS52979.2021.00104DOI: 10.1109/FOCS52979.2021.00104
Gąsieniec, L., Jansson, J., Levcopoulos, C., Lingas, A., & Persson, M. (2021). Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. Journal of Computer and System Sciences, 118, 108-118. doi:10.1016/j.jcss.2020.12.004DOI: 10.1016/j.jcss.2020.12.004
Gasieniec, L., Jansson, J., Levcopoulos, C., & Lingas, A. (2021). Efficient Assignment of Identities in Anonymous Populations. Retrieved from http://arxiv.org/abs/2105.12083v4
Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election (Journal article)
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/3424659DOI: 10.1145/3424659
Doty, D., Eftekhari, M., Gasieniec, L., Severson, E. E., Uznanski, P., & Stachowiak, G. (2021). A time and space optimal stable population protocol solving exact majority.. In FOCS (pp. 1044-1055). IEEE. Retrieved from https://doi.org/10.1109/FOCS52979.2022
Chrobak, M., Costello, K. P., & Gasieniec, L. (2021). Information gathering in ad-hoc radio networks.. Inf. Comput., 281, 104769.
New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive). (Journal article)
Gasieniec, L., Spirakis, P. G., & Stachowiak, G. (2021). New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive).. CoRR, abs/2111.10822.
2020
Di Giacomo, E., Gasieniec, L., Liotta, G., & Navarra, A. (2020). On the curve complexity of 3-colored point-set embeddings. Theoretical Computer Science, 846, 114-140. doi:10.1016/j.tcs.2020.09.027DOI: 10.1016/j.tcs.2020.09.027
Gąsieniec, L., Stachowiak, G., & Uznański, P. (2020). Time and Space Optimal Exact Majority Population Protocols. Retrieved from http://arxiv.org/abs/2011.07392v2
Predicting the Availability of Hematopoietic Stem Cell Donors Using Machine Learning (Journal article)
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.026DOI: 10.1016/j.bbmt.2020.03.026
Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings (Conference Paper)
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.
IWOCA 2020 in B ordeaux (Oops! On-L ine!) 31st International Workshop on Combinatorial Algorithms (Journal article)
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/
Foucaud, F., Gasieniec, L., Klasing, R., Radzik, T., & Smyth, B. (2020). IWOCA 2020 in Bordeaux (Oops! On-Line!).. Bull. EATCS, 132.
Preface (Book)
Gąsieniec, L., Klasing, R., & Radzik, T. (2020). Preface (Vol. 12126 LNCS).
2019
Farrugia, A., Gasieniec, L., Kuszner, L., & Pacheco, E. (2019). Deterministic rendezvous with different maps. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 106, 49-59. doi:10.1016/j.jcss.2019.06.001DOI: 10.1016/j.jcss.2019.06.001
Chrobak, M., Costello, K. P., & Gasieniec, L. (2021). Information gathering in ad-hoc radio networks. INFORMATION AND COMPUTATION, 281. doi:10.1016/j.ic.2021.104769DOI: 10.1016/j.ic.2021.104769
Akrida, E., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. (2019). Temporal flows in Temporal networks. Journal of Computer and System Sciences, 103, 46-60. doi:10.1016/j.jcss.2019.02.003DOI: 10.1016/j.jcss.2019.02.003
Akrida, E. C., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. G. (2019). Temporal flows in temporal networks. In JOURNAL OF COMPUTER AND SYSTEM SCIENCES Vol. 103 (pp. 46-60). doi:10.1016/j.jcss.2019.02.003DOI: 10.1016/j.jcss.2019.02.003
Czyzowicz, J., Gasieniec, L., Killick, R., & Kranakis, E. (2019). Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes. In PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19) (pp. 4-13). doi:10.1145/3293611.3331608DOI: 10.1145/3293611.3331608
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_11DOI: 10.1007/978-3-030-24922-9_11
Gasieniec, L. A., Stachowiak, G., & Uznanski, P. (2019). Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 93-102). Phoenix, USA. doi:10.1145/3323165.3323178DOI: 10.1145/3323165.3323178
Gasieniec, L., Jurdzinski, T., Martin, R., & Stachowiak, G. (2019). Communication and location discovery in geometric ring networks. INFORMATION AND COMPUTATION, 266, 19-48. doi:10.1016/j.ic.2018.12.001DOI: 10.1016/j.ic.2018.12.001
Gąsieniec, L., Jansson, J., Levcopoulos, C., Lingas, A., & Persson, M. (2019). Pushing the online matrix-vector conjecture off-line and identifying its easy cases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11458 LNCS (pp. 156-169). doi:10.1007/978-3-030-18126-0_14DOI: 10.1007/978-3-030-18126-0_14
Bampas, E., Jurek, C., Gasieniec, L., Ilcinkas, D., Klasing, R., Kociumaka, T., & Pajak, D. (2019). Linear Search by a Pair of Distinct-Speed Robots. Algorithmica, 81(1), 317-342. doi:10.1007/s00453-018-0447-0DOI: 10.1007/s00453-018-0447-0
Cicerone, S., Di Stefano, G., Gasieniec, L., Jurdzinski, T., Navarra, A., Radzik, T., & Stachowiak, G. (2019). Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. In Unknown Conference (pp. 174-186). Springer International Publishing. doi:10.1007/978-3-030-17402-6_15DOI: 10.1007/978-3-030-17402-6_15
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
Preface (Book)
Gąsieniec, L. A., Jansson, J., & Levcopoulos, C. (2019). Preface (Vol. 11651 LNCS).
2018
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_9DOI: 10.1007/978-3-030-03232-6_9
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
Gąsieniec, L., Stachowiak, G., & Uznański, P. (2018). Almost logarithmic-time space optimal leader election in population protocols. Retrieved from http://arxiv.org/abs/1802.06867v2
Chrobak, M., Costello, K. P., Gasieniec, L., & Kowalski, D. R. (2018). Information gathering in ad-hoc radio networks with tree topology. Information and Computation, 258, 1-27. doi:10.1016/j.ic.2017.11.003DOI: 10.1016/j.ic.2017.11.003
Chlebus, B. S., Gasieniec, L., & Pelc, A. (2018). Deterministic Computations on a PRAM with Static Processor and Memory Faults..
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
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
2017
Deterministic computations on a PRAM with static processor and memory faults (Journal article)
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/
Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., & Taleb, N. (2017). When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots. Algorithmica, 79(3), 925-940. doi:10.1007/s00453-016-0233-9DOI: 10.1007/s00453-016-0233-9
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 SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 10706 (pp. 367-380). doi:10.1007/978-3-319-73117-9_26
Gasieniec, L., Levcopoulos, C., Lingas, A., Pagh, R., & Tokuyama, T. (2017). Efficiently Correcting Matrix Products.. Algorithmica, 79, 428-443. doi:10.1007/s00453-016-0202-3DOI: 10.1007/s00453-016-0202-3
Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2017). The Complexity of Optimal Design of Temporally Connected Graphs. THEORY OF COMPUTING SYSTEMS, 61(3), 907-944. doi:10.1007/s00224-017-9757-xDOI: 10.1007/s00224-017-9757-x
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
Bampas, E., Gasieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., Kosowski, A., & Radzik, T. (2017). Robustness of the Rotor-Router Mechanism. ALGORITHMICA, 78(3), 869-895. doi:10.1007/s00453-016-0179-yDOI: 10.1007/s00453-016-0179-y
Bampas, E., Gasieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., Kosowski, A., & Radzik, T. (2017). Robustness of the Rotor-Router Mechanism.. Algorithmica, 78, 869-895. doi:10.1007/s00453-016-0179-yDOI: 10.1007/s00453-016-0179-y
Czyzowicz, J., Dereniowski, D., Gasieniec, L., Klasing, R., Kosowski, A., & Pajak, D. (2017). Collision-free network exploration. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 86, 70-81. doi:10.1016/j.jcss.2016.11.008DOI: 10.1016/j.jcss.2016.11.008
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.003DOI: 10.1016/j.ic.2017.02.003
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/
Spirakis, P. G., Gasieniec, L., Martin, R., Hamilton, D., & Stachowiac, G. (2017). Deterministic Population Protocols for Exact Majority and Plurality. In LIPIcs. Madrit Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.OPODIS.2016.14DOI: 10.4230/LIPIcs.OPODIS.2016.14
The Impact of Hierarchical Structure on Efficiency of Cloud Monitoring (Conference Paper)
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/
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 (Conference Paper)
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.
Gasieniec, L., Klasing, R., Levcopoulos, C., Lingas, A., Min, J., & Radzik, T. (2017). Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). In SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 10139 (pp. 229-240). doi:10.1007/978-3-319-51963-0_18DOI: 10.1007/978-3-319-51963-0_18
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
2016
Gąsieniec, L., Levcopoulos, C., Lingas, A., Pagh, R., & Tokuyama, T. (2016). Efficiently Correcting Matrix Products. Algorithmica, 79, 428-443. doi:10.1007/s00453-016-0202-3DOI: 10.1007/s00453-016-0202-3
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
Bienkowski, M., Gasieniec, L., Klonowski, M., Korzeniowski, M., Mans, B., Schmid, S., & Wattenhofer, R. (2016). Distributed Alarming in the On-Duty and Off-Duty Models. IEEE-ACM TRANSACTIONS ON NETWORKING, 24(1), 218-230. doi:10.1109/TNET.2014.2359684DOI: 10.1109/TNET.2014.2359684
Efficiently Correcting Matrix Products (Journal article)
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_5DOI: 10.1007/978-3-319-13075-0_5
Balancing Mobility Algorithm for Monitoring Virtual Machines in Clouds (Conference Paper)
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/
Deterministic Broadcasting in Radio Networks (Chapter)
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_105DOI: 10.1007/978-1-4939-2864-4_105
Deterministic radio broadcasting (Conference Paper)
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/
Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2016). Ephemeral networks with random availability of links: The case of fast networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 87, 109-120. doi:10.1016/j.jpdc.2015.10.002DOI: 10.1016/j.jpdc.2015.10.002
Flows in Temporal networks. (Journal article)
Akrida, E. C., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. G. (2016). Flows in Temporal networks.. CoRR, abs/1606.01091.
Linear Search by a Pair of Distinct-Speed Robots (Conference Paper)
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_13DOI: 10.1007/978-3-319-48314-6_13
Randomized Gossiping in Radio Networks (Chapter)
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_324DOI: 10.1007/978-1-4939-2864-4_324
Routing in Geometric Networks (Chapter)
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_352DOI: 10.1007/978-1-4939-2864-4_352
2015
Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines (Conference Paper)
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.257DOI: 10.1109/CIT/IUCC/DASC/PICOM.2015.257
Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Morales-Ponce, O., & Pacheco, E. (2015). Position discovery for a system of bouncing robots. INFORMATION AND COMPUTATION, 244, 122-133. doi:10.1016/j.ic.2015.07.005DOI: 10.1016/j.ic.2015.07.005
Fundamentals of Computation Theory Preface (Journal article)
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.040DOI: 10.1016/j.tcs.2015.05.040
Deterministic Symmetry Breaking in Ring Networks (Conference Paper)
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.59DOI: 10.1109/ICDCS.2015.59
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Conference Paper)
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_32DOI: 10.1007/978-3-662-47672-7_32
On Temporally Connected Graphs of Small Cost (Conference Paper)
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_8DOI: 10.1007/978-3-319-28684-6_8
Algorithms for Sensor Systems (Conference Paper)
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-9DOI: 10.1007/978-3-319-28472-9
Designing and Testing Temporally Connected Graphs. (Journal article)
Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2015). Designing and Testing Temporally Connected Graphs.. CoRR, abs/1502.04579.
Deterministic Rendezvous in Restricted Graphs (Conference Paper)
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/
Deterministic Symmetry Breaking in Ring Networks. (Conference Paper)
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.59DOI: 10.1109/ICDCS.2015.59
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/
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. (Conference Paper)
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
The Beachcombers' Problem: Walking and searching with mobile robots. (Journal article)
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.011DOI: 10.1016/j.tcs.2015.09.011
The Match-Maker: Constant-Space Distributed Majority via Random Walks (Conference Paper)
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_5DOI: 10.1007/978-3-319-21741-3_5
The Multi-source Beachcombers' Problem (Conference Paper)
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_1DOI: 10.1007/978-3-662-46018-4_1
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots (Conference Paper)
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_30DOI: 10.1007/978-3-662-48971-0_30
2014
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
Information Gathering in Ad-Hoc Radio Networks with Tree Topology (Journal article)
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_11DOI: 10.1007/978-3-319-12691-3_11
Ephemeral Networks with Random Availability of Links: Diameter and Connectivity (Conference Paper)
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.2612693DOI: 10.1145/2612669.2612693
Towards optimal packed string matching (Journal article)
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.013DOI: 10.1016/j.tcs.2013.06.013
Collision-Free Network Exploration (Conference Paper)
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/
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/
Information Gathering in Ad-Hoc Radio Networks with Tree Topology. (Conference Paper)
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
The Beachcombers' Problem: Walking and Searching with Mobile Robots (Conference Paper)
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/
2013
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (Book)
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).
Optimal patrolling of fragmented boundaries (Conference Paper)
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.2486176DOI: 10.1145/2486159.2486176
Preface (Book)
Gleirscher, M., Kugele, S., & Linker, S. (2018). Preface. Retrieved from https://www.webofscience.com/
Rendezvous Problem (Chapter)
Gąsieniec, L. (2013). Rendezvous Problem. In Search Theory (pp. 167-174). Springer New York. doi:10.1007/978-1-4614-6825-7_11DOI: 10.1007/978-1-4614-6825-7_11
The Beachcombers' Problem: Walking and searching with mobile robots (Journal article)
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.011DOI: 10.1016/j.tcs.2015.09.011
Efficient broadcasting in radio networks with long-range interference (Journal article)
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-6DOI: 10.1007/s00446-012-0176-6
Fast message dissemination in random geometric networks (Journal article)
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-4DOI: 10.1007/s00446-011-0154-4
Fundamentals of Computation Theory (Conference Paper)
Gąsieniec, L., & Wolter, F. (Eds.) (2013). Fundamentals of Computation Theory. In . Springer Berlin Heidelberg. doi:10.1007/978-3-642-40164-0DOI: 10.1007/978-3-642-40164-0
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata. (Conference Paper)
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
2012
Position Discovery for a System of Bouncing Robots (Conference Paper)
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/
Observe and Remain Silent (Communication-Less Agent Location Discovery) (Conference Paper)
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/
More efficient periodic traversal in anonymous undirected graphs (Journal article)
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.035DOI: 10.1016/j.tcs.2012.01.035
Choosing the best among peers (Journal article)
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.005DOI: 10.1016/j.tcs.2012.04.005
Constant-Time Word-Size String Matching (Conference Paper)
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_7DOI: 10.1007/978-3-642-31265-6_7
2011
APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Journal article)
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/S0129054111009148DOI: 10.1142/S0129054111009148
Optimal Packed String Matching (Conference Paper)
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.423DOI: 10.4230/LIPIcs.FSTTCS.2011.423
Synchronous Rendezvous for Location-Aware Agents (Conference Paper)
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/
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds (Conference Paper)
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/
Consensus and Mutual Exclusion in a Multiple Access Channel (Journal article)
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.162DOI: 10.1109/TPDS.2010.162
Tree Exploration with Logarithmic Memory (Conference Paper)
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.1921663DOI: 10.1145/1921659.1921663
Tree exploration with logarithmic memory (Journal article)
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.1921663DOI: 10.1145/1921659.1921663
2010
Efficient Information Exchange in the Random Phone-Call Model (Conference Paper)
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/
Tell Me Where I Am So I Can Meet You Sooner (Conference Paper)
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_42DOI: 10.1007/978-3-642-14162-1_42
Event Extent Estimation (Conference Paper)
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/
On Efficient Gossiping in Radio Networks (Conference Paper)
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/
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids (Conference Paper)
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/
More Efficient Periodic Traversal in Anonymous Undirected Graphs (Conference Paper)
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_14DOI: 10.1007/978-3-642-11476-2_14
Tell Me Where I Am So I Can Meet You Sooner (Asynchronous Rendezvous with Location Information) (Conference Paper)
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/
2009
Robustness of the Rotor-router Mechanism (Conference Paper)
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/
Consensus and Mutual Exclusion in a Multiple Access Channel (Conference Paper)
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/
Euler Tour Lock-In Problem in the Rotor-Router Model I Choose Pointers and You Choose Port Numbers (Conference Paper)
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/
Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Conference Paper)
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/
Efficient Broadcasting in Known Topology Radio Networks with Long-range Interference (Conference Paper)
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.1582754DOI: 10.1145/1582716.1582754
Czyzowicz, J., Dobrev, S., Gasieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., . . . Sung, W. -K. (2009). More efficient periodic traversal in anonymous undirected graphs. Retrieved from http://arxiv.org/abs/0905.1737v1
Gathering few fat mobile robots in the plane (Journal article)
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.005DOI: 10.1016/j.tcs.2008.10.005
Broadcasting in UDG radio networks with unknown topology (Journal article)
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-zDOI: 10.1007/s00446-008-0075-z
Faster multi-witnesses for Boolean matrix multiplication (Journal article)
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.012DOI: 10.1016/j.ipl.2008.10.012
More efficient periodic traversal in anonymous undirected graphs (Conference Paper)
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.
2008
A robust randomized algorithm to perform independent tasks (Journal article)
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.001DOI: 10.1016/j.jda.2008.03.001
Memory Efficient Anonymous Graph Exploration (Conference Paper)
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/
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges (Conference Paper)
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/
On Radio Broadcasting in Random Geometric Graphs (Conference Paper)
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/
Faster algorithm for the set variant of the string barcoding problem (Conference Paper)
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/
Time efficient k-shot broadcasting in known topology radio networks (Journal article)
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-0DOI: 10.1007/s00446-008-0058-0
Structural Information and Communication Complexity (SIROCCO 2006) - Preface (Journal article)
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.002DOI: 10.1016/j.tcs.2008.02.002
Deterministic Broadcasting in Radio Networks (Chapter)
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_105DOI: 10.1007/978-0-387-30162-4_105
Fast periodic graph exploration with constant memory (Journal article)
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.004DOI: 10.1016/j.jcss.2007.09.004
Randomized Gossiping in Radio Networks (Chapter)
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_324DOI: 10.1007/978-0-387-30162-4_324
Routing in Geometric Networks (Chapter)
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_352DOI: 10.1007/978-0-387-30162-4_352
2007
Preface (Book)
Movchan, N. V., & McPhedran, R. C. (2007). Preface (Vol. 17). Informa UK Limited. doi:10.1080/17455030701602295DOI: 10.1080/17455030701602295
Randomized probe selection algorithm for microarray design (Journal article)
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.036DOI: 10.1016/j.jtbi.2007.05.036
Time efficient centralized gossiping in radio networks (Journal article)
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.059DOI: 10.1016/j.tcs.2007.03.059
Improved approximate common interval (Journal article)
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.006DOI: 10.1016/j.ipl.2007.03.006
Broadcasting in UDG Radio Networks with Unknown Topology (Conference Paper)
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/
Routing of single-source and multiple-source queries in static sensor networks (Journal article)
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.012DOI: 10.1016/j.jda.2006.03.012
Faster communication in known topology radio networks (Journal article)
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-zDOI: 10.1007/s00446-006-0011-z
Deterministic communication in radio networks with large labels (Journal article)
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-3DOI: 10.1007/s00453-006-1212-3
Energy and time efficient broadcasting in known topology radio networks (Conference Paper)
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/
Fast periodic graph exploration with constant memory (Conference Paper)
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/
Tree Exploration with Logarithmic Memory (Conference Paper)
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/
2006
Collective tree exploration (Journal article)
Fraigniaud, P., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2006). Collective tree exploration. NETWORKS, 48(3), 166-177. doi:10.1002/net.20127DOI: 10.1002/net.20127
Efficient Probe Selection in Microarray Design (Conference Paper)
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. IEEE. doi:10.1109/cibcb.2006.331018DOI: 10.1109/cibcb.2006.331018
THE WAKE-UP PROBLEM IN MULTIHOP RADIO NETWORKS (Journal article)
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/S0097539704442726DOI: 10.1137/S0097539704442726
Deterministic M2M multicast in radio networks (Journal article)
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.017DOI: 10.1016/j.tcs.2006.06.017
Foundations of computation theory (FCT 2003) - Preface (Book)
Lingas, A., & Gasieniec, L. (2006). Foundations of computation theory (FCT 2003) - Preface (Vol. 354). doi:10.1016/j.tcs.2005.11.028DOI: 10.1016/j.tcs.2005.11.028
Gathering Few Fat Mobile Robots in the Plane. (Conference Paper)
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
Gathering few fat mobile robots in the plane (Conference Paper)
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/
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (Book)
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).
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring (Conference Paper)
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/
Radio communication in random graphs (Journal article)
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.003DOI: 10.1016/j.jcss.2005.09.003
SIROCCO'2006 (Conference Paper)
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/
Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings (Conference Paper)
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.
2005
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks (Conference Paper)
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. IEEE. doi:10.1109/ipdps.2005.384DOI: 10.1109/ipdps.2005.384
Optimal two-stage algorithms for group testing problems (Journal article)
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/S0097539703428002DOI: 10.1137/S0097539703428002
Real-time traversal in grammar-based compressed files (Conference Paper)
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/
On realizing shapes in the theory of RNA neutral networks (Journal article)
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.006DOI: 10.1016/j.jtbi.2005.03.006
Radio communication in random graphs (Conference Paper)
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. ACM. doi:10.1145/1073970.1074021DOI: 10.1145/1073970.1074021
Faster communication in known topology radio networks (Conference Paper)
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. ACM. doi:10.1145/1073814.1073840DOI: 10.1145/1073814.1073840
Space efficient search for maximal repetitions (Journal article)
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.006DOI: 10.1016/j.tcs.2005.01.006
On the wake-up problem in radio networks (Conference Paper)
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/
Radio communication in random graphs: extended abstract. (Conference Paper)
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
2004
The Wake-Up Problem in Multi-Hop Radio Networks (Conference Paper)
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).
A randomized algorithm for gossiping in radio networks (Journal article)
Chrobak, M., Gasieniec, L., & Rytter, W. (2004). A randomized algorithm for gossiping in radio networks. NETWORKS, 43(2), 119-124. doi:10.1002/net.10109DOI: 10.1002/net.10109
Approximation algorithms for Hamming clustering problems (Journal article)
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-0DOI: 10.1016/s1570-8667(03)00079-0
Collective tree exploration (Conference Paper)
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_18DOI: 10.1007/978-3-540-24698-5_18
Deterministic M2M Multicast in Radio Networks (Conference Paper)
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.
Deterministic M2M multicast in radio networks - (Extended abstract) (Conference Paper)
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/
Faster deterministic gossiping in directed ad hoc radio networks (Conference Paper)
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/
Real-time string matching in sublinear space (Conference Paper)
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/
The wake-up problem in multi-hop radio networks. (Conference Paper)
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
Time Efficient Gossiping in Known Radio Networks (Conference Paper)
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_16DOI: 10.1007/978-3-540-27796-5_16
Time efficient gossiping in known radio networks (Conference Paper)
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/
2003
Time/space efficient compressed pattern matching (Journal article)
Gasieniec, L., & Potapov, I. (2003). Time/space efficient compressed pattern matching. FUNDAMENTA INFORMATICAE, 56(1-2), 137-154. Retrieved from https://www.webofscience.com/
On polynomial-time approximation algorithms for the variable length scheduling problem (Journal article)
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-5DOI: 10.1016/S0304-3975(03)00141-5
An improved bound on Boolean matrix multiplication for highly clustered data (Conference Paper)
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/
Generalized framework for selectors with applications in optimal group testing (Conference Paper)
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/
Space efficient search for maximal repetitions (Conference Paper)
Gasieniec, L., Kolpakov, R., & Potapov, I. (2003). Space efficient search for maximal repetitions. In 4th International Conference on Words, WORDS'2003. Turku: Turku University.
2002
On adaptive deterministic gossiping in ad hoc radio networks (Journal article)
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-XDOI: 10.1016/S0020-0190(01)00312-X
Bounding work and communication in robust cooperative computation (Conference Paper)
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/
Deterministic broadcasting in ad hoc radio networks (Journal article)
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-1DOI: 10.1007/s446-002-8028-1
Deterministic communication in radio networks with large labels (Conference Paper)
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/
Fast broadcasting and gossiping in radio networks (Journal article)
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-4DOI: 10.1016/S0196-6774(02)00004-4
Gossiping with Bounded Size Messages in ad hoc Radio Networks (Conference Paper)
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_33DOI: 10.1007/3-540-45465-9_33
Gossiping with bounded size messages in ad hoc radio networks - (Extended abstract) (Conference Paper)
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/
Gossiping with unit messages in known radio networks (Conference Paper)
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/
On adaptive deterministic gossiping in <i>ad hoc</i> radio networks (Conference Paper)
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/
2001
Efficient web searching using temporal factors (Journal article)
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-2DOI: 10.1016/S0304-3975(00)00366-2
Oblivious gossiping in ad-hoc radio networks (Conference Paper)
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. ACM. doi:10.1145/381448.381454DOI: 10.1145/381448.381454
The wakeup problem in synchronous broadcast systems (Journal article)
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/S0895480100376022DOI: 10.1137/S0895480100376022
A randomized algorithm for gossiping in radio networks (Conference Paper)
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/
Time/Space Efficient Compressed Pattern Matching (Conference Paper)
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_15DOI: 10.1007/3-540-44669-9_15
2000
Wakeup problem in synchronous broadcast systems (Conference Paper)
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).
Algorithms for the parallel alternating direction access machine (Journal article)
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-7DOI: 10.1016/S0304-3975(99)00280-7
The wakeup problem in synchronous broadcast systems (extended abstract) (Conference Paper)
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. ACM. doi:10.1145/343477.343529DOI: 10.1145/343477.343529
Approximation algorithms for Hamming clustering problems (Conference Paper)
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/
Deterministic Radio Broadcasting (Conference Paper)
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_60DOI: 10.1007/3-540-45022-x_60
Deterministic broadcasting in unknown radio networks (Conference Paper)
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/
Fast broadcasting and gossiping in radio networks (Conference Paper)
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.892325DOI: 10.1109/SFCS.2000.892325
On the complexity of determining the period of a string (Conference Paper)
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/
Strategies for hotlink assignments (Conference Paper)
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/
