Sciweavers

14 search results - page 3 / 3
» Short Cycles in Random Regular Graphs
Sort
View
SAC
2010
ACM
14 years 10 days ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
13 years 11 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
13 years 11 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
John E. Hopcroft, Daniel Sheldon
ACNS
2006
Springer
87views Cryptology» more  ACNS 2006»
13 years 9 months ago
Effect of Malicious Synchronization
Abstract. We study the impact of malicious synchronization on computer systems that serve customers periodically. Systems supporting automatic periodic updates are common in web se...
Mun Choon Chan, Ee-Chien Chang, Liming Lu, Peng So...