Publication Details
Title: Sorting and Selection in Posets
Author: C. Daskalakis, R. M. Karp, E. Mossel, S. Riesenfeld, and E. Verbin
Group: Algorithms
Date: January 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/sortingand09.pdf
Acknowledgements:
This work was partially supported by funding provided to ICSI and its researchers through National Science Foundation grant CCF: 0515259 ("Design and Analysis of Internet Algorithms: Routing, Filtering, Overlay Design, and Influence of Heterogeneity"). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors or originators and do not necessarily reflect the views of the National Science Foundation.
Bibliographic Information:
Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, New York, pp. 392-401
Bibliographic Reference:
C. Daskalakis, R. M. Karp, E. Mossel, S. Riesenfeld, and E. Verbin. Sorting and Selection in Posets. Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, New York, pp. 392-401, January 2009
Author: C. Daskalakis, R. M. Karp, E. Mossel, S. Riesenfeld, and E. Verbin
Group: Algorithms
Date: January 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/sortingand09.pdf
Acknowledgements:
This work was partially supported by funding provided to ICSI and its researchers through National Science Foundation grant CCF: 0515259 ("Design and Analysis of Internet Algorithms: Routing, Filtering, Overlay Design, and Influence of Heterogeneity"). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors or originators and do not necessarily reflect the views of the National Science Foundation.
Bibliographic Information:
Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, New York, pp. 392-401
Bibliographic Reference:
C. Daskalakis, R. M. Karp, E. Mossel, S. Riesenfeld, and E. Verbin. Sorting and Selection in Posets. Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, New York, pp. 392-401, January 2009