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

Finding OR in a noisy broadcast network

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

DOI10.1016/S0020-0190(00)00002-8zbMath1339.68016MaRDI QIDQ294723

Uriel Feige, Joe Kilian

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000028?np=y


zbMATH Keywords

distributed algorithmsagreementnoisy computation


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)


Related Items

Unnamed Item ⋮ Computing in fault tolerant broadcast networks and noisy decision trees



Cites Work

  • Finding parity in a simple broadcast network
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:294723&oldid=12176362"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki