Andréa W. Richa

Distributed Comput., June, 2023

Is stochastic thermodynamics the key to understanding the energy costs of computation?

[BibT_eX]

[DOI]

Vijay Balasubramanian

CoRR, 2023

Distributed Online Rollout for Multivehicle Routing in Unmapped Environments.

[BibT_eX]

[DOI]

CoRR, 2023

Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks.

[BibT_eX]

[DOI]

Shunhao Oh

Dana Randall

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Energy-Constrained Programmable Matter Under Unfair Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Pursuit Policies in Dynamic Environments.

[BibT_eX]

[DOI]

Joseph L. Briones

Proceedings of the First Tiny Papers Track at ICLR 2023, 2023

Invited Paper: Asynchronous Deterministic Leader Election in Three-Dimensional Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

2022

Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2022

Foraging in Particle Systems via Self-Induced Phase Changes.

[BibT_eX]

[DOI]

Shunhao Oh

Dana Randall

CoRR, 2022

Asynchronous Deterministic Leader Election in Three-Dimensional Programmable Matter.

[BibT_eX]

[DOI]

CoRR, 2022

Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes.

[BibT_eX]

[DOI]

Shunhao Oh

Dana Randall

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

Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.

[BibT_eX]

[DOI]

Joshua J. Daymude

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2022 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

Marcos Aguiliera

Alexander A. Schwarzmann

Alessandro Panconesi

Philipp Woelfel

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

2021

Deadlock and Noise in Self-Organized Aggregation Without Computation.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Bio-Inspired Energy Distribution for Programmable Matter.

[BibT_eX]

[DOI]

Joshua J. Daymude

Jamison W. Weber

Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2020

Programming Active Granular Matter with Mechanically Induced Phase Changes.

[BibT_eX]

[DOI]

CoRR, 2020

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks.

[BibT_eX]

[DOI]

CoRR, 2020

Convex Hull Formation for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

Computing by Programmable Particles.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly.

[BibT_eX]

[DOI]

John Calvin Alumbaugh

Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019

A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

On the runtime of universal coating for programmable matter.

[BibT_eX]

[DOI]

Nat. Comput., 2018

A stochastic approach to shortcut bridging in programmable matter.

[BibT_eX]

[DOI]

Nat. Comput., 2018

Sade: competitive MAC under adversarial SINR.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Phototactic supersmarticles.

[BibT_eX]

[DOI]

Artif. Life Robotics, 2018

Collaborative Computation in Self-organizing Particle Systems.

[BibT_eX]

[DOI]

Alexandra M. Porter

Proceedings of the Unconventional Computation and Natural Computation, 2018

Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.

[BibT_eX]

[DOI]

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

2018 Doctoral Dissertation Award.

[BibT_eX]

[DOI]

Lorenzo Alvisi

Idit Keidar

Alexander A. Schwarzmann

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

Overlay Networks for Peer-to-Peer Networks.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Universal coating for programmable matter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Leader Election with High Probability for Self-Organizing Programmable Matter.

[BibT_eX]

[DOI]

CoRR, 2017

Interest- and Content-Based Data Dissemination in Mobile Social Networks.

[BibT_eX]

[DOI]

Mengxue Liu

Proceedings of the 2017 IEEE Global Communications Conference, 2017

Automated synthesis of scalable algorithms for inferring non-local properties to assist in multi-robot teaming.

[BibT_eX]

[DOI]

Taeyeong Choi

Theodore P. Pavlic

Proceedings of the 13th IEEE Conference on Automation Science and Engineering, 2017

Improved Leader Election for Self-organizing Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Jamming-Resistant MAC Protocols for Wireless Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Editorial to the Special Issue on SODA'12.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design.

[BibT_eX]

[DOI]

Comput. Networks, 2016

Universal Shape Formation for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems.

[BibT_eX]

[DOI]

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

On the Runtime of Universal Coating for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

2015

Mutual Embeddings.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2015

Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.

[BibT_eX]

[DOI]

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

An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.

[BibT_eX]

[DOI]

Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, 2015

Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem.

[BibT_eX]

[DOI]

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

Robust data mule networks with remote healthcare applications in the Amazon region: A fountain code approach.

[BibT_eX]

[DOI]

Mauro Margalho Coutinho

Proceedings of the 17th International Conference on E-health Networking, 2015

Leader Election and Shape Formation with Self-organizing Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014

Principles of Robust Medium Access and an Application to Leader Election.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

SKIP<sup>+</sup>: A Self-Stabilizing Skip Graph.

[BibT_eX]

[DOI]

J. ACM, 2014

Infinite Object Coating in the Amoebot Model.

[BibT_eX]

