Dariusz R. Kowalski

Pavan Poudel

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

2022

Generalized framework for Group Testing: Queries, feedbacks and adversaries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Information dissemination in wireless ad-hoc networks under the weighted-TIM framework.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Stable routing scheduling algorithms in multi-hop wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Polynomial anonymous dynamic distributed computing without a unique leader.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Distributed bare-bones communication in wireless networks.

[BibT_eX]

[DOI]

Distributed Comput., 2022

Time and Energy Efficient Contention Resolution in Asynchronous Shared Channels.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

CoRR, 2022

Optimal Algorithms for Free Order Multiple-Choice Secretary.

[BibT_eX]

[DOI]

Piotr Krysta

CoRR, 2022

Efficient Algorithm for Deterministic Search of Hot Elements.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

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

Improved communication complexity of fault-tolerant consensus.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

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

[BibT_eX]

[DOI]

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

Scalable and Efficient Non-adaptive Deterministic Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Tree Exploration in Dual-Memory Model.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Light Agents Searching for Hot Information.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Optimal channel utilization with limited feedback.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

New View on Adversarial Queueing on MAC.

[BibT_eX]

[DOI]

Elijah Hradovich

IEEE Commun. Lett., 2021

Efficient Deterministic Quantitative Group Testing for Precise Information Retrieval.

[BibT_eX]

[DOI]

CoRR, 2021

Entropy-Based Approximation of the Secretary Problem.

[BibT_eX]

[DOI]

Piotr Krysta

CoRR, 2021

Byzantine-Resilient Population Protocols.

[BibT_eX]

[DOI]

Costas Busch

CoRR, 2021

Consensus in Networks Prone to Link Failures.

[BibT_eX]

[DOI]

CoRR, 2021

Supervised Average Consensus in Anonymous Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Exact and Efficient Protective Jamming in SINR-based Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Modeling, 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

Time and Communication Complexity of Leader Election in Anonymous Networks.

[BibT_eX]

[DOI]

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

2020

Optimizing mmWave Wireless Backhaul Scheduling.

[BibT_eX]

[DOI]

Edgar Arribas

IEEE Trans. Mob. Comput., 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

Universal stability in multi-hop radio networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.

[BibT_eX]

[DOI]

J. ACM, 2020

Guest Editorial: Special Issue on High-Confidence City IoT for Collaborative Smart City Services.

[BibT_eX]

[DOI]

IEEE Internet Things J., 2020

Confidential gossip.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Fast Agreement in Networks with Byzantine Nodes.

[BibT_eX]

[DOI]

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

Efficient Local Medium Access.

[BibT_eX]

[DOI]

Pawel Garncarek

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

Generic Framework for Optimization of Local Dissemination in Wireless Networks.

[BibT_eX]

[DOI]

Krutika Wadhwa

Proceedings of the Networked Systems - 8th International Conference, 2020

Heuristically Speeding up Anonymous Dynamic Network Computations.

[BibT_eX]

[DOI]

Austin Halper

Proceedings of the IEEE International Conference on Parallel & Distributed Processing with Applications, 2020

Contention resolution on a restrained channel.

[BibT_eX]

[DOI]

Elijah Hradovich

Proceedings of the 26th IEEE International Conference on Parallel and Distributed Systems, 2020

2019

Online packet scheduling under adversarial errors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Packet latency of deterministic broadcasting in adversarial multiple access channels.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Ordered and delayed adversaries and how to work against them on a shared channel.

[BibT_eX]

[DOI]

Jaroslaw Mirek

Distributed Comput., 2019

Packet-oblivious stable routing in multi-hop wireless networks.

[BibT_eX]

[DOI]

CoRR, 2019

Deterministic coloring algorithms in the LOCAL model.

[BibT_eX]

[DOI]

Piotr Krysta

CoRR, 2019

Stable Memoryless Queuing under Contention.

[BibT_eX]

[DOI]

Pawel Garncarek

Proceedings of the 33rd International Symposium on Distributed Computing, 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

On the Complexity of Fault-Tolerant Consensus.

