World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
41
Citations
5928
World Ranking
8945
National Ranking
547

Overview

Leszek Gasieniec is affiliated with the University of Liverpool in the United Kingdom and specializes in computer science. Their research covers various subfields including computer networks and communications, artificial intelligence, and computational theory and mathematics. Additional areas of study include statistical and nonlinear physics as well as sociology and political science.

Gasieniec's work addresses multiple main topics such as distributed systems and fault tolerance, privacy-preserving technologies in data, and complexity and algorithms in graphs. Further topics of research include cryptography and data security, advanced database systems and queries, opportunistic and delay-tolerant networks, and mobile ad hoc networks.

Recent papers authored or co-authored by Gasieniec include:

  • "Predicting the Availability of Hematopoietic Stem Cell Donors Using Machine Learning," 2020, published in Biology of Blood and Marrow Transplantation
  • "Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election," 2020, published in Journal of the ACM
  • "Perpetual maintenance of machines with different urgency requirements," 2023, published in Journal of Computer and System Sciences
  • "On the curve complexity of 3-colored point-set embeddings," 2020, published in Theoretical Computer Science
  • "Efficient assignment of identities in anonymous populations," 2025, published in Information and Computation

Frequent co-authors collaborating with Gasieniec are Christos Levcopoulos, Grzegorz Stachowiak, Andrzej Lingas, Jesper Jansson, and Ralf Klasing.

The scientist has published extensively in venues such as arXiv (Cornell University), Journal of Computer and System Sciences, Information and Computation, SSRN Electronic Journal, and Algorithmica.

Gasieniec has contributed to book publications through Springer Science+Business Media, including titles like SOFSEM 2023: Theory and Practice of Computer Science (2022) and Algorithms for Sensor Systems (2021).

Best Publications

  • Fast broadcasting and gossiping in radio networks

    Marek Chrobak;Leszek Gasieniec;Wojciech Rytter

  • Deterministic broadcasting in ad hoc radio networks

    Bogdan S. Chlebus;Leszek Gasieniec;Alan Gibbons;Andrzej Pelc

  • Fast broadcasting and gossiping in radio networks

    M. Chrobak;L. Gasieniec;W. Rytter

  • Speeding up two string-matching algorithms

    Maxime Crochemore;Artur Czumaj;Leszek Gasieniec;Stefan Jarominek

  • Gathering few fat mobile robots in the plane

    Jurek Czyzowicz;Leszek Gasieniec;Andrzej Pelc

  • Optimal Two-Stage Algorithms for Group Testing Problems

    Annalisa De Bonis;Leszek Gasieniec;Ugo Vaccaro

  • Collective tree exploration

    Pierre Fraigniaud;Leszek Gąsieniec;Dariusz R. Kowalski;Andrzej Pelc

  • Faster communication in known topology radio networks

    Leszek Gąsieniec;David Peleg;Qin Xin

  • Faster communication in known topology radio networks

    Leszek Gasieniec;David Peleg;Qin Xin

  • Deterministic Radio Broadcasting

    Bogdan S. Chlebus;Leszek Gasieniec;Anna Östlin;John Michael Robson

  • Efficient algorithms for Lempel-Ziv encoding

    Leszek Gasieniec;Marek Karpinski;Wojciech Plandowski;Wojciech Rytter

  • The Wakeup Problem in Synchronous Broadcast Systems

    Leszek Gasieniec;Andrzej Pelc;David Peleg

  • Collective tree exploration

    Pierre Fraigniaud;Leszek Gasieniec;Dariusz R. Kowalski;Dariusz R. Kowalski;Andrzej Pelc

  • Episode Matching

    Gautam Das;Rudolf Fleischer;Leszek Gasieniec;Dimitrios Gunopulos

  • Boundary patrolling by mobile agents with distinct maximal speeds

    Jurek Czyzowicz;Leszek Gąsieniec;Adrian Kosowski;Evangelos Kranakis

  • Fast practical multi-pattern matching

    Maxime Crochemore;Artur Czumaj;Leszek Gasieniec;Thierry Lecroq

  • Evacuating Robots via Unknown Exit in a Disk

    Jurek Czyzowicz;Leszek Gąsieniec;Thomas Gorry;Evangelos Kranakis

  • Gossiping with Bounded Size Messages in ad hoc Radio Networks

    Malin Christersson;Leszek Gasieniec;Andrzej Lingas

  • Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids

    Unknown

  • Group Search on the Line

    Marek Chrobak;Leszek Gąsieniec;Thomas Gorry;Russell Martin

  • Tree exploration with logarithmic memory

    Leszek Gasieniec;Andrzej Pelc;Tomasz Radzik;Xiaohui Zhang

  • Tree exploration with logarithmic memory

    Leszek Gasieniec;Andrzej Pelc;Tomasz Radzik;Xiaohui Zhang

  • Gossiping with Unit Messages in Known Radio Networks

    Leszek Gasieniec;Igor Potapov

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

    Marek Chrobak;Leszek Gasieniec;Dariusz Kowalski

  • Gathering few fat mobile robots in the plane

    Jurek Czyzowicz;Leszek Gąsieniec;Andrzej Pelc

  • Collective Tree Exploration

    Pierre Fraigniaud;Leszek Gasieniec;Dariusz Kowalski;Andrzej Pelc

  • Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms

    Leszek Gasieniec;Pelc Andrzej;Tomasz Radzik;Xiaohui Zhang

Frequent Co-Authors

Wojciech Rytter
Wojciech Rytter University of Warsaw
Andrzej Pelc
Andrzej Pelc Université du Québec en Outaouais
Dariusz R. Kowalski
Dariusz R. Kowalski Augusta University
Evangelos Kranakis
Evangelos Kranakis Carleton University
Artur Czumaj
Artur Czumaj University of Warwick
Marek Chrobak
Marek Chrobak University of California, Riverside
Paul G. Spirakis
Paul G. Spirakis University of Liverpool
Maxime Crochemore
Maxime Crochemore King's College London
Tomasz Radzik
Tomasz Radzik King's College London
David Peleg
David Peleg Weizmann Institute of Science

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online study options can open multiple doors in Computer Science and related fields. Many universities now offer affordable online degree programs that allow students to earn respected qualifications without substantial financial strain. These programs are ideal for those balancing education with work or family commitments.

Admissions requirements are also broadening, with some online graduate schools with low gpa requirements making advanced education accessible to more learners. This flexibility empowers non-traditional students and career changers to pursue their goals in tech.

Graduates with a background in Computer Science have many career options but can also branch into related disciplines. For example, those interested in environmental technology or data science will find useful insights in what can you do with an environmental science major. The tech sector values interdisciplinary skills.

If you’re eager to join the workforce quickly, consider a online computer science degree in an accelerated format. These fast-paced programs help motivated students earn their degree in less time, making it easier to keep pace with industry needs.

Best Scientists Citing Leszek Gasieniec

Trending Scientists