Find link

language:

Find link is a tool written by Edward Betts.

searching for International Colloquium on Automata, Languages and Programming 50 found (85 total)

alternate case: international Colloquium on Automata, Languages and Programming

2-EXPTIME (960 words) [view diff] exact match in snippet view article find links to article

Expression Size" (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Vol. 5126. pp. 39–50. doi:10

Quantum sort (165 words) [view diff] no match in snippet view article find links to article

sorting, and element distinctness". 28th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science. Vol. 2076

Twin-width (4,129 words) [view diff] no match in snippet view article find links to article

Merelli, Emanuela; Worrell, James (eds.), 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12–16, 2021, Glasgow, Scotland

Fractional graph isomorphism (415 words) [view diff] no match in snippet view article find links to article

Kuhn, Fabian; Muscholl, Anca (eds.). 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10–14, 2017, Warsaw, Poland

Categorical quantum mechanics (2,203 words) [view diff] exact match in snippet view article find links to article

quantum observables". Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science

Jeff Edmonds (382 words) [view diff] no match in snippet view article find links to article

Nondeterministic Semantic Read-Once Branching Programs", International Colloquium on Automata, Languages, and Programming: 36:1–6:13, doi:10.4230/LIPIcs.ICALP.2016.36

Partial k-tree (498 words) [view diff] exact match in snippet view article find links to article

graphs with bounded treewidth", Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317

Bitonic tour (682 words) [view diff] no match in snippet view article find links to article

Rabani, Yuval; Sangiorgi, Davide (eds.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Leibniz International Proceedings

Thomas Colcombet (297 words) [view diff] no match in snippet view article find links to article

Functions and Omega-Regular Languages". 43rd International Colloquium on Automata, Languages, and Programming. ICALP 2016. Leibniz International Proceedings

Minimum k-cut (847 words) [view diff] no match in snippet view article find links to article

the Small Set Expansion Hypothesis". 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. pp. 79:1–79:14. doi:10.4230/LIPIcs

Soft heap (1,250 words) [view diff] no match in snippet view article find links to article

Flocchini, Paola; Leonardi, Stefano (eds.). 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9–12, 2019, Patras, Greece

PPAD (complexity) (1,003 words) [view diff] exact match in snippet view article

Complexity of 2D Discrete Fixed Point Problem". International Colloquium on Automata, Languages and Programming. pp. 489–500. ECCC TR06-037. Deng, X.; Qi,

Dershowitz–Manna ordering (373 words) [view diff] exact match in snippet view article find links to article

S2CID 17906810. (Also in Proceedings of the International Colloquium on Automata, Languages and Programming, Graz, Lecture Notes in Computer Science 71

Function problem (1,174 words) [view diff] no match in snippet view article find links to article

R. Milner, Editors, Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming: 322–337. Selman, A. (1988). "Natural self-reducible

100 prisoners problem (3,577 words) [view diff] exact match in snippet view article find links to article

Bro Miltersen in the proceedings of the 30. International Colloquium on Automata, Languages and Programming (ICALP). In their version, player A (the prison

Stuttering equivalence (342 words) [view diff] exact match in snippet view article find links to article

Michael S. (ed.). Proceedings of the 17th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 443

Melanie Schmidt (499 words) [view diff] no match in snippet view article find links to article

Marx, Dániel; Sannella, Donald (eds.), 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9–13, 2018, Prague, Czech

SL (complexity) (1,793 words) [view diff] exact match in snippet view article

space-bounded computation", Proceedings of the Seventh International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 85

Colour refinement algorithm (1,129 words) [view diff] no match in snippet view article find links to article

(2018). "Lovász Meets Weisfeiler and Leman". International Colloquium on Automata, Languages, and Programming. 45. Grohe, Martin. "Finite variable logics

Tree decomposition (1,537 words) [view diff] exact match in snippet view article find links to article

graphs with bounded treewidth", Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317

Peripheral cycle (1,503 words) [view diff] exact match in snippet view article find links to article

Mondshein Sequence", Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14), Lecture Notes in Computer Science

Disjunct matrix (1,207 words) [view diff] exact match in snippet view article find links to article

Testing Schemes". Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP): 748–759. arXiv:0712.3876. Bibcode:2007arXiv0712

Planarity testing (1,840 words) [view diff] exact match in snippet view article find links to article

and Programming; Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14), Lecture Notes in Computer Science

Unrooted binary tree (1,971 words) [view diff] exact match in snippet view article find links to article

alphabetic tree problem revisited", Proc. 21st International Colloquium on Automata, Languages and Programming (ICALP '94), Lecture Notes in Computer Science

Set packing (1,514 words) [view diff] exact match in snippet view article find links to article

Independent sets with domination constraints. 25th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 1443

Halin graph (2,300 words) [view diff] exact match in snippet view article find links to article

bounded treewidth", Proceedings of the 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317

Eli Ben-Sasson (1,150 words) [view diff] no match in snippet view article find links to article

Interactive Oracle Proofs of Proximity". 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings

Longest path problem (2,662 words) [view diff] exact match in snippet view article find links to article

algorithms for path and packing problems", International Colloquium on Automata, Languages and Programming (PDF), Lecture Notes in Computer Science, vol

Circuit complexity (2,571 words) [view diff] exact match in snippet view article find links to article

is in uniform TC0". Proceedings of the 28th International Colloquium on Automata, Languages and Programming. Springer Verlag. pp. 104–114. Allender, Eric

Hamiltonian path problem (2,518 words) [view diff] exact match in snippet view article find links to article

"Computing Tutte Paths", Proceedings of the 45th International Colloquium on Automata, Languages and Programming (ICALP'18), to appear. Thomason, A. G. (1978)

Parameterized approximation algorithm (3,440 words) [view diff] no match in snippet view article find links to article

Puppis, Gabriele; Svensson, Ola (eds.). 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8–12, 2024, Tallinn, Estonia

Cuckoo hashing (2,591 words) [view diff] exact match in snippet view article find links to article

(2008). "History-Independent Cuckoo Hashing". International Colloquium on Automata, Languages and Programming (ICALP). Reykjavik, Iceland. Retrieved 2008-07-21

Unbounded nondeterminism (2,718 words) [view diff] no match in snippet view article find links to article

Colloquium on Automata, Languages and Programming. International Colloquium on Automata, Languages, and Programming. Noordwijkerhout, the Netherlands: Springer-Verlag

Branch-decomposition (2,449 words) [view diff] exact match in snippet view article find links to article

time algorithms for branchwidth", Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP '97), Lecture Notes in Computer Science

Jordan curve theorem (3,351 words) [view diff] no match in snippet view article find links to article

of Hex and the Jordan Curve Theorem". 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings

Suffix tree (3,710 words) [view diff] no match in snippet view article find links to article

Time Randomized Suffix Tree Construction", International Colloquium on Automata Languages and Programming (PDF). Farach-Colton, Martin; Ferragina, Paolo;

Polygonalization (2,758 words) [view diff] no match in snippet view article find links to article

Rabani, Yuval; Sangiorgi, Davide (eds.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Leibniz International Proceedings

Unique games conjecture (3,066 words) [view diff] no match in snippet view article find links to article

the Small Set Expansion Hypothesis", 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Leibniz International Proceedings

Integer programming (4,226 words) [view diff] no match in snippet view article find links to article

Marx, Dániel; Sannella, Donald (eds.). 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9–13, 2018, Prague, Czech

Maximum subarray problem (2,467 words) [view diff] no match in snippet view article find links to article

for Maximum Weight Rectangles", Proc. 43rd International Colloquium on Automata, Languages, and Programming: 81:1–81:13, doi:10.4230/LIPIcs.ICALP.2016

Welfare maximization (2,835 words) [view diff] exact match in snippet view article find links to article

Independent sets with domination constraints. 25th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 1443

McDiarmid's inequality (3,767 words) [view diff] no match in snippet view article find links to article

Algorithms on Random MAX-k-XOR and Beyond". 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). 229. Schloss Dagstuhl – Leibniz-Zentrum

Universal hashing (4,886 words) [view diff] exact match in snippet view article find links to article

Are Reliable (Extended Abstract). Proc. 19th International Colloquium on Automata, Languages and Programming (ICALP). pp. 235–246. Black, J.; Halevi, S

Treewidth (4,575 words) [view diff] exact match in snippet view article find links to article

graphs with bounded treewidth", Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317

Differential privacy (5,184 words) [view diff] exact match in snippet view article find links to article

1559850 Differential Privacy by Cynthia Dwork, International Colloquium on Automata, Languages and Programming (ICALP) 2006, p. 1–12. doi:10.1007/11787006_1

Existential theory of the reals (3,824 words) [view diff] no match in snippet view article find links to article

Multi-player (Symmetric) Nash Equilibria", Proc. 42nd International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science

Shortest path problem (4,790 words) [view diff] exact match in snippet view article find links to article

Welzl, Emo (eds.). Proceedings of the 27th International Colloquium on Automata, Languages and Programming. pp. 61–72. ISBN 978-3-540-67715-4. Henzinger

Regular expression (8,871 words) [view diff] exact match in snippet view article find links to article

Expression Size (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Lecture Notes in Computer Science

Petri net (7,255 words) [view diff] exact match in snippet view article find links to article

and Undecidability". Proceedings of the 25th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 1443

Erdős–Ko–Rado theorem (5,592 words) [view diff] no match in snippet view article find links to article

Emanuela; Woodruff, David P. (eds.), 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4–8, 2022, Paris, France