Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory

DOI10.1002/net.10094zbMath1031.68013OpenAlexW2055943982MaRDI QIDQ4432766

Yannis C. Stamatiou, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc

Publication date: 29 October 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10094

zbMATH Keywords

random walkscliquecomplete network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Memoryless search algorithms in a network with faulty advice

Cites Work

• Lower bounds for noisy Boolean decision trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory