2 citations · 2 across the 2 of their papers we have counts for
5 papers · 1 filter
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
Elvira Mayordomo, Philippe Moser, Sylvain Perifel
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation, and in particular calls for a formulation of information-lossl…
Curves That Must Be Retraced
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. F…
Bounded Pushdown dimension vs Lempel Ziv information density
Pilar Albert, Elvira Mayordomo, Philippe Moser
In this paper we introduce a variant of pushdown dimension called bounded pushdown (BPD) dimension, that measures the density of information contained in a sequence, relative to a…
Points on Computable Curves
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
The ``analyst's traveling salesman theorem'' of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This result,…
Effective Strong Dimension, Algorithmic Information, and Computational Complexity
Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz +1
The two most important notions of fractal dimension are {\it Hausdorff dimension}, developed by Hausdorff (1919), and {\it packing dimension}, developed by Tricot (1982). Lutz (200…