On the public citation graph

Distributed Algorithms

0 signed · 3547 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.1002/net.3230150404openalex-snapshot

Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronization

inferredcites →https://doi.org/10.1006/inco.1993.1043openalex-snapshot

More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems

inferredcites →https://doi.org/10.1006/inco.1993.1065openalex-snapshot

Bounds on Shared Memory for Mutual Exclusion

inferredcites →https://doi.org/10.1006/inco.1994.1030openalex-snapshot

Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty

inferredcites →https://doi.org/10.1006/inco.1994.1094openalex-snapshot

Asynchronous Approximate Agreement

inferredcites →https://doi.org/10.1006/inco.1996.0060openalex-snapshot

Forward and Backward Simulations

inferredcites →https://doi.org/10.1006/jagm.1994.1029openalex-snapshot

Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time

inferredcites →https://doi.org/10.1007/3-540-08755-9_9openalex-snapshot

Notes on data base operating systems

inferredcites →https://doi.org/10.1007/3-540-08860-1_13openalex-snapshot

Mutual exclusion of N processors using an O(N)-valued message variable

inferredcites →https://doi.org/10.1007/3-540-09510-1_12openalex-snapshot

Arbitration and queueing under limited shared storage requirements

inferredcites →https://doi.org/10.1007/3-540-12689-9_99openalex-snapshot

The consensus problem in unreliable distributed systems (a brief survey)

inferredcites →https://doi.org/10.1007/3-540-19488-6_145openalex-snapshot

Assertional verification of a timer based protocol

inferredcites →https://doi.org/10.1007/3-540-52559-9_64openalex-snapshot

Functional specification of time sensitive communicating systems

inferredcites →https://doi.org/10.1007/3-540-52559-9_77openalex-snapshot

Multivalued possibilities mappings

inferredcites →https://doi.org/10.1007/3-540-52559-9_79openalex-snapshot

Formal verification of data type refinement — Theory and practice

inferredcites →https://doi.org/10.1007/3-540-56188-9_7openalex-snapshot

A concurrent time-stamp scheme which is linear in time and space

inferredcites →https://doi.org/10.1007/3-540-56922-7_25openalex-snapshot

Computer-assisted simulation proofs

inferredcites →https://doi.org/10.1007/3-540-57271-6_40openalex-snapshot

A simple, efficient algorithm for maximum finding on rings

inferredcites →https://doi.org/10.1007/978-0-387-34878-0_19openalex-snapshot

Verifying Timing Properties of Concurrent Algorithms

inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot

The Temporal Logic of Reactive and Concurrent Systems

inferredcites →https://doi.org/10.1007/978-1-4615-2271-3_1openalex-snapshot

A Tight Lower Bound for Processor Coordination

inferredcites →https://doi.org/10.1007/978-94-011-1793-7_4openalex-snapshot

Assigning Meanings to Programs

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

An axiomatic proof technique for parallel programs I

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

Proof of correctness of data representations

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

Hierarchical ordering of sequential processes

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

Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds

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

Efficiency of semisynchronous versus asynchronous networks

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

The sliding-window protocol revisited

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

Simulating authenticated broadcasts to derive simple fault-tolerant algorithms

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

Distributed deadlock detection

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

Asymptotically optimal algorithms for approximate agreement

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

On interprocess communication

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

On interprocess communication

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

Easy impossibility proofs for distributed consensus problems

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

Verification of multiprocess probabilistic protocols

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

Composite registers

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

A modular drinking philosophers algorithm

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

Using mappings to prove timing properties

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

Detecting causal relationships in distributed computations: In search of the holy grail

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

Multi-writer composite registers

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

Neuer beweis für die invarianz der dimensionszahl und des gebietes

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

Probabilistic simulations for probabilistic processes

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

Concurrency and automata on infinite sequences

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

Message delaying synchronizers

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

An old-fashioned recipe for real time

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

Forward and backward simulations for timing-based systems

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

Time-lapse snapshots

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

At-most-once message delivery A case study in algorithm verification

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

On deadlocks of exclusive AND-requests for resources

inferredcites →https://doi.org/10.1016/0020-0190(80)90021-6openalex-snapshot

Termination detection for diffusing computations

inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot

Myths about the mutual exclusion problem

inferredcites →https://doi.org/10.1016/0020-0190(82)90033-3openalex-snapshot

A lower bound for the time to assure interactive consistency

inferredcites →https://doi.org/10.1016/0020-0190(84)90027-9openalex-snapshot

Extending binary Byzantine agreement to multivalued Byzantine agreement

inferredcites →https://doi.org/10.1016/0020-0190(85)90056-0openalex-snapshot

Defining liveness

inferredcites →https://doi.org/10.1016/0020-0190(87)90052-4openalex-snapshot

Extended impossibility results for asynchronous complete networks

inferredcites →https://doi.org/10.1016/0022-0000(81)90015-5openalex-snapshot

Upper bounds for static resource allocation in a distributed system

inferredcites →https://doi.org/10.1016/0022-0000(85)90039-xopenalex-snapshot

Scaling algorithms for network problems

inferredcites →https://doi.org/10.1016/0141-1195(83)90127-4openalex-snapshot

Principles of concurrent programming

inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot

The Byzantine generals strike again

inferredcites →https://doi.org/10.1016/0196-6774(82)90023-2openalex-snapshot

An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

inferredcites →https://doi.org/10.1016/0196-6774(90)90020-fopenalex-snapshot

A combinatorial characterization of the distributed 1-solvable tasks

inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot

Fast randomized consensus using shared memory

inferredcites →https://doi.org/10.1016/0304-3975(81)90109-2openalex-snapshot

On describing the behavior and implementation of distributed systems

inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot

A theory of timed automata

inferredcites →https://doi.org/10.1016/0376-5075(76)90015-5openalex-snapshot

A data transfer protocol

inferredcites →https://doi.org/10.1016/0890-5401(87)90029-0openalex-snapshot

Simulating synchronous processors

inferredcites →https://doi.org/10.1016/0890-5401(90)90014-9openalex-snapshot

Knowledge and common knowledge in a Byzantine environment: Crash failures

inferredcites →https://doi.org/10.1016/0890-5401(91)90014-sopenalex-snapshot

Fault-tolerant critical section management in asynchronous environments

inferredcites →https://doi.org/10.1016/s0019-9958(82)90776-8openalex-snapshot

An efficient algorithm for byzantine agreement without authentication

inferredcites →https://doi.org/10.1016/s0022-0000(75)80018-3openalex-snapshot

Proving assertions about parallel programs

inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot

Graphs and Hypergraphs

inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot

Introduction to Distributed Algorithms

inferredcites →https://doi.org/10.1090/qam/102435openalex-snapshot

On a routing problem

inferredcites →https://doi.org/10.1109/12.9729openalex-snapshot

Constructing two-writer atomic registers

inferredcites →https://doi.org/10.1109/2.76283openalex-snapshot

A design approach for ultrareliable real-time systems

inferredcites →https://doi.org/10.1109/26.2744openalex-snapshot

Reliable link initialization procedures

inferredcites →https://doi.org/10.1109/cmpsac.1978.810401openalex-snapshot

An effective "on-line" deadlock detection technique for distributed data base management systems

inferredcites →https://doi.org/10.1109/fscs.1990.89525openalex-snapshot

A dining philosophers algorithm with polynomial response time

inferredcites →https://doi.org/10.1109/fscs.1990.89571openalex-snapshot

Sparse partitions

inferredcites →https://doi.org/10.1109/hicss.1995.375494openalex-snapshot

Connection management without retaining information

inferredcites →https://doi.org/10.1109/istcs.1995.377024openalex-snapshot

Trade-offs between message delivery and quiesce times in connection management protocols

inferredcites →https://doi.org/10.1109/lics.1990.113769openalex-snapshot

Modelling shared state in a shared action model

inferredcites →https://doi.org/10.1109/proc.1978.11114openalex-snapshot

SIFT: Design and analysis of a fault-tolerant computer for aircraft control

inferredcites →https://doi.org/10.1109/real.1992.242657openalex-snapshot

Bounds on the time to detect failures using bounded-capacity message links

inferredcites →https://doi.org/10.1109/real.1992.242666openalex-snapshot

A simple assertional proof system for real-time systems

inferredcites →https://doi.org/10.1109/real.1992.242680openalex-snapshot

Results about fast mutual exclusion

inferredcites →https://doi.org/10.1109/real.1992.242681openalex-snapshot

Timing-based mutual exclusion

inferredcites →https://doi.org/10.1109/real.1994.342724openalex-snapshot

The generalized railroad crossing: a case study in formal verification of real-time systems

inferredcites →https://doi.org/10.1109/sfcs.1979.37openalex-snapshot

