Seth Gilbert

Distributed Comput., June, 2024

Concurrent Data Structures Made Easy.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2024

DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Concurrent Data Structures Made Easy (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2024

Error-Free Near-Optimal Validated Agreement.

[BibT_eX]

[DOI]

CoRR, 2024

A Survey on Adversarial Contention Resolution.

[BibT_eX]

[DOI]

CoRR, 2024

Partial synchrony for free? New bounds for Byzantine agreement via a generic transformation across network models.

[BibT_eX]

[DOI]

CoRR, 2024

Efficient Signature-Free Validated Agreement.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Distributed Computing, 2024

All Byzantine Agreement Problems Are Expensive.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Compositional Verification of Composite Byzantine Protocols.

[BibT_eX]

[DOI]

Qiyuan Zhao

George Pîrlea

Karolina Grzeszkiewicz

Ilya Sergey

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., November, 2023

Leader Election in Well-Connected Graphs.

[BibT_eX]

[DOI]

Algorithmica, April, 2023

Strong Byzantine Agreement with Adaptive Word Complexity.

[BibT_eX]

[DOI]

CoRR, 2023

Robust and Listening-Efficient Contention Resolution.

[BibT_eX]

[DOI]

CoRR, 2023

Every Bit Counts in Consensus.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Robust Overlays Meet Blockchains - On Handling High Churn and Catastrophic Failures.

[BibT_eX]

[DOI]

Vijeth Aradhya

Aquinas Hobor

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

On the Validity of Consensus.

[BibT_eX]

[DOI]

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

2022

Latency, capacity, and distributed minimum spanning trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Crime and Punishment in Distributed Byzantine Decision Tasks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version].

[BibT_eX]

[DOI]

CoRR, 2022

OverChain: Building a robust overlay with a blockchain.

[BibT_eX]

[DOI]

Vijeth Aradhya

Aquinas Hobor

CoRR, 2022

Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!

[BibT_eX]

[DOI]

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

Contention Resolution for Coded Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2022 Principles of Distributed Computing Doctoral Dissertation Award.

[BibT_eX]

[DOI]

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

2021

Introduction to the Special Issue for SPAA 2018 - Part 2.

[BibT_eX]

[DOI]

Aydin Buluç

ACM Trans. Parallel Comput., 2021

Introduction to the Special Issue for SPAA 2018: Part 1.

[BibT_eX]

[DOI]

Aydin Buluç

ACM Trans. Parallel Comput., 2021

On the Complexity of Load Balancing in Dynamic Networks.

[BibT_eX]

[DOI]

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

Contention Resolution with Predictions.

[BibT_eX]

[DOI]

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

2021 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

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

2020

On simple back-off in unreliable radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Confidential gossip.

[BibT_eX]

[DOI]

Chryssis Georgiou

Distributed Comput., 2020

How fast can you update your MST? (Dynamic algorithms for cluster computing).

[BibT_eX]

[DOI]

Lawrence Li

CoRR, 2020

Brief Announcement: Polygraph: Accountable Byzantine Agreement.

[BibT_eX]

[DOI]

Vincent Gramoli

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

How Fast Can You Update Your MST?

[BibT_eX]

[DOI]

Lawrence Er Lu Li

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

Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast.

[BibT_eX]

[DOI]

Faith Ellen

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

Contention Resolution with Message Deadlines.

[BibT_eX]

[DOI]

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

DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Latency, Capacity, and Distributed Minimum Spanning Tree†.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

2019

Slow Links, Fast Links, and the Cost of Gossip.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2019

Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness.

[BibT_eX]

[DOI]

J. ACM, 2019

Polygraph: Accountable Byzantine Agreement.

[BibT_eX]

[DOI]

Vincent Gramoli

IACR Cryptol. ePrint Arch., 2019

Contention resolution on a fading channel.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Latency, Capacity, and Distributed MST.

[BibT_eX]

[DOI]

CoRR, 2019

Cooperation Speeds Surfing: Use Co-Bandit!

[BibT_eX]

[DOI]

Anuja Meetoo Appavoo

Kian-Lee Tan

CoRR, 2019

On Bioelectric Algorithms.

[BibT_eX]

[DOI]

James Maguire

Calvin Newport

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Parallel Finger Search Structures.

[BibT_eX]

[DOI]

Wei Quan Lim

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Periodic Bandits and Wireless Network Selection.

[BibT_eX]

[DOI]

Shunhao Oh

Anuja Meetoo Appavoo

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Introduction to the Special Issue for SPAA 2016.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2018

Smoothed analysis of dynamic networks.

[BibT_eX]

[DOI]

Distributed Comput., 2018

On Bioelectric Algorithms: A Novel Application of Theoretical Computer Science to Core Problems in Developmental Biology.

[BibT_eX]

[DOI]

James Maguire

Calvin Newport

CoRR, 2018

