Publications

Export 56 results:
Sort by: Author [ Title (Asc)] Type Year
Filters: First Letter Of Last Name is L  [Clear All Filters]
A B C D E F G H I J K [L] M N O P Q R S T U V W X Y Z   [Show ALL]
A
C
[LutMayCVKL] Lutz, JH, Mayordomo E.  1996.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
[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.
[1293] Gu, X, Lutz JH, Mayordomo E.  2011.  Curves that must be retraced. Information and Computation. 209:992--1006.
[1301] Mayordomo, E, Lutz JH, Gu X.  2009.  Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
D
[1517] López-Grao, JP, Colom JM, Tricas F.  2014.  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).
[LoMa05] López-Valdés, M, Mayordomo E.  2005.  Dimension is Compression. 3618:676-685.
[1439] Mayordomo, E, López-Valdés M.  2013.  Dimension is Compression. Theory of Computing Systems. 52:95-112.
[1438] Mayordomo, E, Lutz JH, Gu X, Moser P.  2012.  Dimension spectra of random subfractals of self-similar fractals. Ninth International Conference on Computability and Complexity in Analysis (CCA 2012).
[DPSSFc] Lutz, JH, Mayordomo E.  2008.  Dimensions of Points in Self-Similar Fractals. 5092:215-224.
[DPSSF] Lutz, JH, Mayordomo E.  2008.  Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
E
F
G
I
[1559] Lamarca, J, Kloetzer M, Mahulea C.  2016.  Inexpensive robot for experimental validation of planning and control algorithms. ICSTCC'2016: 20th International Conference on System Theory, Control and Computing.
[1297] Mayordomo, E, Lutz JH, Fortnow L.  2012.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[1302] Mayordomo, E, Lutz JH, Fortnow L.  2010.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Twenty-Seventh Symposium on Theoretical Aspects of Computer Science (STACS'10).
[1001] Leu, D, Silva M, Colom JM, Murata T.  1988.  Interrelationships among various concepts of fairness for Petri nets. 31st Midwest Symposium on Circuits and Systems. :1141-1144.
L