Computing functions on asynchronous anonymous networks (Q4887486): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better computing on the anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on an anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two lower bounds in asynchronous distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap Theorems for Distributed Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing functions on asynchronous anonymous networks / rank
 
Normal rank

Revision as of 12:53, 24 May 2024

scientific article; zbMATH DE number 913008
Language Label Description Also known as
English
Computing functions on asynchronous anonymous networks
scientific article; zbMATH DE number 913008

    Statements

    Identifiers