Algorithms – ESA 2005

DOI10.1007/11561071zbMath1142.68320OpenAlexW2501059503MaRDI QIDQ5475888

Maxwell Young, Jared Saia, Amos Fiat

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (11)

Towards worst-case churn resistant peer-to-peer systems ⋮ Markov chains competing for transitions: application to large-scale distributed systems ⋮ A theoretical and empirical evaluation of an algorithm for self-healing computation ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Bankrupting Sybil despite churn ⋮ Choosing a random peer in Chord ⋮ Reliable Resource Searching in P2P Networks ⋮ Reducing communication costs in robust peer-to-peer networks ⋮ Towards a scalable and robust DHT ⋮ Robust random number generation for peer-to-peer systems ⋮ Distributed agreement in dynamic peer-to-peer networks

This page was built for publication: Algorithms – ESA 2005