Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Ittai Rubinstein. Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction Problem. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 102:1-102:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{rubinstein:LIPIcs.ICALP.2023.102, author = {Rubinstein, Ittai}, title = {{Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction Problem}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {102:1--102:20}, 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.102}, URN = {urn:nbn:de:0030-drops-181542}, doi = {10.4230/LIPIcs.ICALP.2023.102}, annote = {Keywords: Trace Reconstruction, Synchronization Channels, Computational Learning Theory, Computational Biology} }
Published in: LIPIcs, Volume 110, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)
Yuliy Baryshnikov, Stephen Melczer, Robin Pemantle, and Armin Straub. Diagonal Asymptotics for Symmetric Rational Functions via ACSV. In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{baryshnikov_et_al:LIPIcs.AofA.2018.12, author = {Baryshnikov, Yuliy and Melczer, Stephen and Pemantle, Robin and Straub, Armin}, title = {{Diagonal Asymptotics for Symmetric Rational Functions via ACSV}}, booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-078-1}, ISSN = {1868-8969}, year = {2018}, volume = {110}, editor = {Fill, James Allen and Ward, Mark Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2018.12}, URN = {urn:nbn:de:0030-drops-89055}, doi = {10.4230/LIPIcs.AofA.2018.12}, annote = {Keywords: Analytic combinatorics, generating function, coefficient, lacuna, positivity, Morse theory, D-finite, smooth point} }
Published in: Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)
Carsten Schneider. Some Notes On ``When is 0.999... equal to 1?. In Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, Volume 5021, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{schneider:DagSemProc.05021.19, author = {Schneider, Carsten}, title = {{Some Notes On ``When is 0.999... equal to 1?}}, booktitle = {Mathematics, Algorithms, Proofs}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5021}, editor = {Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.19}, URN = {urn:nbn:de:0030-drops-2755}, doi = {10.4230/DagSemProc.05021.19}, annote = {Keywords: Symbolic summation, computer algebra, proofs, harmonic numbers, zeta-relations} }
Feedback for Dagstuhl Publishing