Train tracks with gaps: applying the probabilistic method to trains

DOI10.1016/j.tcs.2021.11.017OpenAlexW3108113026MaRDI QIDQ2062121

William Kuszmaul

Publication date: 22 December 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.00589

zbMATH Keywords

algorithmsprobabilistic methodLovász local lemmatrainsMcDiarmid's inequality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Min-wise independent permutations
• A constructive proof of the general lovász local lemma
• Efficiently Approximating Edit Distance Between Pseudorandom Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item