Sciweavers

72 search results - page 8 / 15
» Hierarchical Correctness Proofs for Distributed Algorithms
Sort
View
JUCS
2006
124views more  JUCS 2006»
13 years 7 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang
GC
2004
Springer
14 years 23 days ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 1 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
PODC
2009
ACM
14 years 8 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 7 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant