Some combinatorial aspects of time-stamp systems

DOI10.1006/eujc.1993.1013zbMath0771.05043OpenAlexW2016423197MaRDI QIDQ1209725

Robert Cori, Eric Sopena

Publication date: 16 May 1993

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6d515f429436836ffc60c17b4bd31ae07e71818e

zbMATH Keywords

oriented graphdistributed computingtime-stamp system

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distributed algorithms (68W15)

Related Items (5)

The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ Keeping track of the latest gossip in a distributed system ⋮ A model for learning the news in social networks ⋮ Time and space optimal implementations of atomic multi-writer register ⋮ Time-stamps for Mazurkiewicz traces.

This page was built for publication: Some combinatorial aspects of time-stamp systems