Publications

Export 653 results:
Sort by: [ Author (Asc)] Title Type Year
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 
K
[1554] Kloetzer, M, Mahulea C, Gonzalez R.  2015.  Optimizing Cell Decomposition Path Planning for Mobile Robots Using Different Metrics. ICSTCC'2015: 19th International Conference on System Theory, Control and Computing.
[1556] Kloetzer, M, Mahulea C.  2015.  LTL-based Planning in Environments with Probabilistic Observations. IEEE Transactions on Automation Science and Engineering. 12(4)
[1557] Kloetzer, M, Mahulea C.  2016.  Multi-Robot Path Planning for Syntactically Co-Safe LTL Specifications. WODES'2016: 13rd IFAC International Workshop on Discrete Event Systems.
[1558] Kloetzer, M, Mahulea C, Burlacu A.  2016.  Sample Gathering Problem for Different Robots with Limited Capacity. ICSTCC'2016: 20th International Conference on System Theory, Control and Computing.
L
[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.
A
[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.
L
[LG03RR1] López-Grao, JP.  2003.  Sketching architectural concerns on distributed discrete event simulation based on Petri Nets.
[SDIS] López-Valdés, M.  2006.  Scaled dimension of invidual strings.
0 icon
SDIS.pdf
[LSD] López-Valdés, M.  2006.  Lempel-Ziv Dimension for Lempel-Ziv compression.
0 icon
submission_172.pdf
[1423] López-Valdés, M.  2011.  Aplicaciones de la Dimensión Efectiva a la Complejidad Computacional y a los Algoritmos de Compresión de Datos. PhD
[LMT-91] Luciañez, JM, Merseguer J, Torralba JM.  1991.  Sistemas de ayuda a las decisiones. Metodología de desarrollo de aplicaciones.
M
[MayEHD] Mayordomo, E.  2004.  Effective Hausdorff dimension. Trends in Logic. 23:171-186.
0 icon
xx_May_FFS.ps
L
[LutMayTPRBM] Lutz, JH, Mayordomo E.  2001.  Twelve problems in resource bounded measure. :83-101.
[LutMayTPRBMb] Lutz, JH, Mayordomo E.  1999.  Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
0 icon
99_LM_BEATCS.ps
A
[AmbMay97] Ambos-Spies, K, Mayordomo E.  1997.  Resource Bounded Measure and Randomness. :1-47.
0 icon
97_ASM_LNPAM.ps
H
[HiLuMaSDNC] Hitchcock, JM, Lutz JH, Mayordomo E.  2004.  Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
0 icon
sdnc.ps
D
[DaLaLuMaFSD] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2004.  Finite state dimension. Theoretical Computer Science. 310:1-33.
0 icon
fsd.ps
M
[MayKCCCHD] Mayordomo, E.  2002.  A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
0 icon
02_May_IPL.ps
B
[BuhMay97] Buhrman, H, Mayordomo E.  1997.  An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
0 icon
97_BM_JCSS.ps
L
[LutMayCVKL] Lutz, JH, Mayordomo E.  1996.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
0 icon
96_LM_TCS.ps
B
[BooMay96] Book, RV, Mayordomo E.  1996.  On the robustness of ALMOST R. Rairo Informatique Theorique et Applications. 30:123-133.
0 icon
96_BM_RITA.ps
M
[MayAESET] Mayordomo, E.  1994.  Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
0 icon
94_May_TCS.ps
L
[LutMayMSDHL] Lutz, JH, Mayordomo E.  1994.  Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
0 icon
94_LM_SIAMJoC.ps
H
[HerMay94] Hermo, M, Mayordomo E.  1994.  A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
0 icon
94_HM_MST.ps
[HiLuMaSDNCb] Hitchcock, JM, Lutz JH, Mayordomo E.  2003.  Scaled dimension and non uniform complexity. 2719:278-290.