DECOMPOSABLE SEARCHING PROBLEMS

[1] Bentley, Shaw, An Alphard specification of a correct and efficient transformation on data structures, Proc. IEEE Conference on Specifications of Reliable Software, (1979)

[2] Bentley, Shamos, A problem in multivariate statistics: algorithm, data structure, and applications, Proc. Fifteenth Allerton Conference on Communication, Control and Computing, pp. 193-201, (1977)

[3] Dobkin, Lipton, Multidimensional searching problems, SIAM Journal on Computing, 5, pp. 181-186, (1976)

[4] Knuth, The Art of Computer Programming, Sorting and Searching, 3, (1973)

[5] Lipton, Tarjan, Applications of a planar separator theorem, Proc. Eighteenth Symposium on the Foundations of Computer Science, pp. 162-170, (1977)

[6] Lueker, A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems, UC Irvine Technical Rep., (1978)

[7] Rivest, Analysis of associative retrieval algorithms, Stanford Computer Science Department Rep. STAN-CS-74-415, (1974)

[8] Tarjan, Complexity of combinatorial algorithms, SIAM Review, 20, 3, pp. 457-491, (1978)

[9] Vuillemin, A data structure for manipulating priority queues, Comm. ACM, 21, 4, pp. 309-315, (1978)

[10] Yao, Fast algorithms for finding minimum spanning trees in k dimensions, Proc. Fifteenth Allerton Conference on Communication, Control and Computing, pp. 553-556, (1977)

[1] Bentley, Shaw, An Alphard specification of a correct and efficient transformation on data structures, Proc. IEEE Conference on Specifications of Reliable Software, (1979)

[2] Bentley, Shamos, A problem in multivariate statistics: algorithm, data structure, and applications, Proc. Fifteenth Allerton Conference on Communication, Control and Computing, pp. 193-201, (1977)

[3] Dobkin, Lipton, Multidimensional searching problems, SIAM Journal on Computing, 5, pp. 181-186, (1976)

[4] Knuth, The Art of Computer Programming, Sorting and Searching, 3, (1973)

[5] Lipton, Tarjan, Applications of a planar separator theorem, Proc. Eighteenth Symposium on the Foundations of Computer Science, pp. 162-170, (1977)

[6] Lueker, A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems, UC Irvine Technical Rep., (1978)

[7] Rivest, Analysis of associative retrieval algorithms, Stanford Computer Science Department Rep. STAN-CS-74-415, (1974)

[8] Tarjan, Complexity of combinatorial algorithms, SIAM Review, 20, 3, pp. 457-491, (1978)

[9] Vuillemin, A data structure for manipulating priority queues, Comm. ACM, 21, 4, pp. 309-315, (1978)

[10] Yao, Fast algorithms for finding minimum spanning trees in k dimensions, Proc. Fifteenth Allerton Conference on Communication, Control and Computing, pp. 553-556, (1977)