Sciweavers

21 search results - page 3 / 5
» algorithmica 2005
Sort
View
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 8 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
ALGORITHMICA
2005
92views more  ALGORITHMICA 2005»
13 years 8 months ago
Average-Case Competitive Analyses for Ski-Rental Problems
Let s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after r...
Hiroshi Fujiwara, Kazuo Iwama
ALGORITHMICA
2005
84views more  ALGORITHMICA 2005»
13 years 8 months ago
Optimal Read-Once Parallel Disk Scheduling
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
Mahesh Kallahalla, Peter J. Varman
ALGORITHMICA
2005
102views more  ALGORITHMICA 2005»
13 years 8 months ago
Effective Routing and Scheduling in Adversarial Queueing Networks
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
Jay Sethuraman, Chung-Piaw Teo
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
13 years 8 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman