yusuke1997/dblp-id-title huggingface dataset:
Specification, implementation and application of randomized regular registers (brief announcement)
On a selfish caching game
Solvability Characterization for General Three-Process Tasks
Using CSP to Derive a Sequentially Consistent DSM System
The internet is flat: a brief history of networking in the next ten years
Formal Semantics for Expressing Optimism: The Meaning of HOPE
Partitioning Graph Databases by Using Access Patterns
Properties of the r -Operators to Insure Termination of Distributed Computatioons
Asynchronous group key exchange with failures
On the establishment of distinct identities in overlay networks
Mixed Consistency: A Model for Parallel Programming (Extended Abstract)
Brief Announcement: constraint-based synchronization and verification of concurrent programs
Software transactional memory for dynamic-sized data structures
Tutorial: Specifying, Implementing, and Verifying Algorithms for Persistent Memory
Virtual Time II: Storage Management in Conservative and Optimistic Systems
Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory Model
Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks
Practical multi-candidate election system
Scalable Concurrent Priority Queue Algorithms
Brief announcement: efficient flooding in power-law networks
Brief announcement: superpeer formation amidst churn and rewiring
On the Value of Information in Distributed Decision-Making (Extended Abstract)
Stone age distributed computing
A framework for semantic reasoning about Byzantine quorum systems
Competitive Dynamic Bandwidth Allocation
Accessing probabilistic quorums in dynamic networks
Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement
Fast byzantine agreement in dynamic networks
Continuous Clock Amortization Need Not Affect the Precision of a Clock Synchronization Algorithm
Return of the primal-dual: distributed metric facility location
Stateless distributed algorithms for near optimal maximum multicommodity flows
Brief Announcement: Know Your Audience: Communication model and computability in anonymous networks
Efficient fork-linearizable access to untrusted shared memory
Distributed social systems
Stability of long-lived consensus (extended abstract)
On the price of equivocation in byzantine agreement
2018 Edsger W. Dijkstra Prize in Distributed Computing
Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
Keynote: Provable Slashing Guarantees
Multi-Party Computations: Past and Present
Simple and efficient local codes for distributed stable network construction
How computer architecture trends may affect future distributed systems: from infiniBand clusters to inter-processor speculation (abstract)
Connectivity and aggregation in multihop wireless networks
In-Memory Runtime File Systems for Many-Task Computing
New Routing Techniques and their Applications
Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logs
The impact of memory models on software reliability in multiprocessors
Safety-Liveness Exclusion in Distributed Computing
Efficient lock-free binary search trees
A Gap Theorem for Consensus Types (Extended Abstract)
Probabilistic Self-Stabilizing Mutual Exclusion in Uniform Rings
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
On selection problem in radio networks
Cloud Search Based Applications for Big Data - Challenges and Methodologies for Acceleration
Distributed Fingerprints and Secure Information Dispersal
Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components (Extended Abstract)
Viceroy: a scalable and dynamic emulation of the butterfly
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
The Impact of Cooperation in Bilateral Network Creation
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority
Measuring robustness of superpeer topologies
Long-Lived Renaming Made Fast
A Tight Lower Bound for Randomized Synchronous Consensus
Brief announcement: exploring the consistency problem space
Brief Announcement: On the Significance of Consecutive Ballots in Paxos
Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates
CoLa: A Coordination Language for Massive Parallelism
Brief Announcement: Asynchronous Coordination with Constraints and Preferences
A Characterization of Eventual Byzantine Agreement
Brief Announcement: Content-Oblivious Leader Election on Rings
Towards a Universal Directory Service
Competitive weighted throughput analysis of greedy protocols on DAGs
Byzantine agreement with homonyms
Average probe complexity of non-dominated coteries (brief announcement)
A Concurrency Control Theory for Nested Transactions
Revisiting the Power of Non-Equivocation in Distributed Protocols
A programming language perspective on transactional memory consistency
Online Resource Leasing
Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links
Broadcasting in undirected ad hoc radio networks
Near-Optimal Leader Election in Population Protocols on Graphs
Experiences with a Model for Parallel Computation
Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2025, Hotel Las Brisas Huatulco, Huatulco, Mexico, June 16-20, 2025
Greedy distributed optimization of multi-commodity flows
A Formal Description of the UNIX Operating System
Brief Announcement: Performance Prediction for Coarse-Grained Locking
Brahms: byzantine resilient random membership sampling
Optimal smoothing schedules for real-time streams (extended abstract)
Compact routing with slack
Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract)
Constructing scalable overlays for pub-sub with many topics
Brief announcement: exponential speed-up of local algorithms using non-local communication
Non-blocking timeout in scalable queue-based spin locks
Brief announcement: impossibility results for concurrent secure two-party computation
Stable and fault-tolerant object allocation
Routing complexity of faulty networks
Restoration by path concatenation: fast recovery of MPLS paths
Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes
Making Operations of Concurrent Data Types Fast
Analyzing consistency properties for fun and profit
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, PODC 2002, Monterey, California, USA, July 21-24, 2002
Efficient top-K query calculation in distributed networks
Distributed Convex Thresholding
Reconsidering Fragmentation and Reassembly
Compact routing with stretch factor of less than three (brief announcement)
Brief announcement: what can be computed without communication?
An improved lower bound for the time complexity of mutual exclusion
On Achieving Consensus Using a Shared Memory
Tolerating corrupted communication
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, May 23-26, 1996
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits
Nearly optimal perfectly-periodic schedules
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility
Detecting Global Termination Conditions in the Face of Uncertainty
Persistent Messages in Local Transactions
Detecting distributed cycles of garbage in large-scale systems
A Categorical Approach to Distributed Systems Expressibility and Knowledge
Distributed Task and Memory Management
Geographic gossip on geometric random graphs via affine combinations
Dynamic and self-stabilizing distributed matching
Adaptive Solutions to the Mutual Exclusion Problem (Extended Abstract)
A Refinement of Kahn's Semantic to Handle Non-Determinism and Communication (Extended Abstract)
Optimally work-competitive scheduling for cooperative computing with merging groups
Brief Announcement: Certified Universal Gathering in R 2 for Oblivious Mobile Robots
Minimal Synchrony for Byzantine Consensus
The Complexity of Data Mining on the Web (Abstract)
Open Systems in TLA
State Complexity of Protocols with Leaders
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Single-Source Shortest Paths in the CONGEST Model with Improved Bound
Distributed MIS in O(log log n) Awake Complexity
Towards Reproducible Evaluation of Large-Scale Distributed Systems
On the Use of Registers in Achieving Wait-Free Consensus
Fault-Tolerance in Distributed Optimization: The Case of Redundancy
Distributed k-core decomposition
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
Language Semantics Driven Design and Formal Analysis for Distributed Cyber-Physical Systems: [Extended Abstract]
Source to Destination Communication in the Presence of Faults
Implementing Wait-Free Objects on Priority-Based Systems
Relative Liveness and Behavior Abstraction (Extended Abstract)
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions
Issues and Directions in Scalable Parallel Computing
The Benefits of Relaxing Punctuality
An Efficient Recovery-Based Spin Lock Protocol for Preemptive Shared Memory Multiprocessors
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, Canada, August 18-20, 1982
Veracity radius: capturing the locality of distributed computations
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract)
Minimalist Leader Election Under Weak Communication
The Impact of Time on the Session Problem
When selfish meets evil: byzantine players in a virus inoculation game
Knowledge, Common Knowledge and related puzzles (Extended Summary)
Brief announcement: pan and scan
Brief announcement: an obstacle to scalability in wireless networks
Hierarchical Correctness Proofs for Distributed Algorithms
Lower and Upper Bounds for Attacks on Authentication Protocols
Validity bound of regular registers with churn and byzantine processes
Countering web spam with credibility-based link analysis
On the weakest failure detector ever
From causal to z-linearizable transactional memory
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Sleeping on the job: energy-efficient and robust broadcast for radio networks
Script: A Communication Abstraction Mechanism
Brief announcement: early decision despite general process omission failures
Controlling Real-Time Asynchronous Tasks with ESTEREL Synchronous Language
Fault Tolerant Gradient Clock Synchronization
A denial-of-service resistant DHT
Partial information spreading with application to distributed maximum coverage
Brief announcement: an overview of the content-addressable network D2B
Compact Deterministic Distributed Dictionaries (Extended Abstract)
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
Brief announcement: self-stabilizing resource discovery algorithm
Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018
Adaptive system anomaly prediction for large-scale hosting infrastructures
Fast, Wait-Free (2 k )-Renaming
Revisionist Simulations: A New Approach to Proving Space Lower Bounds
An Optimal Algorithm for Generalized Causal Message Ordering (Abstract)
Improved Byzantine Agreement under an Adaptive Adversary
Efficient broadcasting in known topology radio networks with long-range interference
On the Space Complexity of Randomized Synchronization
Fast and Fair Randomized Wait-Free Locks
Time-efficient randomized multiple-message broadcast in radio networks
An agent exploration in unknown undirected graphs with whiteboards
Brief announcement: k-shot distributed broadcasting in radio networks
Hardness of Distributed Optimization
Efficient Message Ordering in Dynamic Networks
Possibility and complexity of probabilistic reliable communication in directed networks
Beyond set disjointness: the communication complexity of finding the intersection
Tight bounds for clock synchronization
Decentalized Replicated-Object Protocols
The disagreement power of an adversary: extended abstract
Asynchronous resource discovery
Real-Time Sequence Transmission Problem
Update Propagation in Bakunin Data Networks
Distributed data classification in sensor networks
The space complexity of long-lived and one-shot timestamp implementations
Generalizing Fair Reachability Analysis to Protocols with Arbitrary Topology (Abstract)
Multi-Party Set Disjointness and Intersection with Bounded Dependence
2021 Principles of Distributed Computing Doctoral Dissertation Award
Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
Efficient and practical constructions of LL/SC variables
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
Brief Announcement: A Key-Value Map for Massive Real-Time Analytics
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures
Reasoning about Meta Level Activities in Open Distributed Systems
Recoverable Mutual Exclusion in Sub-logarithmic Time
Properties of a Family of Booster Types
Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time
On Fault Tolerant Routings in General Networks
A Multi-Version Concurrency Scheme With No Rollbacks
Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks
Brief announcement: a note on distributed stable matching
The Cost of Synchronizing Multiple-Access Channels
Brief Announcement: Byzantine Agreement with Unknown Participants and Failures
Brief announcement: analysis of a randomized contention-resolution protocol for distributed access
The k -bakery: local-spin k -exclusion using non-atomic reads and writes
Unifying Synchronous and Asynchronous Message-Passing Models
Adaptive Massively Parallel Coloring in Sparse Graphs
Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies
Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems
History-Independent Concurrent Objects
On the theoretical gap between synchronous and asynchronous MPC protocols
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA
On the Impossibility of Group Membership
Coding theory for scalable media delivery
Flooding time in edge-Markovian dynamic graphs
Aggregation in dynamic networks
Lower Bounds for Searching Robots, some Faulty
Cheating Husbands and Other Stories: A Case Study of Knowledge, Action, and Communication (Preliminary Version)
Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space
Randomized Concurrent Set Union and Generalized Wake-Up
Brief announcement: concurrency-aware linearizability
Exploiting Locality in Maintaining Potential Causality
Performing Work Efficiently in the Presence of Faults
Unreliable Failure Detectors for Asynchronous Systems (Preliminary Version)
Strong Linearizability using Primitives with Consensus Number 2
On spectrum sharing games
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, Ithaca, New York, USA, August 15-18, 1993
The Consensus Number of a Cryptocurrency
Bootstrapping Public Blockchains Without a Trusted Setup
Unbeatable Set Consensus via Topological and Combinatorial Reasoning
Security and Privacy for Distributed Optimization & Distributed Machine Learning
Brief announcement: an incentive-compatible capacity assignment algorithm for bulk data distribution using P2P
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, PODC, '99Atlanta, Georgia, USA, May 3-6, 1999
The Complexity of Using Forwarding Addresses for Decentralized Object Finding
Probabilistic Byzantine Quorum Systems
Brief announcement: a platform for experimenting with mobile algorithms in a laboratory
OCD: obsessive consensus disorder (or repetitive consensus)
Deterministic distributed vertex coloring in polylogarithmic time
Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing
Randomized Competitive Algorithms for Admission Control in General Networks (Abstract)
Self-Stabilizing Clock Synchronization in the Presence of Byzantine Faults (Abstract)
Brief announcement: on the quest of optimal service ordering in decentralized queries
Beyond nash equilibrium: solution concepts for the 21st century
Distributed algorithms for scheduling on line and tree networks
Analyzing Kleinberg's (and other) small-world Models
Secure and Verifiable Schemes for Election and General Distributed Computing Problems
Life is not a state-machine: the long road from research to production
Brief announcement: a framework for building self-stabilizing overlay networks
Local approximation schemes for topology control
Real-Time Object Sharing with Minimal System Support (Extended Abstract)
Brief announcement: self-assembly as graph grammar as distributed system
Robust network supercomputing without centralized control
Efficient dependency tracking for relevant events in shared-memory systems
ApPLIED '22: Proceedings of the 2022 Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, Salerno, Italy, 25 July 2022
Brief announcement: optimal amortized secret sharing with cheater identification
Brief announcement: linear time byzantine self-stabilizing clock synchronization
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast
Software-improved hardware lock elision
Property Testing of Planarity in the CONGEST model
Leaplist: lessons learned in designing tm-supported range queries
Brief announcement: tight lower bounds for greedy routing in uniform small world rings
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
Compiling Knowledge-Based Programs (Abstract)
Brief Announcement: Fast and Simple Node Coloring in the SINR Model
Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail!
Dynamic-sized nonblocking hash tables
On scalable and efficient distributed failure detectors
Fault-Tolerant Consensus in Directed Graphs
Brief announcement: collaborative measurement of upload speeds in P2P systems
Brief announcement: deterministic skipnet
The concurrency hierarchy, and algorithms for unbounded concurrency
The cost of fault tolerance in multi-party communication complexity
A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract)
Brief Announcement: Eventually Consistent Linearizability
A Lower Bound on Wait-Free Counting
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Distributed Strong Diameter Network Decomposition: Extended Abstract
Distributed computing with rules of thumb
Brief announcement: a tight RMR lower bound for randomized mutual exclusion
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
Graph Neural Networks as Application of Distributed Algorithms
Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems
Compact Routing Schemes with Low Stretch Factor (Extended Abstract)
Adaptive and efficient abortable mutual exclusion
Generalized lattice agreement
The inherent difficulty of timely primary-backup replication
The CAT theorem and performance of transactional distributed systems
Consensus Power Makes (Some) Sense! (Extended Abstract)
Characterization of Message Ordering Specifications and Protocols (Abstract)
The wireless synchronization problem
Communication-Optimal Convex Agreement
Locally Checkable Problems in Rooted Trees
On k -Set Consensus Problems in Asynchronous Systems
Clocked Population Protocols
Brief Announcement: Fence Insertion for Straight-line Programs is in P
Towards Efficient Power Management in MapReduce: Investigation of CPU-Frequencies Scaling on Power Efficiency in Hadoop
Rigorous system design
The IceCube approach to the reconciliation of divergent replicas
Accurate byzantine agreement with feedback
Automated Logical Verification Based on Trace Abstractions
Geometric ad-hoc routing: of theory and practice
Transactional memory retry mechanisms
Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 10-12, 1992
Brief Announcement: Average Complexity for the LOCAL Model
On Reliable Message Diffusion
Faster than optimal snapshots (for a while): preliminary version
Symmetry and Similarity in Distributed Systems
Immediate Atomic Snapshots and Fast Renaming (Extended Abstract)
Why Control of the Concurrency Level in Distributed Systems is More Fundamental Than Deadlock Management
Brief announcement: towards a secure indirection infrastructure
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time
On the generalized dining philosophers problem
Adaptive routing with stale information
Crash Failures vs. Crash + Link Failures (Abstract)
Maximal independent sets in multichannel radio networks
Optimal Clock Synchronization with Signatures
Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation
Protocols for Dynamic Vote Reassignment
Testing Incomplete Specifications of Distributed Systems
Deterministic Near-Optimal Distributed Listing of Cliques
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC
Transactions and privatization in Delaunay triangulation
Optimal Efficiency of Optimistic Contract Signing
Brief Announcement: 2D-Stack - A Scalable Lock-Free Stack Design that Continuously Relaxes Semantics for Better Performance
Lock-free reference counting
About State Recording in Asynchronous Computations (Abstract)
Fair Leader Election for Rational Agents in Asynchronous Rings and Networks
Brief announcement: efficient causality tracking in distributed storage systems with dotted version vectors
Self-stabilization - beyond the token ring circulation (brief announcement)
Differential Privacy in Distributed Environments: An Overview and Open Questions
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
2019 Principles of Distributed Computing Doctoral Dissertation Award
Highly-Available Distributed Services and Fault-Tolerant Distributed Garbage Collection
Deterministic Expander Routing: Faster and More Versatile
Fast and unconditionally secure anonymous channel
A note on efficient aggregate queries in sensor networks
Self-Stabilizing Leader Election in Regular Graphs
Synchronization Mechanisms for SCRAMNet+ Systems
Implementation of Authenticated Communication Based on Hierarchy-Relative Naming Scheme
A Lattice-Structured Proof of a Minimum Spanning
Distance-2 Coloring in the CONGEST Model
Brief announcement: controlled quorum selection in arbitrary topologies
Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings
Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers
Asynchronous recommendation systems
How Proofs are Prepared at Camelot: Extended Abstract