Publications
Filters: First Letter Of Last Name is L [Clear All Filters]
.
2011.
[1308] Resource-bounded Dimension in Computational Learning Theory. arXiv.
.
2010.
.
2003.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[1293] Curves that must be retraced. Information and Computation. 209:992--1006.
.
2011.
[1439] Dimension is Compression. Theory of Computing Systems. 52:95-112.
.
2013.
[DPSSF] Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
.
2008.
[AtHiLuMa06] Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
.
2007.
[DaLaLuMaFSD] Finite state dimension. Theoretical Computer Science. 310:1-33.
.
2004.
[HiLuMa05] The fractal geometry of complexity classes. SIGACT News. 36:24-38.
.
2005.
[RP-85-03] Generalized Inverses and the Calculation of Symbolic Invariants for Colored Petri Nets. Technique et Science Informatique (TSI). 4:113-126.
.
1985.
[1297] Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
.
2012.
[LutMayMSDHL] Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
.
1994.
[1323] A Petri Net Perspective on the Resource Allocation Problem in Software Engineering. Transactions on Petri Nets and Other Models of Concurrency. V
.
2012.
[HiLuMaSDNC] Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
.
2004.
[sdkcthsR] Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory of Computing Systems. 43:471-497.
.
2008.
[1532] A Semantic Approach for Designing Assistive Software Recommender Systems. Journal of Systems and Software. 104
.
2015.
[1425] Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
.
2012.
[BLV07] Tail estimates and a random embedding of l^p_n to l_r^{(1+ε)n}, 0<r<p<2.. Publ. Math. Debrecen. 70
.
2007.
[LutMayTPRBMb] Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
.
1999.
[FeLuMaRe05] Weakly useful sequences. Information and Computation. 197:41-54.
.
2005.
.
2010.
[LutMayCVKLb] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
.
1994.
[RP-95-12] Corrección de programas y redes de Petri de alto nivel. :155-164.
.
1995.
[1301] Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
.
2009.