[BibT_eX]

[DOI]

Jaroslaw Mirek

Proceedings of the Networked Systems - 7th International Conference, 2019

Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE International Symposium on Network Computing and Applications, 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

mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Deterministic Contention Resolution on a Shared Channel.

[BibT_eX]

[DOI]

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

Testing Methods to Minimise Range-shifting Time with Conservation Actions.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Bioinformatics and Biomedical Technology, 2019

Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

The Properties of the Standard Genetic Code and Its Selected Alternatives in Terms of the Optimal Graph Partition.

[BibT_eX]

[DOI]

Proceedings of the Biomedical Engineering Systems and Technologies, 2019

The Impact of the Transversion/Transition Ratio on the Optimal Genetic Code Graph Partition.

[BibT_eX]

[DOI]

Proceedings of the 12th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2019), 2019

2018

Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees.

[BibT_eX]

[DOI]

Prudence W. H. Wong

ACM Trans. Parallel Comput., 2018

Distributed Online and Stochastic Queueing on a Multiple Access Channel.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Information gathering in ad-hoc radio networks with tree topology.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

Randomized Rumor Spreading in Ad Hoc Networks with Buffers.

[BibT_eX]

[DOI]

Christopher Thraves Caro

CoRR, 2018

Power Constrained Parallel Queuing with Contention.

[BibT_eX]

[DOI]

Elijah Hradovich

CoRR, 2018

Brief Announcement: Deterministic Contention Resolution on a Shared Channel.

[BibT_eX]

[DOI]

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

Local Queuing Under Contention.

[BibT_eX]

[DOI]

Pawel Garncarek

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

Deterministic Digital Clustering of Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

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

Estimating Invasion Time in Real Landscapes.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Computational Biology and Bioinformatics, 2018

Reaching Consensus in Ad-Hoc Diffusion Networks.

[BibT_eX]

[DOI]

Jaroslaw Mirek

Proceedings of the Algorithms for Sensor Systems, 2018

2017

Contention resolution in a non-synchronized multiple access channel.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Adaptive packet scheduling over a wireless channel under constrained jamming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Fault tolerant scheduling of tasks of two sizes under resource augmentation.

[BibT_eX]

[DOI]

Prudence W. H. Wong

J. Sched., 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

Deterministic Backbone Creation in an SINR Network without Knowledge of Location.

[BibT_eX]

[DOI]

William K. Moses Jr.

CoRR, 2017

Ad-hoc Affectance-selective Families for Layer Dissemination.

[BibT_eX]

[DOI]

Harshita Kudaravalli

CoRR, 2017

Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets: Poster Abstract.

[BibT_eX]

[DOI]

Harshita Kudaravalli

Proceedings of the Second International Conference on Internet-of-Things Design and Implementation, 2017

Lightweight Robust Framework for Workload Scheduling in Clouds.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Edge Computing, 2017

2016

Wake-Up Problem in Multi-Hop Radio Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Measuring the impact of adversarial errors on packet scheduling strategies.

[BibT_eX]

[DOI]

J. Sched., 2016

Clique Here: On the Distributed Complexity in Fully-Connected Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2016

Randomized mutual exclusion on a multiple access channel.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Universal Routing in Multi-hop Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Message and time efficient multi-broadcast schemes.

[BibT_eX]

[DOI]

Liron Levin

Theor. Comput. Sci., 2015

Online parallel scheduling of non-uniform tasks: Trading failures for energy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Stability of adversarial routing with feedback.

[BibT_eX]

[DOI]

Networks, 2015

On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

Multi-Broadcasting under the SINR Model.

[BibT_eX]

[DOI]

Sai Praneeth Reddy

CoRR, 2015

Distributed Communication in Bare-Bones Wireless Networks.

[BibT_eX]

[DOI]

CoRR, 2015

Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Adaptive Resource Management and Scheduling for Cloud Computing, 2015

On setting-up asynchronous ad hoc wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Provable fairness for TDMA scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines.

[BibT_eX]

[DOI]

Sultan S. Alshamrani

Leszek Antoni Gasieniec

Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015

2014

Performance Analysis and Algorithm Selection for Reliable Multicast in IEEE 802.11aa Wireless LAN.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2014

Scheduling problems in transportation networks of line topology.

[BibT_eX]

[DOI]

Optim. Lett., 2014

Decomposing broadcast algorithms using abstract MAC layers.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2014

Online Packet Scheduling Under Adversarial Jamming.

[BibT_eX]

[DOI]

Krzysztof Lorys

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 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

Dynamic multiple-message broadcast: bounding throughput in the affectance model.

[BibT_eX]

[DOI]

Tevin Rouse

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

Universal routing in multi hop radio network.

[BibT_eX]

[DOI]

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

2013

Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Leader election in ad hoc radio networks: A keen ear helps.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Asynchronous gossip.

[BibT_eX]

[DOI]

J. ACM, 2013

On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up.

[BibT_eX]

[DOI]

Krzysztof Krzywdzinski

Discret. Math. Theor. Comput. Sci., 2013

Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.

[BibT_eX]

[DOI]

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

A Multiagent Based Framework for the Simulation of Mammalian Behaviour.

[BibT_eX]

[DOI]

Proceedings of the Research and Development in Intelligent Systems XXX, 2013

Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits.

[BibT_eX]

[DOI]

Achour Mostéfaoui

Proceedings of the ACM Symposium on Principles of Distributed Computing, 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

Station Assignment with Applications to Sensing.

[BibT_eX]

[DOI]

Prudence W. H. Wong

Proceedings of the Algorithms for Sensor Systems, 2013

Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks.

[BibT_eX]

[DOI]

Christopher Thraves Caro

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012

Adversarial Queuing on the Multiple Access Channel.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 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

Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks

[BibT_eX]

[DOI]

CoRR, 2012

Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Distributed Online and Stochastic Queuing on a Multiple Access Channel.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Communication and privacy in dynamic message-passing systems.

[BibT_eX]

[DOI]

Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks.

[BibT_eX]

[DOI]

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

Electing a Leader in Multi-hop Radio Networks.

[BibT_eX]

[DOI]

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

Scheduling of Vehicles in Transportation Networks.

[BibT_eX]

[DOI]

Zeev Nutov

Proceedings of the Communication Technologies for Vehicles - 4th International Workshop, 2012

2011

Coordination Problems in Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Consensus and Mutual Exclusion in a Multiple Access Channel.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Meeting the deadline: on the complexity of fault-tolerant continuous gossip.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Multi-channel Assignment for Communication in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Medium Access Control for Adversarial Channels with Jamming.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Towards Large-Scale Multi-Agent Based Rodent Simulation: The "Mice In A Box" Scenario.

[BibT_eX]

[DOI]

Proceedings of the Research and Development in Intelligent Systems XXVIII, 2011

Time-efficient randomized multiple-message broadcast in radio networks.

[BibT_eX]

[DOI]

Majid Khabbazian

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Efficient Distributed Communication in Ad-Hoc Radio Networks.

[BibT_eX]

[DOI]

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

Introduction.

[BibT_eX]

[DOI]

Pierre Sens

Guillaume Pierre

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010

Fast radio broadcasting with advice.

[BibT_eX]

[DOI]

David Ilcinkas

Theor. Comput. Sci., 2010

Emulating shared-memory Do-All algorithms in asynchronous message-passing systems.

[BibT_eX]

[DOI]

Mariam Momenzadeh

J. Parallel Distributed Comput., 2010

Bounds on Stability and Latency in Wireless Communication.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2010

Connectivity Problem in Wireless Networks.

[BibT_eX]

[DOI]

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

Trusted Computing for Fault-Prone Wireless Networks.

[BibT_eX]

[DOI]

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

Scalable Quantum Consensus for Crash Failures.

[BibT_eX]

[DOI]

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

Dynamic Sharing of a Multiple Access Channel.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Distributed Agreement with Optimal Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Deterministic Broadcast on Multiple Access Channels.

[BibT_eX]

