×

zbMATH — the first resource for mathematics

Found 7 Documents (Results 1–7)

100
MathJax
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer (ISBN 978-3-030-30228-3/hbk; 978-3-030-30231-3/pbk; 978-3-030-30229-0/ebook). Trends in Logic – Studia Logica Library 53, 145-159 (2020).
MSC:  03F
PDF BibTeX XML Cite
Full Text: DOI
Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1425-1435 (2012).
MSC:  05C85 05C15 68W25
PDF BibTeX XML Cite
Full Text: Link
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 196-227 (2012).
MSC:  68Q25 05C85
PDF BibTeX XML Cite
Full Text: DOI