Automata, Languages and Programming
From MaRDI portal
Publication:5466508
DOI10.1007/b99859zbMath1099.68681OpenAlexW2505584480MaRDI QIDQ5466508
Shirley Halevy, Eyal Kushilevitz
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (4)
Information theory in property testing and monotonicity testing in higher dimension ⋮ Distribution-free connectivity testing for sparse graphs ⋮ Transitive-Closure Spanners: A Survey ⋮ Tolerant property testing and distance approximation
This page was built for publication: Automata, Languages and Programming
