Publications
Filters: First Letter Of Last Name is L [Clear All Filters]
.
2011.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[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.
[1293] Curves that must be retraced. Information and Computation. 209:992--1006.
.
2011.
[1301] Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
.
2009.
[1517] The deadlock problem in the control of Flexible Manufacturing Systems: An overview of the Petri net approach. 19th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'2014).
.
2014.
[LoMa05] Dimension is Compression. 3618:676-685.
.
2005.
[1439] Dimension is Compression. Theory of Computing Systems. 52:95-112.
.
2013.
[1438] Dimension spectra of random subfractals of self-similar fractals. Ninth International Conference on Computability and Complexity in Analysis (CCA 2012).
.
2012.
[DPSSFc] Dimensions of Points in Self-Similar Fractals. 5092:215-224.
.
2008.
[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.
[ESDAICC] Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
.
2004.
[DaLaLuMaFSD] Finite state dimension. Theoretical Computer Science. 310:1-33.
.
2004.
[DaLaLuMaFSDb] Finite state dimension. 2076:1028-1039.
.
2001.
[HiLuMa05] The fractal geometry of complexity classes. SIGACT News. 36:24-38.
.
2005.
.
2004.
[RP-85-03] Generalized Inverses and the Calculation of Symbolic Invariants for Colored Petri Nets. Technique et Science Informatique (TSI). 4:113-126.
.
1985.
.
2006.
[1559] Inexpensive robot for experimental validation of planning and control algorithms. ICSTCC'2016: 20th International Conference on System Theory, Control and Computing.
.
2016.
[1297] Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
.
2012.
[1302] Inseparability and Strong Hypotheses for Disjoint NP Pairs. Twenty-Seventh Symposium on Theoretical Aspects of Computer Science (STACS'10).
.
2010.
[1001] Interrelationships among various concepts of fairness for Petri nets. 31st Midwest Symposium on Circuits and Systems. :1141-1144.
.
1988.