On Simple Back-Off in Complicated Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2018

A Reallocation Algorithm for Online Split Packing of Circles.

[BibT_eX]

[DOI]

Shunhao Oh

CoRR, 2018

Brief Announcement: On Simple Back-Off in Unreliable Radio Networks.

[BibT_eX]

[DOI]

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

Parallel Working-Set Search Structures.

[BibT_eX]

[DOI]

Kunal Agrawal

Wei Quan Lim

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

The Power to Schedule a Parallel Program.

[BibT_eX]

[DOI]

Kunal Agrawal

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

Shrewd Selection Speeds Surfing: Use Smart EXP3!

[BibT_eX]

[DOI]

Anuja Meetoo Appavoo

Kian-Lee Tan

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

2017

Cost-Oblivious Storage Reallocation.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Who are you? Secure identities in single hop ad hoc networks.

[BibT_eX]

[DOI]

Calvin Newport

Distributed Comput., 2017

File Maintenance: When in Doubt, Change the Layout!

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Brief Announcement: Gossiping with Latencies.

[BibT_eX]

[DOI]

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

Symmetry Breaking with Noisy Processes.

[BibT_eX]

[DOI]

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

Communication Primitives in Cognitive Radio Networks.

[BibT_eX]

[DOI]

Fabian Kuhn

Nimantha Thushan Baranasuriya

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

Load balancing with bounded convergence in dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Informed Bandwidth Adaptation in Wi-Fi Networks using Ping-Pair.

[BibT_eX]

[DOI]

Rajdeep Das

Venkata N. Padmanabhan

Christoffer Rødbro

Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, 2017

2016

A New Approach to Incremental Cycle Detection and Related Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Gossiping with Latencies.

[BibT_eX]

[DOI]

CoRR, 2016

How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

PSync: Visible light-based time synchronization for Internet of Things (IoT).

[BibT_eX]

[DOI]

Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

A Secure Sharding Protocol For Open Blockchains.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

SybilCast: Broadcast on the Open Airwaves.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2015

Resource-Competitive Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2015

Dynamic Reallocation Problems in Scheduling.

[BibT_eX]

[DOI]

Wei Quan Lim

Wei Zhong Lim

CoRR, 2015

Reallocation Problems in Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2015

The Computational Power of Beeps.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Cost-Oblivious Reallocation for Scheduling and Planning.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Efficient Communication in Cognitive Radio Networks.

[BibT_eX]

[DOI]

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

Bounds for Blind Rate Adaptation.

[BibT_eX]

[DOI]

Tonghe Wang

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

On Differentially Private Online Collaborative Recommendation Systems.

[BibT_eX]

[DOI]

Nimantha Thushan Baranasuriya

Xiao Liu

Haifeng Yu

Proceedings of the Information Security and Cryptology - ICISC 2015, 2015

QProbe: locating the bottleneck in cellular communication.

[BibT_eX]

[DOI]

Vishnu Navda

Venkata N. Padmanabhan

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies, 2015

2014

Tight Bounds for Asynchronous Renaming.

[BibT_eX]

[DOI]

J. ACM, 2014

Structuring unreliable radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2014

NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World.

[BibT_eX]

[DOI]

CoRR, 2014

Who Are You? Secure Identities in Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Making Sense of Relativistic Distributed Systems.

[BibT_eX]

[DOI]

Nimantha Thushan Baranasuriya

Wojciech M. Golab

Proceedings of the Distributed Computing - 28th International Symposium, 2014

(Near) optimal resource-competitive broadcast with jamming.

[BibT_eX]

[DOI]

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

Dynamic Task Allocation in Asynchronous Shared Memory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Aggregation in Smartphone Sensor Networks.

[BibT_eX]

[DOI]

Seth Lewis Gilbert

Jayanthi Rao

Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems, 2014

2013

Asynchronous gossip.

[BibT_eX]

[DOI]

J. ACM, 2013

Broadcast in the Ad Hoc SINR Model.

[BibT_eX]

[DOI]

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

SybilCast: broadcast on the open airwaves (extended abstract).

[BibT_eX]

[DOI]

Seth Lewis Gilbert

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Maximal independent sets in multichannel radio networks.

[BibT_eX]

[DOI]

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

2012

Generating Fast Indulgent Algorithms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Perspectives on the CAP Theorem.

[BibT_eX]

[DOI]

Computer, 2012

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.

[BibT_eX]

[DOI]

Algorithmica, 2012

Making evildoers pay: resource-competitive broadcast in sensor networks.

[BibT_eX]

[DOI]

Maxwell Young

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

Leader election in shared spectrum radio networks.

[BibT_eX]

[DOI]

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

Aggregation in dynamic networks.

[BibT_eX]

[DOI]

Alejandro Cornejo

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

Optimal Broadcast in Shared Spectrum Radio Networks.

[BibT_eX]

