yusuke1997/dblp-id-title huggingface dataset:
Brief announcement: optimization based rate allocation for application layer multicast
Brief announcement: monotonic stabilization
Optimal-time adaptive strong renaming, with applications to counting
Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks
Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives
Rapid randomized pruning for fast greedy distributed algorithms
Brief announcement: concurrent non-commutative boosted transactions
A Quantitative Approach to Dynamic Networks
PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022
Reasoning About Networks With Many Identical Finite-State Processes
The Power of Multi-objects (Extended Abstract)
Brief announcement: efficient implementation of a byzantine data storage system
Separating Lock-Freedom from Wait-Freedom
On the robustness of (semi) fast quorum-based implementations of atomic shared memory
A Distributed Algorithm for Generalized Deadlock Detection
Fast scalable deterministic consensus for crash failures
Randomness in Private Computations
Geometrically aware communication in random wireless networks
PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021
New techniques to curtail the tail latency in stream processing systems
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
The Unified Structure of Consensus: A Layered Analysis Approach
Efficient Token-Based Control in Rings (Abstract)
Brief announcement: are lock-free concurrent algorithms practically wait-free?
K-set agreement bounds in round-based models through combinatorial topology
Max registers, counters, and monotone circuits
Communication in dynamic radio networks
Distributed connectivity of wireless networks
Observing Self-Stabilization
Towards Optimal Deterministic LOCAL Algorithms on Trees
A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract)
Dynamic Voting for Consistent Primary Components
Efficient Deadlock-Free Routing
An analysis of intention preservation in group editors
Passing Messages while Sharing Memory
A Model and Proof System for Asynchronous Networks
An Omega ( n log n ) lower bound on the cost of mutual exclusion
Computing on an Anonymous Ring
Evaluating Quorum Systems Over the Internet (Abstract)
The multiplicative power of consensus numbers
Blockchains and the Future of Distributed Computing
Sticky Bits and Universality of Consensus
Introducing speculation in self-stabilization: an application to mutual exclusion
Efficient Communication in Cognitive Radio Networks
A Roadmap To Post-Moore Era for Distributed Systems
Brief announcement: improving social-network-based sybil-resilient node admission control
Failure detectors are schedulers
Stabilizing Algorithms for Diagnosing Crash Failures
Erasure Coding in Object Stores: Challenges and Opportunities
Brief announcement: From sequential to concurrent: correctness and relative efficiency
Brief announcement: ART--sub-logarithmic decentralized range query processing with probabilistic guarantees
Distributed Averaging in Opinion Dynamics
Knowledge, Timed Precedence and Clocks (Preliminary Report)
Proving Time Bounds for Randomized Distributed Algorithms
A hierarchy of conditions for consensus solvability
Randomized shared queues
A nonblocking set optimized for querying the minimum value
From Classical to Blockchain Consensus: What Are the Exact Algorithms?
The cost of radio network broadcast for different models of unreliable links
A Fault-Tolerant Dynamic Resource Allocation Algorithm (Short Abstract)
Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling
Estimation for monotone sampling: competitiveness and customization
Reliable Communication over Highly Connected Noisy Networks
Fast Concurrent Data Sketches
The Space Requirement of Local Forwarding on Acyclic Networks
Lower bounds for randomized consensus under a weak adversary
Distributed consensus in the presence of sectional faults
How much does randomness help with locally checkable problems?
Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel Networks
Distributed Version Management for Read-Only Actions (Extended Abstract)
DSB-SEIS: a deduplicating secure backup system with encryption intensity selection
Common2 extended to stacks and unbounded concurrency
Ignore or Comply?: On Breaking Symmetry in Consensus
Exploiting precision vs. efficiency tradeoffs in symmetric replication environments
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks
On the interconnection of causal memory systems
Secure communication over radio channels
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract)
Strong-Feasibilities of Equivalence-Completions
The weakest failure detector to solve nonuniform consensus
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Toward an optimal social network defense against Sybil attacks
Diversity, Fairness, and Sustainability in Population Protocols
Brief Announcement: Fast Atomic Snapshot and Asynchronous Latency
Scalable rational secret sharing
A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract)
Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract)
Stateless Computation
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
An almost non-blocking stack
Message Optimality and Message-Time Trade-offs for APSP and Beyond
Distributed broadcasting and mapping protocols in directed anonymous networks
Adaptive AIMD congestion control
Compact routing with slack in low doubling dimension
Distributed averaging in the presence of a sparse cut
The Inherent Cost of Nonblocking Commitment
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage
Brief Announcement: A Family of Leaderless Generalized-Consensus Algorithms
Randomized Byzantine Agreements
Algorithms for dynamic multicast key distribution trees
Constant phase efficient protocols for secure message transmission in directed networks
Distributed Edge Coloring in Time Polylogarithmic in Δ
Data Summarization and Distributed Computation
The power of simulation relations
Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair
Verifiable Outsourced Computation: A Survey
Active Client Primary-Backup Protocols (Abstract)
On the Relation between Bit Delay for Slot Reuse and the Number of Address Bits in the Dual Bus Configuration (Brief Announcement)
On the time and space complexity of randomized test-and-set
Clock synchronization with faults and recoveries (extended abstract)
You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processes
Optimal implementation of the weakest failure detector for solving consensus (brief announcement)
Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?
What's a little collusion between friends?
A Recursive Early-Stopping Phase King Protocol
Requirements for Deadlock-Free, Adaptive Packet Routing
Fast and compact self stabilizing verification, computation, and fault detection of an MST
f -arrays: implementation and applications
Brief announcement: efficient optimally resilient statistical AVSS and its applications
Finding mobile data under delay constraints with searching costs
Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model
Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions
Debugging distributed programs using controlled re-execution
Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract)
Securing social networks
Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks
Load balancing and locality in range-queriable data structures
Universal constructions that ensure disjoint-access parallelism and wait-freedom
Towards the minimal synchrony for byzantine consensus
Brief announcement: (more) efficient pruning of ad-hoc wireless networks
Distributed Approximation of Maximum Independent Set and Maximum Matching
Integrated Support Environment for Concurrent Process Calculi
Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract)
Model checking transactional memory with spin
Brief announcement: the design of an internet-scale monitoring and assertion-checking infrastructure
Impact of Virtual Machines Heterogeneity on Data Center Power Consumption in Data-Intensive Applications
Approximate Byzantine Fault-Tolerance in Distributed Optimization
Brief announcement: distributed almost stable marriage
Proceedings of the Third International Workshop on Adaptive Resource Management and Scheduling for Cloud Computing, ARMS-CC@PODC 2016, Chicago, IL, USA, July 25-28, 2016
Optimal gradient clock synchronization in dynamic networks
Distributed Spanner Approximation
Distributed approximate matching
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes
Lower Bounds for Convergence Function Based Clock Synchronization
Using Mappings to Prove Timing Properties
Proving Safety and Liveness of Communicating Processes with Examples
Massively Parallel Algorithms for Minimum Cut
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators
Brief announcement: on the expected overpayment of VCG mechanisms in large networks
Brief announcement: the theory of network tracing
Verifying distributed erasure-coded data
Brief announcement: Super-fast t-ruling sets
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols
On the Validity of Consensus
Lower bound for scalable Byzantine Agreement
A Consistent History Link Connectivity Protocol
Real-Time Programming and Asynchronous Message Passing
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
Language Concepts for Distributed Processing of Large Arrays
Anonymous networks: randomization = 2-hop coloring
Asymptotically Optimal Validated Asynchronous Byzantine Agreement
Leader election in shared spectrum radio networks
Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols
Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version)
Message Reduction in the LOCAL Model is a Free Lunch
Distributed multi-broadcast in unknown radio networks
Distributing the setup in universally composable multi-party computation
Session details: Session 3D: Graphs and Population
Bandwidth-Aware Resource Optimization for SMT Processors
Brief announcement: name-independent compact routing in trees
Distributed error confinement
Distributed Dynamic Channel Allocation for Mobile Computing
Clock Distribution with Gradient TRIX
Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract)
The universe of symmetry breaking tasks
Brief announcement: realizing secure multiparty computation on incomplete networks
Non-blocking steal-half work queues
Easy Impossibility Proofs for Distributed Consensus Problems
Fast fault-tolerant agreement algorithms
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions
On the Time and Space Complexity of ABA Prevention and Detection
Near-Optimal Distributed Maximum Flow: Extended Abstract
The stretched exponential distribution of internet media access patterns
The flip markov chain and a randomising P2P protocol
The Impact of Synchronization on the Session Problem
A View-Based Approach to Relaxing Global Serializability in a Multidatabase System (Abstract)
d -clock: distributed QoS in heterogeneous resource environments
Dynamic Sets for Search
How Processes Learn
A lattice-theoretic characterization of safety and liveness
Epidemic Algorithms for Replicated Database Maintenance
On perfectly secure cmmunication over arbitrary networks
Efficient distributed random walks with applications
Oblivious signature-based envelope
Rational Consensus: Extended Abstract
Triangle Finding and Listing in CONGEST Networks
Computing almost shortest paths
Brief announcement: minimum spanning trees and cone-based topology control
Refined quorum systems
Density-Dependent Graph Orientation and Coloring in Scalable MPC
Coloring unstructured wireless multi-hop networks
Cloud Services Composition Through Cloud Patterns
Leader Election in Well-Connected Graphs
Eventually linearizable shared objects
Fundamental Challenges in Mobile Computing
Session details: Session 2C: Security, Blockchains, and Replication
Correctness Conditions for Highly Available Replicated Databases
Randomized Parallel Communication (Preliminary Version)
A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract)
Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?
Towards fast decentralized construction of locality-aware overlay networks
Computing separable functions via gossip
Brief Announcement: Hierarchical Consensus
Sequential composition of protocols without simultaneous termination
Randomized mutual exclusion in O(log N / log log N) RMRs
Repeatable and Portable Message-Passing Programs
Space-Optimal Wait-Free Queues
Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack Protocols
Improving validity of query answering in dynamic systems
Time-decaying sketches for sensor data aggregation
On Information Complexity in the Broadcast Model
Dynamic packet scheduling in wireless networks
Session details: Session 2A: Approximation and Learning
Consensus in the Presence of Partial Synchrony (Preliminary Version)
Cloud live streaming System based on Auto-adaptive Overlay for Cyber Physical Infrastructure
Wait-Free Solvability Via Combinatorial Topology (Abstract)
Practical Uses of Synchronized Clocks in Distributed Systems
Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents
Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed
Distributed Resource Discovery in Sub-Logarithmic Time
The ABCD's of Paxos
Brief announcement: an incremental algorithm for calculation of backup-paths in link-state networks
Communication-Time Trade-Offs in Network Synchronization
Baked Potatoes: Deadlock Prevention Via Scheduling (Abstract)
Load Balancing Networks (Abstract)
Trust your social network according to satisfaction, reputation and privacy
The complexity of updating multi-writer snapshot objects
Using Process Groups to Implement Failure Detection in Asynchronous Environments
Fault-Local Distributed Mending (Extended Abstract)
Early-Delivery Atomic Broadcast
On the Classification of Deterministic Objects via Set Agreement Power
On Using Time Without Clocks via Zigzag Causality
Solved Problems, Unsolved Problems and Non-Problems in Concurrency (Invited Address)
Refining the way to consensus
An Efficient Adaptive Partial Snapshot Implementation
Time-Optimal Message-Efficient Work Performance in the Presence of Faults (Extended Summary)
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
Computing with Faulty Shared Memory (Extended Abstract)
Weighted Matchings via Unweighted Augmentations
Knowledge, Probability, and Adversaries
Tight Bounds for Asymptotic and Approximate Consensus
A closer look at fault tolerance
More on t-Resilience vs. Wait-Freedom (Extended Abstract)
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
On Parallel Searching (Extended Abstract)
On the Use of Randomness in Local Distributed Graph Algorithms
A Framework for Protocol Composition in Horus
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach
Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes
Adaptively secure broadcast, revisited
A Predicate Transformer Approach to Knowledge and Knowledge-Based Protocols (Extended Abstract)
Session details: Session 1A: Persistent Memory
Quorum Consensus in Nested Transaction Systems
Error-free multi-valued consensus with byzantine failures
Algebraic Methods in the Congested Clique
Self-Stabilizing Leader Election
Reconstructing approximate tree metrics
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 17-19, 1983
Maintenance of a Spanning Tree in Dynamic Networks
MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory
Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
Locally checkable proofs
Hardness of Minimal Symmetry Breaking in Distributed Computing
How Useful Is Old Information? (Extended Abstract)
Brief Announcement: Using Detectability to Simplify the Design of Concurrent Algorithms for Persistent Memory
Trading Fences with RMRs and Separating Memory Models
On a capacitated multivehicle routing problem
Parametric Analysis of Mobile Cloud Computing Frameworks Using Simulation Modeling
Modular Verification of Asynchronous Networks
A generalized asynchronous computability theorem
Self-stabilizing tiny interaction protocols
Scalable and dynamic quorum systems
Node and Edge Averaged Complexities of Local Graph Problems
Brief Announcement: Automatic Log Enhancement for Fault Diagnosis
Near-Optimal Distributed Routing with Low Memory
Dynamic input/output automata, a formal model for dynamic systems
Failure detectors in loosely named systems
Keynote: Examples of Mantras as a Beacon in Guiding Research
Contention in Balancing Networks Resolved (Extended Abstract)
Nearest-neighbor graphs on random point sets and their applications to sensor networks
N-Processors Graph Distributively Achieve Perfect Matchings in O(log 2 N) Beats
Elections in the Presence of Faults
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
Space adaptation: privacy-preserving multiparty collaborative mining with geometric perturbation
Power management of devices: when should i switch off?
Massively Parallel Computation of Matching and MIS in Sparse Graphs
Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors
Asynchronous Byzantine Consensus
Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees
Collaborative enforcement of firewall policies in virtual private networks
Distributed order scheduling and its application to multi-core dram controllers
Brief Announcement: Round eliminator: a tool for automatic speedup simulation
Brief announcement: completing the lock-free dynamic cycle
Optimal Message Routing without Complete Routing Tables (preliminary version)
Truth in advertising: lightweight verification of route integrity
The Inhibition Spectrum and the Achievement of Causal Consistency
Congested Clique Algorithms for the Minimum Cut Problem
Brief announcement: adaptive balancing networks
Brief Announcement: The Small World of Curious Beings
Noisy Beeps
Active disk paxos with infinitely many processes
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
Making objects writable
Constant-time distributed dominating set approximation
Determining Consensus Numbers
A scheme for load balancing in heterogenous distributed hash tables
A tradeoff analysis on message complexity and lifetime optimality for a distributed multicast algorithm in WSNs
Potential Function Analysis of Greedy Hot-Potato Routing
What Can be Sampled Locally?
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994
A theory of goal-oriented communication
Solvability of geocasting in mobile ad-hoc networks
The Energy Complexity of BFS in Radio Networks
Viewstamped Replication: A General Primary Copy
tight bounds for k-set agreement with limited-scope failure detectors
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
Optimal and Efficient Clock Synchronization Under Drifting Clocks
Brief announcement: on the inherent cost of generic broadcast
Brief Announcement: Oh-RAM! One and a Half Round Read/Write Atomic Memory
The "Mobile Adversary" Paradigm in Distributed Computation and Systems
Optimal distributed all pairs shortest paths and applications
Brief Announcement: Local Problems in the SUPPORTED Model
3-Processor Tasks Are Undecidable (Abstract)
A Hundred Impossibility Proofs for Distributed Computing
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
Brief announcement: a simple stretch 2 distance oracle
Can Uncoordinated Beeps tell Stories?
Resilient Consensus Protocols
Game authority for robust andscalable distributed selfish-computer systems
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Purifying data by machine learning with certainty levels
Brief announcement: optimal asynchronous garbage collection for checkpointing protocols with rollback-dependency trackability
Verifying linearizability with hindsight
Swiper: a new paradigm for efficient weighted distributed protocols
A Wait-free Queue with Polylogarithmic Step Complexity
Efficient single phase unconditionally secure message transmission with optimum communication complexity
Modelling the Scalability of Real-Time Online Interactive Applications on Clouds
An Interval Logic for Higher-Level Temporal Reasoning
Peer-to-peer systems for prefix search
Preventing versus curing: avoiding conflicts in transactional memories
An Adaptive Totally Ordered Multicast Protocol That Tolerates Partitions
Brief announcement: reconfigurable state machine replication from non-reconfigurable building blocks
Analysing Snapshot Isolation
On the Multiparty Communication Complexity of Testing Triangle-Freeness
Brief Announcement: Specification and Implementation of Replicated List: The Jupiter Protocol Revisited
On the Complexity of Reader-Writer Locks: Extended Abstract
Brief announcement: pareto optimal solutions to consensus and set consensus
An efficient communication strategy for ad-hoc mobile networks
Compressed bloom filters
Group membership: a novel approach and the first single-round algorithm
ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013
Finding Safe Paths in a Faulty Environment
Contention Resolution on a Fading Channel
Deterministic Fault-Tolerant Connectivity Labeling Scheme
Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive Consistency
Efficient multi-word locking using randomization
Efficient Commit Protocols for the Tree of Processes Model of Distributed Transactions
Leader Election in Complete Networks
Encrypted Distributed Systems
Optimizing consistency checking for memory-intensive transactions
Adapting to a reliable network path
Distributed Communication via Global Buffer
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, August 14-16, 1989
Brief Announcement: Towards Energy-Efficient Distributed Agreement
Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms