Automata, languages and programming : proceedings / by 11198 International Colloquium on Automata, Languages and Programming, Loeckx, Jacques, 1931-

Automata, languages and programming : 34th international colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007 : proceedings / by International Colloquium on Automata, Languages, and Programming (34th : 2007 : Wroclaw, Poland), Arge, Lars, European Association for Theoretical Computer Science

Get full text

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity by Akmal, Shyan, Jin, Ce

“…In: 46th international colloquium on automata, languages, and programming, ICALP 2019, July 9–12, 2019, Patras, Greece, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2019]. …”
Get full text

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile by Demaine, Erik D, Demaine, Martin L, Fekete, Sándor P., Patitz, Matthew J., Schweller, Robert T., Winslow, Andrew, Woods, Damien

Get full text

The Complexity of Hex and the Jordan Curve Theorem by Adler, Aviv, Daskalakis, Konstantinos, Demaine, Erik D

Get full text
Get full text
Get full text
Get full text

The complexity of general-valued constraint satisfaction problems seen from the other side by Carbonnel, C, Romero, M, Živný, S

“…ACM, 54 (2007), 1], and Atserias, Bulatov, and Dalmau [Proceedings of the 34th International Colloquium on Automata, Languages and Programming, Springer, New York, 2007, pp. 279--290] establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by bounded-consistency algorithms (unconditionally) as bounded treewidth modulo homomorphic equivalence. …”

Subspace designs based on algebraic function fields by Guruswami, Venkatesan, Xing, Chaoping, Yuan, Chen

Get full text
Get full text

Relaxations of graph isomorphism by Mančinska, Laura, Šámal, Robert, Severini, Simone, Varvitsiotis, Antonios, Roberson, David E.

Get full text
Get full text

Amplifiers for the Moran process by Galanis, A, Goebel, A, Goldberg, L, Lapinskas, J, Richerby, D

Towards optimal set-disjointness and set-intersection data structures by Kopelowitz, Tsvi, Williams, Virginia Vassilevska

“…© Tsvi Kopelowitz and Virginia Vassilevska Williams; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). …”
Get full text

Conditionally optimal approximation algorithms for the girth of a directed graph by Dalirrooyfard, Mina, Williams, Virginia Vassilevska

“…© Mina Dalirrooyfard and Virginia Vassilevska Williams; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). …”
Get full text