yusuke1997/dblp-id-title huggingface dataset:
Brief Announcement: Secure Self-Stabilizing Computation
Feedback from nature: an optimal distributed algorithm for maximal independent set selection
B-neck: a distributed and quiescent max-min fair algorithm
Using Performance Forecasting to Accelerate Elasticity
Complexity tradeoffs for read and update operations
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
Tight Bounds on Channel Reliability via Generalized Quorum Systems
The Energy Complexity of Broadcast
Our brothers' keepers
Maintaining Authenticated Communication in the Presence of Break-ins
From Serializable to Causal Transactions (Abstract)
Mobile proactive secret sharing
On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems
On the design of distributed protocols from differential equations
Brief announcement: distributed phase synchronization of dynamic set of processes
Deriving Optimal Checkpoint Protocols for Distributed Shared Memory Architectures (Abstract)
Optimal Eventual Byzantine Agreement Protocols with Omission Failures
Performance Issues in Non-blocking Synchronization on Shared-memory Multiprocessors
A Local Constant Factor MDS Approximation for Bounded Genus Graphs
Eclecticism shrinks even small worlds
How to meet asynchronously at polynomial cost
Optimizing data popularity conscious bloom filters
What Critical Algebraic Property Allows Operations of Concurrent Abstract Data Types to be Fast? (Brief Announement)
Coordination Without Prior Agreement
Stochastic Coordination in Heterogeneous Load Balancing Systems
Signed quorum systems
Composite Registers
Early-deciding consensus is expensive
Forbidden-set distance labels for graphs of bounded doubling dimension
What cannot be computed locally!
On the Decidability of Distributed Decision Tasks (Brief Announcement)
Distributed churn measurement in arbitrary networks
1/k phase stamping for continuous shared data (extended abstract)
Adaptive Resource Management and Scheduling for Cloud Computing - First International Workshop, ARMS-CC 2014, held in Conjunction with ACM Symposium on Principles of Distributed Computing, PODC 2014, Paris, France, July 15, 2014, Revised Selected Papers
Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks
Asynchronous Byzantine Approximate Consensus in Directed Networks
A fast distributed slicing algorithm
Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract)
Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency
Brief Announcement: Strong and Hiding Distributed Certification of k -Coloring
Synthesis of Distributed Control Systems (Abstract)
Stability of a peer-to-peer communication system
A New Way to Achieve Round-Efficient Byzantine Agreement
Tight Trade-off in Contention Resolution without Collision Detection
Bringing order to BGP: decreasing time and message complexity
Optmial plans for aggregation
Computing Anonymously with Arbitrary Knowledge
Distributed algorithms for ultrasparse spanners and linear size skeletons
Detecting Stable Properties of Networks in Concurrent Logic Programming Languages
Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems
Exploitng event stream interpretation in publish-subscribe systems
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Scheduling tasks with dependencies on asymmetric multiprocessors
Brief announcement: a method for exchanging valuable data: how to realize matching oblivious transfer
Cassandra: structured storage system on a P2P network
A Distributed Transaction Processing Protocol Based on Majority Consensus
Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks: invited paper
Complete Implementations for Shared Memory Consistency Conditions (Abstract)
Brief announcement: concurrent maintenance of rings
On Serializability of Iterated Transactions
Brief announcement: network traffic can optimize consolidation during transformation to virtualization
ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014
2022 Edsger W. Dijkstra Prize in Distributed Computing
Ant-Inspired Density Estimation via Random Walks: Extended Abstract
A note on group mutual exclusion
Substituting for Real Time and Common Knowledge in Asynchronous Distributed Systems
Non-blocking binary search trees
Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio
Distributed Algorithms for Ensuring Fair Interprocess Communications
Parsimonious flooding in dynamic graphs
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
Disjoint-Access Parallelism: Impossibility, Possibility, and Cost of Transactional Memory Implementations
Constant RMR solutions to reader writer synchronization
Distributed graph coloring in a few rounds
Minimal replication cost for availability
Brief Announcement: Routing the Internet with Very Few Entries
On maintaining multiple versions in STM
Distributed MST and Routing in Almost Mixing Time
A Formal Model of Knowledge, Action, and Communication in Distributed Systems: Preliminary Report
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Brief announcement: modelling MapReduce for optimal execution in the cloud
Asynchronous Group Mutual Exclusion (Extended Abstract)
Brief Announcement: Communication-Optimal Convex Agreement
Half-Order Modal Logic: How to Prove Real-Time Properties
Logical Clocks Are Not Fair: What Is Fair?
Failure Detectors and the Wait-Free Hierarchy
Routing networks for distributed hash tables
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST
Brief announcement: weakest failure detectors via an egg-laying simulation
Analyzing Contention and Backoff in Asynchronous Shared Memory
How to meet when you forget: log-space rendezvous in arbitrary graphs
Brief announcement: live streaming with utilities, quality and cost
Recoverable Mutual Exclusion Under System-Wide Failures
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
Fast Distributed Agreement (Preliminary Version)
Brief announcement: veto number and the respective power of eventual failure detectors
Distributed algorithms for the Lovász local lemma and graph coloring
Proactive secure message transmission in asynchronous networks
Fault Tolerant Distributed Services
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Optimally efficient multi-valued byzantine agreement
Data Distribution Method for Fast Giga-scale Hologram Generation on a Multi-GPU Cluster
Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract)
Benchmarking OpenCL, OpenACC, OpenMP, and CUDA: Programming Productivity, Performance, and Energy Consumption
Compact routing on euclidian metrics
Seeing is Believing: A Client-Centric Specification of Database Isolation
Working with mike on distributed computing theory, 1978--1992
X-ability: a theory of replication
Squirrel: a decentralized peer-to-peer web cache
Limitations on Database Availability when Networks Partition
Session details: Session 3A: Congest
Brief announcement: PUSH, a DISC shell
The Virtual Path Layout Problem in Fast Networks (Extended Abstract)
The Space Complexity of Scannable Binary Objects
Strongly linearizable implementations: possibilities and impossibilities
A Framework for Speculative Scheduling and Device Selection for Task Execution on a Mobile Cloud
The Offset Problem (Abstract)
Revisiting Optimal Resilience of Fast Byzantine Consensus
Making evildoers pay: resource-competitive broadcast in sensor networks
On the (limited) power of non-equivocation
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
3-Majority and 2-Choices with Many Opinions
Brief announcement: tree decomposition for faster concurrent data structures
Upper bound on the complexity of solving hard renaming
A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem
Timed Consistency for Shared Distributed Objects
Byzantine Clock Synchronization
Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits
Compact roundtrip routing with topology-independent node names
Resettable vector clocks
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers
Stably computable predicates are semilinear
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007
Brief announcement: global consistency can be easier than point-to-point communication
Designing Algorithms for Distributed Systems with Partially Synchronized Clocks
Uniform Deployment of Mobile Agents in Asynchronous Rings
Memory Space Requirements for Self-Stabilizing Leader Election Protocols
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
Balanced binary trees for ID management and load balance in distributed hash tables
Symmetry Breaking with Noisy Processes
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001
Scheduling sensors by tilinglattices
On the hardness and approximation of minimum topic-connected overlay
Local Computation Algorithms
Tradeoffs for Selection in Distributed Networks (Preliminary Version)
Brief announcement: Stateless distributed algorithms for generalized packing linear programs
Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries
Low-Congestion Shortcuts in Constant Diameter Graphs
Transactional Lock Elision Meets Combining
Brief Announcement: Multi-Broadcasting under the SINR Model
Deterministic Digital Clustering of Wireless Ad Hoc Networks
When graph theory helps self-stabilization
CCS Expressions, Finite State Processes, and THree Problems of Equivalence
Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe
Probabilistic Solitude Verification on a Ring
Auditing without Leaks Despite Curiosity
Self-organized Segregation on the Grid
On Distributed Object Checkpointing and Recovery
Distributed discovery of large near-cliques
Data Link Layer: Two Impossibility Results
Fast and Exact Majority in Population Protocols
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks
Automatic Verification of Liveness Properties of Randomized Systems
Distributed Uniformity Testing
Trinity: distributed defense against transient spam-bots
Contention Resolution with Predictions
Digital Epidemiology and Beyond
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
Compute on the Go: A Case of Mobile-Cloud Collaborative Computing Under Mobility
A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract)
Efficient Schemes for Parallel Communication
A middleware overview: goals, research issues, and coded examples (abstract)
Brief announcement: on the resilience of routing tables
Search via Parallel Lévy Walks on Z2
Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement
Long-Lived Renaming Made Adaptive
Scheduling at the Edge for Assisting Cloud Real-Time Systems
Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination
Brief Announcement: Sustainable Blockchains through Proof of eXercise
Faster information dissemination in dynamic networks via network coding
Brief announcement: deterministic dominating set construction in networks with bounded degree
Verification of Multiprocess Probabilistic Protocols
Atomicity in Electronic Commerce
The communication complexity of distributed task allocation
Resource Bounds for Self Stabilizing Message Driven Protocols
Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems
Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment
Brief Announcement: Improved Consensus in Quantum Networks
An Optimal Synchronizer for the Hypercube
Tight bounds for delay-sensitive aggregation
Fault-Tolerant Clock Synchronization
On the complexity of greedy routing in ring-based peer-to-peer networks
Resource Bounds and Combinations of Consensus Objects
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing
A Calculus for Concurrent Update (Abstract)
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
Brief announcement: continuous containment and local stabilization in path-vector routing
A New Look at Membership Services (Extended Abstract)
The Consensus Hierarchy Is Not Robust
Tight Bounds for Weakly Bounded Protocols
Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
On the locality of distributed sparse spanner construction
Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle
Can Message Buffers be Characterized in Linear Temporal Logic?
A network pricing game for selfish traffic
Fault-tolerant spanners: better and simpler
Fast distributed random walks
Brief announcement: the synchronous condition-based consensus hierarchy
Set-Linearizability
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC '98, Puerto Vallarta, Mexico, June 28 - July 2, 1998
Verification Engineering: A Future Profession (A. M. Turing Award Lecture)
Brief announcement: deaf, dumb, and chatting robots
Brief announcement: asynchronous bounded expected delay networks
Vertical paxos and primary-backup replication
Computing Shortest Paths and Diameter in the Hybrid Network Model
A Technique for Partial Broadcasting in Networks (Abstract)
Barriers due to Congestion and Two Ways to Deal With Them
Predicates are Predicate Transformers: A Unified Compositional Theory for Concurrency
An Algorithm for Replicated Directories
The Intractability of Bounded Protocols for Non-FIFO Channels
Concurrent Programming For The Masses (PODC 1984 Invited Address)
Broadcast with Partial Knowledge (Preliminary Version)
A Recognize-and-Accuse Policy to Speed up Distributed Processes
Improved compact routing schemes for dynamic trees
Multimedia Networking: Applications and Challenges
Distributed selfish load balancing with weights and speeds
Extracting models from design documents with mapster
On the Complexity of Distributed Splitting Problems
Specification and Complexity of Collaborative Text Editing
Comparison Dynamics in Population Protocols
From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good
A Framework for Distributed Quantum Queries in the CONGEST Model
How Emerging Memory Technologies Will Have You Rethinking Algorithm Design
Cost-Sensitive Analysis of Communication Protocols
Lamport on mutual exclusion: 27 years of planting seeds
Matching Events in a Content-Based Subscription System
Brief announcement: optimal self-stabilizing multi-token ring: a randomized solution
LOTEC: A Simple DSM Consistency Protocol for Nested Object Transactions
A Checkpoint Protocol for an Entry Consistent Shared Memory System
Round- and Message-Optimal Distributed Graph Algorithms
QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator
Compact routing schemes with improved stretch
The price of anarchy in network creation games
The Greedy Spanner is Existentially Optimal
A Technique for Proving Liveness of Communicating Finite State Machines with Examples
Secure Distributed Computing Made (Nearly) Optimal
Brief announcement: efficient clustering in unstructured radio networks
Distributed public key schemes secure against continual leakage
Discrete load balancing is (almost) as easy as continuous load balancing
Faster communication in known topology radio networks
Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
DARTS: Distributed IoT Architecture for Real-Time, Resilient and AI-Compressed Workflows
Scalable Best Matching Prefix Lookups
Fast Distributed Almost Stable Matchings
Efficient Solutions to the Replicated Log and Dictionart Problems
A Little Knowledge Goes a Long Way: Simple Knowledge-based Derivations and Correctness Proofs for a Family of Protocols
Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary
Asynchronous exclusive selection
Layering Data Structures over Skip Graphs for Increased NUMA Locality
From anarchy to geometric structuring: the power of virtual coordinates
Recent Trends in Experimental Operating Systems Research
Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication
Establishing wireless conference calls under delay constraints
On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract
On-the-fly Deadlock Prevention
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Brief Announcement: Noisy Beeping Networks
A Dynamic Self-Stabilizing Algorithm for Finding Strongly Connected Components
Fail-Awareness in Timed Asynchronous Systems
Sustaining collaboration in multicast despite rational collusion
Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret
On beyond registers: wait-free readable objects
Brief announcement: maintaining large dense subgraphs on dynamic networks
A highly concurrent group mutual /-exclusion algorithm 0
Brief Announcement: Distributed Single-Source Reachability
SLA-Driven Simulation of Multi-Tenant Scalable Cloud-Distributed Enterprise Information Systems
On the inherent weakness of conditional synchronization primitives
Fault-Tolerant Labeling and Compact Routing Schemes
Synchronization and Recovery of Actions
Sparse communication networks and efficient routing in the plane (extended abstract)
Brief Announcement: Classification of Distributed Binary Labeling Problems
A formal treatment of an abstract channel implementation using java sockets and TCP
Efficient Deterministic Leader Election for Programmable Matter
UIDS as Internal Names in a Distributed File System
Universal Service-Providers for Database Private Information Retrieval (Extended Abstract)
Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words
Network synchronization and localization based on stolen signals
Dynamic Hashing + Quorum = Efficient Location Management for Mobile Computing Systems
Relays: Towards a Link Layer for Robust and Secure Fog Computing
Algebraic Spans (Preliminary Version)
Brief announcement: brokerage and closure in a strategic model of social capital
A Lower Bound on the Local Time Complexity of Universal Constructions
Every problem has a weakest failure detector
(Δ+1) Vertex Coloring in O ( n ) Communication
Keynote: Time is not a Healer: Before and After
Supporting Quality of Service in HTTP Servers
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Distributed Priority Algorithms Under One-Bit-Delay Constraints
Tracking distributed aggregates over time-based sliding windows
Gossip in a Smartphone Peer-to-Peer Network
Brief announcement: extending SQL access control to derived and distributed data
Implementing Mediators with Asynchronous Cheap Talk
Distributed Symmetry Breaking on Power Graphs via Sparsification
A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time
A world of (Im) possibilities
Strongly Linearizable Implementations of Snapshots and Other Types
Efficient reliable communication over partially authenticated networks
Fast flooding over Manhattan
An Algorithm for Replicated Objects with Efficient Reads
Sticks and stones: a coding scheme for parameterized verification
Timeliness-based wait-freedom: a gracefully degrading progress condition
Balancing energy consumption for uniform data gathering wireless sensor networks
Brief announcement: abstractions for implementing atomic objects in dynamic systems
Prediction Based Task Scheduling in Distributed Computing (Abstract)
Sparse Semi-Oblivious Routing: Few Random Paths Suffice
Brief Announcement: Fast and Gas-efficient Private Sealed-bid Auctions
Highly dynamic distributed computing with byzantine failures
Fork-consistent constructions from registers
Distributed algorithms in TLA (abstract)
Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings
Delimiting the Power of Bounded Size Synchronization Objects (Extended Abstract)
Brief Announcement: Computing in the Presence of Weak Crash Failures
On the Power of Shared Object Types to Implement One-Resilient Consensus
Brief announcement: polygonal broadcast, secret maturity and the firing sensors
Using Broadcast Primitives in Replicated Databases (Abstract)
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms
Understanding and Using Asynchronous Message Passing (Preliminary Version)
An RLS Memory-based Mechanism for the Automatic Adaptation of VMs on Cloud Environments
Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs
How to Withstand Mobile Virus Attacks (Extended Abstract)
Session details: Session 2B: Routing and Leader Election
Collaborative search on the plane without communication
Cloud Elasticity: going beyond demand as user load
Distributed MIS via All-to-All Communication
Distributed connectivity decomposition
On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement)
Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks
Optimal Space Distributed Move-to-Front Lists
Distributed Self-Stabilizing MIS with Few States and Weak Communication
Brief Announcement: Active Information Spread in Networks
Fault-tolerant routing in peer-to-peer systems
Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms
Reliable Message Delivery and Conditionally-Fast Transactions are not Possible Without Accurate Clocks
Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
Improvements in the Time Complexity of Two Message-Optimal Election Algorithms
Broadcasting in unreliable radio networks
Nonatomic mutual exclusion with local spinning
Brief announcement: the accuracy of tree-based counting in dynamic networks
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009
A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems
Distributed algorithms for barrier coverage using relocatable sensors
Brief announcement: the price of anarchy for distributed network formation in an adversary model
Toward a theory of maximally concurrent programs (shortened version)
Proceedings of the 2017 Workshop on Adaptive Resource Management and Scheduling for Cloud Computing, ARMS-CC@PODC 2017, Washington, DC, USA, July 28, 2017
Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract
MST in Log-Star Rounds of Congested Clique
Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up
How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality
A Theory of Relaxed Atomicity (Extended Abstract)
Iterative approximate byzantine consensus in arbitrary directed graphs
Dynamic routing and location services in metrics of low doubling dimension
Concurrent updates with RCU: search tree as an example
One Bit Algorithms