Published in: Dagstuhl Reports, Volume 11, Issue 10 (2022)
Mathieu Hoyrup, Arno Pauly, Victor Selivanov, and Mariya I. Soskova. Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). In Dagstuhl Reports, Volume 11, Issue 10, pp. 72-93, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{hoyrup_et_al:DagRep.11.10.72, author = {Hoyrup, Mathieu and Pauly, Arno and Selivanov, Victor and Soskova, Mariya I.}, title = {{Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461)}}, pages = {72--93}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {11}, number = {10}, editor = {Hoyrup, Mathieu and Pauly, Arno and Selivanov, Victor and Soskova, Mariya I.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.10.72}, URN = {urn:nbn:de:0030-drops-159293}, doi = {10.4230/DagRep.11.10.72}, annote = {Keywords: computable analysis, enumeration degrees, quasi-polish spaces, synthetic topology} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Antonin Callard and Mathieu Hoyrup. Descriptive Complexity on Non-Polish Spaces. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{callard_et_al:LIPIcs.STACS.2020.8, author = {Callard, Antonin and Hoyrup, Mathieu}, title = {{Descriptive Complexity on Non-Polish Spaces}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.8}, URN = {urn:nbn:de:0030-drops-118694}, doi = {10.4230/LIPIcs.STACS.2020.8}, annote = {Keywords: Represented space, Computable analysis, Descriptive set theory, CoPolish spaces} }
Published in: Dagstuhl Reports, Volume 6, Issue 1 (2016)
Jean Goubault-Larrecq, Monika Seisenberger, Victor Selivanov, and Andreas Weiermann. Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). In Dagstuhl Reports, Volume 6, Issue 1, pp. 69-98, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{goubaultlarrecq_et_al:DagRep.6.1.69, author = {Goubault-Larrecq, Jean and Seisenberger, Monika and Selivanov, Victor and Weiermann, Andreas}, title = {{Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031)}}, pages = {69--98}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {6}, number = {1}, editor = {Goubault-Larrecq, Jean and Seisenberger, Monika and Selivanov, Victor and Weiermann, Andreas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.1.69}, URN = {urn:nbn:de:0030-drops-58158}, doi = {10.4230/DagRep.6.1.69}, annote = {Keywords: Better quasi-order, Well quasi-order, Hierarchy, Infinite State Machines, Logic, Noetherian space, Reducibility, Termination, Topological Complexity,} }
Published in: Dagstuhl Reports, Volume 5, Issue 10 (2016)
Mai Gehrke, Achim Jung, Victor Selivanov, and Dieter Spreen. Duality in Computer Science (Dagstuhl Seminar 15441). In Dagstuhl Reports, Volume 5, Issue 10, pp. 66-88, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{gehrke_et_al:DagRep.5.10.66, author = {Gehrke, Mai and Jung, Achim and Selivanov, Victor and Spreen, Dieter}, title = {{Duality in Computer Science (Dagstuhl Seminar 15441)}}, pages = {66--88}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {5}, number = {10}, editor = {Gehrke, Mai and Jung, Achim and Selivanov, Victor and Spreen, Dieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.10.66}, URN = {urn:nbn:de:0030-drops-56999}, doi = {10.4230/DagRep.5.10.66}, annote = {Keywords: coalgebra, domain theory, probabilistic systems, recognizability, semantics of non-classical logics, Stone duality} }
Published in: Dagstuhl Reports, Volume 3, Issue 7 (2013)
Mai Gehrke, Jean-Eric Pin, Victor Selivanov, and Dieter Spreen. Duality in Computer Science (Dagstuhl Seminar 13311). In Dagstuhl Reports, Volume 3, Issue 7, pp. 54-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{gehrke_et_al:DagRep.3.7.54, author = {Gehrke, Mai and Pin, Jean-Eric and Selivanov, Victor and Spreen, Dieter}, title = {{Duality in Computer Science (Dagstuhl Seminar 13311)}}, pages = {54--73}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {7}, editor = {Gehrke, Mai and Pin, Jean-Eric and Selivanov, Victor and Spreen, Dieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.7.54}, URN = {urn:nbn:de:0030-drops-43068}, doi = {10.4230/DagRep.3.7.54}, annote = {Keywords: Stone-Priestley duality, Point free topology, Infinite computations Exact real number computation, Computability in analysis, Hierarchies, Reducibilit Topological complexity, Domain theory, Semantics, Recognizability, Profinite topology} }
Published in: Dagstuhl Reports, Volume 1, Issue 10 (2012)
Ulrich Berger, Vasco Brattka, Victor Selivanov, Dieter Spreen, and Hideki Tsuiki. Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). In Dagstuhl Reports, Volume 1, Issue 10, pp. 14-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@Article{berger_et_al:DagRep.1.10.14, author = {Berger, Ulrich and Brattka, Vasco and Selivanov, Victor and Spreen, Dieter and Tsuiki, Hideki}, title = {{Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411)}}, pages = {14--36}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2012}, volume = {1}, number = {10}, editor = {Berger, Ulrich and Brattka, Vasco and Selivanov, Victor and Spreen, Dieter and Tsuiki, Hideki}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.10.14}, URN = {urn:nbn:de:0030-drops-33721}, doi = {10.4230/DagRep.1.10.14}, annote = {Keywords: Exact real number computation, Stream computation, Infinite computations, Computability in analysis, Hierarchies, Reducibility, Topological complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)
Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas. 10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees. In Advances and Applications of Automata on Words and Trees. Dagstuhl Seminar Proceedings, Volume 10501, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{glasser_et_al:DagSemProc.10501.1, author = {Glasser, Christian and Pin, Jean-Eric and Schweikardt, Nicole and Selivanov, Victor and Thomas, Wolfgang}, title = {{10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees}}, booktitle = {Advances and Applications of Automata on Words and Trees}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10501}, editor = {Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.1}, URN = {urn:nbn:de:0030-drops-31486}, doi = {10.4230/DagSemProc.10501.1}, annote = {Keywords: Automata theory, logic, verification, data structures, algorithms, complexity, games, infinite games with perfect information, reactive systems, specification and verification, combinatorics, hierarchies and reducibilities} }
Published in: Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)
Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas. 10501 Executive Summary – Advances and Applications of Automata on Words and Trees. In Advances and Applications of Automata on Words and Trees. Dagstuhl Seminar Proceedings, Volume 10501, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{glasser_et_al:DagSemProc.10501.2, author = {Glasser, Christian and Pin, Jean-Eric and Schweikardt, Nicole and Selivanov, Victor and Thomas, Wolfgang}, title = {{10501 Executive Summary – Advances and Applications of Automata on Words and Trees}}, booktitle = {Advances and Applications of Automata on Words and Trees}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10501}, editor = {Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.2}, URN = {urn:nbn:de:0030-drops-31474}, doi = {10.4230/DagSemProc.10501.2}, annote = {Keywords: Infinite games with perfect information, reactive systems, specification and verification, combinatorics, hierarchies and reducibilities} }
Published in: Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)
Alexander Okhotin and Christian Reitwießner. Parsing Unary Boolean Grammars Using Online Convolution. In Advances and Applications of Automata on Words and Trees. Dagstuhl Seminar Proceedings, Volume 10501, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{okhotin_et_al:DagSemProc.10501.3, author = {Okhotin, Alexander and Reitwie{\ss}ner, Christian}, title = {{Parsing Unary Boolean Grammars Using Online Convolution}}, booktitle = {Advances and Applications of Automata on Words and Trees}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10501}, editor = {Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.3}, URN = {urn:nbn:de:0030-drops-31465}, doi = {10.4230/DagSemProc.10501.3}, annote = {Keywords: } }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Peter Hertling, Victor Selivanov, Wolfgang Thomas, William W. Wadge, and Klaus Wagner. 08271 Abstracts Collection – Topological and Game-Theoretic Aspects of Infinite Computations. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hertling_et_al:DagSemProc.08271.1, author = {Hertling, Peter and Selivanov, Victor and Thomas, Wolfgang and Wadge, William W. and Wagner, Klaus}, title = {{08271 Abstracts Collection – Topological and Game-Theoretic Aspects of Infinite Computations}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.1}, URN = {urn:nbn:de:0030-drops-16555}, doi = {10.4230/DagSemProc.08271.1}, annote = {Keywords: Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification and verification, topological complexity, Wadge reducibility} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Peter Hertling, Victor Selivanov, Wolfgang Thomas, William W. Wadge, and Klaus Wagner. 08271 Executive Summary – Topological and Game-Theoretic Aspects of Infinite Computations. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hertling_et_al:DagSemProc.08271.2, author = {Hertling, Peter and Selivanov, Victor and Thomas, Wolfgang and Wadge, William W. and Wagner, Klaus}, title = {{08271 Executive Summary – Topological and Game-Theoretic Aspects of Infinite Computations}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.2}, URN = {urn:nbn:de:0030-drops-16499}, doi = {10.4230/DagSemProc.08271.2}, annote = {Keywords: Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
John Plaice and Blanca Mancilla. Cartesian Programming: The TransLucid Programming Language. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{plaice_et_al:DagSemProc.08271.3, author = {Plaice, John and Mancilla, Blanca}, title = {{Cartesian Programming: The TransLucid Programming Language}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.3}, URN = {urn:nbn:de:0030-drops-16546}, doi = {10.4230/DagSemProc.08271.3}, annote = {Keywords: Cartesian programming, Lucid language, declarative programming, multidimensional programming, context-aware programming, semantics.} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Blanca Mancilla and John Plaice. Declarative Synchronous Multithreaded Programming. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{mancilla_et_al:DagSemProc.08271.4, author = {Mancilla, Blanca and Plaice, John}, title = {{Declarative Synchronous Multithreaded Programming}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.4}, URN = {urn:nbn:de:0030-drops-16536}, doi = {10.4230/DagSemProc.08271.4}, annote = {Keywords: Synchronous programming, distributed computing, declarative programming, Cartesian programming, multidimensional programming.} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Chrysida Galanaki, Panos Rondogiannis, and William W. Wadge. General Logic Programs as Infinite Games. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{galanaki_et_al:DagSemProc.08271.5, author = {Galanaki, Chrysida and Rondogiannis, Panos and Wadge, William W.}, title = {{General Logic Programs as Infinite Games}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.5}, URN = {urn:nbn:de:0030-drops-16519}, doi = {10.4230/DagSemProc.08271.5}, annote = {Keywords: Infinite Games, Negation in Logic Programming, Well-Founded Semantics} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Vassilis Kountouriotis, Christos Nomikos, and Panos Rondogiannis. On the Semantic Approaches to Boolean Grammars. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{kountouriotis_et_al:DagSemProc.08271.6, author = {Kountouriotis, Vassilis and Nomikos, Christos and Rondogiannis, Panos}, title = {{On the Semantic Approaches to Boolean Grammars}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.6}, URN = {urn:nbn:de:0030-drops-16527}, doi = {10.4230/DagSemProc.08271.6}, annote = {Keywords: Boolean Grammars, Negation in Formal Grammars, Well-Founded Semantics} }
Feedback for Dagstuhl Publishing