Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Brief Announcement

From MaRDI portal
Publication:2796253
Jump to:navigation, search

DOI10.1145/2767386.2767447zbMath1446.68110OpenAlexW2163841653MaRDI QIDQ2796253

Florent Becker, Eric Rémila, Ivan Rapaport, Antonio Fernández Anta

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2767386.2767447


zbMATH Keywords

message passingdistributed computationCONGEST modelcongested clique model


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Network protocols (68M12)


Related Items (2)

Unnamed Item ⋮ The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model







This page was built for publication: Brief Announcement

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2796253&oldid=15694461"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 17:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki