Published in: LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Jack H. Lutz, Neil Lutz, and Elvira Mayordomo. Extending the Reach of the Point-To-Set Principle. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 48:1-48:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{lutz_et_al:LIPIcs.STACS.2022.48, author = {Lutz, Jack H. and Lutz, Neil and Mayordomo, Elvira}, title = {{Extending the Reach of the Point-To-Set Principle}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {48:1--48:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.48}, URN = {urn:nbn:de:0030-drops-158585}, doi = {10.4230/LIPIcs.STACS.2022.48}, annote = {Keywords: algorithmic dimensions, geometric measure theory, hyperspace, point-to-set principle} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Xiang Huang, Jack H. Lutz, Elvira Mayordomo, and Donald M. Stull. Asymptotic Divergences and Strong Dichotomy. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 51:1-51:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{huang_et_al:LIPIcs.STACS.2020.51, author = {Huang, Xiang and Lutz, Jack H. and Mayordomo, Elvira and Stull, Donald M.}, title = {{Asymptotic Divergences and Strong Dichotomy}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {51:1--51:15}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.51}, URN = {urn:nbn:de:0030-drops-119125}, doi = {10.4230/LIPIcs.STACS.2020.51}, annote = {Keywords: finite-state dimension, finite-state gambler, Kullback-Leibler divergence, normal sequences} }
Published in: Dagstuhl Reports, Volume 2, Issue 1 (2012)
Veronica Becher, Laurent Bienvenu, Rodney Downey, and Elvira Mayordomo. Computability, Complexity and Randomness (Dagstuhl Seminar 12021). In Dagstuhl Reports, Volume 2, Issue 1, pp. 19-38, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
@Article{becher_et_al:DagRep.2.1.19, author = {Becher, Veronica and Bienvenu, Laurent and Downey, Rodney and Mayordomo, Elvira}, title = {{Computability, Complexity and Randomness (Dagstuhl Seminar 12021)}}, pages = {19--38}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2012}, volume = {2}, number = {1}, editor = {Becher, Veronica and Bienvenu, Laurent and Downey, Rodney and Mayordomo, Elvira}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.1.19}, URN = {urn:nbn:de:0030-drops-34555}, doi = {10.4230/DagRep.2.1.19}, annote = {Keywords: algorithmic randomness, computability theory, computationl complexity, Kolmogorov complexity, algorithmic information theory} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Lance Fortnow, Jack H. Lutz, and Elvira Mayordomo. Inseparability and Strong Hypotheses for Disjoint NP Pairs. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 395-404, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{fortnow_et_al:LIPIcs.STACS.2010.2471, author = {Fortnow, Lance and Lutz, Jack H. and Mayordomo, Elvira}, title = {{Inseparability and Strong Hypotheses for Disjoint NP Pairs}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {395--404}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2471}, URN = {urn:nbn:de:0030-drops-24711}, doi = {10.4230/LIPIcs.STACS.2010.2471}, annote = {Keywords: Computational Complexity, Disjoint NP-pairs, Resource-Bounded Measure, Genericity} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Xiaoyang Gu, Jack H. Lutz, and Elvira Mayordomo. Curves That Must Be Retraced. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 149-160, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{gu_et_al:OASIcs.CCA.2009.2267, author = {Gu, Xiaoyang and Lutz, Jack H. and Mayordomo, Elvira}, title = {{Curves That Must Be Retraced}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {149--160}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2267}, URN = {urn:nbn:de:0030-drops-22674}, doi = {10.4230/OASIcs.CCA.2009.2267}, annote = {Keywords: Computable analysis, computable curve, computational complexity, Hausdorff measure, rectifiable curve} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Pilar Albert, Elvira Mayordomo, Philip Moser, and Sylvain Perifel. Pushdown Compression. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 39-48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{albert_et_al:LIPIcs.STACS.2008.1332, author = {Albert, Pilar and Mayordomo, Elvira and Moser, Philip and Perifel, Sylvain}, title = {{Pushdown Compression}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {39--48}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1332}, URN = {urn:nbn:de:0030-drops-13327}, doi = {10.4230/LIPIcs.STACS.2008.1332}, annote = {Keywords: Finite-state compression, Lempel-Ziv algorithm, pumping-lemma, pushdown compression, XML document} }
Feedback for Dagstuhl Publishing