yusuke1997/dblp-id-title huggingface dataset:
A theoretical and empirical evaluation of an algorithm for self-healing computation
Crumbling Walls: A Class of Practical and Efficient Quorum Systems
On implementing omega in systems with weak reliability and synchrony assumptions
Derandomizing local distributed algorithms under bandwidth restrictions
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
An optimal bit complexity randomized distributed MIS algorithm
Improved distributed degree splitting and edge coloring
Concurrent Maintenance of Rings
On Interprocess Communication. Part II: Algorithms
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
Equivalence classes and conditional hardness in massively parallel computations
Randomized leader election
Time-communication impossibility results for distributed transactional memory
Hundreds of impossibility results for distributed computing
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution
Special issue on PODC 2007
The mailbox problem
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
Asynchronous reconfiguration with Byzantine failures
The splay-list: a distribution-adaptive concurrent skip-list
Improved distributed Δ-coloring
An efficient fault-containing self-stabilizing algorithm for the shortest path problem
The k -simultaneous consensus problem
Lock-free dynamic hash tables with open addressing
Anonymous asynchronous systems: the case of failure detectors
Fast computation by population protocols with a leader
Concise version vectors in WinFS
Approximate distributed top- k queries
The Construction of Self-Synchronizing Finite State Protocols
Choice Coordination with Limited Failure
Locality and checkability in wait-free computing
The weakest failure detector for eventual consistency
Asynchronous group mutual exclusion
Searching without communicating: tradeoffs between performance and selection complexity
Safety assurance via on-line monitoring
Asynchronous approach in the plane: a deterministic polynomial algorithm
The design of novel distributed protocols from differential equations
Using counterfactuals in knowledge-based programming
Modelling and verifying the AODV routing protocol
Distributed computation with continual population growth
Torus orientation
Read-modify-write networks
Special issue with selected papers from PODC 2011
Probabilistic Clock Synchronization
Cross-chain payment protocols with success guarantees
On the power of shared object types to implement one-resilient Consensus
Long lived adaptive splitter and applications
Efficient Agreement Using Fault Diagnosis
Distributed transactional memory for general networks
The Torus Routing Chip
Demand-aware network designs of bounded degree
The complexity of leader election in diameter-two networks
On the computability power and the robustness of set agreement-oriented failure detector classes
How many cooks spoil the soup?
Defending non-Bayesian learning against adversarial attacks
Distributed approximation of k-service assignment
Meeting in a polygon by anonymous oblivious robots
Broadcasting in UDG radio networks with missing and inaccurate information
Linial for lists
Reviewer Acknowledgement (2020)
Near-optimal distributed dominating set in bounded arboricity graphs
Improved weighted additive spanners
Special issue in memory of Berthold Vöcking
On implementing SWMR registers from SWSR registers in systems with Byzantine failures
Algebraic and Functional Specification of an Interactive Serializable Database Interface
Fault Tolerant Processes
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail
Designing Systolic, Distributed Buffers with Bounded Response Time
Randomized Naming Using Wait-Free Shared Variables
Near-optimal distributed computation of small vertex cuts
Threshold protocols in survivor set systems
A decision-theoretic approach to reliable message delivery
Asymmetric distributed trust
Last-use opacity: a strong safety property for transactional memory with prerelease support
Fooling views: a new lower bound technique for distributed computations under congestion
(Δ + 1) vertex coloring in O(n) communication
Timestamping messages and events in a distributed system using synchronous communication
Knowledge, level of symmetry, and time of leader election
The CB tree: a practical concurrent self-adjusting search tree
Tight bounds for parallel randomized load balancing
A spatial equational logic for the applied pi -calculus
Derandomizing random walks in undirected graphs using locally fair exploration strategies
A coded shared atomic memory algorithm for message passing architectures
Deterministic fault-tolerant connectivity labeling scheme
Superstabilizing Mutual Exclusion
A self-stabilizing quorum-based protocol for maxima computing
Distributed computing with the cloud
Sub-logarithmic distributed algorithms for metric facility location
Implementing Hybrid Consistency with High-Level Synchronization Operations
Necessary and Sufficient Conditions for Broadcast Consensus Protocols
Nearly optimal bounds for distributed wireless scheduling in the SINR model
Optimistically tuning synchronous byzantine consensus: another win for null messages
Verification of Distributed Programs Using Representative Interleaving Sequences
Fast approximate shortest paths in the congested clique
Dynamic group communication
Inherent limitations of hybrid transactional memory
Randomized mutual exclusion on a multiple access channel
Multi-Writer Composite Registers
On the importance of having an identity or, is consensus really universal?
Asymptotically Optimal Algorithms for Approximate Agreement
Proving Refinement Using Transduction
Time versus space trade-offs for rendezvous in trees
On efficient distributed construction of near optimal routing schemes
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Renaming and the weakest family of failure detectors
Self-stabilizing gathering of mobile robots under crash or Byzantine faults
Termination of amnesiac flooding
Introduction to the special issue of papers from DISC 2015
Progress Under Bounded Fairness
Rendezvous in networks in spite of delay faults
Combinatorial algorithms for distributed graph coloring
Deterministic polynomial approach in the plane
The minimum information about failures for solving non-local tasks in message-passing systems
Special issue on DISC 2011
MinMax algorithms for stabilizing consensus
Choreographies, logically
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
Adversarial topology discovery in network virtualization environments: a threat for ISPs?
Communication complexity of byzantine agreement, revisited
Time-space trade-offs in population protocols for the majority problem
The sum of its parts: Analysis of federated byzantine agreement systems
On best response dynamics in weighted congestion games with polynomial delays
RMR-efficient implementations of comparison primitives using read and write operations
Self-stabilization with r-operators
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case
Comments on Deriving Protocol Specifications from Service Specifications Written in LOTOS
Interval routing schemes allow broadcasting with linear message-complexity
Remote method invocation as a first-class citizen
Introduction to special issue dedicated to the DISC 20th anniversary
Optimal Geometric Algorithms for Digitized Images on Fixed-Size Linear Arrays and Scan-Line Arrays
Randomized mutual exclusion with sub-logarithmic RMR-complexity
Automation of fault-tolerant graceful degradation
Distributed speculative execution for reliability and fault tolerance: an operational semantics
The computability of relaxed data structures: queues and stacks as examples
Component stability in low-space massively parallel computation
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms
Optimal message-passing with noisy beeps
Anonymous and fault-tolerant shared-memory computing
The Theta-Model: achieving synchrony without clocks
Expected linear round synchronization: the missing link for linear Byzantine SMR
Redundancy in distributed proofs
Vertex fault tolerant additive spanners
Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks
Property testing of planarity in the CONGEST model
Performing tasks on synchronous restartable message-passing processors
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs
On set consensus numbers
On Deadlocks of Exclusive AND-Requests for Resources
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
Reconciling fault-tolerant distributed algorithms and real-time computing
Stabilization and Pseudo-Stabilization
A Fully Abstract Trace Model for Dataflow and Asynchronous Networks
Lower bounds for searching robots, some faulty
Byzantine gathering in polynomial time
How to reconcile fault-tolerant interval intersection with the Lipschitz condition
Self-stabilizing 2 m -Clock for Unidirectional Rings of Odd Size
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
A new fast-path mechanism for mutual exclusion
Parameterized model checking of rendezvous systems
Concurrent disjoint set union
P - A Logic - A Compositional Proof System for Distributed Programs
The Compositional Approach to Sequential Consistency and Lazy Caching
Distributed Optimistic Concurrency Control with Reduced Rollback
Overcoming controllability problems in distributed testing from an input output transition system
Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links
Failure detectors encapsulate fairness
The space complexity of unbounded timestamps
Reaching consensus for asynchronous distributed key generation
A Modular Algorithm for Resource Allocation
Tight bounds for k -set agreement with limited-scope failure detectors
Naming Symmetric Processes Using Shared Variables
Near-optimal self-stabilising counting and firing squads
Communication complexity of approximate maximum matching in the message-passing model
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
Upper and lower bounds for deterministic broadcast in powerline communication networks
Adaptive Solutions to the Mutual Exclusion Problem
Efficient online algorithm for identifying useless states in distributed systems
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
Consensus in the presence of mortal Byzantine faulty processes
Special issue on DISC 07
Verification of consensus algorithms using satisfiability solving
Election in partially anonymous networks with arbitrary knowledge in message passing systems
Window-based greedy contention management for transactional memory: theory and practice
A Fast, Scalable Mutual Exclusion Algorithm
Bonded Time-Stamps
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
Special issue on PODC 2015 and PODC 2016
Detection of Global Predicates: Techniques and Their Limitations
The topology of distributed adversaries
Stochastic coordination in heterogeneous load balancing systems
Distributed symmetry breaking on power graphs via sparsification
PerformERL: a performance testing framework for erlang
On the inherent weakness of conditional primitives
A taxonomy of process calculi for distribution and mobility
Asynchronous Multicaches
Sade: competitive MAC under adversarial SINR
Distributed computing with advice: information sensitivity of graph coloring
Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery
Distributed data clustering in sensor networks
Distributed scheduling for disconnected cooperation
The disagreement power of an adversary
Self-Stabilization: Randomness to Reduce Space
Efficient Detection of Discrepancies in Multiple File Copies
Distributed construction of low-interference spanners
Introduction to the special issue PODC'2004
An Incremental Specification of the Sliding-Window Protocol
Randomized Function Evaluation on a Ring
Broadcasting in UDG radio networks with unknown topology
Checking sequences for distributed test architectures
Scalable eventually consistent counters over unreliable networks
Xheal: a localized self-healing algorithm using expanders
The ANTS problem
Fault-Tolerant Atomic Computations in an Object-Based Distributed System
Recognizing Safety and Liveness
Scalable mechanisms for rational secret sharing
Adaptive progress: a gracefully-degrading liveness property
Special issue on PODC 2019
Distributed distance computation and routing with small messages
Generating FSMs from Interworkings
Reliable communication over highly connected noisy networks
Communication-efficient randomized consensus
Phase transition of the 2-Choices dynamics on core-periphery networks
Fence patrolling by mobile agents with distinct speeds
A knowledge-based analysis of global function computation
The congenial talking philosophers problem in computer networks
Breaking the $$\log n$$ log n barrier on rumor spreading
Randomization can be a healer: consensus with dynamic omission failures
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
A Formal Approach to Designing Delay-Insensitive Circuits
Leveraging multiple channels in ad hoc networks
Contention resolution with message deadlines
Compiling Communicating Processes Into Delay-Insensitive VLSI Circuits
When is recoverable consensus harder than consensus?
Using CSP to Verify Sequential Consistency
Extending hardware transactional memory capacity via rollback-only transactions and suspend/resume
On the uncontended complexity of anonymous agreement
On the complexity of distributed stable matching with small messages
The power of logical clock abstractions
Leader election using loneliness detection
The topology of look-compute-move robot wait-free algorithms with hard termination
Special issue on PODC 2008
Massively parallel computation in a heterogeneous regime
Constraint-based Structuring of Network Protocols
Understanding Naming in Distributed Systems
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Some lower bounds in dynamic networks with oblivious adversaries
Massively parallel algorithms for approximate shortest paths
The computational structure of progress conditions and shared objects
Distributed algorithms for covering, packing and maximum weighted matching
Optimal extension protocols for byzantine broadcast and agreement
Linearizable Counting Networks
Silent anonymous snap-stabilizing termination detection
Algebraic methods in the congested clique
Competitive throughput in multi-hop wireless networks despite adaptive jamming
Reliable Broadcasts and Communication Models: Tradeoffs and Lower Bounds
A Self-Stabilizing Algorithm for Coloring Planar Graphs
Activating anonymous ad hoc radio networks
The computational power of population protocols
Universal Routing Schemes
Collecting Cyclic Distributed Garbage by Controlled Migration
A framework for automated distributed implementation of component-based models
Systolic Algorithms as Programs
How much memory is needed for leader election
Randomized distributed decision
On Multilevel Voting
Special issue on DISC 2010
Fast Consensus in Networks of Bounded Degree
Fault-containing self-stabilizing distributed protocols
Correction to: The consensus number of a cryptocurrency
Communication-Based Prevention of Useless Checkpoints in Fistributed Computations
Efficient broadcasting in radio networks with long-range interference
Special issue on DISC 2020
Finding missing synchronization in a distributed computation using controlled re-execution
Lower bounds on the state complexity of population protocols
Localization for a system of colliding robots
A wait-free queue with polylogarithmic step complexity
The complexity of synchronous iterative Do-All with crashes
Editorial: Introduction
Fast and Simple Distributed Consensus
Self-Stabilizing Token Circulation in Uniform Networks
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC
A Self-Stabilizing Algorithm for the Maximum Flow Problem
Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)
Self-Stabilizing Multi-Token Rings
Timed implementation relations for the distributed test architecture
The consensus number of a cryptocurrency
A local approximation algorithm for minimum dominating set problem in anonymous planar networks
Adaptive mutual exclusion with local spinning
Vector Time and Causality Among Abstract Events in Distributed Computations
Symbolic synthesis of masking fault-tolerant distributed programs
On quorum systems for group resources allocation
A distributed low tree-depth decomposition algorithm for bounded expansion classes
Time-optimal construction of overlay networks
Fast deterministic rendezvous in labeled lines
On atomic registers and randomized consensus in M&M systems
Renaming in synchronous message passing systems with Byzantine failures
Multidimensional agreement in Byzantine systems
Sequential Consistency and the Lazy Caching Algorithm
Self-Stabilization Over Unreliable Communication Media
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
Automatic verification for a class of distributed systems
Computable Obstructions to Wait-Free Computability
An optimal maximal independent set algorithm for bounded-independence graphs
Semantics of Finite and Infinite Networks of Concurrent Communicating Agents
Recoverable mutual exclusion
Gathering on rings under the Look-Compute-Move model
Distributed bare-bones communication in wireless networks
Fast message dissemination in random geometric networks
Liveness and latency of Byzantine state-machine replication
Failure detectors as type boosters
Speed faults in computation by chemical reaction networks
Synthesizing Systolic Arrays with Control Signals from Recurrence Equations
Almost global problems in the LOCAL model
Close to linear space routing schemes
An algorithm for the asynchronous Write-All problem based on process collision
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
Towards distributed two-stage stochastic optimization
Sparse communication networks and efficient routing in the plane
Efficient bounded timestamping from standard synchronization primitives
Reaching Agreement on Processor-Group Memebership in Synchronous Distributed Systems
The complexity of verifying population protocols
Time efficient k-shot broadcasting in known topology radio networks
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms
Lower and upper bounds for single-scanner snapshot implementations
Special issue with selected papers from DISC 2009
Practical load balancing for content requests in peer-to-peer networks
Adaptive and efficient mutual exclusion
Getting close without touching: near-gathering for autonomous mobile robots
Leader election for anonymous asynchronous agents in arbitrary networks
General compact labeling schemes for dynamic trees
Fast and scalable rendezvousing
Efficient distributed computation of distance sketches in networks
Editorial: Time for Change
Life beyond set agreement
Some simple distributed algorithms for sparse networks
Concurrent Reading While Writing Revisited
Efficient Algorithms for Optimistic Crash Recovery
Dynamics in network interaction games
Compiling Path Expressions Into VLSI Circuits
Achieving Graceful Performance in Distributed Error-Prone Databases
Decidability of the Termination Problem for Completely Specified Protocols
Concurrent Common Knowledge: Defining Agreement for Asynchronous Systems
A Methodology for Constructing Communication Protocols with Multiple Concurrent Functions
Active Disk Paxos with infinitely many processes
Optimal Time Byzantine Agreement for t<n/8 With Linear-Messages
Fast distributed approximation for TAP and 2-edge-connectivity
Unifying stabilization and termination in message-passing systems
Special issue on PODC 2013
The canonical amoebot model: algorithms and concurrency control
Some perspectives on PODC
A Class of High Performance Maekawa-Type Algorithms for Distributed Systems Under Heavy Demand
Nearly optimal perfectly periodic schedules
Efficient algorithms for constructing (1+epsilon, beta)-spanners in the distributed and streaming models
HyperTree for self-stabilizing peer-to-peer systems
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
Search on a line with faulty robots
Distributed computing on oriented anonymous hypercubes with faulty components
Modeling radio networks
Preserving stabilization while practically bounding state space using incorruptible partially synchronized clocks
Anti- Omega : the weakest failure detector for set agreement
Mutual Exclusion in Partitioned Distributed Systems
Cache Consistency by Design
Distributed Algorithms for Constructing a Minimum-Weight Spaning Tree in a Broadcast Network
Distributed Election in Complete Networks
Model Checking for a Probabilistic Branching Time Logic with Fairness
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors
Characterization of a Sequentially Consistent Memory and Verification of a Cache Memory by Abstraction
Fair and resilient Incentive Tree mechanisms
Distributed computation and reconfiguration in actively dynamic networks
Low-Congestion shortcuts without embedding
Soft-error mitigation by means of decoupled transactional memory threads
Implementation relations and test generation for systems with distributed interfaces
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach
Optimal Deterministic Broadcasting in Known Topology Radio Networks
Techniques and applications of computation slicing
Byzantine consensus is Θ (n 2) : the Dolev-Reischuk bound is tight even in partial synchrony!
Special issue on DISC 2013, 2014 and PODC 2014
Assigning labels in an unknown anonymous network with a leader
A Self-Stabilizing Algorithm for Bridge Finding
Editorial: Special issue of PODC 2017 and DISC 2017
Bounded-wait combining: constructing robust and high-throughput shared objects
Solo-valency and the cost of coordination
Chemical foundations of distributed aspects
Knowledge in Shared Memory Systems
Revisiting asynchronous fault tolerant computation with optimal resilience
Efficient Leader Election Using Sense of Direction
Analysis of Toggle Protocols
Passive testing with asynchronous communications and timestamps
What can be sampled locally?
Distributed backup placement in networks
Sublinear-time distributed algorithms for detecting small cliques and even cycles
The Evolution of the SR Language
Low-congestion shortcut and graph parameters
Tolerating malicious gossip
Transient fault detectors
Distributed edge coloration for bipartite networks
Misleading stars: what cannot be measured in the internet?
A tight lower bound for semi-synchronous collaborative grid exploration
A Sound and Complete Algorithm for Distributed Commerce Transactions
Performing work in broadcast networks
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack
Efficient adaptive collect algorithms
Objects shared by Byzantine processes
Lower bounds for sense of direction in regular graphs
Time-Dependent Distributed Systems: Proving Safety, Liveness and Real-Time Properties
Deterministic near-optimal distributed listing of cliques
A Proof Technique for Concurrency Control and Recovery Algorithms for Replicated Databases
A complexity-based classification for multiprocessor synchronization