On the public citation graph

Distributed Algorithms

0 signed · 1881 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0019791openalex-snapshot

Directed network protocols

inferredcites →https://doi.org/10.1007/bfb0019792openalex-snapshot

Fault tolerant queries in computer networks

inferredcites →https://doi.org/10.1007/bfb0019793openalex-snapshot

General and efficient decentralized consensus protocols

inferredcites →https://doi.org/10.1007/bfb0019795openalex-snapshot

Byzantine firing squad using a faulty external source

inferredcites →https://doi.org/10.1007/bfb0019797openalex-snapshot

Distributed algorithms for tree pattern matching

inferredcites →https://doi.org/10.1007/bfb0019798openalex-snapshot

On the packet complexity of distributed selection

inferredcites →https://doi.org/10.1007/bfb0019799openalex-snapshot

Load balancing in a network of transputers

inferredcites →https://doi.org/10.1007/bfb0019802openalex-snapshot

How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion

inferredcites →https://doi.org/10.1007/bfb0019803openalex-snapshot

Verification of connection-management protocols

inferredcites →https://doi.org/10.1007/bfb0019804openalex-snapshot

Generalized scheme for topology-update in dynamic networks

inferredcites →https://doi.org/10.1007/bfb0019807openalex-snapshot

A modular proof of correctness for a network synchronizer

inferredcites →https://doi.org/10.1007/bfb0019808openalex-snapshot

On the use of synchronizers for asynchronous communication networks

inferredcites →https://doi.org/10.1007/bfb0019809openalex-snapshot

Atomic multireader register

inferredcites →https://doi.org/10.1007/bfb0019810openalex-snapshot

An optimistic resiliency control scheme for distributed database systems

inferredcites →https://doi.org/10.1007/bfb0019811openalex-snapshot

A failsafe scheme for replicated information

inferredcites →https://doi.org/10.1007/bfb0019813openalex-snapshot

A distributed ring orientation algorithm

inferredcites →https://doi.org/10.1007/bfb0019814openalex-snapshot

Constructing efficient election algorithms from efficient traversal algorithms

inferredcites →https://doi.org/10.1007/bfb0019815openalex-snapshot

Optimal resilient ring election algorithms

inferredcites →https://doi.org/10.1007/bfb0019816openalex-snapshot

Fault-tolerant distributed algorithm for election in complete networks

inferredcites →https://doi.org/10.1007/bfb0019817openalex-snapshot

Lower bounds for synchronous networks and the advantage of local information

inferredcites →https://doi.org/10.1007/bfb0019819openalex-snapshot

Stepwise removal of virtual channels in distributed algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4490248openalex-extracted

A Review on Customer Satisfaction and an Efficient Online Cab Booking System

inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(20000410)30:4<419::aid-spe305>3.0.co;2-3openalex-snapshot

Dynamo: design, implementation, and evaluation of cooperative persistent object management in a local area network

inferred← citeshttps://doi.org/10.1002/0470094559.biblioopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1002/047134608x.w1638openalex-snapshot

Fault Tolerant Computing

inferred← citeshttps://doi.org/10.1002/047134608x.w5320openalex-snapshot

Network Operating Systems

inferred← citeshttps://doi.org/10.1002/9780470487068.ch17openalex-snapshot

Distributed Algorithms in Sensor Networks

inferred← citeshttps://doi.org/10.1002/9780470828229.ch1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1002/9781118135617.ch8openalex-snapshot

Distributed Control

inferred← citeshttps://doi.org/10.1002/9781118256107.ch18openalex-snapshot

Distributed Algorithms

inferred← citeshttps://doi.org/10.1002/9781118602638.ch3openalex-snapshot

Specification and Design Approaches

inferred← citeshttps://doi.org/10.1002/9781118648919.biblioopenalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1002/9781118753620.biblioopenalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1002/9781118753620.ch5openalex-snapshot

Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search

inferred← citeshttps://doi.org/10.1002/9781119246213.biblioopenalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1002/9781119266235.ch4openalex-snapshot

Projection‐Based Consensus for Time‐Critical Coordination of Unmanned Aerial Vehicles under Velocity Constraints

inferred← citeshttps://doi.org/10.1002/9781119332015.ch16openalex-snapshot

Smart Interleavings for Testing Parallel Programs

inferred← citeshttps://doi.org/10.1002/9781119699057.ch3openalex-snapshot

Consensus Q‐Learning for Multi‐agent Cooperative Planning

inferred← citeshttps://doi.org/10.1002/asjc.1493openalex-snapshot

Consensus Control of Fractional‐Order Systems Based on Delayed State Fractional Order Derivative

inferred← citeshttps://doi.org/10.1002/cjce.22090openalex-snapshot

Distributed estimation for a class of nonlinear systems with application to Navier‐Stokes flow estimation

inferred← citeshttps://doi.org/10.1002/cpe.1067openalex-snapshot

Distributed desk checking

inferred← citeshttps://doi.org/10.1002/cpe.1741openalex-snapshot

A liveness condition for concurrent objects: x‐wait‐freedom

inferred← citeshttps://doi.org/10.1002/cpe.3263openalex-snapshot

High‐performanceN‐thread software solutions for mutual exclusion

inferred← citeshttps://doi.org/10.1002/cpe.3311openalex-snapshot

Secure random number generation in wireless sensor networks

inferred← citeshttps://doi.org/10.1002/cpe.5049openalex-snapshot

Consensus‐based distributed learning for robust convex optimization with a scenario approach

inferred← citeshttps://doi.org/10.1002/ecjc.10109openalex-snapshot

A self‐stabilizing max‐heap protocol in tree networks

inferred← citeshttps://doi.org/10.1002/oca.2368openalex-snapshot

Vulnerabilities in Lagrange‐based distributed model predictive control

inferred← citeshttps://doi.org/10.1002/rnc.1147openalex-snapshot

Distributed multi‐vehicle coordinated controlvialocal information exchange

inferred← citeshttps://doi.org/10.1002/rnc.1148openalex-snapshot

A control‐theoretic perspective on the design of distributed agreement protocols

inferred← citeshttps://doi.org/10.1002/rnc.1495openalex-snapshot

Multi‐vehicle coordination for double‐integrator dynamics under fixed undirected/directed interaction in a sampled‐data setting

inferred← citeshttps://doi.org/10.1002/rnc.1705openalex-snapshot

Consensus strategy for a class of multi‐agents with discrete second‐order dynamics

inferred← citeshttps://doi.org/10.1002/rnc.3990openalex-snapshot

Robust node‐to‐node consensus of linear multiagent systems with directed switching topologies subject to uncertain pinning communications

inferred← citeshttps://doi.org/10.1002/rnc.6090openalex-snapshot

Distributed neuroadaptive monitoring fault‐tolerant consensus control for nonlinear multi‐agent systems with actuator faults

inferred← citeshttps://doi.org/10.1002/rnc.7929openalex-snapshot

Open Privacy‐Preserving Consensus via State Decomposition

inferred← citeshttps://doi.org/10.1002/rnc.8019openalex-snapshot

Distributed Sliding Mode Control for Nonlinear Multi‐Agent Consensus

inferred← citeshttps://doi.org/10.1002/wcm.233openalex-snapshot

A unifying look at clustering in mobile ad hoc networks

inferred← citeshttps://doi.org/10.1002/wcm.431openalex-snapshot

Mobility control for throughput maximization in ad hoc networks

inferred← citeshttps://doi.org/10.1006/jpdc.2001.1818openalex-snapshot

Communication Patterns in Distributed Computations

inferred← citeshttps://doi.org/10.1006/jpdc.2001.1827openalex-snapshot

Tolerating Transient and Intermittent Failures

inferred← citeshttps://doi.org/10.1007/0-306-48019-0_4openalex-snapshot

Team Automata for Spatial Access Control

inferred← citeshttps://doi.org/10.1007/10722468_1openalex-snapshot

Symmetric Spin

inferred← citeshttps://doi.org/10.1007/10722468_12openalex-snapshot

Abstraction of Communication Channels in Promela: A Case Study

inferred← citeshttps://doi.org/10.1007/11408901_5openalex-snapshot

Gracefully Degrading Fair Exchange with Security Modules

inferred← citeshttps://doi.org/10.1007/11427186_26openalex-snapshot

A Simple Randomized k-Local Election Algorithm for Local Computations

inferred← citeshttps://doi.org/10.1007/11429647_11openalex-snapshot

Two Absolute Bounds for Distributed Bit Complexity

inferred← citeshttps://doi.org/10.1007/11494881_18openalex-snapshot

On Correctness of Dynamic Protocol Update

inferred← citeshttps://doi.org/10.1007/11512073_8openalex-snapshot

Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems

inferred← citeshttps://doi.org/10.1007/11513988_35openalex-snapshot

Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking

inferred← citeshttps://doi.org/10.1007/11527800_10openalex-snapshot

Programming an Amorphous Computational Medium

inferred← citeshttps://doi.org/10.1007/11533719_39openalex-snapshot

Simple Distributed Algorithms for Approximating Minimum Steiner Trees

inferred← citeshttps://doi.org/10.1007/11535294_5openalex-snapshot

Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes

inferred← citeshttps://doi.org/10.1007/11539902_51openalex-snapshot

Consensus Control for Networks of Dynamic Agents via Active Switching Topology

inferred← citeshttps://doi.org/10.1007/11555827_20openalex-snapshot

Quantifying Probabilistic Information Flow in Computational Reactive Systems

inferred← citeshttps://doi.org/10.1007/11559306_5openalex-snapshot

Sociable Interfaces

inferred← citeshttps://doi.org/10.1007/11560333_14openalex-snapshot

Proof-Based System Engineering Using a Virtual System Model

inferred← citeshttps://doi.org/10.1007/11561927_13openalex-snapshot

Proving Atomicity: An Assertional Approach

inferred← citeshttps://doi.org/10.1007/11561927_18openalex-snapshot

Causing Communication Closure: Safe Program Composition with Non-FIFO Channels

inferred← citeshttps://doi.org/10.1007/11563952_96openalex-snapshot

Process Controlling and Monitoring Scheme for Distributed Systems with Fault-Tolerance by Using Web Services

inferred← citeshttps://doi.org/10.1007/11572329_9openalex-snapshot

Verifying Fault-Tolerant Distributed Systems Using Object-Based Graph Grammars

inferred← citeshttps://doi.org/10.1007/11576235_31openalex-snapshot

Lock-Free Parallel Garbage Collection

inferred← citeshttps://doi.org/10.1007/11576259_48openalex-snapshot

Energy Usage in Biomimetic Models for Massively-Deployed Sensor Networks

inferred← citeshttps://doi.org/10.1007/11577327_14openalex-snapshot

Towards Automatic Convergence Verification of Self-stabilizing Algorithms

inferred← citeshttps://doi.org/10.1007/11577327_5openalex-snapshot

Self-stabilization with r-Operators Revisited

inferred← citeshttps://doi.org/10.1007/11577327_6openalex-snapshot

Self-stabilization Preserving Compiler

inferred← citeshttps://doi.org/10.1007/11603009_19openalex-snapshot

Performance of Pipelined Asynchronous Systems

inferred← citeshttps://doi.org/10.1007/11611257_10openalex-snapshot

Group Communication: From Practice to Theory

inferred← citeshttps://doi.org/10.1007/11682462_47openalex-snapshot

The Committee Decision Problem

inferred← citeshttps://doi.org/10.1007/11758471_12openalex-snapshot

Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates

inferred← citeshttps://doi.org/10.1007/11780823_15openalex-snapshot

Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures

inferred← citeshttps://doi.org/10.1007/11780823_25openalex-snapshot

Approximate Top-k Queries in Sensor Networks

inferred← citeshttps://doi.org/10.1007/11784180_13openalex-snapshot

State Space Reduction of Rewrite Theories Using Invisible Transitions

inferred← citeshttps://doi.org/10.1007/11787006_45openalex-snapshot

Invisible Safety of Distributed Protocols

inferred← citeshttps://doi.org/10.1007/11795490_14openalex-snapshot

Stable Predicate Detection in Dynamic Systems

inferred← citeshttps://doi.org/10.1007/11795490_27openalex-snapshot

Reconfigurable Distributed Storage for Dynamic Networks

inferred← citeshttps://doi.org/10.1007/11808107_2openalex-snapshot

Dependable Systems

inferred← citeshttps://doi.org/10.1007/11813040_37openalex-snapshot

Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces

inferred← citeshttps://doi.org/10.1007/11813040_5openalex-snapshot

Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study

inferred← citeshttps://doi.org/10.1007/11817963_44openalex-snapshot

Formal Verification of a Lazy Concurrent List-Based Set Algorithm

inferred← citeshttps://doi.org/10.1007/11817963_8openalex-snapshot

Ticc: A Tool for Interface Compatibility and Composition

inferred← citeshttps://doi.org/10.1007/11864219_10openalex-snapshot

A Knowledge-Based Analysis of Global Function Computation

inferred← citeshttps://doi.org/10.1007/11864219_2openalex-snapshot

Renaming in Message Passing Systems with Byzantine Failures

inferred← citeshttps://doi.org/10.1007/11864219_4openalex-snapshot

Fault-Tolerant and Self-stabilizing Mobile Robots Gathering

inferred← citeshttps://doi.org/10.1007/11864219_9openalex-snapshot

A New Proof of the GHS Minimum Spanning Tree Algorithm

inferred← citeshttps://doi.org/10.1007/11916246_18openalex-snapshot

Rigorous Design of Fault-Tolerant Transactions for Replicated Database Systems Using Event B

inferred← citeshttps://doi.org/10.1007/11940128_74openalex-snapshot

Gathering Asynchronous Oblivious Mobile Robots in a Ring

inferred← citeshttps://doi.org/10.1007/11945529_13openalex-snapshot

Verification Techniques for Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/11945529_5openalex-snapshot

When Consensus Meets Self-stabilization

inferred← citeshttps://doi.org/10.1007/11945529_8openalex-snapshot

Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems

inferred← citeshttps://doi.org/10.1007/11947950_35openalex-snapshot

The Complexity of Updating Multi-writer Snapshot Objects

inferred← citeshttps://doi.org/10.1007/3-540-36078-6_13openalex-snapshot

Using BDDs with Combinations of Theories

inferred← citeshttps://doi.org/10.1007/3-540-36108-1_12openalex-snapshot

RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks

inferred← citeshttps://doi.org/10.1007/3-540-36108-1_7openalex-snapshot

Transformations of Self-Stabilizing Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-36190-1_5openalex-snapshot

Decomposition in Asynchronous Circuit Design

inferred← citeshttps://doi.org/10.1007/3-540-36494-3_59openalex-snapshot

Cryptographically Sound and Machine-Assisted Verification of Security Protocols

inferred← citeshttps://doi.org/10.1007/3-540-36577-x_8openalex-snapshot

Decidability of Invariant Validation for Paramaterized Systems

inferred← citeshttps://doi.org/10.1007/3-540-44679-6_63openalex-snapshot

A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem

inferred← citeshttps://doi.org/10.1007/3-540-44743-1_10openalex-snapshot

Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles

inferred← citeshttps://doi.org/10.1007/3-540-44988-4_24openalex-snapshot

Efficiency of Asynchronous Systems That Communicate Asynchronously

inferred← citeshttps://doi.org/10.1007/3-540-45614-7_18openalex-snapshot

Deriving Cryptographically Sound Implementations Using Composition and Formally Verified Bisimulation

inferred← citeshttps://doi.org/10.1007/3-540-45655-4_29openalex-snapshot

Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model

inferred← citeshttps://doi.org/10.1007/3-540-45739-9_7openalex-snapshot

An Overview of Formal Verification for the Time-Triggered Architecture

inferred← citeshttps://doi.org/10.1007/3-540-45748-8_28openalex-snapshot

Atomic Data Access in Distributed Hash Tables

inferred← citeshttps://doi.org/10.1007/3-540-45853-0_1openalex-snapshot

Computational Probabilistic Non-interference

inferred← citeshttps://doi.org/10.1007/3-540-48035-8_15openalex-snapshot

Distributed Deadlock Detection in Mobile Agent Systems

inferred← citeshttps://doi.org/10.1007/3-540-48169-9_5openalex-snapshot

A Dynamic Primary Configuration Group Communication Service

inferred← citeshttps://doi.org/10.1007/3-540-65307-4_52openalex-snapshot

Distributed algorithms for networks of agents

inferred← citeshttps://doi.org/10.1007/3-540-69108-1_11openalex-snapshot

Efficiency of Token-Passing MUTEX-Solutions — Some Experiments

inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_321openalex-snapshot

Randomization in Distributed Computing

inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_60openalex-snapshot

Byzantine Agreement

inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_457openalex-snapshot

Robotic Networks, Distributed Algorithms for

inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_2openalex-snapshot

Computer-Assisted Verification of an Algorithm for Concurrent Timestamps

inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_15openalex-snapshot

Randomized Dining Philosophers without Fairness Assumption

inferred← citeshttps://doi.org/10.1007/978-1-4020-8889-6_11openalex-snapshot

Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_6openalex-snapshot

Supervisory Control of Distributed Discrete-Event Systems

inferred← citeshttps://doi.org/10.1007/978-1-4614-1806-1_94openalex-snapshot

Robotic Networks, Distributed Algorithms for

inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-1-4615-1167-0_24openalex-snapshot

Tolerating Stop Failures in Distributed Maple

inferred← citeshttps://doi.org/10.1007/978-1-4757-5210-6_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_611openalex-snapshot

BG Distributed Simulation Algorithm

inferred← citeshttps://doi.org/10.1007/978-1-84800-131-2_66openalex-snapshot

Status and Trends in the Performance Assessment of Fault Tolerant Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-00265-7_17openalex-snapshot

An Introduction to cP Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_30openalex-snapshot

Gathering in the Plane of Location-Aware Robots in the Presence of Spies

inferred← citeshttps://doi.org/10.1007/978-3-030-03101-5_5openalex-snapshot

DoTRo: A New Dominating Tree Routing Algorithm for Efficient and Fault-Tolerant Leader Election in WSNs and IoT Networks

inferred← citeshttps://doi.org/10.1007/978-3-030-03424-5_22openalex-snapshot

ByMC: Byzantine Model Checker

inferred← citeshttps://doi.org/10.1007/978-3-030-05171-6_24openalex-snapshot

(Invited Paper) on the Security of Blockchain Consensus Protocols

inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_12openalex-snapshot

Unleashing and Speeding Up Readers in Atomic Object Implementations

inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_8openalex-snapshot

On Helping and Stacks

inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_22openalex-snapshot

Computing by Programmable Particles

inferred← citeshttps://doi.org/10.1007/978-3-030-12797-8_12openalex-snapshot

Actor-Like cP Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-17465-1_20openalex-snapshot

Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_23openalex-snapshot

Benchmarks for Automata Learning and Conformance Testing

inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_20openalex-snapshot

Communication-Closed Asynchronous Protocols

inferred← citeshttps://doi.org/10.1007/978-3-030-25636-4_33openalex-snapshot

Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector

inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_8openalex-snapshot

Self-stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-31517-7_12openalex-snapshot

Case Study on Certifying Distributed Algorithms: Reducing Intrusiveness

inferred← citeshttps://doi.org/10.1007/978-3-030-33716-2_14openalex-snapshot

On Trust Confusional, Trust Ignorant, and Trust Transitions

inferred← citeshttps://doi.org/10.1007/978-3-030-34968-4_13openalex-snapshot

Dione: A Protocol Verification System Built with Dafny for I/O Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_3openalex-snapshot

Stationary and Deterministic Leader Election in Self-organizing Particle Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_5openalex-snapshot

Synchronous t-Resilient Consensus in Arbitrary Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-36683-4_45openalex-snapshot

A Multiplier Effect Model for Price Stabilization Networks

inferred← citeshttps://doi.org/10.1007/978-3-030-41672-0_9openalex-snapshot

Better Upper Bounds for Searching on a Line with Byzantine Robots

inferred← citeshttps://doi.org/10.1007/978-3-030-43020-7_79openalex-snapshot

Non-Blocking Commitment Algorithm in Distributed Systems with Fail-Stop Model

inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_11openalex-snapshot

Tutorial: Parameterized Verification with Byzantine Model Checker

inferred← citeshttps://doi.org/10.1007/978-3-030-61362-4_30openalex-snapshot

Formal Verification of an Industrial Distributed Algorithm: An Experience Report

inferred← citeshttps://doi.org/10.1007/978-3-030-62401-9_2openalex-snapshot

Distributed Localization of Wireless Sensor Network Using Communication Wheel

inferred← citeshttps://doi.org/10.1007/978-3-030-68291-0_14openalex-snapshot

Partial Consensus and Incremental Learning Based Intrusion Detection System

inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_6openalex-snapshot

Weak Amnesiac Flooding of Multiple Messages

inferred← citeshttps://doi.org/10.1007/978-3-031-14841-5_13openalex-snapshot

Developing an Algorithm for the Management of Local Government Expenditures

inferred← citeshttps://doi.org/10.1007/978-3-031-18283-9_28openalex-snapshot

Three Attacks on Proof-of-Stake Ethereum

inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_23openalex-snapshot

Improved Deterministic Leader Election in Diameter-Two Networks

inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_6openalex-snapshot

Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20

inferred← citeshttps://doi.org/10.1007/978-3-031-45329-8_13openalex-snapshot

Synthesis of Distributed Protocols by Enumeration Modulo Isomorphisms

inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_3openalex-snapshot

Locally Verifiable Distributed SNARGs

inferred← citeshttps://doi.org/10.1007/978-3-031-48618-0_5openalex-snapshot

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority

inferred← citeshttps://doi.org/10.1007/978-3-031-71280-7_5openalex-snapshot

Programming

inferred← citeshttps://doi.org/10.1007/978-3-031-78676-1_3openalex-snapshot

Short Paper: Accountable Safety Implies Finality

inferred← citeshttps://doi.org/10.1007/978-3-031-90109-6_4openalex-snapshot

Quantifying and Reducing System Non-Resilience: Methodology, Metrics, and Case Study

inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_25openalex-snapshot

Brief Announcement: Relaxation for Efficient Asynchronous Queues

inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_17openalex-snapshot

Synchronous Counting and Computational Algorithm Design

inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_3openalex-snapshot

A Characterization of Dynamic Networks Where Consensus Is Solvable

inferred← citeshttps://doi.org/10.1007/978-3-319-09581-3_8openalex-snapshot

Practically Self-stabilizing Paxos Replicated State-Machine

inferred← citeshttps://doi.org/10.1007/978-3-319-10268-9_4openalex-snapshot

Decentralized Movement Analysis

inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_28openalex-snapshot

Model Checking Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-11764-5_23openalex-snapshot

Tight Bounds for Stabilizing Uniform Consensus in Mobile Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-14370-5_21openalex-snapshot

Parallel Thinning with Complex Objects and Actors

inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_1openalex-snapshot

Verifying the Consistency of Remote Untrusted Services with Commutative Operations

inferred← citeshttps://doi.org/10.1007/978-3-319-17112-8_6openalex-snapshot

Monitoring of Client-Cloud Interaction

inferred← citeshttps://doi.org/10.1007/978-3-319-17581-2_6openalex-snapshot

A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols

inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_23openalex-snapshot

Automatic Completion of Distributed Protocols with Symmetry

inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_6openalex-snapshot

SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_5openalex-snapshot

Hybrid Multirate PALS

inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_15openalex-snapshot

Data-Streaming and Concurrent Data-Object Co-design: Overview and Algorithmic Challenges

inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_16openalex-snapshot

Stability in Heterogeneous Dynamic Multimedia Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-26350-2_11openalex-snapshot

DMAPP: A Distributed Multi-agent Path Planning Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-319-27308-2_4openalex-snapshot

Parallel Computing vs. Distributed Computing: A Great Confusion? (Position Paper)

inferred← citeshttps://doi.org/10.1007/978-3-319-27335-8_32-1openalex-snapshot

Social Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-27340-2_28openalex-snapshot

A Scalable Monitoring Solution for Large-Scale Distributed Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-27889-6_14openalex-snapshot

Robustness of P

inferred← citeshttps://doi.org/10.1007/978-3-319-28872-7_9openalex-snapshot

K-Redundant Trees for Safe and Efficient Multi-robot Recovery in Complex Environments

inferred← citeshttps://doi.org/10.1007/978-3-319-29201-4_5openalex-snapshot

Trust Communities: An Open, Self-Organised Social Infrastructure of Autonomous Agents

inferred← citeshttps://doi.org/10.1007/978-3-319-33600-8_1openalex-snapshot

Modeling Distributed Algorithms by Abstract State Machines Compared to Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-319-39519-7_12openalex-snapshot

Improving Gossip Dynamics Through Overlapping Replicates

inferred← citeshttps://doi.org/10.1007/978-3-319-41579-6_2openalex-snapshot

What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-319-47846-3_17openalex-snapshot

Contextual Trace Refinement for Concurrent Objects: Safety and Progress

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_1openalex-snapshot

How Many Cooks Spoil the Soup?

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_6openalex-snapshot

Message Lower Bounds via Efficient Network Synchronization

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_7openalex-snapshot

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_21openalex-snapshot

Near-Optimal Self-stabilising Counting and Firing Squads

inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_28openalex-snapshot

Asynchronous Non-Bayesian Learning in the Presence of Crash Failures

inferred← citeshttps://doi.org/10.1007/978-3-319-49583-5_26openalex-snapshot

Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-50478-0_1openalex-snapshot

Machine Learning for Health Informatics

inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_2openalex-snapshot

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC

inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_3openalex-snapshot

Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-54072-6_20openalex-snapshot

Revising the Membrane Computing Model for Byzantine Agreement

inferred← citeshttps://doi.org/10.1007/978-3-319-57288-8_27openalex-snapshot

Verifying a Class of Certifying Distributed Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_10openalex-snapshot

Oh-RAM! One and a Half Round Atomic Memory

inferred← citeshttps://doi.org/10.1007/978-3-319-60225-7_1openalex-snapshot

Session Types for Link Failures

inferred← citeshttps://doi.org/10.1007/978-3-319-65338-9_3openalex-snapshot

Networks in Smart Cities from a Graph Theoretic Point of View

inferred← citeshttps://doi.org/10.1007/978-3-319-66799-7_9openalex-snapshot

A Stochastic Approach to Shortcut Bridging in Programmable Matter

inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_29openalex-snapshot

Brief Announcement: Asynchronous, Distributed, Optical Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_16openalex-snapshot

How Long It Takes for an Ordinary Node with an Ordinary ID to Output?

showing the first 200 of 1860

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.