[DOI]

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

Towards Power-Sensitive Communication on a Multiple-Access Channel.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2009

Reliability and security in wireless networks.

[BibT_eX]

[DOI]

SIGACT News, 2009

Node discovery in networks.

[BibT_eX]

[DOI]

Kishori M. Konwar

J. Parallel Distributed Comput., 2009

Gossiping by processors prone to omission failures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 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

Reliable distributed computing on unreliable radio channels.

[BibT_eX]

[DOI]

Proceedings of the 2009 MobiHoc S³ workshop on MobiHoc S³, 2009

Fast scalable deterministic consensus for crash failures.

[BibT_eX]

[DOI]

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

Interference-Resilient Information Exchange.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

How to meet in anonymous network.

[BibT_eX]

[DOI]

Adam Malinowski

Theor. Comput. Sci., 2008

Writing-all deterministically and optimally using a nontrivial number of asynchronous processors.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

A robust randomized algorithm to perform independent tasks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Time efficient k-shot broadcasting in known topology radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2008

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

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On the complexity of asynchronous gossip.

[BibT_eX]

[DOI]

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

Asynchronous exclusive selection.

[BibT_eX]

[DOI]

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

2007

The Wake-Up Problem in MultiHop Radio Networks.

[BibT_eX]

[DOI]

Marek Chrobak

SIAM J. Comput., 2007

Optimal Deterministic Broadcasting in Known Topology Radio Networks.

[BibT_eX]

[DOI]

Distributed Comput., 2007

Searching for a Black Hole in Synchronous Tree Networks.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

On the Communication Surplus Incurred by Faulty Processors.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Message Complexity of Indulgent Consensus.

[BibT_eX]

[DOI]

Rachid Guerraoui

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Energy and Time Efficient Broadcasting in Known Topology Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

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

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2007

2006

Collective tree exploration.

[BibT_eX]

[DOI]

Networks, 2006

Fast distributed algorithm for convergecast in ad hoc geometric radio networks.

[BibT_eX]

[DOI]

Alexander Kesselman

J. Parallel Distributed Comput., 2006

Robust gossiping with an application to consensus.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Complexity of Searching for a Black Hole.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Performing work in broadcast networks.

[BibT_eX]

[DOI]

Andrzej Lingas

Distributed Comput., 2006

Deterministic Rendezvous in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 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

Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Efficient gossip and robust distributed computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Energy efficient communication in ad hoc networks from user's and designer's perspective.

[BibT_eX]

[DOI]

Alexander Kesselman

ACM SIGMOBILE Mob. Comput. Commun. Rev., 2005

Performing work with asynchronous processors: Message-delay-sensitive bounds.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Broadcasting in undirected ad hoc radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Cooperative asynchronous update of shared memory.

[BibT_eX]

[DOI]

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

On selection problem in radio networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Explicit Combinatorial Structures for Cooperative Distributed Algorithms.

[BibT_eX]

[DOI]

Peter M. Musial

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Energy efficient connectivity in ad hoc networks from user's and designer's perspective.

[BibT_eX]

[DOI]

Alexander Kesselman

Proceedings of IEEE International Conference on Communications, 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

Faster Deterministic Broadcasting in Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Time of Deterministic Broadcasting in Radio Networks with Local Knowledge.

[BibT_eX]

[DOI]

SIAM J. Comput., 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

Writing-all deterministically and optimally using a non-trivial number of asynchronous processors.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

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

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Searching for a Black Hole in Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Polynomial Deterministic Rendezvous in Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

The Join Problem in Dynamic Network Algorithms.

[BibT_eX]

[DOI]

Kishori M. Konwar

Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

Broadcasting Spanning Forests on a Multiple-Access Channel.

[BibT_eX]

[DOI]

Karol Golab

Theory Comput. Syst., 2003

Time of Radio Broadcasting.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

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

Deterministic Broadcasting Time in Radio Networks of Unknown Topology.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

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

1999

Randomization Helps to Perform Tasks on Processors Prone to Failures.

[BibT_eX]

[DOI]