Guy E. Blelloch
Margaret Reid-Miller
- 1.R. J. Andersol#, E. W. Meyer, and M. K. Warmuth. Parallel approximation algorithms for bin packing. Information and Computation, 82:262-277, 1989. Google Scholar
Digital Library
- 2.A. B~umker and W. Dittrich. Fully dynamic search trees for an extension of the BSP model. In Proceedings of the 8th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 233-242, 1996. Google ScholarDigital Library
- 3.G. Blelloch and M. Reid-Miller. Pipelining with flatures. In Proceedings of the 9th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 249-259, June 1997. Google ScholarDigital Library
- 4.G. E. Blelloch. Scans as primitive parallel operations. 1538, Nov. 1989. Google ScholarDigital Library
- 5.R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the Fifth A CM SIGPLA N on Principles and Practice of Parallel Programming, pages 207-216, Santa Barbara, CA, July 1995. Google ScholarDigital Library
- 6.M. R. Brown and R. E. Tarjan. A fast merging algorithm. Journal of the Association for Computing Machinery, 26(2):211-226, Apr. 1979. Google ScholarDigital Library
- 7.M. R. Brown and R. E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal of Computing, 9(3):594-614, Aug. 1980.Google ScholarCross Ref
- 8.S. Carlsson, C. Levcopoulos, and O. Petersson. Sublinear merging and natural merge sort. In Proceedings of the International Symposium on Algorithms SIGA L '90, pages 251-260, Tokyo, Japan, Aug. 1990. Google ScholarDigital Library
- 9.E. Dekel and I. Azsvath. Parallel external merging. Journal of Parallel and Distributed Computing, 6:623- 635, 1989. Google ScholarDigital Library
- 10.J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, Feb. 1989. Google ScholarDigital Library
- 11.X. Guan and M. A. Langston. Time-space optimal parallel merging and sorting. IEEE Transactions on Computers, 40:592-602, 1991. Google ScholarDigital Library
- 12.T. Hagerup and C. Rfib. Optimal merging and sorting on the gREW PRAM. Information Processing Letters, 33:181-185, 1989. Google ScholarDigital Library
- 13.L. Highan and E. Schenk. Maintaining B-tree on an gREW PRAM. Journal of Parallel and Distributed Computing, 22:329-335, 1994. Google ScholarDigital Library
- 14.F. K. Hwang and S. Lin. A simple algorithm for merging two disjoint linearly ordered sets. SlAM Journal of Computing, 1:31-39, Mar. 1972.Google ScholarCross Ref
- 15.J. Katajainen. Efficient parallel algorithms for manipulating sorted sets. P'rvceedings of the 17th Annual Computer Science Conference, Australian Computer Science Communications, 16(1):281-288, 1994.Google Scholar
- 16.J. Katajainen, C. Levcopoulos, and O. Petersson. Space-efficient parallel merging. In Proceedings of the .#th International PARLE Conference (Parallel Architectures and Languages Europe), volume 605 of Lecture Notes in Computer Science, pages 37-49, 1992. Google ScholarDigital Library
- 17.D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley Publishing Company, Reading, MA, 1968.Google Scholar
- 18.D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley Publishing Company, Reading, MA, 1973.Google Scholar
- 19.M. L. Mauldin. Lycos: Design choices in an Internet search service. IEEE Expert, 12(1), Jan. 1997. (w w w.compu ter. org/pubs / expert / 1997 / trends / x1008 / mauldin, htm).Google Scholar
- 20.W. Paul, U. Vishkin, and H. Wagener. Parallel dictionaries on 2-3 trees. In Lecture Notes in Computer Science 143: Proceedings of the lOth Colloquium on Automata, Languages and Programming, Barcelona, Spain, pages 597-609, Be#n/New York, July 1983. Springer-Verlag. Google Scholar
- 21.W. Pugh. A skip list cookbook. Technical Report CS- TR-2286.1, University of Maryland Institute for Advanced Computer Studies Dept. of Computer Science, University of Maryland, June 1990. Google ScholarDigital Library
- 22.W. Pugh. Skip lists: A probilistic alternative to balanced #rees. Communications of the A UM, 33(6):668- 676, June 1990. Google ScholarDigital Library
- 23.A. Ranade. Maintaining dynamic ordered sets on processor networks, in Proceedings of the 4th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 127-137, San Diego, CA, June-July 1992. Google ScholarDigital Library
- 24.M. Reid-Miller. Experiments with Parallel Pointer- Based Algoriths. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1998. To appear.Google Scholar
- 25.R. Sedgewick. Algorithms in C. Addison-Wesley, Reading, MA, 1990. Google ScholarDigital Library
- 26.R. Seidel and C. R. Aragon. Randomized search trees. Algorithrnica, 16:464-497, 1996.Google ScholarCross Ref
- 27.D. D. Sleator and R. E. Tarjan. Self-adjusting binary trees. Journal of the Association }or Computing Machinery, 32(3):652-686, 1985. Google ScholarDigital Library
- 28.Supercomputing Technologies Group, MIT Laboratory for Computer Science. Cilk-5.0 (Beta i) Reference Manual, Mar. 1997.Google Scholar
- 29.P. J. Varman, B. R. Iyer, D. J. Haderle, and S. M. Dunn. Parallel merging: Algorithm and implementation results. Parallel Computing, 15:165-177, I990.Google ScholarCross Ref
- 30.I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, 1994. Google ScholarDigital Library
Index Terms
- Fast set operations using treaps
Recommendations
Faster and smaller inverted indices with treaps
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrievalWe introduce a new representation of the inverted index that performs faster ranked unions and intersections while using less space. Our index is based on the treap data structure, which allows us to intersect/merge the document identifiers while ...
Hardware Designs for Decimal Floating-Point Addition and Related Operations
Decimal arithmetic is often used in commercial, financial, and Internet-based applications. Due to the growing importance of decimal floating-point (DFP) arithmetic, the IEEE 754 Draft Standard for Floating-Point Arithmetic (IEEE P754) includes ...
The Axiomatization of the Rough Set Upper Approximation Operations
The theory of rough sets deals with the approximation of an arbitrary subset of a universe by two definable or observable subsets called, respectively, the lower and the upper approximation. There are at least two methods for the development of this ...
Comments