1542 search results - page 151 / 309 » The metamathematics of random graphs |
115
click to vote
SIROCCO
2010
15 years 3 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
113
click to vote
COMBINATORICA
2007
15 years 1 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
105
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
130
click to vote
TCS
2010
15 years 9 days ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
154
click to vote
WWW
2011
ACM
14 years 8 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...