yusuke1997/dblp-id-title huggingface dataset:
Randomized broadcast in radio networks with collision detection
A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects
Paxos made live: an engineering perspective
Towards Optimal Synchronous Counting
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders
Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n 2 ) messages
Bounded Polynomial Randomized Consensus
On the liveness of transactional memory
Consensus in the Presence of Timing Uncertainty: Omission and Byzantine Failures (Extended Abstract)
Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages
The Complexity of End-to-End Communication in Memoryless Networks
An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
Constant-Round Near-Optimal Spanners in Congested Clique
Distributed Computation and Reconfiguration in Actively Dynamic Networks
Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract)
A Randomized Concurrent Algorithm for Disjoint Set Union
Dynamic Systems and Their Distributed Termination
Optimal Coteries
Policy-Based Cloud Management Through Resource Usage Prediction
Exploring the use of Strongly Consistent Distributed Shared Memory in 3D NVEs
Bootstrap Network Resynchronization (Extended Abstract)
A Modular Measure of Competitiveness for Distributed Algorithms (Abstract)
Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers
Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition
Brief Announcement: Local Advice and Local Decompression
Distributed computation of the mode
Distributed Minimum Degree Spanning Trees
Efficient synchronous snapshots
Easy impossibility proofs for k-set agreement in message passing systems
Completely fair SFE and coalition-safe cheap talk
Performance of Approximate Causal Consistency for Partially Replicated Systems
Operation-valency and the cost of coordination
An Inter-Cloud Architecture for Future Internet Infrastructures
Computation Offloading from Mobile Devices: Can Edge Devices Perform Better Than the Cloud?
On the impact of geometry on ad hoc communication in wireless networks
Brief announcement: local approximability of minimum dominating set on planar graphs
Towards a Minimal Object-Oriented Language for Distributed and Concurrent Programming
Hedging Against Sore Loser Attacks in Cross-Chain Transactions
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique
Transactional contention management as a non-clairvoyant scheduling problem
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Brief announcement: dynamic interoperable point-to-point connection of MPI implementations
Brief announcement: network formation games can give rise to realistic networks
Using Lock-Free Objects in Hard Real-Time Applications (Abstract)
Memory Coherence in Shared Virtual Memory Systems
From an intermittent rotating star to a leader
The Ambiguity of Choosing
Brief announcement: order-preserving renaming in synchronous message passing systems with byzantine faults
Universal Constructions for Multi-Object Operations
Leveraging Multiple Channels in Ad Hoc Networks
Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography
Analysis of Timing-Based Mutual Exclusion with Random Times
Broadcasting in udg radio networks with unknown topology
Internet Computer Consensus
Brief announcement: gradient clock synchronization in sensor networks
Xheal: localized self-healing using expanders
Adding Concurrency to Smart Contracts
Implementing and Evaluating an Eventualy-Serializable Data Service
Brief Announcement: Brokering with Hashed Timelock Contracts is NP-Hard
Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs
ENF Event Predicate Detection in Distributed Systems
On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional Faults
Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees
Using Events Structures for the Efficient Analysis of State Graphs (Abstract)
Edge Locks and Deadlock Avoidance in Distributed Systems
A Novel NFV Schedule Optimization Approach with Sensitivity to Packets Dropping Positions
Partial reversal acyclicity
Simulation as an Iterated Task (Abstract)
Rollback-Dependency Trackability: Visible Characterizations
Fast self-stabilizing byzantine tolerant digital clock synchronization
Brief Announcement: Distributed Approximation for Tree Augmentation
On using network attached disks as shared memory
Efficient Delta-Causal Broadcasting of Multimedia Applications (Abstract)
Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion
Optimal Distributed Algorithm for Minimum Spanning Trees Revisited
Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters
Brief announcement: sources of instability in data center multicast
Achieving Independence Efficiently and Securely
Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
Asynchronous Time-Adaptive Self Stabilization
Distributed computational complexities: are you volvo-addicted or nascar-obsessed?
Unbounded contention resolution in multiple-access channels
Brief announcement: revisiting the power-law degree distribution for social graph analysis
A paradox of eventual linearizability in shared memory
Maintaining the Time in a Distributed System
Leveraging Indirect Signaling for Topology Inference and Fast Broadcast
High Performance Clusters: State of the Art and Challenges Ahead
Online and dynamic embeddings of approximate ultrametrics
Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning
Constructing Multi-reader Atomic Values From Non-atomic Values
Controller and estimator for dynamic networks
On Site Fidelity and the Price of Ignorance in Swarm Robotic Central Place Foraging Algorithms
Brief announcement: techniques for programmatically troubleshooting distributed systems
Knowledge-Based Programs
Distributed Approximation on Power Graphs
An Analysis of Quorum-based Abstractions: A Case Study using Gorums to Implement Raft
Improved Analysis of Deterministic Load-Balancing Schemes
Principle for High Speed Network Control: Congestion- and Deadlock-Freeness, Self-Routing, and a Single Buffer per Link
Brief announcement: a single enqueuer wait-free queue implementation
Efficient distributed source detection with limited bandwidth
Toward a theory of transactional contention managers
On Distributed Listing of Cliques
On the Robustness of Herlihy's Hierarchy
Multiparty Interactive Communication with Private Channels
Brief announcement: view transactions: transactional model with relaxed consistency checks
Robust data sharing with key-value stores
On the power of the congested clique model
Brief Announcement: Sublinear-Space Distance Labeling Using Hubs
Self-Stabilizing Extensions for Message-Passing Systems
Fischer's cryptographic protocols
On asymmetric progress conditions
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement
The combined power of conditions and failure detectors to solve asynchronous set agreement
Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm
Synthesis of Fault-Tolerant Concurrent Programs
Building responseive TMR-based servers in presence of timing constraints
Randomized compact routing in decomposable metrics
Efficient algorithms for leader election in radio networks
Single-scanner multi-writer snapshot implementations are fast!
Distributed CONGEST Algorithms against Mobile Adversaries
Apply or Perish!
On implementing omega with weak reliability and synchrony assumptions
Time bounds for shared objects in partially synchronous systems
Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication
Communication Complexity of Byzantine Agreement, Revisited
Oblivious interference scheduling
Brief announcement: new bounds for the controller problem
Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract)
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs
Comparing Primary-Backup and State Machines for Crash Failures (Abstract)
Adaptive and efficient mutual exclusion (extended abstract)
Calling Names in Nameless Networks
Brief announcement: towards robust medium access in multi-hop networks
Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows
Group mutual exclusion in O (log n ) RMR
Brief Announcement: A Tight Space Bound for Consensus
Positive Aging Admits Fast Asynchronous Plurality Consensus
An incomplete history of concurrency chapter 1. 1965-1977
A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
Collecting Distributed Garbage Cycles by Back Tracing
Locking Timestamps versus Locking Objects
Brief announcement: degree: optimal deterministic routing for P2P systems
On the complexity of distributed graph coloring
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract
Set Consensus Using Arbitrary Objects (Preliminary Version)
A Distributed Learning Dynamics in Social Groups
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory
Compact policy routing
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Optimal Synchronous Approximate Agreement with Asynchronous Fallback
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
Delegation of computation with verification outsourcing: curious verifiers
Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data Structures
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies
Freedom from Deadlock of Locked Transactions in a Distributed Database
Brief announcement: anonymity and trust in distributed systems
Brief announcement: exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast
On the topologies formed by selfish peers
Spanners and sparsifiers in dynamic streams
Modelling Garbage Collection Algorithms Using CCS and Temporal Logic (Abstract)
Brief announcement: almost-tight approximation distributed algorithm for minimum cut
Interleaving Set Temporal Logic (Preliminary Version)
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
SNZI: scalable NonZero indicators
The Complexity of Crash Failures
Towards a formal model for view maintenance in data warehouses
Lower Bounds on the State Complexity of Population Protocols
Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers
Secure data structures based on multi-party computation
Towards Dataflow Analysis of Communicating Finite State Machines
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication
Reasoning About Probabilistic Algorithms
Distributed cooperation in the absence of communication (brief announcement)
An asynchronous protocol for distributed computation of RSA inverses and its applications
PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020
Quorum placement in networks: minimizing network congestion
Uniform Actions in Asynchronous Distributed Systems (Extended Abstract)
Massively Parallel Computation in a Heterogeneous Regime
Space Bounds for Reliable Storage: Fundamental Limits of Coding
Toward more localized local algorithms: removing assumptions concerning global knowledge
Language Constructs and Support Systems for Distributed Computing
A Protocol for Wait-Free, Atomic, Multi-Reader Shared Variables
Adaptively Secure Single Secret Leader Election from DDH
Lower bounds for adaptive collect and related objects
Distributed Variable Server for Atomic Unification
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
Analysis of the evolution of peer-to-peer systems
BMobi_Causal: a causal broadcast protocol in mobile dynamic groups
A Brief Tutorial on Distributed and Concurrent Machine Learning
Distributed k-Selection: From a Sequential to a Distributed Algorithm
Wait-freedom with advice
Fast Approximate Shortest Paths in the Congested Clique
Lazy Consistency Using Loosely Synchronized Clocks
Embedding a Deterministic BFT Protocol in a Block DAG
Consensus Numbers of Multi-Objects
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016
Effectiveness of Delaying Timestamp Computation
Site Optimal Termination Protocols for a Distributed Database under Network Partitioning
Designing a Global Name Service
Can quantum communication speed up distributed computation?
On the expected payment of mechanisms for task allocation
Proceedings of the 4th Workshop on Distributed Cloud Computing, DCC@PODC 2016, Chicago, IL, USA, July 25, 2016
A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor
Brief Announcement: A Case for Byzantine Machine Learning
Random walk for self-stabilitzing group communication in ad hoc networks
The RAPID C++ Environment (Abstract)
Coordinated consensus in dynamic networks
Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems
Backward Consistency and Sense of Direction in Advanced Distributed Systems
Brief announcement: hardness of broadcasting in wireless networks with unreliable communication
Folding and Unrolling Systolic Arrays (Preliminary Version)
Optimal Locking Integrated with Operational Transformation in Distributed Real-Time Group Editors
Sublinear Message Bounds for Randomized Agreement
Brief announcement: collusion free protocol for rational secret sharing
Achieving scalability and expressiveness in an Internet-scale event notification service
External Logging on a Logical Ring
Brief announcement: secret sharing based on the social behaviors of players
Randomness vs. Fault-Tolerance
Wait-free programming for general purpose computations on graphics processors
On local representation of distances in trees
Brief announcement: a shared disk on distributed storage
An O (log 3/2 n ) Parallel Time Population Protocol for Majority with O (log n ) States
Computing on an Anonymous Network
Compact roundtrip routing in directed networks (extended abstract)
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
Four Combinators for Concurrency
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version)
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity
The Effect of Link Failures on Computations in Asynchronous Rings
Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics
Brief Announcement: Gossiping with Latencies
Principles and Patterns of High-Performance and Real-Time Distributed Object Computing
An Inherent Bottleneck in Distributed Counting
Distributed Allocation with Pools of Servers
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018
Brief Announcement: Partially Replicated Causally Consistent Shared Memory
Collecting Cyclic Distributed Garbage Using Heuristics to Control Migration
A Case for NOW (Networks of Workstations) - Abstract
On Mixing Eventual and Strong Consistency: Bayou Revisited
Brief Announcement: Byzantine-Tolerant Machine Learning
A simple approach for adapting continuous load balancing processes to discrete settings
Does Preprocessing Help under Congestion?
A Combinatorial Treatment of Balancing Networks
Connection-Based Communication in Dynamic Networks (Extended Abstract)
Efficient distributed approximation algorithms via probabilistic tree embeddings
Testing Concurrent Data Structures (Abstract)
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
Data-dependent Concurrency Control and Recovery (Extended Abstract)
Extending the Wait-free Hierarchy to Multi-Threaded Systems
The Failure and Recovery Problem for Replicated Databases
The Strength of Counting Networks (Abstract)
An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience
Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
The Power of Choice in Priority Scheduling
Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems
Fundamental Distributed Protocols in Mobile Networks
The coBFIT toolkit
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
Session details: Session 1C: Wireless Networks
Internet of Things data management in the cloud for Bluetooth Low Energy (BLE) devices
Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model
Brief announcement: a generic construction for nonblocking dual containers
Faster Randomized Repeated Choice and DCAS
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics
Brief Announcement: Extending Asynchronous Byzantine Agreement with Crusader Agreement
Brief announcement: Trilix: a scalable unstructured lookup system for dynamic environments
New combinatorial topology upper and lower bounds for renaming
Election and Traversal in Unidirectional Networks
On Interplanetary and Relativistic Distributed Computing
A distributed algorithm for gathering many fat mobile robots in the plane
Synchronizing without locks is inherently expensive
A new technique for distributed symmetry breaking
On Local Distributed Sampling and Counting
A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors
Efficient and Simple Algorithms for Fault-Tolerant Spanners
Counting Networks are Practically Linearizable
Reliable broadcast in unknown fixed-identity networks
Bounded Round Numbers
On deterministic abortable objects
SODA: A Simplified Operating System for Distributed Applications
Adaptive Video on Demand
Impossibility and Universality Results for Wait-Free Synchronization
Crash Failures can Drive Protocols to Arbitrary States
Adaptive Resource Management and Scheduling for Cloud Computing - Second International Workshop, ARMS-CC 2015, Held in Conjunction with ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 20, 2015, Revised Selected Papers
A Polylogarithmic Gossip Algorithm for Plurality Consensus
Life Beyond Set Agreement
Patterns of Communication in Consensus Protocols
Responsiveness and Consistency Tradoffs in Interactive Groupware
Brief announcement: randomized rumor spreading with fewer phone calls
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics
Muteness Detectors for Consensus with Byzantine Processes
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Scaling properties of the Internet graph
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
Brief announcement: on the possibility and the impossibility of message-driven self-stabilizing failure detection
The inherent price of indulgence
Greedy Routing and the Algorithmic Small-World Phenomenon
Algorithmic Problems in Internet Research
Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation
Slicing in locavore infrastructures
Wait-Free Clock Synchronization (Extended Abstract)
Brief announcement: evaluation of tree-based data gathering algorithms for wireless sensor networks
Distributed Algorithms for Sparse k-Connectivity Certificates (Abstract)
Byzantine broadcast in point-to-point networks using local linear coding
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities
On Self-stabilizing Leader Election in Directed Networks
A Template for Implementing Fast Lock-free Trees Using HTM
Internet Support for Wireless and Mobile Networking
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011
Deterministic distributed resource discovery (brief announcement)
Brief announcement: virtual mobile nodes for mobile ad hoc networks
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games
Relations Between Concurrent-Write Models of Parallel Computation
Efficient generation of all regular non-dominated coteries
Fast Network Decomposition (Extended Abstract)
Connectivity Lower Bounds in Broadcast Congested Clique
Brief announcement: distributed cryptography using trinc
Decentralized Distributed Graph Coloring: Cluster Graphs
Solving the at-most-once problem with nearly optimal effectiveness
Brief Announcement: Broadcast in Radio Networks, Time vs. Energy Tradeoffs
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005
The Weakest Failure Detector for Eventual Consistency
Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults
DoS-resilient secure aggregation queries in sensor networks
Sequentially Consistent versus Linearizable Counting Networks
Tight bounds on information dissemination in sparse mobile networks
Knowledge and Common Knowledge in a Distributed Environment
Computing Weak Consistency in Polynomial Time: [Extended Abstract]
Fault Tolerance Bounds for Memory Consistency
Randomized Adaptive Video on Demand (Abstract)
Lock-free linked lists and skip lists
BeeGees: Stayin' Alive in Chained BFT
Amortizing Randomness in Private Multiparty Computations
A Distributed and Fault Tolerant Robotic Localisation and Mapping in Network Edge
Power-Efficient Assignment of Virtual Machines to Physical Machines
Average probe complexity in quorum systems
Continous Routing and Batch Routing on the Hypercube
Brief announcement: tolerating permanent and transient value faults
Brief Announcement: Optimal Record and Replay under Causal Consistency
Brief announcement: how to speed-up fault-tolerant clock generation in VLSI systems-on-chip via pipelining
Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects
Streaming Graph Algorithms in the Massively Parallel Computation Model
Trade-offs in Fault-Containing Self-Stabilization
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
A Framework for Partitionable Membership Service (Abstract)
Self-stabilizing byzantine agreement
Partial synchrony based on set timeliness
Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines
Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
Concurrent Counting (Extended Abstract)
Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
Towards a More Reliable Store-and-forward Protocol for Mobile Text Messages
Overview of Persistent Memory in Distributed Systems Architecture - Past, Present, Future
Cortical Computation
Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
The Topology of Randomized Symmetry-Breaking Distributed Computing
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
A Compositional Verification Method for LOTOS
Analysing Scalability Strategies for Service Choreographies on Cloud Environments
Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems
The impact of randomization in smoothing networks