Resource allocation with immunity to limited process failure

inferredcites →https://doi.org/10.1109/sfcs.1983.48openalex-snapshot

Randomized byzantine generals

inferredcites →https://doi.org/10.1109/sfcs.1985.20openalex-snapshot

Distributed BFS algorithms

inferredcites →https://doi.org/10.1109/sfcs.1986.11openalex-snapshot

Atomic shared register access by asynchronous hardware

inferredcites →https://doi.org/10.1109/sfcs.1987.15openalex-snapshot

Concurrent reading while writing II: The multi-writer case

inferredcites →https://doi.org/10.1109/sfcs.1993.366821openalex-snapshot

A sub-linear time distributed algorithm for minimum-weight spanning trees

inferredcites →https://doi.org/10.1109/sfcs.1993.366823openalex-snapshot

Near-linear cost sequential and distributed constructions of sparse neighborhood covers

inferredcites →https://doi.org/10.1109/sfcs.1993.366866openalex-snapshot

A tight lower bound for k-set agreement

inferredcites →https://doi.org/10.1109/tcom.1976.1093283openalex-snapshot

Single-Message Communication

inferredcites →https://doi.org/10.1109/tcom.1978.1094040openalex-snapshot

A Review of the Development and Performance of the ARPANET Routing Algorithm

inferredcites →https://doi.org/10.1109/tcom.1980.1094702openalex-snapshot

OSI Reference Model--The ISO Model of Architecture for Open Systems Interconnection

inferredcites →https://doi.org/10.1109/tcom.1983.1095883openalex-snapshot

A Distributed Algorithm for Minimum Weight Directed Spanning Trees

inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot

Distributed network protocols

inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot

Proving the Correctness of Multiprocess Programs

inferredcites →https://doi.org/10.1109/tse.1979.234181openalex-snapshot

Locking and Deadlock Detection in Distributed Data Bases

inferredcites →https://doi.org/10.1109/tse.1980.230491openalex-snapshot

On Deadlock Detection in Distributed Systems

inferredcites →https://doi.org/10.1109/tse.1982.235418openalex-snapshot

Global States of a Distributed System

inferredcites →https://doi.org/10.1109/tse.1982.235573openalex-snapshot

Echo Algorithms: Depth Parallel Operations on General Graphs

inferredcites →https://doi.org/10.1109/tse.1982.235884openalex-snapshot

Protocols for Deadlock Detection in Distributed Database Systems

inferredcites →https://doi.org/10.1137/0212045openalex-snapshot

Authenticated Algorithms for Byzantine Agreement

inferredcites →https://doi.org/10.1137/0215074openalex-snapshot

A Simple Parallel Algorithm for the Maximal Independent Set Problem

inferredcites →https://doi.org/10.1137/0220023openalex-snapshot

Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks

inferredcites →https://doi.org/10.1137/0405013openalex-snapshot

Routing with Polynomial Communication-Space Trade-Off

inferredcites →https://doi.org/10.1137/s0097539790187084openalex-snapshot

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

inferredcites →https://doi.org/10.1145/10590.10593openalex-snapshot

Highly available distributed services and fault-tolerant distributed garbage collection

inferredcites →https://doi.org/10.1145/10590.10609openalex-snapshot

Efficient synchronization of multiprocessors with shared memory

inferredcites →https://doi.org/10.1145/112600.112612openalex-snapshot

Consensus in the presence of timing uncertainty

inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot

Wait-free synchronization

inferredcites →https://doi.org/10.1145/129393.129394openalex-snapshot

A stepwise refinement heuristic for protocol construction

inferredcites →https://doi.org/10.1145/129712.129770openalex-snapshot

Efficient fault tolerant algorithms for resource allocation in distributed systems

inferredcites →https://doi.org/10.1145/129712.129776openalex-snapshot

Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!

inferredcites →https://doi.org/10.1145/135419.135461openalex-snapshot

From sequential layers to distributed processes

inferredcites →https://doi.org/10.1145/135419.135463openalex-snapshot

A tradeoff between safety and liveness for randomized coordinated attack protocols

inferredcites →https://doi.org/10.1145/146585.146596openalex-snapshot

The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels

inferredcites →https://doi.org/10.1145/146637.146638openalex-snapshot

A little knowledge goes a long way

inferredcites →https://doi.org/10.1145/151261.151267openalex-snapshot

Simulating synchronized clocks and common knowledge in distributed systems

