8 search results - page 1 / 2 » Optimally pebbling hypercubes and powers |
63
Voted
DM
1998
14 years 9 months ago
1998
JGT
2008
14 years 10 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
91
Voted
STOC
2004
ACM
15 years 3 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
SIGMOD
1996
ACM
15 years 2 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...