Cookies?
Library Header Image
LSE Research Online LSE Library Services

Items where Author is "Gaspers, Serge"

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

Gaspers, Serge and Sorkin, Gregory B. (2017) Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. ACM Transactions on Algorithms, 13 (4). pp. 1-36. ISSN 1549-6325

Gaspers, Serge and Sorkin, Gregory B. (2015) Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. In: Halldórsson, Magnús M., Iwama, Kazuo, Kobayashi, Naoki and Speckmann, Bettina, (eds.) Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Lecture Notes in Computer Science. Springer, pp. 567-579. ISBN 9783662476710

Gaspers, Serge and Sorkin, Gregory B. (2011) A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Journal of Computer and System Sciences, 78 (1). pp. 305-335. ISSN 0022-0000

Gaspers, Serge and Sorkin, Gregory B. (2009) A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. In: ACM-SIAM Symposium 4-6 January hosted in New York Marriot Downtown, NY, 2009-01-04 - 2009-01-06.

This list was generated on Mon Jul 26 19:43:27 2021 BST.