inferredcites →https://doi.org/10.1145/153724.153741openalex-snapshot

Atomic snapshots of shared memory

inferredcites →https://doi.org/10.1145/164051.164068openalex-snapshot

Designing algorithms for distributed systems with partially synchronized clocks

inferredcites →https://doi.org/10.1145/167088.167101openalex-snapshot

Fully polynomial Byzantine agreement in t + 1 rounds

inferredcites →https://doi.org/10.1145/167088.167119openalex-snapshot

Generalized FLP impossibility result for t -resilient asynchronous computations

inferredcites →https://doi.org/10.1145/167088.167122openalex-snapshot

Wait-free k -set agreement is impossible

inferredcites →https://doi.org/10.1145/167088.167125openalex-snapshot

The asynchronous computability theorem for t -resilient tasks

inferredcites →https://doi.org/10.1145/174147.169676openalex-snapshot

The impossibility of implementing reliable communication in the face of crashes

inferredcites →https://doi.org/10.1145/174644.174649openalex-snapshot

Bounds on the time to reach agreement in the presence of timing uncertainty

inferredcites →https://doi.org/10.1145/174652.174657openalex-snapshot

The elusive atomic register

inferredcites →https://doi.org/10.1145/174662.174665openalex-snapshot

Compositional specification and verification of distributed systems

inferredcites →https://doi.org/10.1145/176575.176576openalex-snapshot

Sequential consistency versus linearizability

inferredcites →https://doi.org/10.1145/177492.177726openalex-snapshot

The temporal logic of actions

inferredcites →https://doi.org/10.1145/1780.1804openalex-snapshot

The drinking philosophers problem

inferredcites →https://doi.org/10.1145/179812.179902openalex-snapshot

Are wait-free algorithms fast?

inferredcites →https://doi.org/10.1145/195058.195144openalex-snapshot

A simple constructive computability theorem for wait-free computation

inferredcites →https://doi.org/10.1145/195613.195651openalex-snapshot

Reliable communication over unreliable channels

inferredcites →https://doi.org/10.1145/195664.195666openalex-snapshot

Quorum consensus in nested-transaction systems

inferredcites →https://doi.org/10.1145/200836.200869openalex-snapshot

Sharing memory robustly in message-passing systems

inferredcites →https://doi.org/10.1145/200836.200871openalex-snapshot

Constructing 1-writer multireader multivalued atomic variables from regular variables

inferredcites →https://doi.org/10.1145/210118.210133openalex-snapshot

Recoverable sequence transmission protocols

inferredcites →https://doi.org/10.1145/214451.214456openalex-snapshot

Distributed snapshots

inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot

Unreliable failure detectors for reliable distributed systems

inferredcites →https://doi.org/10.1145/234533.234549openalex-snapshot

The weakest failure detector for solving consensus

inferredcites →https://doi.org/10.1145/234533.234556openalex-snapshot

How to share concurrent wait-free variables

inferredcites →https://doi.org/10.1145/2402.322387openalex-snapshot

Efficiency of Synchronous Versus Asynchronous Distributed Systems

inferredcites →https://doi.org/10.1145/2402.322398openalex-snapshot

The Weak Byzantine Generals Problem

inferredcites →https://doi.org/10.1145/28395.28421openalex-snapshot

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

inferredcites →https://doi.org/10.1145/2993.2994openalex-snapshot

Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.

inferredcites →https://doi.org/10.1145/300307.1040360openalex-snapshot

Elements of the Theory of Computation

inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot

Impossibility of distributed consensus with one faulty process

inferredcites →https://doi.org/10.1145/319702.319717openalex-snapshot

Distributed deadlock detection algorithm

inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot

Reaching Agreement in the Presence of Faults

inferredcites →https://doi.org/10.1145/322290.322302openalex-snapshot

Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable

inferredcites →https://doi.org/10.1145/355592.365595openalex-snapshot

Additional comments on a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/355606.361895openalex-snapshot

Further comments on Dijkstra's concurrent programming control problem

inferredcites →https://doi.org/10.1145/357084.357087openalex-snapshot

Distributed Termination

inferredcites →https://doi.org/10.1145/357195.357198openalex-snapshot

Concurrent Reading While Writing

inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot

A Distributed Algorithm for Minimum-Weight Spanning Trees

inferredcites →https://doi.org/10.1145/357360.357365openalex-snapshot

Distributed deadlock detection

inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot

Solution of a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/358527.358537openalex-snapshot

An optimal algorithm for mutual exclusion in computer networks

inferredcites →https://doi.org/10.1145/359024.359029openalex-snapshot

Decentralized extrema-finding in circular configurations of processors

inferredcites →https://doi.org/10.1145/359104.359108openalex-snapshot

An improved algorithm for decentralized extrema-finding in circular configurations of processes

inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot

Time, clocks, and the ordering of events in a distributed system

inferredcites →https://doi.org/10.1145/359763.359789openalex-snapshot

Abstraction mechanisms in CLU

inferredcites →https://doi.org/10.1145/361082.361093openalex-snapshot

A new solution of Dijkstra's concurrent programming problem

inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot

A note on reliable full-duplex transmission over half-duplex links

inferredcites →https://doi.org/10.1145/363162.363167openalex-snapshot

Additional comments on a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/3788687openalex-snapshot

An Introduction to Input/Output Automata

inferredcites →https://doi.org/10.1145/41840.41844openalex-snapshot

Shifting gears: changing algorithms on the fly to expedite Byzantine agreement

inferredcites →https://doi.org/10.1145/41840.41845openalex-snapshot

Fault-tolerant decision making in totally asynchronous distributed systems

inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot

On processor coordination using asynchronous hardware

inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot

Hierarchical correctness proofs for distributed algorithms

inferredcites →https://doi.org/10.1145/4221.214134openalex-snapshot

Asynchronous consensus and broadcast protocols

inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot

Complexity of network synchronization

inferredcites →https://doi.org/10.1145/42282.42283openalex-snapshot

Consensus in the presence of partial synchrony

inferredcites →https://doi.org/10.1145/48014.48247openalex-snapshot

Computing on an anonymous ring

inferredcites →https://doi.org/10.1145/5383.5385openalex-snapshot

The mutual exclusion problem

inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot

On the andvantages of free choice

inferredcites →https://doi.org/10.1145/588058.588080openalex-snapshot

Concurrency control for resilient nested transactions

inferredcites →https://doi.org/10.1145/5925.5931openalex-snapshot

Reaching approximate agreement in the presence of faults

inferredcites →https://doi.org/10.1145/59287.59292openalex-snapshot

Distributed FIFO allocation of identical resources using small shared space

inferredcites →https://doi.org/10.1145/62212.62225openalex-snapshot

Optimal algorithms for Byzantine agreement

inferredcites →https://doi.org/10.1145/62546.62552openalex-snapshot

A lattice-structured proof of a minimum spanning

inferredcites →https://doi.org/10.1145/62546.62556openalex-snapshot

Understanding and verifying distributed algorithms using stratified decomposition

inferredcites →https://doi.org/10.1145/62546.62567openalex-snapshot

Improved algorithms for distributed resource allocation

inferredcites →https://doi.org/10.1145/62546.62572openalex-snapshot

Data link layer: two impossibility results

inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot

On achieving consensus using a shared memory

inferredcites →https://doi.org/10.1145/6306.6308openalex-snapshot

A quorum-consensus replication method for abstract data types

inferredcites →https://doi.org/10.1145/69622.357194openalex-snapshot

An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem

inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot

Specifying Concurrent Program Modules

inferredcites →https://doi.org/10.1145/72981.72986openalex-snapshot

Tight bounds for the sequence transmission problem

inferredcites →https://doi.org/10.1145/73007.73051openalex-snapshot

Bounded concurrrent time-stamp systems are constructible

inferredcites →https://doi.org/10.1145/7351.7478openalex-snapshot

Reliable communication in the presence of failures

inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot

On the minimal synchronism needed for distributed consensus

inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot

Electing a leader in a synchronous ring

showing the first 200 of 223

What points at this work

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

inferred← citeshttps://doi.org/10.3217/jucs-011-06-1054openalex-extracted

Model Checking, Automated Abstraction, and Compositional Verification of Rebeca Models

inferred← citeshttps://doi.org/10.3217/jucs-011-10-1695openalex-extracted

Modular Verification of a Component-Based Actor Language.

inferred← citeshttps://doi.org/10.3217/jucs-012-08-0981openalex-extracted

Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM

inferred← citeshttps://doi.org/10.3217/jucs-015-02-0444openalex-extracted

Stability in Heterogeneous Multimedia Networks under Adversarial Attacks

inferred← citeshttps://doi.org/10.3217/jucs-023-02-0129openalex-extracted

Communication in Abstract State Machines

inferred← citeshttps://doi.org/10.5281/zenodo.41911openalex-extracted

Polynomial Filter Design For Quantized Consensus

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/0471224561.ch10openalex-snapshot

Leader Election Protocols for Radio Networks

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

Cooperating Mobile Agents

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

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

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

Event‐Triggered Communication and Control for Multi‐Agent Average Consensus

inferred← citeshttps://doi.org/10.1002/9781119993766.app1openalex-snapshot

Appendix A: Examples

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.635openalex-snapshot

Advanced concurrency control in Java

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

Consensus control for a class of networks of dynamic agents

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

Distributed multi‐vehicle coordinated controlvialocal information exchange

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

Constructing consensus controllers for networks with identical general linear agents

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

Coordination of discrete‐time multi‐agent systems via relative output feedback

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

Cooperative adaptive sampling of random fields with partially known covariance

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

The impact of multi‐group multi‐layer network structure on the performance of distributed consensus building strategies

inferred← citeshttps://doi.org/10.1002/scj.4690270301openalex-snapshot

A method of communication route switching by a distributed algorithm

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

Mobility control for throughput maximization in ad hoc networks

inferred← citeshttps://doi.org/10.1006/inco.1996.0060openalex-snapshot

Forward and Backward Simulations

inferred← citeshttps://doi.org/10.1006/inco.2001.3085openalex-snapshot

Fair Simulation

inferred← citeshttps://doi.org/10.1006/inco.2001.3088openalex-snapshot

Distributed Probabilistic Polling and Applications to Proportionate Agreement

inferred← citeshttps://doi.org/10.1006/jagm.2000.1110openalex-snapshot

The Las-Vegas Processor Identity Problem (How and When to Be Unique)

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

Remote Reference Counting: Distributed Garbage Collection with Low Communication and Computation Overhead

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/0-387-27972-5_10openalex-snapshot

Multi-Agent Coordination in Open Environments

inferred← citeshttps://doi.org/10.1007/1-4020-3532-2_3openalex-snapshot

Interface-Based Design

inferred← citeshttps://doi.org/10.1007/1-4020-8058-1_17openalex-snapshot

Coordination Infrastructures in the Engineering of Multiagent Systems

inferred← citeshttps://doi.org/10.1007/1-4020-8058-1_19openalex-snapshot

Engineering Amorphous Computing Systems

inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_16openalex-snapshot

The Driving Philosophers

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

Compact Implicit Representation of Graphs

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

Auctions without Auctioneers: Distributed Auction Protocols

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_2openalex-snapshot

Building and Using Quorums Despite any Number of Process of Crashes

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

Failure Detection with Booting in Partially Synchronous Systems

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/11429647_15openalex-snapshot

An Improved Algorithm for Adaptive Condition-Based Consensus

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

On Private Computation in Incomplete Networks

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

General Homomorphic Overloading

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

Termination Properties of TCP’s Connection Management Procedures

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

On the Expressive Power of Petri Net Schemata

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/11516798_21openalex-snapshot

A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks

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

Fast Localized Delaunay Triangulation

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

Programming an Amorphous Computational Medium

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

Distributed Kalman Filtering and Sensor Fusion in Sensor Networks

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/11549468_72openalex-snapshot

A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree

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

Random Walks in Distributed Computing: A Survey

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_11openalex-snapshot

Computing with Reads and Writes in the Absence of Step Contention

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

Proving Atomicity: An Assertional Approach

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

Ω Meets Paxos: Leader Election and Stability Without Eventual Timely Links

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/11561927_19openalex-snapshot

What Can Be Implemented Anonymously?

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

Adaptive Software Transactional Memory

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

The Dynamic And-Or Quorum System

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

Obstruction-Free Algorithms Can Be Practically Wait-Free

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

Thread Allocation Protocols for Distributed Real-Time and Embedded Systems

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

A Formal Model for Fault-Tolerance in Distributed Systems

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/11564751_6openalex-snapshot

Dynamic Ordering for Asynchronous Backtracking on DisCSPs

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/11573937_17openalex-snapshot

Revisiting the Election Problem in Asynchronous Distributed Systems

inferred← citeshttps://doi.org/10.1007/11575863_72openalex-snapshot

Requirements for Secure Logging of Decentralized Cross-Organizational Workflow Executions

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_11openalex-snapshot

On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection

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

Towards Automatic Convergence Verification of Self-stabilizing Algorithms

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

A Snap-Stabilizing DFS with a Lower Space Requirement

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/11596356_58openalex-snapshot

Nonintrusive Snapshots Using Thin Slices

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

Performance of Pipelined Asynchronous Systems

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

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

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

Model Checking the Time to Reach Agreement

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

An Asynchronous Recovery Algorithm Based on a Staggered Quasi-Synchronous Checkpointing Algorithm

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

Labeling Schemes for Tree Representation

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

Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes

inferred← citeshttps://doi.org/10.1007/11604655_21openalex-snapshot

Divide and Concur: Employing Chandra and Toueg’s Consensus Algorithm in a Multi-level Setting

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/11783565_3openalex-snapshot

Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System

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/11795490_6openalex-snapshot

Randomized Wait-Free Consensus Using an Atomicity Assumption

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

Separation Results Via Leader Election Problems

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/11823285_56openalex-snapshot

A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks

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

A Knowledge-Based Analysis of Global Function Computation

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

One-Step Consensus Solvability

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/11888116_2openalex-snapshot

The + CAL Algorithm Language

inferred← citeshttps://doi.org/10.1007/11914952_52openalex-snapshot

Self-organizing and Self-stabilizing Role Assignment in Sensor/Actuator Networks

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/11935308_32openalex-snapshot

Secure Set Membership Using 3Sat

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_3openalex-snapshot

A Topological Treatment of Early-Deciding Set-Agreement

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_12openalex-snapshot

On Distributed Verification

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

The Complexity of Updating Multi-writer Snapshot Objects

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

Distributed Node-Based Transmission Power Control for Wireless Ad Hoc Networks

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

Revisiting Colored Networks and Privacy Preserving Censorship

inferred← citeshttps://doi.org/10.1007/3-540-34874-3_8openalex-snapshot

Interactive Algorithms 2005 with Added Appendix

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-36080-8_5openalex-snapshot

Solving Agreement Problems with Weak Ordering Oracles

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

Early-Delivery Dynamic Atomic Broadcast

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_16openalex-snapshot

Failure Detection Lower Bounds on Registers and Consensus

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

On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems

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

Distributed Agreement and Its Relation with Error-Correcting Codes

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

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols

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-36108-1_8openalex-snapshot

Simple Wait-Free Multireader Registers

inferred← citeshttps://doi.org/10.1007/3-540-36135-9_10openalex-snapshot

A Formal Venture into Reliable Multicast Territory

inferred← citeshttps://doi.org/10.1007/3-540-36135-9_24openalex-snapshot

Mechanical Translation of I/O Automaton Specifications into First-Order Logic

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-36285-1_1openalex-snapshot

Open Problems in Data-Sharing Peer-to-Peer Systems

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

Distributed Algorithm Engineering

inferred← citeshttps://doi.org/10.1007/3-540-36384-x_23openalex-snapshot

Using Simulated Execution in Verifying Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-36385-8_7openalex-snapshot

Concurrent Reading and Writing with Mobile Agents

inferred← citeshttps://doi.org/10.1007/3-540-36477-3_4openalex-snapshot

Teaching Algorithms and Data Structures: 10 Personal Observations

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-36577-x_9openalex-snapshot

Verification and Improvement of the Sliding Window Protocol

inferred← citeshttps://doi.org/10.1007/3-540-36978-3_22openalex-snapshot

Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network

inferred← citeshttps://doi.org/10.1007/3-540-36978-3_33openalex-snapshot

Efficient and Fault-Tolerant Feature Extraction in Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1007/3-540-37795-6_11openalex-snapshot

Modeling Complexity in Secure Distributed Computing

inferred← citeshttps://doi.org/10.1007/3-540-37795-6_3openalex-snapshot

Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing?

inferred← citeshttps://doi.org/10.1007/3-540-39997-6_9openalex-snapshot

The Performance Impact of Advance Reservation Meta-scheduling

inferred← citeshttps://doi.org/10.1007/3-540-40026-5_1openalex-snapshot

Lower Bounds in Distributed Computing

inferred← citeshttps://doi.org/10.1007/3-540-40026-5_9openalex-snapshot

On the Importance of Having an Identity or, is Consensus really Universal?

inferred← citeshttps://doi.org/10.1007/3-540-40922-x_5openalex-snapshot

Automated Refinement Checking for Asynchronous Processes

inferred← citeshttps://doi.org/10.1007/3-540-44450-5_39openalex-snapshot

Keeping Track of the Latest Gossip in Shared Memory Systems

inferred← citeshttps://doi.org/10.1007/3-540-44518-8_8openalex-snapshot

Towards an ASM Thesis for Unconventional Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-44585-4_17openalex-snapshot

Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM?

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_3openalex-snapshot

Compositional Performance Analysis Using Probabilistic I/O Automata

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_33openalex-snapshot

The Control of Synchronous Systems

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_39openalex-snapshot

Revisiting Safety and Liveness in the Context of Failures

inferred← citeshttps://doi.org/10.1007/3-540-44647-8_31openalex-snapshot

Secure and Efficient Asynchronous Broadcast Protocols

inferred← citeshttps://doi.org/10.1007/3-540-44667-2_6openalex-snapshot

Verification of Randomized Distributed Algorithms

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-44685-0_18openalex-snapshot

A Faster-than Relation for Asynchronous Processes

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_24openalex-snapshot

Compositional Methods for Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/3-540-44688-5_13openalex-snapshot

An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks

inferred← citeshttps://doi.org/10.1007/3-540-44723-7_9openalex-snapshot

Customer Coalitions in Electronic Markets

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-44755-5_9openalex-snapshot

Proving Hybrid Protocols Correct

inferred← citeshttps://doi.org/10.1007/3-540-44803-9_20openalex-snapshot

The Use of Aggregate and Z Formal Methods for Specification and Analysis of Distributed Systems

inferred← citeshttps://doi.org/10.1007/3-540-44895-0_12openalex-snapshot

Security in Business Process Engineering

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-45022-x_41openalex-snapshot

Reasoning about Message Passing in Finite State Environments

inferred← citeshttps://doi.org/10.1007/3-540-45032-7_15openalex-snapshot

An Improved Snap-Stabilizing PIF Algorithm

inferred← citeshttps://doi.org/10.1007/3-540-45032-7_3openalex-snapshot

Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks

inferred← citeshttps://doi.org/10.1007/3-540-45071-8_25openalex-snapshot

Group Mutual Exclusion Algorithms Based on Ticket Orders

inferred← citeshttps://doi.org/10.1007/3-540-45251-6_30openalex-snapshot

A Heuristic for Symmetry Reductions with Scalarsets

inferred← citeshttps://doi.org/10.1007/3-540-45294-x_18openalex-snapshot

Verification of a Leader Election Algorithm in Timed Asynchronous Systems

inferred← citeshttps://doi.org/10.1007/3-540-45319-9_14openalex-snapshot

Linear Parametric Model Checking of Timed Automata

inferred← citeshttps://doi.org/10.1007/3-540-45352-0_2openalex-snapshot

Issues in the Refinement of Distributed Programs

inferred← citeshttps://doi.org/10.1007/3-540-45353-9_30openalex-snapshot

Targeted Advertising ... and Privacy Too

inferred← citeshttps://doi.org/10.1007/3-540-45397-0_17openalex-snapshot

An Actor Algebra for Specifying Distributed Systems: The Hurried Philosophers Case Study

inferred← citeshttps://doi.org/10.1007/3-540-45414-4_10openalex-snapshot

A New Synchronous Lower Bound for Set Agreement

inferred← citeshttps://doi.org/10.1007/3-540-45414-4_16openalex-snapshot

A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings

inferred← citeshttps://doi.org/10.1007/3-540-45414-4_22openalex-snapshot

Stabilizing Replicated Search Trees

inferred← citeshttps://doi.org/10.1007/3-540-45449-7_11openalex-snapshot

Interface Theories for Component-Based Design

inferred← citeshttps://doi.org/10.1007/3-540-45484-5_17openalex-snapshot

Refining Interactions in a Distributed System

inferred← citeshttps://doi.org/10.1007/3-540-45500-0_27openalex-snapshot

The UDP Calculus: Rigorous Semantics for Real Networking

inferred← citeshttps://doi.org/10.1007/3-540-45508-6_28openalex-snapshot

Developing Pattern-Based Management Programs

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

Automated Analysis of Java Message Service Providers

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

Rational Exchange - A Formal Model Based on Game Theory

inferred← citeshttps://doi.org/10.1007/3-540-45605-8_1openalex-snapshot

Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs

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

Verifying Erlang Code: A Resource Locker Case-Study

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

VAlloy — Virtual Functions Meet a Relational Language

showing the first 200 of 3324

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.