Sorting under partial information (without the ellipsoid algorithm)
暂无分享,去创建一个
Jean Cardinal | Raphaël M. Jungers | J. Ian Munro | Samuel Fiorini | Gwenaël Joret | J. I. Munro | Samuel Fiorini | I. Munro | R. Jungers | J. Cardinal | G. Joret | Ulb Gwenaël | Joret Ulb | Waterloo
[1] Nathan Linial,et al. The Information-Theoretic Bound is Good for Merging , 1984, SIAM J. Comput..
[2] Elchanan Mossel,et al. Sorting and Selection in Posets , 2007, SIAM J. Comput..
[3] F. Glover. Maximum matching in a convex bipartite graph , 1967 .
[4] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[5] Jeff Kahn,et al. Entropy and sorting , 1992, STOC '92.
[6] Richard P. Stanley,et al. Two poset polytopes , 1986, Discret. Comput. Geom..
[7] J. Körner. Fredman-Kolmo´s bounds and information theory , 1986 .
[8] Jean Cardinal,et al. Minimum entropy coloring , 2008, J. Comb. Optim..
[9] Jan Neerbek,et al. Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2002, Algorithmica.
[10] Nathan Linial,et al. Balancing extensions via Brunn-Minkowski , 1991, Comb..
[11] B. T. Bennett,et al. Bounds on Optimal Merge Performance, and a Strategy for Optimality , 1972, JACM.
[12] Michael L. Fredman,et al. How Good is the Information Theory Bound in Sorting? , 1976, Theor. Comput. Sci..
[13] László Lovász,et al. Entropy splitting for antiblocking corners and perfect graphs , 1990, Comb..
[14] Stefan Felsner,et al. Balancing pairs and the cross product conjecture , 1995 .
[15] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[16] Mark Huber,et al. Fast perfect sampling from linear extensions , 2006, Discret. Math..
[17] Jean Cardinal,et al. An efficient algorithm for partial order production , 2008, STOC '09.
[18] Frank K. Hwang,et al. A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets , 1972, SIAM J. Comput..
[19] Gábor Simonyi,et al. Graph entropy: A survey , 1993, Combinatorial Optimization.
[20] G. Brightwell,et al. Counting linear extensions , 1991 .
[21] Timothy M. Chan. All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time , 2008, Algorithmica.
[22] J. Körner,et al. Graphs that Split Entropies , 1988, SIAM J. Discret. Math..
[23] Graham R. Brightwell,et al. Balanced pairs in partial orders , 1999, Discret. Math..
[24] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[25] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[26] Jan Neerbek,et al. Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2001, ICALP.
[27] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[28] J. Kahn,et al. Balancing poset extensions , 1984 .
[29] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[30] Andrew Chi-Chih Yao. Graph entropy and quantum sorting problems , 2004, STOC '04.
[31] Prasad Tetali,et al. The Number of Linear Extensions of the Boolean Lattice , 2003, Order.