Cookies?
Library Header Image
LSE Research Online LSE Library Services

Items where Author is "Coppersmith, Don"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 8.

Article

Balcan, Maria-Florina, Bansal, Nikhil, Beygelzimer, Alina, Coppersmith, Don, Langford, John and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2008) Robust reductions from ranking to classification. Machine Learning, 72 (1-2). pp. 139-153. ISSN 0885-6125

Coppersmith, Don, Gamarnik, David, Taghi Hajiaghayi, Mohammad and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2004) Random MAX SAT, random MAX CUT, and their phase transitions. Random Structures and Algorithms, 24 (4). pp. 502-545. ISSN 1042-9832

Arratia, Richard, Bollobás, Béla, Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2000) Euler circuits and DNA sequencing by hybridization. Discrete Applied Mathematics, 104 (1-3). pp. 63-96. ISSN 0166-218X

Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (1999) Constructive bounds and exact expectations for the random assignment problem. Random Structures and Algorithms, 15 (2). pp. 113-144. ISSN 1042-9832

Book Section

Balcan, Maria Florina, Bansal, Nikhil, Beygelzimer, Alina, Coppersmith, Don, Langford, John and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2007) Robust reductions from ranking to classification. In: Bshouty, Nader and Gentile, Claudio, (eds.) Learning Theory: 20th Annual Conference on Learning Theory, Colt 2007, San Diego, Ca, Usa, June 13-15, 2007, Proceedings. Lecture notes in computer science (4539). Springer Berlin / Heidelberg, Germany, pp. 604-619. ISBN 9783540729259

Coppersmith, Don, Gamarnik, David, Hajiaghayi, Mohammad and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2003) Random Max Sat, random Max Cut, and their phase transitions. In: Farach-Colton, Martin, (ed.) Proceedings of the Fourteenth Aanual ACM-SIAM: Symposium on Discrete Algorithms. SIAM, pp. 364-373. ISBN 9780898715385

Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2002) On the expected incremental cost of a minimum assignment. In: Bollobás, Béla, (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies (10). Springer Berlin / Heidelberg, pp. 277-288. ISBN 9783540427254

Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (1998) Constructive bounds and exact expectations for the random assignment problem. In: Luby, Michael, Rolim, Jose and Serna, Maria J., (eds.) Randomization and Approximation Techniques in Computer Science: Second International Workshop, Random'98, Barcelona, Spain, Octo. Lecture notes in computer science (1518). Springer Berlin / Heidelberg, pp. 319-330. ISBN 9783540651420

This list was generated on Tue May 28 18:00:19 2024 BST.