Sorting and selection in posets

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 392-401

  Daskalakis, Constantinos ^a   Karp, Richard M ^b   Mossel, Elchanan ^b   Riesenfeld, Samantha ^b   Verbin, Elad ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

BIOLOGICAL NETWORKS; CLASSICAL PROBLEMS; EFFICIENT IMPLEMENTATION; PARTIALLY ORDERED SET; RANDOMIZED ALGORITHMS; SORTING ALGORITHM; SORTING AND SEARCHING; TRANSITIVE RELATION;

COMPLEX NETWORKS;

EID: 70349136668     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.44     Document Type: Conference Paper

References (20)

1. P. Boldi and F. Chierichetti and S. Vigna. "Pictures from Mongolia - Partial Sorting in a Partial World," FUN 2007.
2. G. Brightwell. "Balanced Pairs in Partial Orders," Discrete Mathematics 201(1-3): 25-52, 1999.
3. G. Brightwell and S. Goodall. "The Number of Partial Orders of Fixed Width," Order 20(4): 333-345, 2003.
4. G. Brightwell and P. Winkler. "Counting Linear Extensions is #P-Coinplete," STOC 1991.
5. Y. Chen. "Decomposing DAGs into Disjoint Chains," Database and Expert Systems Applications 2007.
6. T. M. Cover and J. A. Thomas. Elements of information theory. New York: John Wiley & Sons Inc., 1991.
7. C. Daskalakis, R. M. Karp, E. Mossel, S. Riesenfeld, E. Verbin. "Sorting and Selection in Posets," ArXiv Report, 2007.
8. M. E. Dyer, A. M. Frieze and R. Kannan. "A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies," Journal of the ACM, 38(1): 1-17, 1991.
9. U. Faigle and Gy. Turán. "Sorting and Recognition Problems for Ordered Sets," SIAM J. Comput. 17(1): 100-113, 1988.
10. L. R., Jr., Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
11. M. Fredman. "How good is the information theory bound in sorting?" Theor. Comput Sci. 1(4): 355-361, 1976.
12. F. Fussenegger and H. N. Gabow. "A Counting Approach to Lower Bounds for Selection Problems," Journal of the ACM 26(2): 227-238, 1979. (Pubitemid 9451687)
13. J. Kahn and J. H. Kim. "Entropy and Sorting," STOC, 178-187, 1992.
14. J. Kahn and M. Saks. "Balancing poset extensions," Order 1(2): 113-126,1984.
15. S. S. Kislitsyn, "A finite partially ordered set and its corresponding set of permutations," Matematicheskie Zametki 4(5): 511-518, 1968.
16. D. Knuth. The Art of Computer Programming: Sorting and Searching, Massachusetts: Addison-Wesley, 1998.
17. N. Linial. "The Information theoretic bound is good for merging," SIAM J. Comput. 13(4): 795-801, 1984.
18. M. E. J. Newman, SIAM Review 45: 167-256, 2003.
19. K. Onak and P. Parys. Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. FOGS 2006.
20. W. Trotter and S. Felsner, "Balancing pairs in partially ordered sets," Combinatorics, Paul Erdos is Eighty I: 145-157, 1993.