How to meet asynchronously at polynomial cost (Q5176086): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5258918
 
aliases / en / 0aliases / en / 0
 
How to Meet Asynchronously at Polynomial Cost
description / endescription / en
 
scientific article; zbMATH DE number 6449570
Property / title
 
How to Meet Asynchronously at Polynomial Cost (English)
Property / title: How to Meet Asynchronously at Polynomial Cost (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1325.68252 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/130931990 / rank
 
Normal rank
Property / published in
 
Property / published in: SIAM Journal on Computing / rank
 
Normal rank
Property / publication date
 
24 June 2015
Timestamp+2015-06-24T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 24 June 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6449570 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1582826078 / rank
 
Normal rank

Latest revision as of 10:23, 6 May 2024

scientific article; zbMATH DE number 6449570
  • How to Meet Asynchronously at Polynomial Cost
Language Label Description Also known as
English
How to meet asynchronously at polynomial cost
scientific article; zbMATH DE number 6449570
  • How to Meet Asynchronously at Polynomial Cost

Statements

How to meet asynchronously at polynomial cost (English)
0 references
How to Meet Asynchronously at Polynomial Cost (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
2 March 2015
0 references
24 June 2015
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
asynchronous mobile agents
0 references
deterministic algorithm
0 references
gossiping
0 references
leader election
0 references
network
0 references
renaming
0 references
rendezvous
0 references
0 references
0 references
0 references