1542 search results - page 31 / 309 » The metamathematics of random graphs |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
STOC
2000
ACM
15 years 2 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
115
click to vote
ISCA
2012
IEEE
13 years 3 days ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
COMGEO
1999
ACM
14 years 9 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...