yusuke1997/dblp-id-title huggingface dataset:
Distributed Multi-Destination Routing: The Constraints of Local Information
Cascade: An Edge Computing Platform for Real-time Machine Intelligence
The weakest failure detector for solving k-set agreement
Distributed computing building blocks for rational agents
Efficient Parallel Algorithms on Restartable Fail-Stop Processors
Rational and resilient protocols
Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures
Efficient lookup on unstructured topologies
(1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings
Implementing Hybrid Consistency with High-Level Synchronization Operations (Extenced Abstract)
Simple, Efficient Asynchronous Parallel Algorithms for Maximization
Proving Probabilistic Correctness Statements: the Case of Rabin's Algorithm for Mutual Exclusion
A Local Broadcast Layer for the SINR Network Model
An Adaptive Approach to Recoverable Mutual Exclusion
Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract)
Synthesis of Communicating Processes
Practical Implementations of Non-Blocking Synchronization Primitives
Space Bounds for Transactional Synchronization (Abstract)
Brief Announcement: Fair Ordering via Streaming Social Choice Theory
Competitiveness in Distributed Algorithms
The do-all problem in broadcast networks
Greedy distributed optimization of unsplittable multicommodity flows
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs
Brief Announcement: The MBroadcast Abstraction
On the Memory Overhead of Distributed Snapshots
Theory of BAR games
Multiple Source Replacement Path Problem
Forget him and keep on moving
The Laplacian Paradigm in the Broadcast Congested Clique
Gradient clock synchronization
Weak models of distributed computing, with connections to modal logic
GS 3 : scalable self-configuration and self-healing in wireless networks
Memory Requirements for Routing in Distributed Networks (Extended Abstract)
Majority Consensus Thresholds in Competitive Lotka-Volterra Populations
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
Optimal Message-Passing with Noisy Beeps
The Power of Multimedia: Combining Point-to Point and Multi-Access Networks
On utilizing speed in networks of mobile agents
Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract)
Brief Announcement: Robust and Scalable Renaming with Subquadratic Bits
Time-Adaptive Self Stabilization
Time versus cost tradeoffs for deterministic rendezvous in networks
Fault-Containing Self-Stabilizing Algorithms
How Should We Think about Persistent Data Structures?
Brief announcement: single-version permissive STM
Minimizing Access Costs in Replicated Distributed Syste (Abstract)
Tight RMR lower bounds for mutual exclusion and other problems
Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds
Brief Announcement: Probabilistic Dynamic Input/Output Automata
Advanced contention management for dynamic software transactional memory
Equational Reasoning About Nondeterministic Processes
Optimal Dynamic Distributed MIS
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
I2oT: Inexactness in IoT
Time-Optimal Construction of Overlay Networks
Optimal Clock Synchronization
Round and Communication Efficient Graph Coloring
Minor Excluded Network Families Admit Fast Distributed Algorithms
Flash Mixing
Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control
Asynchronous MPC with a strict honest majority using non-equivocation
The HiMAT Model for Mobile Agent Applications
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion
On the Communication Complexity of Secure Multi-Party Computation With Aborts
From Distributed Algorithms to Machine Learning and Back
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network
The Role of Data-Race-Free Programs in Recoverable DSM (Abstract)
Brief announcement: building an adaptive distributed web server system on the fly for handling web hotspots
Brief announcement: perfectly secure message transmission in directed networks re-visited
p 2 - a generic proxy platform for wireless access and mobility in CORBA
Are Shared Objects Composable under an Oblivious Adversary?
Brief Announcement: Population Protocols Are Fast
Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead
FruitChains: A Fair Blockchain
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
Simultaneous broadcast revisited
Improved distributed steiner forest construction
Brief Announcement: Beeping a Time-Optimal Leader Election
Elle: Finding Isolation Violations in Real-World Databases
Timeliness, failure-detectors, and consensus performance
From Sequential Layers to Distributed Processes: Deriving a Distributed Minimum Weight Spanning Tree Algorithm (Extended Anstract)
Brief announcement: distributed algorithmic mechanism design for scheduling
A Perspective on AN2: Local Area Network as Distributed System
Brief Announcement: What's Live? Understanding Distributed Consensus
On the power of hardware transactional memory to simplify memory management
Brief announcement: NUMA-aware transactional memory
Efficient player-optimal protocols for strong and differential consensus
Information spreading in dynamic graphs
Brief announcement: lightweight key agreement and digital certificates for wireless sensor networks
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time
Indulgent algorithms (preliminary version)
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006
Breaking the O ( n 2 ) bit barrier: scalable byzantine agreement with an adaptive adversary
The Cost of Messages
Brief Announcement: Local Independent Set Approximation
Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction
Brief announcement: implementing multi-word atomic snapshots on current hardware
Decentralization of Process Nets with Centralized Control
Reliability and performance of hierarchical RAID with multiple controllers
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
Fast Partial Distance Estimation and Applications
Brief Announcement: Space-Time Tradeoffs for Distributed Verification
An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
A jamming-resistant MAC protocol for single-hop wireless networks
Specifying Graceful Degradation in Distributed Systems
The lotus-eater attack
Simulations and reductions for colorless tasks
An Asynchronous Computability Theorem for Fair Adversaries
Competitive on-line paging strategies for mobile users under delay constraints
Universal Operations: Unary versus Binary (Extended Abstract)
On the locality of bounded growth
Colder Than the Warm Start and Warmer Than the Cold Start! Experience the Spawn Start in FaaS Providers
Brief Announcement: Discrete Incremental Voting
Structuring unreliable radio networks
A Design Methodology for Mobile Distributed Applications Based on UNITY Formalism and Communication-Closed Layering
Eventually-Serializable Data Services
Turn of the Carousel - What Does Edge Computing Change for Distributed Applications?
Distributed MIS with Low Energy and Time Complexities
Synchronous Byzantine Quorum Systems
Online set packing and competitive scheduling of multi-part tasks
A new approach to on-demand loop-free routing in ad hoc networks
Incremental Attribute Evaluation in Distributed Language-Based Environments
Brief announcement: ring-like DHTs and the postage stamp problem
On Processor Coordination Using Asynchronous Hardware
Computing Minimum Weight Cycle in the CONGEST Model
Improved All-Pairs Approximate Shortest Paths in Congested Clique
Two Classes of Communication Patterns
Scalability versus semantics of concurrent FIFO queues
Practical summation via gossip
On cost sharing mechanisms in the network design game
Anonymous and censorship resistant content sharing in unstructured overlays
Brief announcement: complexity analysis and algorithm design for pipeline configuration in distributed networks
Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write
Information dissemination on multiple channels
Failure Detectors in Omission Failure Environments
Programming models for extreme-scale computing
Brief Announcement: Linearizability: A Typo
Optimal Routing Tables
Brief Announcement: Object Oriented Consensus
Brief Announcement: Breaking the f + 1 Barrier: Executing Payment Transactions in Parallel with Less than f + 1 Validations
Transaction Commit in a Realistic Fault Model
New Opportunities for PODC?: Massive, Volatile, but Highly Predictable Resources
Unifying Self-Stabilization and Fault-Tolerance (Preliminary Version)
Efficient Bounded Timestamping from Standard Synchronization Primitives
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
Selective private function evaluation with applications to private statistics
Robust Efficient Distributed RSA-Key Generation
Memory Requirement for Universal Routing Schemes
Enabling Exclusive Shared Access to Cloud of Things Resources
GEM: A Tool for Concurrency Specification and Verification
Research Issues in Ubiquitous Computing
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008
Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
Brief Announcement: Stranger-Free Tasks
Brief announcement: branching time refinement
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks
The Landscape of Distributed Complexities on Trees and Beyond
Log-Space Polynomial End-to-End Communication (Abstract)
Asynchronous Secure Computations with Optimal Resilience (Extended Abstract)
Byzantine Agreement and Leader Election: From Classical to the Modern
Brief announcement: prefix hash tree
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, USA, August 21-24, 1997
An algorithm composition scheme preserving monotonicity
Consistency and Conformance in ODP (Abstract)
Brief announcement: an efficient failure detector for omission environments
Optimal atomic broadcast and multicast algorithms for wide area networks
Randomized Wait-Free Concurrent Objects (Extended Abstract)
Collective Consistency (Work in Progress, Abstract)
An Interaction Balance Based Approach for Autonomic Performance Management in a Cloud Computing Environment
Coded State Machine - Scaling State Machine Execution under Byzantine Faults
An Exact Characterization of the Two-shot Deterministic Objects Solving Two-process Consensus
Brief Announcement: Simple and Local Independent Set Approximation
On ad hoc routing with guaranteed delivery
A generalization of multiple choice balls-into-bins
On the Bit Complexity of Distributed Computations in a Ring with a Leader
Brief Announcement: Towards Optimal Distributed Delta Coloring
Asymptotically Optimal Algorithms For Approximale Agreement
Randomized loose renaming in O (log log n ) time
Brief announcement: a flexible framework for secret handshakes
Improving Fast Mutual Exclusion
Brief announcement: distributed algorithms for approximating wireless network capacity
LCL Problems on Grids
The Formal Verification of an ATM Network
Brief Announcement: MUSIC: Multi-Site Entry Consistencyfor Geo-Distributed Services
High performance adaptive middleware for CORBA-based systems
Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017
Issues in Distributed Control for ATM Networks
Brief announcement: on the possibility of consensus in asynchronous systems with finite average response times
Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness
Brief announcement: locality-based aggregate computation in wireless sensor networks
Early stopping in aglobal data computation
Sublinear-Time Sampling of Spanning Trees in the Congested Clique
Randomized Proof-Labeling Schemes
Bounding the locality of distributed routing algorithms
Anti-Omega: the weakest failure detector for set agreement
Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract)
Strongly Linearizable LL/SC from CAS
Distributed House-Hunting in Ant Colonies
Adaptive resilient routing via preorders in SDN
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets
Brief Announcement: Holistic Verification of Blockchain Consensus
Building secure file systems out of Byzantine storage
Self-stabilizing counting in mobile sensor networks
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time
Brief announcement: all-to-all gradecast using coding with byzantine failures
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
Strong-Diameter Network Decomposition
Oracle size: a new measure of difficulty for communication tasks
Brief announcement: on enhancing concurrency in distributed transactional memory
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
Delay-Optimal Quorum-Based Mutual Exclusion for Distributed Systems
Detection of Stable Properties in Distributed Applications
Resource Discovery in Distributed Networks
Distance estimation and object location via rings of neighbors
On the Amortized Communication Complexity of Byzantine Broadcast
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
Distributed Match-Making for Processes in Computer Networks (Preliminary Version)
Space-optimal multi-writer snapshot objects are slow
Fast Asynchronous Byzantine Agreement (Extended Abstract)
Reductions and Extension-Based Proofs
Automatically Increasing the Fault-Tolerance of Distributed Systems
2022 Principles of Distributed Computing Doctoral Dissertation Award
A Sequencing Service for Group Communication (Abstract)
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
Multi-message broadcast with abstract MAC layers and unreliable links
Distributed MST for constant diameter graphs
Low-Congestion Shortcuts without Embedding
Contention-free Complexity of Shared Memory Algorithms
A Hierarchy of Temporal Properties (Abstract)
Competitive concurrent distributed queuing
Quorum placement in networks to minimize access delays
Brief announcement: efficient perfectly secure communication over synchronous networks
Consensus and collision detectors in wireless Ad Hoc networks
Improved sparse covers for graphs excluding a fixed minor
Optimal inter-object correlation when replicating for availability
Game Dynamics and Equilibrium Computation in the Population Protocol Model
Improved Algorithms for Distributed Resource Allocation
The Akamai approach to achieving performance and reliability on the internet
Closing the complexity gap between mutual exclusion and FCFS mutual exclusion
Proof labeling schemes
k -Stabilization of Reactive Tasks
On the complexity of asynchronous agreement against powerful adversaries
Transactional memory for a modern microprocessor
Bayesian ignorance
Resilience of mutual exclusion algorithms to transient memory faults
Brief announcement: cluster-based control mechanism for communication networks
Brief Announcement: Labeling Schemes for Power-Law Graphs
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
Disentangling Multi-Object Operations (Extended Abstract)
Asynchronous failure detectors
Reconfigurable Atomic Transaction Commit
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
Efficient Detection of Corrupted Pages in a Replicated File (Preliminary Report)
Byzantine renaming in synchronous systems with t<N
Virtual infrastructure for collision-prone wireless networks
Pragmatic primitives for non-blocking data structures
A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols
Lower bounds for local approximation
Recoverable Mutual Exclusion: [Extended Abstract]
A complexity separation between the cache-coherent and distributed shared memory models
A Predicate Transformer Approach to Semantics of Parallel Programs
2019 Edsger W. Dijkstra Prize in Distributed Computing
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Expansion and the cover time of parallel random walks
On the Power of Quantum Distributed Proofs
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors
The Global Time Assumption and Semantics for Concurrent Systems
Brief announcement: fair maximal independent sets in trees
Distributed algorithms for edge dominating sets
A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]
All Byzantine Agreement Problems Are Expensive
How to withstand mobile virus attacks, revisited
Efficient Deterministic Distributed Coloring with Small Bandwidth
Scalable public-key tracing and revoking
PCODE: Efficient Parallel Computing over Distributed Environments
Efficient atomic broadcast using deterministic merge
Brief announcement: on minimum interaction time for continuous distributed interactive computing
Towards migrating computation to distributed memory caches
Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties
Probabilistic Byzantine Fault Tolerance
Facility location: distributed approximation
The Fractional Spending Problem: Executing Payment transactions in parallel with less than f +1 validations
String realizers of posets with applications to distributed computing
The future of distributed computing: renaissance or reformation?
The Sound of Silence - Guessing Games for Saving Energy in Mobile Environment
Configurations: a model for distributed data storage
Observable Clock Synchronization (Extended Abstract)
What Processes Know: Definitions and Proof Methods (Preliminary Version)
A New Fault-Tolerant Algorithm for Clock Synchronization
Self-Stabilization by Counter Flushing
The LATEX legacy: 2.09 and all that
Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
Optimal Distributed Covering Algorithms
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, Toronto, Ontario, Canada, August 15-17, 1988
Practical private computation of vector addition-based functions
Brief announcement: scalable anonymous communication with byzantine adversary
Scheduling in Client-Server Systems (Abstract)
Keynote: Disaggregated Memory and the Revival of Memory Research
Irreducibility and additivity of set agreement-oriented failure detector classes
Load balancing without regret in the bulletin board model
Brief announcement: virtual world consistency: a new condition for STM systems
Brief announcement: communication efficient asynchronous byzantine agreement
Perfectly-secure Network-agnostic MPC with Optimal Resiliency
Fair group mutual exclusion
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Compact Distributed Certification of Planar Graphs
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm
Brief Announcement: Self-Stabilizing Recoverable Mutual Exclusion
Consensus with an abstract MAC layer
The Balanced Sorting Network
Brief announcement: minimal system conditions to implement unreliable failure detectors
Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics
Software-defined consistency group abstractions for virtual machines
An O (1) RMRs leader election algorithm
Fast deterministic consensus in a noisy environment
Selfish caching in distributed systems: a game-theoretic analysis
Compact routing for average-case networks
A Graph Theoretic Approach for Resilient Distributed Algorithms
Optimal Reactive k -Stabilization: The Case of Mutual Exclusion
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
Inexact Agreement: Accuracy, Precision, and Graceful Degradation
Distributed network monitoring and multicommodity flows: a primal-dual approach
Century papers at the first quarter-century milestone
Efficient revocation and threshold pairing based cryptosystems
Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model
Liveness-Preserving Simulation Relations
Optimal Allocation of Electronic Contect in Networks
Adaptively Secure Computation with Partial Erasures
Using Belief to Reason about Cache Coherence
Efficient Distributed Recovery Using Message Logging
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]
How Asynchrony Affects Rumor Spreading Time
Dynamic service assignment in mobile networks: the magma approach
Drone-Truck Cooperated Delivery Under Time Varying Dynamics
Optimal, Distributed Decision-Making: The Case of no Communication
2018 Doctoral Dissertation Award
Time-Optimal Self-Stabilizing Leader Election in Population Protocols
Refining Knowledge Oriented Actions to Layered Implementations
Self-Stabilization by Window Washing
A Closer Look at Detectable Objects for Persistent Memory
Time- and Space-Efficient Randomized Consensus
How Fast Reads Affect Multi-Valued Register Simulations
Detecting Termination of Distributed Computations Using Markers
SINR diagrams: towards algorithmically usable SINR models of wireless networks
Brief announcement: leader election vs pattern formation
Achieving Independence in Logarithmic Number of Rounds
Asynchronous convex hull consensus in the presence of crash faults
k-set agreement with limited accuracy failure detectors
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique
Sharing is harder than agreeing
Broadcast Extensions with Optimal Communication and Round Complexity
Computation in networks of passively mobile finite-state sensors
Nearly optimal FIFO buffer management for DiffServ
Brief announcement: reconfigurable byzantine-fault-tolerant atomic memory
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient
Lock-Free Linked Lists Using Compare-and-Swap
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms
An Algorithm for Message Delivery to Mobile Units
Incentive-compatible distributed greedy protocols
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Message-Optimal Protocols for Byzantine Agreement (Extended Abstract)
Towards the Impact of Design Flaws on the Resources Used by an Application
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
Brief announcement: Cataclysm: handling extreme overloads in internet services
The Weakest Failure Detector for Solving Consensus
Brief announcement: linial's lower bound made easy
Byzantine disk paxos: optimal resilience with byzantine shared memory
The Price of being Adaptive
When is Recoverable Consensus Harder Than Consensus?
HotStuff: BFT Consensus with Linearity and Responsiveness
System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models
Inconsistency and Contamination (Preliminary Version)
Policy-hiding access control in open environment
Space-Efficient Construction of Buffer-Optimal 1-Writer 1-Reader Multivalued Atomic Variable (Abstract)
A Shared Archive of Snapshots
Optimized VM memory allocation based on monitored cache hit ratio
Searching for a black hole in arbitrary networks: optimal mobile agent protocols
All You Need is DAG