Cookies?
Library Header Image
LSE Research Online LSE Library Services

Items where Author is "Gamarnik, David"

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

Article

Flaxman, Abraham, Gamarnik, David and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2011) First-passage percolation on a ladder graph, and the path cost in a VCG auction. Random Structures & Algorithms, 38 (3). pp. 350-364. ISSN 1042-9832

Flaxman, Abraham D., Gamarnik, David and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2005) Embracing the giant component. Random Structures & Algorithms, 27 (3). pp. 277-289. ISSN 1042-9832

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

Book Section

Flaxman, Abraham, Gamarnik, David and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2006) First-passage percolation on a width-2 strip and the path cost in a VCG auction. In: Spirakis, Paul, Mavronicolas, Marios and Kontogiannis, Spyros, (eds.) Internet and Network Economics: Second International Workshop, Wine 2006, Patras, Greece, December 15-17, 2006, Proceedings. Lecture notes in computer science (4286). Springer Berlin / Heidelberg, pp. 99-111. ISBN 9783540681380

Flaxman, Abraham, Gamarnik, David and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2004) Embracing the giant component. In: Farach-Colton, Martin, (ed.) Latin 2004: Theoretical Informatics. 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings. Lecture notes in computer science (2976). Springer Berlin / Heidelberg, pp. 66-79. ISBN 9783540212584

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

This list was generated on Fri Apr 19 05:11:45 2024 BST.