Arne A. Andersson
- 1.A. Andersson. Sublogarithmic searching without multiplications. In Proc. 36tn FOGS, pages 655-663, 1995. Google Scholar
Digital Library
- 2.A. Andersson. Faster deterministic sorting and searching in linear space. In Proc. 37th FOGS, pages 135-141, 1996. Google ScholarDigital Library
- 3.A. Andersson, P.B. Miltersen, S. Riis, and M. Thorup. Static dictionaries on AC~ RAMs: Query time O(v~og n/log log n)is necessary and sufficient. In Proc. 37ta FOUS, pages 441-450, 1996. Google ScholarDigital Library
- 4.P. Beame and F. Fich. Optimal bounds for the predecessor problem. In Proc. 31st $TOC, pages 295-304, 1999. Google ScholarDigital Library
- 5.G. Brodal. Finger search trees with constant insertion time. In Proc. 9th SODA, pages 540-549. ACM-SIAM, 1998. Google ScholarDigital Library
- 6.A. Brodnik, P. B. Miltersen, and I. Munro. Transdichotomous algorithms without multiplication - some upper and lower bounds. In Proc. 5th WADS, LNCS 127~, pages 426-439, 1997. Google ScholarDigital Library
- 7.P.F. Dietz and R. Raman. A constant update time finger search tree. Inf. Proc. Lett., 52:147-154, 1994. Google ScholarDigital Library
- 8.M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47:424-436, 1993. See also STOC'90. Google ScholarDigital Library
- 9.K. Mehlhorn and S. N~hler. Bounded ordered dictionaries in O(loglog n) time and O(n) space. Inf. Proc. Lett., 35(4):xsa-x89, x990. Google ScholarDigital Library
- 10.M. H. Overmars and C. Levcopoulos. A balanced search tree with O(1) worst-case update time. Acta Informatica, 26:269-277, 1988. Google ScholarDigital Library
- 11.M. Thorup. Randomized sorting in O(nloglogn) time and linear space using addition, shift, and bit-wise boolean operations. In Proc. 8th SODA, pages 352-359, 1997. Google ScholarDigital Library
- 12.M. Thorup. Faster deterministic sorting and priority queues in linear space. In Proc. 9th SODA, pages 550- 555, 1998. Google ScholarDigital Library
- 13.P. van Erode Boas. Preserving order in a forest in less than logarithmic time and linear space. Inf. Proc. Lett., 6(3):80-82, 1977.Google ScholarCross Ref
- 14.P. van Erode Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Syst. Theory, 10:99-127, 1977.Google Scholar
- 15.D. E. WiUard. Applications of the fusion tree method to computational geometry and searching. In Proc. 3~a SODA, pages 386-395, 1992.Google Scholar
Index Terms
- Tight(er) worst-case bounds on dynamic searching and priority queues
Recommendations
Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function
This paper considers a single server queueing system that services customers from P non-preemptive priority classes. We assume independent identically distributed exponential interarrival and general service times for each class of customer. We also ...
(N,n)-preemptive priority queues
In this paper, we propose a new priority discipline, called the (N,n)-preemptive priority discipline. Under this discipline, the preemption of the service of a low-class customer is determined by two thresholds N and n of the queue length of high-class ...
Error Bounds for Perturbing Nonexponential Queues
A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in single- and multiserver queues. The general framework is worked out in detail for the ...
Comments