[DOI]

CoRR, 2014

Brief announcement: amoebot - a new model for programmable matter.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Competitive MAC under adversarial SINR.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

On shortest single/multiple path computation problems in Fiber-Wireless (FiWi) access networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 15th International Conference on High Performance Switching and Routing, 2014

2013

Coping with a Smart Jammer in Wireless Networks: A Stackelberg Game Approach.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2013

An Efficient and Fair MAC Protocol Robust to Reactive Interference.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2013

Competitive throughput in multi-hop wireless networks despite adaptive jamming.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Ameba-inspired Self-organizing Particle Systems.

[BibT_eX]

[DOI]

CoRR, 2013

Optimal Migration Contracts in Virtual Networks: Pay-as-You-Come vs Pay-as-You-Go Pricing.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012

Competitive and fair throughput for co-existing networks under adversarial interference.

[BibT_eX]

[DOI]

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

Optimal transmission power control in the presence of a smart jammer.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011

Minimum Maximum-Degree Publish-Subscribe Overlay Network Design.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2011

Self-Stabilizing De Bruijn Networks.

[BibT_eX]

[DOI]

Phillip Stevens

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Randomized compact routing in decomposable metrics.

[BibT_eX]

[DOI]

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

Self-stabilizing leader election for single-hop wireless networks despite jamming.

[BibT_eX]

[DOI]

Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2011

Towards jamming-resistant and competitive medium access in the SINR model.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM workshop on Wireless of the students, 2011

Competitive and Fair Medium Access Despite Reactive Jamming.

[BibT_eX]

[DOI]

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

2010

AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming

[BibT_eX]

[DOI]

CoRR, 2010

A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.

[BibT_eX]

[DOI]

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

Brief announcement: towards robust medium access in multi-hop networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Broadcasting in unreliable radio networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2009

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design.

[BibT_eX]

[DOI]

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

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.

[BibT_eX]

[DOI]

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

2008

Continuous-Time Collaborative Prefetching of Continuous Media.

[BibT_eX]

[DOI]

IEEE Trans. Broadcast., 2008

Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.

[BibT_eX]

[DOI]

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

A jamming-resistant MAC protocol for single-hop wireless networks.

[BibT_eX]

[DOI]

Baruch Awerbuch

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

An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model.

[BibT_eX]

[DOI]

Paolo Santi

Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

2007

Overlay Networks for Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2007

Optimal scale-free compact routing schemes in networks of low doubling dimension.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compact routing with slack in low doubling dimension.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Linearization: Locally Self-Stabilizing Sorting in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2006

MONET Special Issue on Foundations of Mobile Computing.

[BibT_eX]

[DOI]

Jennifer L. Welch

Mob. Networks Appl., 2006

Optimal-stretch name-independent compact routing in doubling metrics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

On Sampling in Higher-Dimensional Peer-to-Peer Systems.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

A Tight Lower Bound for the Steiner Point Removal Problem on Trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media.

[BibT_eX]

[DOI]

IEEE Trans. Broadcast., 2005

Dynamic Coverage in Ad-Hoc Sensor Networks.

[BibT_eX]

[DOI]

Hai Huang

Michael Segal

Mob. Networks Appl., 2005

Constant density spanners for wireless ad-hoc networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Resource mapping and scheduling for heterogeneous network processor systems.

[BibT_eX]

[DOI]

Proceedings of the 2005 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, 2005

2004

New Approximation Techniques for Some Linear Ordering Problems.

[BibT_eX]

[DOI]

Satish Rao

SIAM J. Comput., 2004

Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks.

[BibT_eX]

[DOI]

Hai Huang

Michael Segal

Mob. Networks Appl., 2004

2003

Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks.

[BibT_eX]

[DOI]

Nicolás E. Stier Moses

Telecommun. Syst., 2003

2002

Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.

[BibT_eX]

[DOI]

Soohyun Oh

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001

A data tracking scheme for general networks.

[BibT_eX]

[DOI]

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

1999

Tight Analyses of Two Local Load Balancing Algorithms.

[BibT_eX]

[DOI]

Bhaskar Ghosh

Frank Thomson Leighton

SIAM J. Comput., 1999

Accessing Nearby Copies of Replicated Objects in a Distributed Environment.

[BibT_eX]

[DOI]

C. Greg Plaxton

Rajmohan Rajaraman

Theory Comput. Syst., 1999

Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Bruce M. Maggs

Friedhelm Meyer auf der Heide

Comb., 1999

1998

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Richard Cole

Bruce M. Maggs

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

New Approximation Techniques for Some Ordering Problems.

[BibT_eX]

[DOI]

Satish Rao