Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Jack H. Lutz, Satyadev Nandakumar, and Subin Pulari. A Weyl Criterion for Finite-State Dimension and Applications. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 65:1-65:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{lutz_et_al:LIPIcs.MFCS.2023.65, author = {Lutz, Jack H. and Nandakumar, Satyadev and Pulari, Subin}, title = {{A Weyl Criterion for Finite-State Dimension and Applications}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {65:1--65:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.65}, URN = {urn:nbn:de:0030-drops-185997}, doi = {10.4230/LIPIcs.MFCS.2023.65}, annote = {Keywords: Finite-state dimension, Finite-state compression, Weyl’s criterion, Exponential sums, Normal numbers} }
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Satyadev Nandakumar, Akhil S, and Prateek Vishnoi. Effective Continued Fraction Dimension Versus Effective Hausdorff Dimension of Reals. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 70:1-70:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{nandakumar_et_al:LIPIcs.MFCS.2023.70, author = {Nandakumar, Satyadev and S, Akhil and Vishnoi, Prateek}, title = {{Effective Continued Fraction Dimension Versus Effective Hausdorff Dimension of Reals}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {70:1--70:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.70}, URN = {urn:nbn:de:0030-drops-186041}, doi = {10.4230/LIPIcs.MFCS.2023.70}, annote = {Keywords: Algorithmic information theory, Kolmogorov complexity, Continued fractions, Effective Hausdorff dimension} }
Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Satyadev Nandakumar and Subin Pulari. Real Numbers Equally Compressible in Every Base. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 48:1-48:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{nandakumar_et_al:LIPIcs.STACS.2023.48, author = {Nandakumar, Satyadev and Pulari, Subin}, title = {{Real Numbers Equally Compressible in Every Base}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {48:1--48:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.48}, URN = {urn:nbn:de:0030-drops-177008}, doi = {10.4230/LIPIcs.STACS.2023.48}, annote = {Keywords: Finite-state dimension, Finite-state compression, Absolutely dimensioned numbers, Exponential sums, Weyl criterion, Normal numbers} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Satyadev Nandakumar and Subin Pulari. Ergodic Theorems and Converses for PSPACE Functions. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 80:1-80:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{nandakumar_et_al:LIPIcs.MFCS.2021.80, author = {Nandakumar, Satyadev and Pulari, Subin}, title = {{Ergodic Theorems and Converses for PSPACE Functions}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {80:1--80:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.80}, URN = {urn:nbn:de:0030-drops-145204}, doi = {10.4230/LIPIcs.MFCS.2021.80}, annote = {Keywords: Ergodic Theorem, Resource-bounded randomness, Computable analysis, Complexity theory} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Satyadev Nandakumar and Prateek Vishnoi. Randomness and Effective Dimension of Continued Fractions. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 73:1-73:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{nandakumar_et_al:LIPIcs.MFCS.2020.73, author = {Nandakumar, Satyadev and Vishnoi, Prateek}, title = {{Randomness and Effective Dimension of Continued Fractions}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {73:1--73:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.73}, URN = {urn:nbn:de:0030-drops-127424}, doi = {10.4230/LIPIcs.MFCS.2020.73}, annote = {Keywords: Continued fractions, Martin-L\"{o}f randomness, Computable randomness, effective Fractal dimension} }
Feedback for Dagstuhl Publishing