Items where Author is "Gaspers, Serge"

Article

Gaspers, Serge and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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. ORCID: 0000-0003-4935-7820 (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

Book Section

Gaspers, Serge and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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 Berlin / Heidelberg, pp. 567-579. ISBN 9783662476710

Conference or Workshop Item

Gaspers, Serge and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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, New York NY, United States.