Find link

language:

Find link is a tool written by Edward Betts.

searching for European Symposium on Algorithms 30 found (54 total)

alternate case: european Symposium on Algorithms

Law of the iterated logarithm (1,375 words) [view diff] exact match in snippet view article find links to article

Stopping Rules for Sequential Hypothesis Testing". In 25th Annual European Symposium on Algorithms (ESA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik

Thomas Lengauer (756 words) [view diff] exact match in snippet view article find links to article

publications. Lengauer was a cofounder of the Conference Series European Symposium on Algorithms (ESA, 1993) and European Symposium on Computational Biology

Transdichotomous model (503 words) [view diff] exact match in snippet view article find links to article

Monotone and Trans-dichotomous", Proceedings of the Fourth Annual European Symposium on Algorithms (ESA '96), Lecture Notes in Computer Science, vol. 1136, Springer-Verlag

Longest common substring (1,063 words) [view diff] exact match in snippet view article find links to article

Grzegorz (eds.). Faster Algorithms for Longest Common Substring. European Symposium on Algorithms. Leibniz International Proceedings in Informatics (LIPIcs)

Quicksort (9,925 words) [view diff] exact match in snippet view article find links to article

(2012). Average case analysis of Java 7's dual pivot quicksort. European Symposium on Algorithms. arXiv:1310.7409. Bibcode:2013arXiv1310.7409W. Yaroslavskiy

Laman graph (1,260 words) [view diff] exact match in snippet view article find links to article

Michael A.; Svensson, Ola; Herman, Grzegorz (eds.), 27th Annual European Symposium on Algorithms (ESA 2019), Leibniz International Proceedings in Informatics

Bidimensionality (1,390 words) [view diff] exact match in snippet view article find links to article

"Contraction Bidimensionality: The Accurate Picture", 17th Annual European Symposium on Algorithms (ESA 2009), Lecture Notes in Computer Science, vol. 5757, pp

Cuckoo filter (1,069 words) [view diff] exact match in snippet view article find links to article

Flemming Friche (2001). "Cuckoo hashing". Proc. 9th Annual European Symposium on Algorithms (ESA 2001). Lecture Notes in Computer Science. Vol. 2161. Århus

HyperLogLog (1,874 words) [view diff] exact match in snippet view article find links to article

U. Zwick (ed.). Lecture Notes in Computer Science. Annual European Symposium on Algorithms (ESA03). Vol. 2832. Springer. pp. 605–617. Flajolet, Philippe;

Predecessor problem (984 words) [view diff] exact match in snippet view article find links to article

queues: small, monotone and trans-dichotomous", Fourth Annual European Symposium on Algorithms (ESA '96), Barcelona, Spain, September 25–27, 1996, Lecture

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

; Wagner, Dorothea (eds.), Proceedings of the 22nd Annual European Symposium on Algorithms (ESA 2014), Wroclaw, Poland, September 8–10, 2014, Lecture

Retrieval Data Structure (1,514 words) [view diff] exact match in snippet view article find links to article

Michael A.; Svensson, Ola; Herman, Grzegorz (eds.). 27th Annual European Symposium on Algorithms, ESA 2019, September 9–11, 2019, Munich/Garching, Germany.

Greedy embedding (1,449 words) [view diff] exact match in snippet view article find links to article

Roman (2013), "Euclidean greedy drawings of trees", Proc. 21st European Symposium on Algorithms (ESA 2013), arXiv:1306.5224, Bibcode:2013arXiv1306.5224N. Leighton

NP-completeness (3,617 words) [view diff] exact match in snippet view article find links to article

Graphs: Exploiting Sphere Cut Branch Decompositions". Proc. 13th European Symposium on Algorithms (ESA '05). Lecture Notes in Computer Science. Vol. 3669. Springer-Verlag

Straight skeleton (2,179 words) [view diff] exact match in snippet view article find links to article

"Straight skeletons of three-dimensional polyhedra". Proc. 16th European Symposium on Algorithms. Lecture Notes in Computer Science. Vol. 5193. Springer-Verlag

Samplesort (3,298 words) [view diff] exact match in snippet view article find links to article

"In-Place Parallel Super Scalar Samplesort (IPSSSSo)". 25th Annual European Symposium on Algorithms (ESA 2017). 87 (Leibniz International Proceedings in Informatics

Graph partition (2,979 words) [view diff] exact match in snippet view article find links to article

Multilevel Graph Partitioning Algorithms. Proceedings of the 19th European Symposium on Algorithms (ESA). Vol. 6942. pp. 469–480. Trifunovic, A.; Knottenbelt

Cereceda's conjecture (1,322 words) [view diff] exact match in snippet view article find links to article

Michael A.; Svensson, Ola; Herman, Grzegorz (eds.), 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany,

Shellsort (3,463 words) [view diff] exact match in snippet view article find links to article

Shellsort and Related Algorithms, Robert Sedgewick, Fourth European Symposium on Algorithms, Barcelona, September 1996. The Wikibook Algorithm implementation

Courcelle's theorem (3,146 words) [view diff] exact match in snippet view article find links to article

in de Berg, Mark; Meyer, Ulrich (eds.), Proc. 18th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 6346, Springer, pp

Dominating set (4,082 words) [view diff] exact match in snippet view article find links to article

Algorithms for Counting Dominating Sets", Proc. 17th Annual European Symposium on Algorithms, ESA 2009, Lecture Notes in Computer Science, vol. 5757, Springer

3SUM (2,664 words) [view diff] exact match in snippet view article find links to article

3SUM, k-SUM, and Linear Degeneracy", In Proc. 25th Annual European Symposium on Algorithms (ESA), LIPIcs, 87: 42:1–42:13, doi:10.4230/LIPIcs.ESA.2017

Planar separator theorem (10,072 words) [view diff] exact match in snippet view article find links to article

graphs: exploiting sphere cut branch decompositions", Proc. 13th European Symposium on Algorithms (ESA '05), Lecture Notes in Computer Science, vol. 3669, Springer-Verlag

Quasi-polynomial growth (727 words) [view diff] exact match in snippet view article find links to article

Gonzalo; Rotenberg, Eva; Herman, Grzegorz (eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, LIPIcs

Powersort (1,492 words) [view diff] exact match in snippet view article find links to article

Methods That Optimally Adapt to Existing Runs". 26th Annual European Symposium on Algorithms (ESA). Leibniz International Proceedings in Informatics (LIPIcs)

Parallel single-source shortest path algorithm (2,662 words) [view diff] exact match in snippet view article find links to article

parallelizable shortest path algorithm". Journal of Algorithms. 1998 European Symposium on Algorithms. 49 (1): 114–152. doi:10.1016/S0196-6774(03)00076-2. ISSN 0196-6774

List of unsolved problems in mathematics (20,026 words) [view diff] exact match in snippet view article find links to article

Michael A.; Svensson, Ola; Herman, Grzegorz (eds.). 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.

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

Martin; Puglisi, Simon J.; Herman, Grzegorz (eds.), 31st Annual European Symposium on Algorithms, ESA 2023, September 4–6, 2023, Amsterdam, The Netherlands

Highway dimension (2,696 words) [view diff] exact match in snippet view article find links to article

Bounded Highway Dimension". Proceedings of the 26th Annual European Symposium on Algorithms (ESA 2018). Schloss-Dagstuhl - Leibniz Zentrum für Informatik

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

Vehicle Routing in Bounded Highway Dimension". 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics