Grzegorz Stachowiak

J. Comput. Syst. Sci., May, 2023

Selective Population Protocols.

[BibT_eX]

[DOI]

CoRR, 2023

New Clocks, Optimal Line Formation and Self-Replication Population Protocols.

[BibT_eX]

[DOI]

Paul G. Spirakis

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Time and Energy Efficient Contention Resolution in Asynchronous Shared Channels.

[BibT_eX]

[DOI]

CoRR, 2022

Contention Resolution Without Collision Detection: Constant Throughput And Logarithmic Energy.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols.

[BibT_eX]

[DOI]

Paul G. Spirakis

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Time, Clocks and Efficiency of Population Protocols (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

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

[BibT_eX]

[DOI]

J. ACM, 2021

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

[BibT_eX]

[DOI]

Paul G. Spirakis

CoRR, 2021

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

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Deterministic Contention Resolution without Collision Detection: Throughput vs Energy.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

A time and space optimal stable population protocol solving exact majority.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Search and evacuation with a near majority of faulty agents.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Token traversal in ad hoc wireless networks via implicit carrier sensing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Subquadratic non-adaptive threshold group testing.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

2019

Communication and location discovery in geometric ring networks.

[BibT_eX]

[DOI]

Inf. Comput., 2019

Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols.

[BibT_eX]

[DOI]

Przemyslaw Uznanski

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Deterministic Contention Resolution on a Shared Channel.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Brief Announcement: Deterministic Contention Resolution on a Shared Channel.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Fast Space Optimal Leader Election in Population Protocols.

[BibT_eX]

[DOI]

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

Deterministic Digital Clustering of Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing.

[BibT_eX]

[DOI]

Michal Rózanski

Proceedings of the Structural Information and Communication Complexity, 2017

Asynchronous Shared Channel.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Subquadratic Non-adaptive Threshold Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

Deterministic Population Protocols for Exact Majority and Plurality.

[BibT_eX]

[DOI]

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

2015

The Cost of Synchronizing Multiple-Access Channels.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

On setting-up asynchronous ad hoc wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Deterministic Symmetry Breaking in Ring Networks.

[BibT_eX]

[DOI]

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

2014

On the impact of geometry on ad hoc communication in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013

A <i>ϕ</i>-competitive algorithm for collecting items with increasing weights from a dynamic queue.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Collecting Weighted Items from a Dynamic Queue.

[BibT_eX]

[DOI]

Algorithmica, 2013

Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Online Control Message Aggregation in Chain Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

Distributed Deterministic Broadcasting in Wireless Networks under the SINR Model

[BibT_eX]

[DOI]

CoRR, 2012

Distributed Broadcasting in Wireless Networks under the SINR Model

[BibT_eX]

[DOI]

CoRR, 2012

2009

Asynchronous Deterministic Rendezvous on the Line.

[BibT_eX]

[DOI]

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

2008

Proofs of Knowledge with Several Challenge Values.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Generalized Whac-a-Mole

[BibT_eX]

[DOI]

CoRR, 2008

2007

Unlinkable Divisible Digital Cash without Trusted Third Party.

[BibT_eX]

[DOI]

Pawel Pszona

IACR Cryptol. ePrint Arch., 2007

2006

Fast periodic correction networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

2003

Lower Bounds on Correction Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2000

Fibonacci Correction Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

1997

Finding parity difference by involutions.

[BibT_eX]

[DOI]

Discret. Math., 1997

1994

On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains.

[BibT_eX]

[DOI]

Discret. Math., 1994

Periodic Constant Depth Sorting Networks.

[BibT_eX]

[DOI]

Marcin Kik

Miroslaw Kutylowski

Proceedings of the STACS 94, 1994

1992

Hamilton Paths in Graphs of Linear Extensions for Unions of Posets.

[BibT_eX]

[DOI]