yusuke1997/dblp-id-title huggingface dataset:
Brief Announcement: Incrementally Verifiable Distributed Computation
Optimal Time Self Stabilization in Dynamic Systems (Preliminary Version)
Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores
Constructing Shared Objects That Are Both Robust and High-Throughput
Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings
Fully-Adaptive Algorithms for Long-Lived Renaming
Solo-Fast Universal Constructions for Deterministic Abortable Objects
Transaction Chopping for Parallel Snapshot Isolation
Randomness Recycling in Constant-Round Private Computations (extended Abstract)
Brief Announcement: Revisiting Signature-Free Asynchronous Byzantine Consensus
Redundancy in Distributed Proofs
Self-Stabilization of Wait-Free Shared Memory Objects
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
Symmetry Breaking in Asynchronous Rings with O(n) Messages
Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited
The Weakest Failure Detector for Message Passing Set-Agreement
Distributed 2-Approximation Algorithm for the Semi-matching Problem
A New Synchronous Lower Bound for Set Agreement
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
On Consistency of Encrypted Files
Asymptotically Optimal Solutions for Small World Graphs
Brief Announcement: Distributed Sparsest Cut via Eigenvalue Estimation
Brief Announcement: Optimistic Algorithms for Partial Database Replication
Lock-Free Data-Structure Iterators
Base Fee Manipulation in Ethereum's EIP-1559 Transaction Fee Mechanism
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Choice Coordination with Multiple Alternatives (Preliminary Version)
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
Trade-Offs in Distributed Interactive Proofs
Observing Global States of Asynchronous Distributed Applications
Drawing Maps with Advice
Performing Tasks on Restartable Message-Passing Processors
On Radio Broadcasting in Random Geometric Graphs
Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time ,
Wait-Free Solvability of Equality Negation Tasks
Communication-Efficient Implementation of Failure Detector Classes and
Brief Announcement: Line Formation in Silent Programmable Matter
Limit Behavior of the Multi-agent Rotor-Router System
Brief Announcement: Simple Gradecast Based Algorithms
Random Walks on Evolving Graphs with Recurring Topologies
Early-Delivery Dynamic Atomic Broadcast
Distributed Deadlock Detection and Resolution with Probes
The Cost of Order in Asynchronous Systems
Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
Anonymous Asynchronous Systems: The Case of Failure Detectors
Fully Distributed Algorithms for Convex Optimization Problems
Network-Aware Distributed Algorithms: Challenges and Opportunities in Wireless Networks - (Invited Lecture Summary)
SMV: Selective Multi-Versioning STM
Decomposing Opacity
Certified Round Complexity of Self-Stabilizing Algorithms
Total Ordering Algorithms for Asynchronous Byzantine Systems
Dynamics in Network Interaction Games
Brief Announcement: It's not easy to relax: liveness in chained BFT protocols
Grasping the Gap Between Blocking and Non-Blocking Transactional Memories
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
On the Communication Surplus Incurred by Faulty Processors
An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention
Fast Nonblocking Persistence for Concurrent Data Structures
Compact Multicast Routing
Universal Constructions for Large Objects
Brief Announcement: Solvability of Three-Process General Tasks
The Power of Random Symmetry-Breaking in Nakamoto Consensus
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
A Local 2-Approximation Algorithm for the Vertex Cover Problem
On Dynamic and Multi-functional Labeling Schemes
Consensus with Max Registers
Pessimistic Software Lock-Elision
Complexity Landscape for Local Certification
Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset
Short Headers Suffice for Communication in a DAG with Link Failures
Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHP
General and Efficient Decentralized Consensus Protocols
Distributed Maximum Matching Verification in CONGEST
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
Information Spreading in Dynamic Networks Under Oblivious Adversaries
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
Distributed Recoloring
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
Brief Announcement: Carry the Tail in Consensus Protocols
The Complexity of Synchronous Iterative Do-All with Crashes
Linear-Time Snapshot Using Multi-writer Multi-reader Registers
Uniform Solvability with a Finite Number of MWMR Registers
Intermediate Value Linearizability: A Quantitative Correctness Criterion
Distributed Transactional Memory for Metric-Space Networks
Brief Announcement: Anonymity, Failures, Detectors and Consensus
Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model
Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers
Structured Derivation of Semi-Synchronous Algorithms
Propagation and Leader Election in a Multihop Broadcast Environment
Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)
Brief Announcement: The BG-Simulation for Byzantine Mobile Robots
Brief Announcement: Highly Dynamic and Fully Distributed Data Structures
Fault Tolerant Reachability for Directed Graphs
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
Oracular Byzantine Reliable Broadcast
Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage
Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time
Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration
A Practical Transactional Memory Interface
Lower Bounds on Information Dissemination in Dynamic Networks
Atomic Snapshots in O(log3 n) Steps Using Randomized Helping
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
Improved Distributed Degree Splitting and Edge Coloring
Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks
Groupings and Pairings in Anonymous Networks
A Single-Enqueuer Wait-Free Queue Implementation
Brief Announcment: Corruption Resilient Fountain Codes
Polymorphic Contention Management
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient
An Optimistic Approach to Lock-Free FIFO Queues
Distributed Dispatching in the Parallel Server Model
Sublinear-Space Distance Labeling Using Hubs
Brief Announcement: Practical Synchronous Byzantine Consensus
Error-Sensitive Proof-Labeling Schemes
Consensus Numbers of Transactional Objects
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
Distributed Computing with Imperfect Randomness
Truthful Information Dissemination in General Asynchronous Networks
Brief Announcement: Colorless Tasks and Extension-Based Proofs
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
Time and Communication Efficient Consensus for Crash Failures
Fault-Tolerant Consensus with an Abstract MAC Layer
On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits
Bounding Work and Communication in Robust Cooperative Computation
Almost Global Problems in the LOCAL Model
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
Distributed Computation with Continual Population Growth
Content-Oblivious Leader Election in 2-Edge-Connected Networks
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
New Bounds for the Controller Problem
Secure Computation without Agreement
Smoothed Analysis of Population Protocols
The Computational Power of Discrete Chemical Reaction Networks with Bounded Executions
Beyond Lamport's Happened-Before : On the Role of Time Bounds in Synchronous Systems
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model
Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
The Complexity of Symmetry Breaking in Massive Graphs
Foundations of Speculative Distributed Computing - (Invited Lecture Extended Abstract)
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols
Localized-Access Protocols for Replicated Databases
Recoverable FCFS Mutual Exclusion with Wait-Free Recovery
Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots
Securing the Net: Challenges, Failures and Directions
Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes
Bounded Wait-Free f -Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
Directed Network Protocols
The Complexity Landscape of Dynamic Distributed Subgraph Finding
Efficient Routing in Networks with Long Range Contacts
Distributed Cooperation During the Absence of Communication
Timing-Based Mutual Exclusion with Local Spinning
34th International Symposium on Distributed Computing, DISC 2020, Virtual Conference, October 12-16, 2020
Byzantine Consensus in the Random Asynchronous Model
Near-Linear Time Dispersion of Mobile Agents
The Inherent Cost of Strong-Partial View-Synchronous Communication
Fairness of Shared Objects
The Power of Abstract MAC Layer: A Fault-Tolerance Perspective
On the Power of Impersonation Attacks
Synchronizing Aysnchronous Bounded Delay Networks
Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem
Continuous Consensus with Failures and Recoveries
Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings
On the Implementation Complexity of Specifications of Concurrent Programs
Brief Announcement: Clock Distribution with Gradient TRIX
Verification of Connection-Management Protocols
Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation
On Real-Time and Non Real-Time Distributed Computing
The Dynamic And-Or Quorum System
Depth of a Random Binary Search Tree with Concurrent Insertions
Brief Announcement: Hybrid Time-Based Transactional Memory
Brief Announcement: Failure Detectors Encapsulate Fairness
Distributed Agreement and Its Relation with Error-Correcting Codes
Brief Announcement: New Bounds for Partially Synchronous Set Agreement
Almost Optimal Algorithms for Token Collision in Anonymous Networks
The Abstract MAC Layer
Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols
Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version)
The Quest for Universally-Optimal Distributed Algorithms (Invited Talk)
On Self-stabilizing Search Trees
Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks
DAG It Off: Latency Prefers No Common Coins
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)
The Synchronization Power of Coalesced Memory Accesses
Counting-Based Impossibility Proofs for Renaming and Set Agreement
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
Interrupting Snapshots and the Java TM ^{\mbox{\tiny TM}} Size() Method
Inter-task Co-ordination in Long-Lived Distributed Applications
Fast Distributed Approximations in Planar Graphs
Hardware Transactions in Nonvolatile Memory
Exponential Speedup over Locality in MPC with Optimal Memory
Minimal Shared Information for Concurrent Reading and Writing
Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract)
More on the Power of Random Walks: Uniform Self-Stabilizing Randomized Algorithms (Preliminary Report)
Byzantizing Paxos by Refinement
32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018
On Barriers and the Gap between Active and Passive Replication
Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults
Stepwise Removal of Virtual Channels in Distributed Algorithms
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model
Push-to-Pull Peer-to-Peer Live Streaming
Space-Optimal Counting in Population Protocols
Brief Announcement: Decreasing Verification Radius in Local Certification
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement
Efficient Fetch-and-Increment
Local Conflict Coloring Revisited: Linial for Lists
Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models
Brief Announcement: Towards Reduced Instruction Sets for Synchronization
The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks
Causing Communication Closure: Safe Program Composition with Non-FIFO Channels
A Case for Message Oriented Middleware
Brief Announcement: Universal Dancing by Luminous Robots Under Sequential Schedulers
On the Computational Power of Radio Channels
Programming Distributed Reactive Systems: a Strong and Weak Synchronous Coupling
Brief Announcement: On Implementing Wear Leveling in Persistent Synchronization Structures
Wait-Free n-Set Consensus When Inputs Are Restricted
Randomized Distributed Decision
Lower Bound on the Step Complexity of Anonymous Binary Consensus
Brief Announcement: Time, Fences and the Ordering of Events in TSO
Brief Announcement: Asynchronous Approximate Agreement with Quadratic Communication
Optimizing Threshold Protocols in Adversarial Structures
Black Hole Search with Finite Automata Scattered in a Synchronous Torus
Distributed Data Structures: A Complexity-Oriented View
Could any Graph be Turned into a Small-World?
Distributed Job Scheduling Using Snapshots
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
What Is the Use of Collision Detection (in Wireless Networks)?
Nonblocking Algorithms and Backward Simulation
Optimal Random Sampling from Distributed Streams Revisited
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput
Probabilistic Quorums for Dynamic Systems
Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection
Distributed Dense Subgraph Detection and Low Outdegree Orientation
Singularly Optimal Randomized Leader Election
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract)
On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects
Highly Concurrent Logically Synchronous Multicast
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
Who Are You? Secure Identities in Ad Hoc Networks
Compressing Communication in Distributed Protocols
Adaptive Long-Lived O(k 2 )-Renaming with O(k 2 ) Steps
DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982
Communication-Efficient Randomized Consensus
Practical Parallel Nesting for Software Transactional Memory
Distributed Certification for Classes of Dense Graphs
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees
Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme
Model-Agnostic Approximation of Constrained Forest Problems
OFC: A Distributed Fossil-Collection Algorithm for Time-Warp
Wait-Free CAS-Based Algorithms: The Burden of the Past
Non-blocking Monitor Executions for Increased Parallelism
Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network
Brief Announcement: On Self-Adjusting Skip List Networks
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract)
Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings
Brief Announcement: Generalising Concurrent Correctness to Weak Memory
Tight Bounds for Deterministic High-Dimensional Grid Exploration
Virtual Mobile Nodes for Mobile Ad Hoc Networks
Musical Benches
Evaluating the Quality of a Network Topology through Random Walks
Fast Distributed Computation in Dynamic Networks via Random Walks
Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings
Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary
Cheaper Matrix Clocks
Bounds on the Costs of Register Implementations
Sleeping Experts in Wireless Networks
Near-Optimal Distributed Tree Embedding
The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract)
Brief Announcement: Distributed Quantum Proofs for Replicated Data
Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems
Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols
Detectable Sequential Specifications for Recoverable Shared Objects
Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
Asynchronous Embedded Pattern Formation Without Orientation
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
Strong Interaction Fairness in a Fully Distributed System with Unbounded Speed Variability
Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers
Connectivity Problem in Wireless Networks
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion
Memory Adaptive Self-Stabilizing Protocols (Extended Abstract)
Using Adaptive Timeouts to Achive At-Most-Once Message Delivery
Atomic Multireader Register
Connectivity Labeling in Faulty Colored Graphs
Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures
Reliable Communication over Partially Authenticated Networks
Brief Announcement: Convergence Analysis of Scalable Gossip Protocols
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs
Brief Announcement: Temporal Locality in Online Algorithms
Conflict Detection and Validation Strategies for Software Transactional Memory
Privacy-Preserving Location-Based Services
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover
Efficient Symmetry Breaking in Multi-Channel Radio Networks
Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space
TEE Is Not a Healer: Rollback-Resistant Reliable Storage
Sorting in One and Two Rounds Using t-Comparators
Coloring Fast Without Learning Your Neighbors' Colors
33rd International Symposium on Distributed Computing, DISC 2019, Budapest, Hungary, October 14-18, 2019
Non-local Probes Do Not Help with Many Graph Problems
Even Better DCAS-Based Concurrent Deques
Local Maps: New Insights into Mobile Agent Algorithms
Active and Concurrent Topology Maintenance
Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings
Optimistic Generic Broadcast
Faster Cycle Detection in the Congested Clique
A Simple, Efficient Algorithm for Maximum Finding on Rings
Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model
LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
On Byzantine Broadcast in Loosely Connected Networks
General CONGEST Compilers against Adversarial Edges
The Communication Complexity of the Two List Problem
Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter
Detecting Global Predicates in Distributed Systems with Clocks
Optimal Error-Free Multi-Valued Byzantine Agreement
Disk Paxos
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
Brief Announcement: The Space Complexity of Set Agreement Using Swap
Weighted Voting for Operation Dependent Management of Replicated Data
The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems
On the Computational Power Needed to Elect a Leader (Extended Abstract)
On the Power of Non-spoofing Adversaries
Thrifty Generic Broadcast
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System
A Lightweight Group Mutual k -Exclusion Algorithm Using Bi- k -Arbiters
Fast Byzantine Leader Election in Dynamic Networks
Fast Randomized Test-and-Set and Renaming
Brief Announcement: On Augmented Graph Navigability
An Optimistic Resiliency Control Scheme for Distributed Database Systems
Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1)
Randomization and Failure Detection: A Hybrid Approach to Solve Consensus
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
An Efficient Long-Lived Adaptive Collect Algorithm
Convergence in (Social) Influence Networks
Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption
Lock-Free Augmented Trees
Dalí: A Periodically Persistent Hash Map
Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure Libraries
On the Inherent Anonymity of Gossiping
Fast Computation by Population Protocols with a Leader
Random Leaders and Random Spanning Trees
Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings
Brief Announcement: Fast and Scalable Group Mutual Exclusion
Fast Distributed Vertex Splitting with Applications
Minimal Byzantine Storage
Competitive Management of Non-preemptive Queues with Multiple Values
Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication
Towards a Theory of Consistency Primitives
Distributed Computing, 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001, Proceedings
A Robust Distributed Mutual Exclusion Algorithm
Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial
Simple and Near-Optimal Distributed Coloring for Sparse Graphs
Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers
Auditable Shared Objects: From Registers to Synchronization Primitives
Unbounded Contention Resolution in Multiple-Access Channels
Consistency Conditions for a CORBA Caching Service
Distributed Discovery of Large Near-Cliques
k-Abortable Objects: Progress Under High Contention
On Quorum Systems for Group Resources with Bounded Capacity
Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols
Smoothed Analysis of Dynamic Networks
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter