Publications

Export 56 results:
Sort by: Author Title [ Type (Desc)] Year
Filters: First Letter Of Last Name is L  [Clear All Filters]
Thesis
Report
Journal Article
[LutMayCVKL] Lutz, JH, Mayordomo E.  1996.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
[1293] Gu, X, Lutz JH, Mayordomo E.  2011.  Curves that must be retraced. Information and Computation. 209:992--1006.
[1439] Mayordomo, E, López-Valdés M.  2013.  Dimension is Compression. Theory of Computing Systems. 52:95-112.
[DPSSF] Lutz, JH, Mayordomo E.  2008.  Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
[AtHiLuMa06] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2007.  Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
[DaLaLuMaFSD] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2004.  Finite state dimension. Theoretical Computer Science. 310:1-33.
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
[RP-85-03] Alla, H, Ladet P.  1985.  Generalized Inverses and the Calculation of Symbolic Invariants for Colored Petri Nets. Technique et Science Informatique (TSI). 4:113-126.
[1297] Mayordomo, E, Lutz JH, Fortnow L.  2012.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[LutMayMSDHL] Lutz, JH, Mayordomo E.  1994.  Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
[1323] López-Grao, JP, Colom JM.  2012.  A Petri Net Perspective on the Resource Allocation Problem in Software Engineering. Transactions on Petri Nets and Other Models of Concurrency. V
[HiLuMaSDNC] Hitchcock, JM, Lutz JH, Mayordomo E.  2004.  Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
[sdkcthsR] Hitchcock, JM, López-Valdés M, Mayordomo E.  2008.  Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory of Computing Systems. 43:471-497.
[1532] Gómez-Martínez, E, Linaje M, Sanchez-Figueroa F, Iglesias-Pérez A, Preciado JC, González-Cabero R, Merseguer J.  2015.  A Semantic Approach for Designing Assistive Software Recommender Systems. Journal of Systems and Software. 104
[1425] Mayordomo, E, Ferreira F, Hyland M, L\"owe B.  2012.  Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
[BLV07] Bernues, J, López-Valdés M.  2007.  Tail estimates and a random embedding of l^p_n to l_r^{(1+ε)n}, 0<r<p<2.. Publ. Math. Debrecen. 70
[LutMayTPRBMb] Lutz, JH, Mayordomo E.  1999.  Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
[FeLuMaRe05] Fenner, SA, Lutz JH, Mayordomo E, Reardon P.  2005.  Weakly useful sequences. Information and Computation. 197:41-54.
Conference Proceedings
Conference Paper
[LutMayCVKLb] Lutz, JH, Mayordomo E.  1994.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
[RP-95-12] Tricas, F, Martínez J.  1995.  Corrección de programas y redes de Petri de alto nivel. :155-164.
[1301] Mayordomo, E, Lutz JH, Gu X.  2009.  Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).