Comparison-sorting and selecting m totally monotone matrices

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 403-408

  Alon, Noga ^a,b   Azar, Yossi ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b TELCORDIA TECHNOLOGIES   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; TREES (MATHEMATICS);

BEST-KNOWN ALGORITHMS; DECISION-TREE ALGORITHM; LOWER BOUNDS; MONOTONE MATRIX; PARALLEL COMPARISONS; SELECTION ALGORITHM; SORTING ALGORITHM; TREE COMPLEXITY;

DATA MINING;

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

References (12)

1. N. Alón and Y. Azar, Sorting, approximate sorting and searching in rounds, SIAM J. Discrete Math. 1 (1988) pp. 269-280.
2. -, Parallel comparison algorithms for approximation problems, Proc. 29th Annual IEEE Symp. on Foundations of Computer Science, White Plains, New York, 1988, pp. 194-203. Also: Combinatorica, in press.
3. M. Ajtai, J. Komlós, W.L. Steiger and E. Szemerédi, Deterministic selection in 0(log log n) parallel time, Proc. 18th Annual ACM Symp. on Theory of Computing, Berkeley, CA, 1986, pp. 188-195.
4. A. Aggarwal, M. Klawe, S. Moran, P.Shor and R. Wilber, Geometric applications of a matrix searching algorithm, Algorithmica 2 (1987) pp. 195-208.
5. A. Aggarwal and J. Park, Notes on searching in multidimensional monotone arrays, Proc. 29th Annual IEEE Symposium on Foundations of Computer Science 1988 pp. 497-512.
6. M. Attallah and R. Kosaraju, An efficient Parallel Algorithm for the row minima of totally monotone matrices, Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 1991 pp. 394-403.
7. Y. Azar and N. Pippenger, Parallel selection, Discrete Applied Math 27 (1990) pp. 49-58.
8. B. Bollobás and G. Brightwell, Graphs whose every transitive orientation contains almost every relation, Israel J. Math., 59 (1987), 112-128.
9. D. Kravets and J. Park, Selection and sorting in totally monotone arrays, Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 494-502.
10. Y. Mansour, J. Park, B. Schieber and S. Sen, Improved selection in totally monotone arrays, May 1991.
11. N. Pippenger, Sorting and selecting in rounds, SIAM J. Computing 6 (1987) pp. 1032-1038.
12. R. Wilber, The concave least-weight subsequence problem revisited, Journal of Algorithms 9 (1988) pp. 418425.