Balcan, Maria-Florina; Bansal, Nikhil; Beygelzimer, Alina; Coppersmith, Don; Langford, John; Sorkin, Gregory B. Robust reductions from ranking to classification. (English) Zbl 1470.68075 Mach. Learn. 72, No. 1-2, 139-153 (2008). MSC: 68T05 62H30 PDFBibTeX XMLCite \textit{M.-F. Balcan} et al., Mach. Learn. 72, No. 1--2, 139--153 (2008; Zbl 1470.68075) Full Text: DOI
Balcan, Maria-Florina; Bansal, Nikhil; Beygelzimer, Alina; Coppersmith, Don; Langford, John; Sorkin, Gregory B. Robust reductions from ranking to classification. (English) Zbl 1203.68135 Bshouty, Nader H. (ed.) et al., Learning theory. 20th annual conference on learning theory, COLT 2007, San Diego, CA, USA, June 13–15, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72925-9). Lecture Notes in Computer Science 4539. Lecture Notes in Artificial Intelligence, 604-619 (2007). MSC: 68T05 62H30 PDFBibTeX XMLCite \textit{M.-F. Balcan} et al., Lect. Notes Comput. Sci. 4539, 604--619 (2007; Zbl 1203.68135) Full Text: DOI
Coppersmith, Don; Gamarnik, David; Hajiaghayi, Mohammad Taghi; Sorkin, Gregory B. Random MAX SAT, random MAX CUT, and their phase transitions. (English) Zbl 1077.68118 Random Struct. Algorithms 24, No. 4, 502-545 (2004). MSC: 68W20 68Q25 PDFBibTeX XMLCite \textit{D. Coppersmith} et al., Random Struct. Algorithms 24, No. 4, 502--545 (2004; Zbl 1077.68118) Full Text: DOI arXiv
Coppersmith, Don; Gamarnik, David; Hajiaghayi, Mohammad; Sorkin, Gregory B. Random MAX SAT, random MAX CUT, and their phase transitions. (English) Zbl 1094.68573 Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 364-373 (2003). MSC: 68Q25 68T20 PDFBibTeX XMLCite \textit{D. Coppersmith} et al., in: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2003, Baltimore, MD, USA, January 12--14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics. 364--373 (2003; Zbl 1094.68573)
Coppersmith, D.; Sorkin, G. B. On the expected incremental cost of a minimum assignment. (English) Zbl 1014.90063 Bollobás, Béla (ed.), Contemporary combinatorics. Collection of survey papers in combinatorics based on lectures given in the workshop on probabilistic combinatorics at the Paul Erdős Summer Research Center in Mathematics, Budapest, Hungary. Berlin: Springer. Bolyai Soc. Math. Stud. 10, 277-288 (2002). MSC: 90B80 90C35 PDFBibTeX XMLCite \textit{D. Coppersmith} and \textit{G. B. Sorkin}, Bolyai Soc. Math. Stud. 10, 277--288 (2002; Zbl 1014.90063)
Arratia, Richard; Bollobás, Béla; Coppersmith, Don; Sorkin, Gregory B. Euler circuits and DNA sequencing by hybridization. (English) Zbl 0997.92014 Discrete Appl. Math. 104, No. 1-3, 63-96 (2000). MSC: 92C40 05A16 05C90 92D20 PDFBibTeX XMLCite \textit{R. Arratia} et al., Discrete Appl. Math. 104, No. 1--3, 63--96 (2000; Zbl 0997.92014) Full Text: DOI
Coppersmith, Don; Sorkin, Gregory B. Constructive bounds and exact expectations for the random assignment problem. (English) Zbl 0957.90076 Random Struct. Algorithms 15, No. 2, 113-144 (1999). MSC: 90B80 05C70 PDFBibTeX XMLCite \textit{D. Coppersmith} and \textit{G. B. Sorkin}, Random Struct. Algorithms 15, No. 2, 113--144 (1999; Zbl 0957.90076) Full Text: DOI