×

zbMATH — the first resource for mathematics

Found 293 Documents (Results 1–100)

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, 271-319 (2020).
MSC:  03
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
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
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, 55-105 (2020).
MSC:  68W05 03E05
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 (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, 1-27 (2020).
MSC:  06A
PDF BibTeX XML Cite
Full Text: DOI
Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 68, 13 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI
Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 57, 15 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI
Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 76, 14 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI
Flapan, Erica (ed.) et al., Knots, links, spatial graphs, and algebraic invariants. AMS special session on algebraic and combinatorial structures in knot theory and AMS special session on spatial graphs, both held at the California State University, Fullerton, CA, USA, October 24–25, 2015. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2847-1/pbk; 978-1-4704-4077-0/ebook). Contemporary Mathematics 689, 137-158 (2017).
MSC:  05C10
PDF BibTeX XML Cite
Full Text: DOI
Flapan, Erica (ed.) et al., Knots, links, spatial graphs, and algebraic invariants. AMS special session on algebraic and combinatorial structures in knot theory and AMS special session on spatial graphs, both held at the California State University, Fullerton, CA, USA, October 24–25, 2015. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2847-1/pbk; 978-1-4704-4077-0/ebook). Contemporary Mathematics 689, 103-124 (2017).
MSC:  05C10
PDF BibTeX XML Cite
Full Text: DOI arXiv
Flapan, Erica (ed.) et al., Knots, links, spatial graphs, and algebraic invariants. AMS special session on algebraic and combinatorial structures in knot theory and AMS special session on spatial graphs, both held at the California State University, Fullerton, CA, USA, October 24–25, 2015. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2847-1/pbk; 978-1-4704-4077-0/ebook). Contemporary Mathematics 689, 81-102 (2017).
MSC:  57M15 57M25 05C10 57-02
PDF BibTeX XML Cite
Full Text: DOI
Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4–7, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-27682-3/pbk; 978-3-319-27683-0/ebook). Lecture Notes in Computer Science 9537, 331-348 (2016).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI
Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 499-512 (2016).
PDF BibTeX XML Cite
Full Text: DOI
Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 351-359 (2016).
MSC:  05C69 05C75 06A07
PDF BibTeX XML Cite
Full Text: DOI
Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44542-7/pbk; 978-3-319-44543-4/ebook). Lecture Notes in Computer Science 9843, 253-265 (2016).
MSC:  68Rxx 68Wxx
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