Published in: LIPIcs, Volume 268, 14th International Conference on Interactive Theorem Proving (ITP 2023)
Martin Dvorak and Jasmin Blanchette. Closure Properties of General Grammars – Formally Verified. In 14th International Conference on Interactive Theorem Proving (ITP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 268, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dvorak_et_al:LIPIcs.ITP.2023.15, author = {Dvorak, Martin and Blanchette, Jasmin}, title = {{Closure Properties of General Grammars – Formally Verified}}, booktitle = {14th International Conference on Interactive Theorem Proving (ITP 2023)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-284-6}, ISSN = {1868-8969}, year = {2023}, volume = {268}, editor = {Naumowicz, Adam and Thiemann, Ren\'{e}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.15}, URN = {urn:nbn:de:0030-drops-183906}, doi = {10.4230/LIPIcs.ITP.2023.15}, annote = {Keywords: Lean, type-0 grammars, recursively enumerable languages, Kleene star} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
David G. Harris and Vladimir Kolmogorov. Parameter Estimation for Gibbs Distributions. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 72:1-72:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{harris_et_al:LIPIcs.ICALP.2023.72, author = {Harris, David G. and Kolmogorov, Vladimir}, title = {{Parameter Estimation for Gibbs Distributions}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {72:1--72:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.72}, URN = {urn:nbn:de:0030-drops-181246}, doi = {10.4230/LIPIcs.ICALP.2023.72}, annote = {Keywords: Gibbs distribution, sampling} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
David G. Harris, Fotis Iliopoulos, and Vladimir Kolmogorov. A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 31:1-31:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{harris_et_al:LIPIcs.APPROX/RANDOM.2021.31, author = {Harris, David G. and Iliopoulos, Fotis and Kolmogorov, Vladimir}, title = {{A New Notion of Commutativity for the Algorithmic Lov\'{a}sz Local Lemma}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {31:1--31:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, 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.2021.31}, URN = {urn:nbn:de:0030-drops-147244}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.31}, annote = {Keywords: Lov\'{a}sz Local Lemma, Resampling, Moser-Tardos algorithm, latin transversal, commutativity} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Vladimir Kolmogorov. Testing the Complexity of a Valued CSP Language. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 77:1-77:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kolmogorov:LIPIcs.ICALP.2019.77, author = {Kolmogorov, Vladimir}, title = {{Testing the Complexity of a Valued CSP Language}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {77:1--77:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.77}, URN = {urn:nbn:de:0030-drops-106531}, doi = {10.4230/LIPIcs.ICALP.2019.77}, annote = {Keywords: Valued Constraint Satisfaction Problems, Exponential time algorithms, Exponential Time Hypothesis} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
Vladimir V'Yugin. On impossibility of sequential algorithmic forecasting. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{vyugin:DagSemProc.06051.11, author = {V'Yugin, Vladimir}, title = {{On impossibility of sequential algorithmic forecasting}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.11}, URN = {urn:nbn:de:0030-drops-6305}, doi = {10.4230/DagSemProc.06051.11}, annote = {Keywords: Universal forecasting, computable calibration, Dawid's prequential framework, algorithmic randomness, defensive forecasting} }
Feedback for Dagstuhl Publishing