Henry Adorna
Henry Adorna
Embedded Files
ha at dcs dot upd dot edu dot ph
ha at dcs dot upd dot edu dot ph
Henry N. Adorna is a member of the Faculty of the Department of Computer Science, College of Engineering, University of the Philippines Diliman, 1101 Quezon City, Philippines.
He founded the Algorithms and Complexity Laboratory of the Department.
The research interests of Henry are in the Mathematical Foundations of Computer Science, in particular, Membrane Computing, Automata and Formal Language Theory, Discrete Mathematics and Algorithms for Hard Problems.
Henry is one of the founders and co-organizers (J. Caro, F.P. Muga II) of SMACS (Symposium on the Mathematical Aspects of Computer Science).
Henry was elected "Full Member" to the Philippine - American Academy of Science and Engineering last October 2018.
Best known upper bound of Henry's Erdos Number is 3, via:
Henry ADORNA, Gheorghe PAUN, and M. J. PEREZ-JIMENEZ, On Communication Complexity in Evolution-Communication P Systems, Romanian Journal of Information Science and Technology, Vol. 13 No. 2 pp. 113–130, 2010
Solomon Marcus and Gheorghe Pâun, On symmetry in languages, International Journal of Computer Mathematics, 1029-0265, Volume 52, Issue 1, pp. 1 – 15, 1994
Paul Erdös and Solomon Marcus, Sur la decomposition de l'espace euclidien en ensembles homogenes, Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 8, Number 3-4, pp. 443-452, 1957
PhD Students: [Mathematics Genealogy Project]
Finished
1. Jan Michael Yap [2014] (now Program Director, Phil Genome Center, and former Chair of DCS, UPDiliman)
2. Francis Cabarle [2015] (now Head of Algorithms and Complexity Lab, UPDiliman)
3. Richelle Juayong [2017] (now with S3 Lab, DCS UPD)
4. Jhoirene Clemente [2019] (now Director at Maroon Studios Inc.; with AI Pros, Inc.; ACLab DCS UPD)
5. Ivy Ordanel [2021] now with ACLab, DCS, UPDiliman)
6. Alfonso Labao [2023] (now with ACLab, DCS, UPDiliman)
Ongoing
1. Nestine Hernandez [on going]
2. Kelvin Buno [on going]
3. Cherry Rose Estabillo [on going, with Jan Michael Yap] (funded by ERDT since 2019)
Teachings
2022- 2023 on Sabbatical Leave (On Residence)
2021-2022 Unang Semestre (flipped classroom: onljne) (CoVID19 era)
CS 277: Introduction to Quantum Algorithms
CS 301: Communication Complexity
CS 133: Automata and Computability
Ikalawang Semestre (flipped classroom: onljne) (CoVID19 era)
CS 204: Theory of Computation
CS 290: Seminar on Cryptography and Complexity
CS 297: Seminar on Membrane Computing and Quantum Algorithms
CS 135: Algorithm Design and Analysis
2020-2021 First Semester (flipped classroom: onljne) (CoVID19 era)
CS 397: Seminar on Automata, Languages and Combinatorics
CS 135: Algorithm Design and Analysis
Second Semester (flipped classroom: onljne) (CoVID19 era)
CS 204: Theory of Computation
CS 290: Special Topics on Automata and Computability
CS 318: Approximation Algorithm
CS 135: Algorithm Design and Analysis
2019-2020 First Semester
CS 204: Theory of Computation
CS 297: Algorithmic for Hard Problems
CS 133: Automata and Computability
CS 135: Algorithms Design and Analysis
CS 298: Special Topics (with Pros Naval)
CS 198: Algorithmics for Biological Networks
Second Semester (CoVID19 era)
CS 338: Computational Models for Biological Processes
CS 397: Seminar on Graph Algorithms
CS 298: Special Topic (with Pros Naval)
CS 199: Algorithmics for Biological Networks
CS 300: Masters Thesis
2018-2019 First Semester
CS 204: Theory of Computation
CS 297: Topics in Discrete Mathematics for Computer Science
CS 133: Automata and Computability
CS 30: Discrete Mathematics
CS 390: Independent Study (PhD)
CS 198: On Quantum Decoherence
Second Semester
CS 297: Algorithmic for Hard Problems
CS 318: Approximation Algorithms
CS 298: Special Topics
(Preservation of some properties of workflow nets)
CS 133: Automata and Computability
CS 199: On Quantum Decoherence
2017-2018 First Semester
CS 204: Theory of Computation
CS 211: Combinatorial Optimization
CS 390: Independent Study (PhD)
CS 133: Automata and Computability
Second Semester
CS 133: Automata and Computability
CS 290: Optimization Algorithms for Networks and Graphs
CS 397: Natural and Bio-Inspired Models of Computation
2016-2017 First Semester
CS 204: Theory of Computation
CS 297: Topics in Graph Theory
CS 318: Approximation Algorithms
CS 133: Automata and Computability
Second Semester
CS 133: Automata and Computability
CS 30: Discrete Mathematics
CS 290: Special Topics in Formal Languages
CS 397: Seminar on
Algorithmic Approaches to Combinatorial Hard Problems
2015-2016 on Sabbatical Leave
2014-2015 First Semester
CS 204: Theory of Computations (UPDil and UPCebu)
CS 297: Formal Models and Computability
Second Semester
CS 30: Discrete Mathematics
CS 290:
2013-2014 First Semester
CS 204: Theory of Computations (UPDil and UPCebu)
CS 360: Formal Methods
CS 133: Automata and Computability
Second Semester
CS 204: Theory of Computation
CS 315: Algorithms in Bioinformatics
CS 397: Special Topics on
Automata, Computability, Languages and Applications
CS 133: Automata and Computability
CS 297: Topics in Discrete Mathematics (UPCebu)
2012-2013 First Semester
CS 30: Discrete Mathematics
CS 204: Theory of Computations
CS 211: Combinatorial Optimization
CS 397: Natural and Unconventional Computing Models
Second Semester
CS 301: Communication Complexity
CS 290: Topics in Unconventional Computing
CS 197: Bridging Theoretical Computer Science
CS 297: Natural Computing and Process Calculi
2011-2012 First Semester
CS 397: Models of Computations
CS 204: Theory of Computations
CS 197: Bridging Theoretical Computer Science
Second Semester
CS 290: Models of Computations and Complexity Measures
CS 297: Communication Complexity
2010-2011 First Semester
CS 204: Theory of Computation
CS 133: Automata and Computability Theory
Second Semester
CS 290 Grammar, Communication, and Languages
CS 208 Computational Complexity Theory
CS 297 Formal Models and Computability
2009-2010 First Semester
CS 204 Theory of Computation
CS 297 Automata, Grammar, and Communication
Second Semester
CS 290: Algorithmics for Hard Problems
CS 297: Special Topics in Communication Complexity
Math 157: Discrete Mathematical Structures
2008-2009 First Semester
CS 133: Automata and Computability
CS 204: Theory of Computation
CS 297: Computer-Assisted Argumentation
CS 296: Graduate Seminar
Second Semester
Math 157: Discrete Mathematical Structures
CS 290:
CS 297: Data Visualization
2007- 2008 First Semester
CS 204: Theory of Computation
CS 133: Automata and Computability
CS 297: Models for Biology Processes
Second Semester
============================================================================
Publication listed in Google Scholar:
Earlier Publications:
X. Zeng, H. Adorna, M.A. Martínez-del-Amor, L. Pan and M. J. Pérez-Jiménez; Matrix Representation of Spiking Neural P Systems; in Membrane Computing: Lecture Notes in Computer Science, 2011, Volume 6501/2011, 377-391,Revised Selected Papers Marian Gheorghe, Thomas Hinze, Gheorghe Paun, Grzegorz Rozenberg and Arto Salomaa (Eds).
H. Adorna, Gh. Paun, and M. J. Perez-Jimenez ; On Communication Complexity in Evolution-Communication P Systems, Romanian Journal of Information Science and Technology, Vol. 13 No. 2 pp. 113–130, 2010
H.N. Adorna: Some Descriptional Complexity Problems on Finite Automata. Philippine Computing Journal, Vol 3, No. 1, pp 1-6, (2008)
H.N. Adorna, N.Hernandez, R. Lorenzo: On the UFA and the Strict Tree Property. Philippine Computing Journal, Vol 3, No.1, pp 7-12, (2008)
H.N. Adorna, A. Aragon, P. Cabral: On Infinite Sequence induced by Collatz Problem, Philippine Computing Science Journal, Vol 3, No. 1, pp 40-45, (2008)
H.N. Adorna: Sequences, Languages and Automata. In:R. Saldana et al. (eds), Proceedings of 8th Philippine Computing Science Congress (2008)
M. de Guzman, J. Pasia, H.N. Adorna: Schutzenberger's Guessing Game and Finite Kolakoski Subsequence. In: R. Saldana et al. (eds), Proceedings of 8th Philippine Computing Science Congress (2008)
H.N. Adorna, A. Aragon, P. Cabral: On Infinite Sequence induced by Collatz Problem, In: R. Saldana et al. (eds) Proceedings of 6th Philippine Computing Science Congress, (2006), 221-226
H.N. Adorna: Some Descriptional Complexity Problems on Finite Automata. In: R. Saldana et al. (eds) Proceedings of 5th Philippine Computing Science Congress (2005), 27-32
H.N. Adorna: On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexity. LNCS 2450, 151-161 (2003)
H.N. Adorna: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. Journal of Automata, Languages and Combinatorics,7 (2002) 4, 419-432.
Last Update: 1 Pebrero 2020
by H.N. Adorna.
Page updated
Report abuse