[DOI]

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

How to Allocate Tasks Asynchronously.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Resource-competitive analysis: a new perspective on attack-resistant distributed computing.

[BibT_eX]

[DOI]

Proceedings of the FOMC'12, 2012

2011

Guest Editorial: Parallelism in Algorithms and Architectures.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

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

[BibT_eX]

[DOI]

Chryssis Georgiou

Distributed Comput., 2011

Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast.

[BibT_eX]

[DOI]

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

Optimal-time adaptive strong renaming, with applications to counting.

[BibT_eX]

[DOI]

Morteza Zadimoghaddam

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

Mutual Exclusion with O(log^2 Log n) Amortized Work.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

The Complexity of Renaming.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Faster and better the promise of dynamic spectrum access: invited talk.

[BibT_eX]

[DOI]

Proceedings of the FOMC'11, 2011

2010

Rambo: a robust, reconfigurable atomic memory service for dynamic networks.

[BibT_eX]

[DOI]

Distributed Comput., 2010

Trusted Computing for Fault-Prone Wireless Networks.

[BibT_eX]

[DOI]

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

Brief Announcement: New Bounds for Partially Synchronous Set Agreement.

[BibT_eX]

[DOI]

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

Fast Randomized Test-and-Set and Renaming.

[BibT_eX]

[DOI]

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

Collaborative scoring with dishonest participants.

[BibT_eX]

[DOI]

Faezeh Malakouti Rad

Morteza Zadimoghaddam

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Securing every bit: authenticated broadcast in radio networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Distributed Agreement with Optimal Communication Complexity.

[BibT_eX]

[DOI]

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

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange).

[BibT_eX]

[DOI]

Dan Alistarh

Morteza Zadimoghaddam

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Self-stabilizing robot formations over unreliable networks.

[BibT_eX]

[DOI]

ACM Trans. Auton. Adapt. Syst., 2009

Reliability and security in wireless networks.

[BibT_eX]

[DOI]

SIGACT News, 2009

Reconfigurable distributed storage for dynamic networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2009

A new approach to incremental topological ordering.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Reliable distributed computing on unreliable radio channels.

[BibT_eX]

[DOI]

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

The wireless synchronization problem.

[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

Consensus and collision detectors in radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2008

How to Solve Consensus in the Smallest Window of Synchrony.

[BibT_eX]

[DOI]

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

Self-stabilizing Mobile Robot Formations with Virtual Nodes.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2008

Extensible encoding of type hierarchies.

[BibT_eX]

[DOI]

Hamed S. Alavi

Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

On fault tolerance and wireless networks.

[BibT_eX]

[DOI]

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

On the complexity of asynchronous gossip.

[BibT_eX]

[DOI]

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

Secure communication over radio channels.

[BibT_eX]

[DOI]

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

Virtual infrastructure for collision-prone wireless networks.

[BibT_eX]

[DOI]

Gregory V. Chockler

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

2007

Virtual infrastructure for wireless ad hoc networks.

[BibT_eX]

[DOI]

PhD thesis, 2007

The virtual node layer: a programming abstraction for wireless sensor networks.

[BibT_eX]

[DOI]

SIGBED Rev., 2007

On the Message Complexity of Indulgent Consensus.

[BibT_eX]

[DOI]

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

Gossiping in a Multi-channel Radio Network.

[BibT_eX]

[DOI]

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

2006

Playing games in many possible worlds.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Communication-Efficient Probabilistic Quorum Systems for Sensor Networks.

[BibT_eX]

[DOI]

Gregory V. Chockler

Boaz Patt-Shamir

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Contention Resolution with Heterogeneous Job Sizes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

GeoQuorums: implementing atomic memory in mobile <i>ad hoc</i> networks.

[BibT_eX]

[DOI]

Shlomi Dolev

Distributed Comput., 2005

Concurrent cache-oblivious b-trees.

[BibT_eX]

[DOI]

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

Brief announcement: virtual stationary automata for mobile networks.

[BibT_eX]

[DOI]

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

Consensus and collision detectors in wireless Ad Hoc networks.

[BibT_eX]

[DOI]

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

Timed Virtual Stationary Automata for Mobile Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Reconciling the Theory and Practice of (Un)Reliable Wireless Broadcast.

[BibT_eX]

[DOI]

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

Autonomous virtual mobile nodes.

[BibT_eX]

[DOI]

Shlomi Dolev

Elad Schiller

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

2004

Virtual Mobile Nodes for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 18th International Conference, 2004

On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs.

[BibT_eX]

[DOI]

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

Brief announcement: virtual mobile nodes for mobile ad hoc networks.

[BibT_eX]

[DOI]

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

The Quorum Deployment Problem.

[BibT_eX]

[DOI]

Grzegorz Malewicz

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

2003

RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

2002

Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services.

[BibT_eX]

[DOI]