Sciweavers

52 search results - page 7 / 11
» Distribution of subgraphs of random regular graphs
Sort
View
SAC
2010
ACM
14 years 2 months 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
CIKM
2010
Springer
13 years 5 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ICALP
2009
Springer
14 years 2 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald