Bogdan S. Chlebus

Dariusz Rafal Kowalski

Jan Olkowski

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

Adversarial Contention Resolution Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Stable Scheduling in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Distributed bare-bones communication in wireless networks.

[BibT_eX]

[DOI]

Shailesh Vaya

Distributed Comput., 2022

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency.

[BibT_eX]

[DOI]

Jan Olkowski

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Consensus in Networks Prone to Link Failures.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Universal stability in multi-hop radio networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Fast Agreement in Networks with Byzantine Nodes.

[BibT_eX]

[DOI]

Jan Olkowski

Proceedings of the 34th International Symposium on Distributed Computing, 2020

2019

Packet latency of deterministic broadcasting in adversarial multiple access channels.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Energy Efficient Adversarial Routing in Shared Channels.

[BibT_eX]

[DOI]

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

Broadcasting on Adversarial Multiple Access Channels.

[BibT_eX]

[DOI]

Bader A. Aldawsari

Proceedings of the 18th IEEE International Symposium on Network Computing and Applications, 2019

2018

Randomized Communication in Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Adversarial Multiple Access Channels with Individual Injection Rates.

[BibT_eX]

[DOI]

Lakshmi Anantharamu

Theory Comput. Syst., 2017

Routing in Wireless Networks With Interferences.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2017

Doing-it-All with bounded work and communication.

[BibT_eX]

[DOI]

Alexander A. Schwarzmann

Inf. Comput., 2017

Naming a Channel with Beeps.

[BibT_eX]

[DOI]

Muhammed Talo

Fundam. Informaticae, 2017

Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms.

[BibT_eX]

[DOI]

Muhammed Talo

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016

Scalable wake-up of multi-channel single-hop radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Universal Routing in Multi-hop Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2016

Distributed communication in bare-bones wireless networks.

[BibT_eX]

[DOI]

Shailesh Vaya

Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015

Broadcasting in ad hoc multiple access channels.

[BibT_eX]

[DOI]

Lakshmi Anantharamu

Theor. Comput. Sci., 2015

Stability of adversarial routing with feedback.

[BibT_eX]

[DOI]

Networks, 2015

Anonymous Processors with Synchronous Shared Memory.

[BibT_eX]

[DOI]

Muhammed Talo

CoRR, 2015

Distributed Communication in Bare-Bones Wireless Networks.

[BibT_eX]

[DOI]

Shailesh Vaya

CoRR, 2015

2014

Universal routing in multi hop radio network.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014

2012

Adversarial Queuing on the Multiple Access Channel.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Electing a Leader in Multi-hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011

Preface for Special Issue "Distributed Computing in Sensor Systems".

[BibT_eX]

[DOI]

Bhaskar Krishnamachari

Sotiris E. Nikoletseas

Ad Hoc Networks, 2011

Medium Access Control for Adversarial Channels with Jamming.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Efficient Distributed Communication in Ad-Hoc Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Scalable Quantum Consensus for Crash Failures.

[BibT_eX]

[DOI]

Michal Strojnowski

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Deterministic Broadcast on Multiple Access Channels.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

Maximum throughput of multiple access channels in adversarial environments.

[BibT_eX]

[DOI]

Distributed Comput., 2009

Many-to-Many Communication in Radio Networks.

[BibT_eX]

[DOI]

Tomasz Radzik

Algorithmica, 2009

Locally scalable randomized consensus for synchronous crash failures.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Fast scalable deterministic consensus for crash failures.

[BibT_eX]

[DOI]

Michal Strojnowski

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Adversarial Multiple Access Channel with Individual Injection Rates.

[BibT_eX]

[DOI]

Lakshmi Anantharamu

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008

A robust randomized algorithm to perform independent tasks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Asynchronous exclusive selection.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007

Centralized asynchronous broadcast in radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Stability of the Multiple-Access Channel Under Maximum Broadcast Loads.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2007

2006

Robust gossiping with an application to consensus.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Performing work in broadcast networks.

[BibT_eX]

[DOI]

Andrzej Lingas

Distributed Comput., 2006

Time and Communication Efficient Consensus for Crash Failures.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Average-Time Complexity of Gossiping in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

On Many-to-Many Communication in Packet Radio Networks.

[BibT_eX]

[DOI]

Tomasz Radzik

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2005

Cooperative asynchronous update of shared memory.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the Wake-Up Problem in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Almost Optimal Explicit Selectors.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Randomization helps to perform independent tasks reliably.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Collective asynchronous reading with polylogarithmic worst-case overhead.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Asynchronous Broadcast in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

A better wake-up in radio networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

Broadcasting Spanning Forests on a Multiple-Access Channel.

[BibT_eX]

[DOI]

Karol Golab

Theory Comput. Syst., 2003

Deterministic Computations on a PRAM with Static Processor and Memory Faults.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Routing on Meshes in Optimum Time and with Really Small Queues.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002

Deterministic broadcasting in ad hoc radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2002

Bounding Work and Communication in Robust Cooperative Computation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 16th International Conference, 2002

Gossiping to reach consensus.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Finding Spanning Forests by Broadcasting.

[BibT_eX]

Karol Golab

Proceedings of the SIROCCO 9, 2002

2001

Performing tasks on synchronous restartable message-passing processors.

[BibT_eX]

[DOI]

Roberto De Prisco

Distributed Comput., 2001

Towards practical deteministic write-all algorithms.

[BibT_eX]

[DOI]

Imrich Vrto

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

The do-all problem in broadcast networks.

[BibT_eX]

[DOI]

Andrzej Lingas

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Oblivious gossiping in ad-hoc radio networks.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000

Algorithms for the parallel alternating direction access machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Deterministic broadcasting in unknown radio networks.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Deterministic Radio Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Randomization Helps to Perform Tasks on Processors Prone to Failures.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 1999

1998

On the Klee's Measure Problem in Small Dimensions.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

On Finding Optimal Discretizations for Two Attributes.

[BibT_eX]

[DOI]

Sinh Hoa Nguyen

Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997

Deterministic Permutation Routing on Meshes.

[BibT_eX]

[DOI]

Michael Kaufmann

J. Algorithms, 1997

Transition-Optimal Token Distribution.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Mesh Sorting and Selection Optimal to the Average.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1997

Performing Tasks on Restartable Message-Passing Processors.

[BibT_eX]

[DOI]

Roberto De Prisco

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Routing on the PADAM: Degrees of Optimality.

[BibT_eX]

[DOI]

Artur Czumaj

Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996

Reliable Broadcasting in Hypercubes with Random Link and Node Failures.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Parallel Alternating-Direction Access Machine.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Distributing Tokens on a Hypercube without Error Accumulation.

[BibT_eX]

[DOI]

José D. P. Rolim

Giora Slutzki

Proceedings of IPPS '96, 1996

Shared-Memory Simulations on a Faulty-Memory DMM.

[BibT_eX]

[DOI]

Anna Gambin

Piotr Indyk

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

O(log log n)-Time Integer Geometry on the CRCW PRAM.

[BibT_eX]

[DOI]

Miroslaw Kowaluk

Algorithmica, 1995

Fast Deterministic Simulation of Computations on Faulty Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Sorting on a Mesh-Connected Computer with Delaying Links.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

Sparse Networks Supporting Efficient Reliable Broadcasting.

[BibT_eX]

Nord. J. Comput., 1994

Fast gossiping with short unreliable messages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Optimal Pattern Matching on Meshes.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Shorter Queues for Permutation Routing on Meshes.

[BibT_eX]

[DOI]

Michael Kaufmann

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Waking up an Anonymous Faulty Network from a Single Source.

[BibT_eX]

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

PRAM Computations Resilient to Memory Faults.

[BibT_eX]

[DOI]

Anna Gambin

Piotr Indyk

Proceedings of the Algorithms, 1994

1992

Two Selection Algorithms on a Mesh-Connected Computer.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1992

1991

Parallel Quicksort.

[BibT_eX]

[DOI]

Imrich Vrto

J. Parallel Distributed Comput., 1991

Duplicating keys to streamline sorting on a mesh-connected computer.

[BibT_eX]

[DOI]

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Optimal Broadcasting in Faulty Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991

Unifying Binary-Search Trees and Permutations.

[BibT_eX]

[DOI]

Imrich Vrto

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Turing Machines With Access to History

[BibT_eX]

[DOI]

Inf. Comput., December, 1990

Sorting Roughly Sorted Sequences in Parallel.

[BibT_eX]

[DOI]

Tom Altman

Inf. Process. Lett., 1990

1989

A Hierarchy of Propositional Horn Formulas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Parallel Iterated Bucket Sort.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Sorting within Distance Bound on a Mesh-Connected Processor Array.

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

New Simulations between CRCW PRAMs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

A Parallel Bucket Sort.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Testing Isomorphism of Outerplanar Graphs in Parallel.

[BibT_eX]

[DOI]

Tomasz Radzik

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Proving NP-completeness Using BOUNDED TILING.

[BibT_eX]

J. Inf. Process. Cybern., 1987

A note on the polynomial-time hierarchy and the quantified Boolean formulas.

[BibT_eX]

Bull. EATCS, 1987

Saturating Flows in Networks.

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the Fundamentals of Computation Theory, 1987

1986

Domino-Tiling Games.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

1985

Algorithms solving path systems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts.

[BibT_eX]

[DOI]

Marek Chrobak

Inf. Process. Lett., 1984

From domino tilings to a new model of computation.

[BibT_eX]

[DOI]

Proceedings of the Computation Theory, 1984

1982

On the Computational Complexity of Satisfiability in Propositional Logics of Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

On the Decidability of Propositional Algorithmic Logic.

[BibT_eX]

[DOI]

Math. Log. Q., 1982

Completeness Proofs for Some Logics of Programs.

[BibT_eX]

[DOI]

Math. Log. Q., 1982

1980

Decidability and Definability Results Concerning Well-Orderings and Some Extensions of First Order Logic.

[BibT_eX]

[DOI]

Math. Log. Q., 1980

On four logics of programs and complexity of their satisfiability problems: extended abstract.

[BibT_eX]

[DOI]