Faster kinetic heaps and their use in broadcast scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 836-844

  Kaplan, Haim ^a   Tarjan, Robert E ^b,c   Tsioutsiouliklis, Kostas ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Intertrust Technologies Corporation   (United States)

^c Princeton University   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

EID: 0012640829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. D. Aksoy and M. Franklin. Scheduling for largescale on-demand data broadcasting. In Proc. IEEE INFOCOM Conf., San Francisco, CA, pages 651-659. IEEE, 1998.
2. Julien Basch , Leonidas J. Guibas, Kinetic data structures, 1999
3. Julien Basch , Leonidas J. Guibas , John Hershberger, Data structures for mobile data, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.747-756, January 05-07, 1997, New Orleans, Louisiana, United States
4. J. Bentley and J. Saxe Decomposable searching problems I: Static-to-dynamic transformation". J. of algorithms, 1:301-358, 1980.
5. Gerth Stølting Brodal , Riko Jacob, Dynamic Planar Convex Hull with Optimal Query Time, Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, p.57-70, July 05-07, 2000
6. Timothy M. Chan, Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.92, October 17-18, 1999
7. T. M. Chan Remarks on k-level algorithms in the plane, draft, 1999.
8. B. Chazelle. On the convex layers of a planar set. IEEEI Transactions on Information Theory, 31, 1985.
9. Boris V. Cherkassky , Andrew V. Goldberg , Craig Silverstein, Buckets, Heaps, Lists, and Monotone Priority Queues, SIAM Journal on Computing, v.28 n.4, p.1326-1346, Aug. 1999 [doi〉10.1137/S0097539796313490]
10. Michael L. Fredman , Robert Endre Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM (JACM), v.34 n.3, p.596-615, July 1987 [doi〉10.1145/28869.28874]
11. John Hershberger , Subhash Suri, Applications of a semi-dynamic convex hull algorithm, BIT, v.32 n.2, p.249-267, 1992 [doi〉10.1007/BF01994880]
12. M. H. Overmars and J. van Leeuwen Maintenance of configurations in the plane. J. Comp. and Syst. Sci., 23:166-204, 1981.
13. Daniel Dominic Sleator , Robert Endre Tarjan, Self-adjusting binary search trees, Journal of the ACM (JACM), v.32 n.3, p.652-686, July 1985 [doi〉10.1145/3828.3835]
14. Robert Endre Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983
15. R. E. Tarjan. Amortized computational complexity. SIAM J. on Algebraic and Discrete Methods, 6(2):306- 318, 1985.
16. Robert E. Tarjan , Christopher van Wyk, An O (n log log n)-time algorithm for triangulating a simple polygon, SIAM Journal on Computing, v.17 n.1, p.143-178, Feb. 1988 [doi〉10.1137/0217010]
17. J. W. Wong. Broadcast delivery. Proc. IEEE, 76(12):1566-1577, 1988.