Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, and James Worrell. Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dcosta_et_al:LIPIcs.MFCS.2022.39, author = {D'Costa, Julian and Lefaucheux, Engel and Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.39}, URN = {urn:nbn:de:0030-drops-168374}, doi = {10.4230/LIPIcs.MFCS.2022.39}, annote = {Keywords: Discrete linear dynamical systems, Program termination, Compact semialgebraic sets, Uniform termination bounds} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Paweł Gawrychowski and Karol Pokorski. Sublinear Dynamic Interval Scheduling (On One or Multiple Machines). In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 67:1-67:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gawrychowski_et_al:LIPIcs.ICALP.2022.67, author = {Gawrychowski, Pawe{\l} and Pokorski, Karol}, title = {{Sublinear Dynamic Interval Scheduling (On One or Multiple Machines)}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {67:1--67:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.67}, URN = {urn:nbn:de:0030-drops-164086}, doi = {10.4230/LIPIcs.ICALP.2022.67}, annote = {Keywords: interval scheduling, dynamic problems, data structures, greedy algorithms} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, and James Worrell. On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 33:1-33:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dcosta_et_al:LIPIcs.MFCS.2021.33, author = {D'Costa, Julian and Lefaucheux, Engel and Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {33:1--33:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.33}, URN = {urn:nbn:de:0030-drops-144734}, doi = {10.4230/LIPIcs.MFCS.2021.33}, annote = {Keywords: Discrete linear dynamical systems, Program termination, Compact semialgebraic sets, Theory of the reals} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Eike Neumann, Joël Ouaknine, and James Worrell. Decision Problems for Second-Order Holonomic Recurrences. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 99:1-99:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{neumann_et_al:LIPIcs.ICALP.2021.99, author = {Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{Decision Problems for Second-Order Holonomic Recurrences}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {99:1--99:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.99}, URN = {urn:nbn:de:0030-drops-141682}, doi = {10.4230/LIPIcs.ICALP.2021.99}, annote = {Keywords: holonomic sequences, Positivity Problem, Skolem Problem} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Eike Neumann, Joël Ouaknine, and James Worrell. On Ranking Function Synthesis and Termination for Polynomial Programs. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{neumann_et_al:LIPIcs.CONCUR.2020.15, author = {Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{On Ranking Function Synthesis and Termination for Polynomial Programs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.15}, URN = {urn:nbn:de:0030-drops-128278}, doi = {10.4230/LIPIcs.CONCUR.2020.15}, annote = {Keywords: Semi-algebraic sets, Polynomial ranking functions, Polynomial programs} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{miller_et_al:LIPIcs.APPROX-RANDOM.2019.8, author = {Miller, Gary L. and Walkington, Noel J. and Wang, Alex L.}, title = {{Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.8}, URN = {urn:nbn:de:0030-drops-112236}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.8}, annote = {Keywords: Hardy, Muckenhoupt, Laplacian, eigenvalue, effective resistance} }
Published in: Dagstuhl Seminar Proceedings, Volume 6491, Digital Historical Corpora- Architecture, Annotation, and Retrieval (2007)
Astrid Ensslin, Martin Durrell, and Paul Bennett. GerManC - Towards a Methodology for Constructing and Annotating Historical Corpora. In Digital Historical Corpora- Architecture, Annotation, and Retrieval. Dagstuhl Seminar Proceedings, Volume 6491, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{ensslin_et_al:DagSemProc.06491.7, author = {Ensslin, Astrid and Durrell, Martin and Bennett, Paul}, title = {{GerManC - Towards a Methodology for Constructing and Annotating Historical Corpora}}, booktitle = {Digital Historical Corpora- Architecture, Annotation, and Retrieval}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6491}, editor = {Lou Burnard and Milena Dobreva and Norbert Fuhr and Anke L\"{u}deling}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06491.7}, URN = {urn:nbn:de:0030-drops-10467}, doi = {10.4230/DagSemProc.06491.7}, annote = {Keywords: Early Modern German; newspaper corpus; GerManC; variation; annotation; tagging} }
Published in: Dagstuhl Seminar Proceedings, Volume 6221, Computational Aesthetics in Graphics, Visualization and Imaging (2007)
Bruce Gooch, László Neumann, Werner Purgathofer, and Mateu Sbert. 06221 Abstracts Collection – Computational Aestethics in Graphics, Visualization and Imaging. In Computational Aesthetics in Graphics, Visualization and Imaging. Dagstuhl Seminar Proceedings, Volume 6221, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{gooch_et_al:DagSemProc.06221.1, author = {Gooch, Bruce and Neumann, L\'{a}szl\'{o} and Purgathofer, Werner and Sbert, Mateu}, title = {{06221 Abstracts Collection – Computational Aestethics in Graphics, Visualization and Imaging}}, booktitle = {Computational Aesthetics in Graphics, Visualization and Imaging}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6221}, editor = {Bruce Gooch and L\'{a}szl\'{o} Neumann and Werner Purgathofer and Mateu Sbert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06221.1}, URN = {urn:nbn:de:0030-drops-8756}, doi = {10.4230/DagSemProc.06221.1}, annote = {Keywords: Lighting Design and Image Relighting, Non-Photorealistic Rendering, Technical Illustration, Medical Illustration, Computational Color Harmony, Color Dynamics , Color Environmental Design, Color Preferences / Effects and Roles of Colors} }
Published in: Dagstuhl Seminar Proceedings, Volume 6221, Computational Aesthetics in Graphics, Visualization and Imaging (2007)
Bruce Gooch, László Neumann, Werner Purgathofer, and Mateu Sbert. 06221 Dagstuhl Report – Computational Aesthetics in Graphics, Visualization and Imaging. In Computational Aesthetics in Graphics, Visualization and Imaging. Dagstuhl Seminar Proceedings, Volume 6221, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{gooch_et_al:DagSemProc.06221.2, author = {Gooch, Bruce and Neumann, L\'{a}szl\'{o} and Purgathofer, Werner and Sbert, Mateu}, title = {{06221 Dagstuhl Report – Computational Aesthetics in Graphics, Visualization and Imaging}}, booktitle = {Computational Aesthetics in Graphics, Visualization and Imaging}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6221}, editor = {Bruce Gooch and L\'{a}szl\'{o} Neumann and Werner Purgathofer and Mateu Sbert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06221.2}, URN = {urn:nbn:de:0030-drops-8749}, doi = {10.4230/DagSemProc.06221.2}, annote = {Keywords: Lighting Design and Image Relighting, Non-Photorealistic Rendering, Technical Illustration, Medical Illustration, Computational Color Harmony, Color D Color Preferences / Effects and Roles of Colors} }
Feedback for Dagstuhl Publishing