2095 search results - page 133 / 419 » Improved pebbling bounds |
147
click to vote
WINE
2005
Springer
15 years 12 months ago
2005
Springer
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with ...
160
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
Kahn process networks (KPNs) are a programming paradigm suitable for streaming-based multimedia and signal-processing applications. We discuss the execution of KPNs, and the criter...
138
click to vote
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
180
click to vote
ICALP
1999
Springer
15 years 10 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
154
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...