×

zbMATH — the first resource for mathematics

Found 643 Documents (Results 1–100)

100
MathJax
Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39880-4/pbk; 978-3-030-39881-1/ebook). Lecture Notes in Computer Science 12049, 211-222 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI
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. Trends Log. Stud. Log. Libr. 53, 161-188 (2020).
MSC:  05C99 06A06 05C20
PDF BibTeX XML Cite
Full Text: DOI
Lo, Allan (ed.) et al., Surveys in combinatorics 2019. Papers based on the 27th British combinatorial conference, University of Birmingham, Birmingham, UK, July 29 – August 2, 2019. Cambridge: Cambridge University Press (ISBN 978-1-108-74072-2/pbk; 978-1-108-64909-4/ebook). London Mathematical Society Lecture Note Series 456, 167-220 (2019).
MSC:  05
PDF BibTeX XML Cite
Full Text: DOI
Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer (ISBN 978-3-030-30785-1/pbk; 978-3-030-30786-8/ebook). Lecture Notes in Computer Science 11789, 106-119 (2019).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI
Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer (ISBN 978-3-030-30785-1/pbk; 978-3-030-30786-8/ebook). Lecture Notes in Computer Science 11789, 53-65 (2019).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI
Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1501-1520 (2019).
MSC:  05C15 05C83 05C42
PDF BibTeX XML Cite
Full Text: DOI arXiv
Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1445-1464 (2019).
MSC:  05C83
PDF BibTeX XML Cite
Full Text: DOI
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 23, 13 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI
Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 465-474 (2018).
MSC:  68W15 05C85 68R10
PDF BibTeX XML Cite
Full Text: DOI
Avigad, Jeremy (ed.) et al., Interactive theorem proving. 9th international conference, ITP 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 9–12, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-94820-1/pbk; 978-3-319-94821-8/ebook). Lecture Notes in Computer Science 10895, 178-195 (2018).
MSC:  68T15
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification