17 search results - page 4 / 4 » Universal Limit Laws for Depths in Random Trees |
RSA
2010
13 years 3 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
SPAA
1997
ACM
13 years 9 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...