| Publication | Date of Publication | Type |
|---|
Self-stabilizing multivalued consensus in asynchronous crash-prone systems
Theoretical Computer Science | 2024-12-02 | Paper |
Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
Theoretical Computer Science | 2024-10-07 | Paper |
Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
Distributed Computing | 2024-07-26 | Paper |
Detecting diamond necklaces in labeled dags (a problem from distributed debugging)
| 2024-06-05 | Paper |
Brief Announcement: The MBroadcast Abstraction
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Self-stabilizing indulgent zero-degrading binary consensus
Theoretical Computer Science | 2024-02-20 | Paper |
Mutual exclusion vs consensus: both sides of the same coin?
| 2024-02-06 | Paper |
About informatics, distributed computing, and our job: a personal view
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Asynchronous Byzantine reliable broadcast with a message adversary
Theoretical Computer Science | 2023-10-12 | Paper |
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
Theoretical Computer Science | 2023-09-07 | Paper |
Optimal algorithms for synchronous Byzantine \(k\)-set agreement
Theoretical Computer Science | 2023-09-07 | Paper |
Set agreement and renaming in the presence of contention-related crash failures
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Bee's strategy against Byzantines. Replacing Byzantine participants (extended abstract)
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Reaching agreement in the presence of contention-related crash failures
Theoretical Computer Science | 2023-06-21 | Paper |
Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
Distributed Computing | 2023-06-19 | Paper |
Reaching consensus in the presence of contention-related crash failures
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Optimal algorithms for synchronous Byzantine \(k\)-set agreement
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
| 2023-04-21 | Paper |
k-Immediate Snapshot and x-Set Agreement: How Are They Related?
| 2023-03-21 | Paper |
Brief Announcement: Leader Election in the ADD Communication Model
| 2023-03-21 | Paper |
scientific article; zbMATH DE number 7650856 (Why is no real title available?)
| 2023-02-07 | Paper |
Which broadcast abstraction captures \(k\)-set agreement?
| 2023-02-03 | Paper |
Election in fully anonymous shared memory systems: tight space bounds and algorithms
| 2022-11-11 | Paper |
Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems
Information Processing Letters | 2022-10-28 | Paper |
On the versatility of Bracha's Byzantine reliable broadcast algorithm
Parallel Processing Letters | 2022-07-08 | Paper |
An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
Parallel Processing Letters | 2022-07-08 | Paper |
A simple object that spans the whole consensus hierarchy
Parallel Processing Letters | 2022-07-04 | Paper |
Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
Information and Computation | 2022-06-08 | Paper |
A visit to mutual exclusion in seven dates
Theoretical Computer Science | 2022-05-10 | Paper |
scientific article; zbMATH DE number 7515766 (Why is no real title available?)
| 2022-04-28 | Paper |
Concurrent crash-prone shared memory systems. A few theoretical notions
Synthesis Lectures on Distributed Computing Theory | 2022-04-19 | Paper |
Contention-related crash failures: definitions, agreement algorithms, and impossibility results
Theoretical Computer Science | 2022-03-01 | Paper |
Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
Theoretical Computer Science | 2021-10-06 | Paper |
Byzantine-tolerant causal broadcast
Theoretical Computer Science | 2021-09-06 | Paper |
Money transfer made simple: a specification, a generic algorithm, and its proof
| 2021-08-30 | Paper |
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Time-efficient read/write register in crash-prone asynchronous message-passing systems
Computing | 2021-01-15 | Paper |
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing | 2020-12-04 | Paper |
A simple and fast asynchronous consensus protocol based on a weak failure detector
| 2020-12-03 | Paper |
Communication-based prevention of useless checkpoints in distributed computations
Distributed Computing | 2020-12-03 | Paper |
Leader-based de-anonymization of an anonymous read/write memory
Theoretical Computer Science | 2020-08-25 | Paper |
scientific article; zbMATH DE number 7228882 (Why is no real title available?)
| 2020-08-06 | Paper |
Mutual exclusion in fully anonymous shared memory systems
Information Processing Letters | 2020-04-03 | Paper |
Anonymous Read/write memory: leader election and de-anonymization
| 2020-03-03 | Paper |
An informal visit to the wonderful land of consensus numbers and beyond
| 2020-01-13 | Paper |
scientific article; zbMATH DE number 7141420 (Why is no real title available?)
| 2019-12-09 | Paper |
Making local algorithms wait-free: the case of ring coloring
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Fault-tolerant message-passing distributed systems. An algorithmic approach
| 2019-10-18 | Paper |
Crash-tolerant causal broadcast in \(O(n)\) messages
Information Processing Letters | 2019-09-20 | Paper |
An introductory tutorial to concurrency-related distributed recursion
| 2019-07-03 | Paper |
Distributed universal constructions: a guided tour
| 2019-07-03 | Paper |
Making local algorithms wait-free: the case of ring coloring
Theory of Computing Systems | 2019-06-21 | Paper |
Unifying Concurrent Objects and Distributed Tasks
Journal of the ACM | 2019-02-25 | Paper |
Vertex coloring with communication and local memory constraints in synchronous broadcast networks
| 2018-12-07 | Paper |
Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
| 2018-08-24 | Paper |
Are Byzantine failures really different from crash failures?
| 2018-08-16 | Paper |
Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
Journal of the ACM | 2018-08-02 | Paper |
A pleasant stroll through the land of distributed machines, computation, and universality
| 2018-06-26 | Paper |
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers | 2018-06-12 | Paper |
Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks
IEEE Transactions on Computers | 2018-06-12 | Paper |
Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
Distributed Computing | 2018-04-11 | Paper |
Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
Theoretical Computer Science | 2017-12-20 | Paper |
Trading off \(t\)-resilience for efficiency in asynchronous Byzantine reliable broadcast
Parallel Processing Letters | 2017-12-15 | Paper |
A fast contention-friendly binary search tree
Parallel Processing Letters | 2017-12-15 | Paper |
Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
| 2017-09-29 | Paper |
Two-bit messages are sufficient to implement atomic read/write registers in crash-prone systems
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
Acta Informatica | 2017-09-29 | Paper |
Signature-free communication and agreement in the presence of Byzantine processes
| 2017-09-29 | Paper |
Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
Theory of Computing Systems | 2017-08-15 | Paper |
From wait-free to arbitrary concurrent solo executions in colorless distributed computing
Theoretical Computer Science | 2017-05-22 | Paper |
Predicate Detection in Asynchronous Distributed Systems: A Probabilistic Approach
IEEE Transactions on Computers | 2017-05-16 | Paper |
From causal consistency to sequential consistency in shared memory systems
Lecture Notes in Computer Science | 2017-01-19 | Paper |
\(t\)-resilient immediate snapshot Is impossible
Structural Information and Communication Complexity | 2016-12-01 | Paper |
A distributed leader election algorithm in crash-recovery and omissive systems
Information Processing Letters | 2016-11-23 | Paper |
Distributed universality
Algorithmica | 2016-10-21 | Paper |
A necessary condition for Byzantine \(k\)-set agreement
Information Processing Letters | 2016-08-16 | Paper |
From binary consensus to multivalued consensus in asynchronous message-passing systems
Information Processing Letters | 2016-06-16 | Paper |
Generalized symmetry breaking tasks and nondeterminism in concurrent objects
SIAM Journal on Computing | 2016-04-25 | Paper |
Implementing set objects in dynamic distributed systems
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Minimal synchrony for Byzantine consensus
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Communication patterns and input patterns in distributed computing (invited talk)
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM | 2015-11-12 | Paper |
Rollback-dependency trackability
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
Timed consistency for shared distributed objects
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Irreducibility and additivity of set agreement-oriented failure detector classes
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
\(K\)-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Distributed Universality
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Brief announcement: Increasing the power of the iterated immediate snapshot model with failure detectors
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
The renaming problem in shared memory systems: an introduction
Computer Science Review | 2014-10-24 | Paper |
Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
Structural Information and Communication Complexity | 2014-08-07 | Paper |
What can be computed in a distributed system?
From Programs to Systems. The Systems perspective in Computing | 2014-07-24 | Paper |
Computing in the presence of concurrent solo executions
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Failure detectors are schedulers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Trust-aware peer sampling: performance and privacy tradeoffs
Theoretical Computer Science | 2014-01-13 | Paper |
The weakest failure detector to implement a register in asynchronous systems with hybrid communication
Theoretical Computer Science | 2014-01-13 | Paper |
Power and limits of distributed computing shared memory models
Theoretical Computer Science | 2014-01-13 | Paper |
Towards a universal construction for transaction-based multiprocess programs
Theoretical Computer Science | 2014-01-10 | Paper |
Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Anonymous asynchronous systems: the case of failure detectors
Distributed Computing | 2013-08-26 | Paper |
Distributed Algorithms for Message-Passing Systems
| 2013-07-29 | Paper |
The \(k\)-simultaneous consensus problem
Distributed Computing | 2013-06-28 | Paper |
On the computability power and the robustness of set agreement-oriented failure detector classes
Distributed Computing | 2013-06-28 | Paper |
Synchronous condition-based consensus
Distributed Computing | 2013-06-13 | Paper |
Failure detectors to solve asynchronous \(k\)-set agreement: a glimpse of recent results
| 2013-01-28 | Paper |
Concurrent programming: algorithms, principles, and foundations.
| 2012-10-12 | Paper |
Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
Theoretical Computer Science | 2012-08-10 | Paper |
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
From the happened-before relation to the causal ordered set abstraction
Journal of Parallel and Distributed Computing | 2012-07-13 | Paper |
Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
No double discount: condition-based simultaneity yields limited gain
Information and Computation | 2012-05-24 | Paper |
Help when needed, but no more: efficient read/write partial snapshot
Journal of Parallel and Distributed Computing | 2012-02-14 | Paper |
On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
Theoretical Computer Science | 2011-07-22 | Paper |
Anonymous asynchronous systems: the case of failure detectors
Lecture Notes in Computer Science | 2010-09-10 | Paper |
A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems
Information Processing Letters | 2010-09-02 | Paper |
A note on atomicity: boosting Test\&Set to solve consensus
Information Processing Letters | 2010-08-16 | Paper |
Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
Theory of Computing Systems | 2010-08-13 | Paper |
Anonymous graph exploration without collision by mobile robots
Information Processing Letters | 2010-06-09 | Paper |
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters | 2010-06-09 | Paper |
Regular register: an implementation in a churn prone environment
Structural Information and Communication Complexity | 2010-02-24 | Paper |
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Using conditions to expedite consensus in synchronous distributed systems
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Stabilizing mobile philosophers
Information Processing Letters | 2009-12-04 | Paper |
Asynchronous bounded lifetime failure detectors
Information Processing Letters | 2009-12-04 | Paper |
Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
Theoretical Computer Science | 2009-12-01 | Paper |
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Help When Needed, But No More: Efficient Read/Write Partial Snapshot
Lecture Notes in Computer Science | 2009-11-19 | Paper |
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
SIAM Journal on Computing | 2009-08-20 | Paper |
A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
Information Processing Letters | 2009-07-21 | Paper |
From adaptive renaming to set agreement
Theoretical Computer Science | 2009-03-30 | Paper |
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures
Structural Information and Communication Complexity | 2009-03-12 | Paper |
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
Lecture Notes in Computer Science | 2008-11-20 | Paper |
The Committee Decision Problem
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement
Lecture Notes in Computer Science | 2008-09-09 | Paper |
A Subjective Visit to Selected Topics in Distributed Computing
Lecture Notes in Computer Science | 2008-09-02 | Paper |
The Iterated Restricted Immediate Snapshot Model
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Narrowing Power vs. Efficiency in Synchronous Set Agreement
Distributed Computing and Networking | 2008-03-06 | Paper |
From Renaming to Set Agreement
Structural Information and Communication Complexity | 2007-11-15 | Paper |
From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing | 2007-02-19 | Paper |
The Synchronous Condition-Based Consensus Hierarchy
Lecture Notes in Computer Science | 2005-08-17 | Paper |
The Notion of Veto Number and the Respective Power of $\Diamond {\cal P}$ and $\Diamond {\cal S}$ to Solve One-Shot Agreement Problems
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
Consensus in Byzantine asynchronous systems
Journal of Discrete Algorithms | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2013822 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2013823 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2013821 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 1983294 (Why is no real title available?)
| 2003-09-18 | Paper |
scientific article; zbMATH DE number 1950677 (Why is no real title available?)
| 2003-07-17 | Paper |
scientific article; zbMATH DE number 1950666 (Why is no real title available?)
| 2003-07-17 | Paper |
scientific article; zbMATH DE number 1875370 (Why is no real title available?)
| 2003-04-03 | Paper |
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems | 2003-01-21 | Paper |
Rollback-dependency trackability: A minimal characterization and its protocol
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1830912 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1830918 (Why is no real title available?)
| 2002-11-18 | Paper |
Interval consistency of asynchronous distributed computations
Journal of Computer and System Sciences | 2002-08-04 | Paper |
Restricted failure detectors: Definition and reduction protocols
Information Processing Letters | 2002-07-25 | Paper |
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property
Information Processing Letters | 2002-07-14 | Paper |
The logically instantaneous communication mode: a communication abstraction
Future Generation Computer Systems | 2002-07-14 | Paper |
Consistent checkpointing for transaction systems
The Computer Journal. Section A Section B | 2001-10-14 | Paper |
scientific article; zbMATH DE number 1445803 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1292975 (Why is no real title available?)
| 1999-05-31 | Paper |
Consistent records in asynchronous computations
Acta Informatica | 1998-08-20 | Paper |
\(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
Theoretical Computer Science | 1998-08-13 | Paper |
Shared global states in distributed computations
Journal of Computer and System Sciences | 1998-08-04 | Paper |
Adaptive checkpointing in message passing distributed systems
International Journal of Systems Science. Principles and Applications of Systems and Integration | 1998-06-08 | Paper |
scientific article; zbMATH DE number 1036309 (Why is no real title available?)
| 1997-12-14 | Paper |
On-the-fly analysis of distributed computations
Information Processing Letters | 1997-02-28 | Paper |
scientific article; zbMATH DE number 915978 (Why is no real title available?)
| 1997-01-22 | Paper |
Distributed algorithms for static and dynamic termination detection
Bulletin of the Polish Academy of Sciences. Technical Sciences | 1996-09-05 | Paper |
Specification and verification of dynamic properties in distributed computations
Journal of Parallel and Distributed Computing | 1996-02-26 | Paper |
scientific article; zbMATH DE number 40998 (Why is no real title available?)
| 1993-01-23 | Paper |
scientific article; zbMATH DE number 107745 (Why is no real title available?)
| 1993-01-23 | Paper |
scientific article; zbMATH DE number 107746 (Why is no real title available?)
| 1993-01-23 | Paper |
scientific article; zbMATH DE number 107747 (Why is no real title available?)
| 1993-01-23 | Paper |
scientific article; zbMATH DE number 47016 (Why is no real title available?)
| 1992-09-17 | Paper |
The causal ordering abstraction and a simple way to implement it
Information Processing Letters | 1992-06-28 | Paper |
Prime numbers as a tool to design distributed algorithms
Information Processing Letters | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4115937 (Why is no real title available?)
| 1989-01-01 | Paper |
A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network
The Computer Journal | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4058843 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4053002 (Why is no real title available?)
| 1988-01-01 | Paper |
A distributed algorithm to prevent mutual drift between n logical clocks
Information Processing Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3999275 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4082934 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3768960 (Why is no real title available?)
| 1982-01-01 | Paper |
An experience in implementing abstract data types
Software: Practice and Experience | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3602665 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3630195 (Why is no real title available?)
| 1978-01-01 | Paper |
