Henry N. Adorna
Orcid: 0000-0001-5513-4039Affiliations:
- University of the Philippines Diliman, Department of Computer Science, Quezon City, Philippines
According to our database1,
Henry N. Adorna
authored at least 60 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Theor. Comput. Sci., January, 2024
Proceedings of the Bioinspired Systems for Translational Applications: From Robotics to Social Engineering, 2024
2023
Theor. Comput. Sci., 2023
2022
Matrix representation and simulation algorithm of numerical spiking neural P systems.
J. Membr. Comput., 2022
Cryptogr., 2022
2021
J. Membr. Comput., 2021
J. Membr. Comput., 2021
J. Membr. Comput., 2021
2020
J. Membr. Comput., 2020
Distributed computation of a <i>k</i> P systems with active membranes for SAT using clause completion.
J. Membr. Comput., 2020
2019
Matrix representation and simulation algorithm of spiking neural P systems with structural plasticity.
J. Membr. Comput., 2019
Generating context-free languages using spiking neural P systems with structural plasticity.
J. Membr. Comput., 2019
Fundam. Informaticae, 2019
Complex., 2019
Proceedings of the 17th International Conference on High Performance Computing & Simulation, 2019
2018
Theor. Comput. Sci., 2018
On simulating cooperative transition P systems in evolution-communication P systems with energy.
Nat. Comput., 2018
Int. J. Comput. Commun. Control, 2018
Proceedings of the Enjoying Natural Computing, 2018
2017
Characterizing Classes of Potential Outliers through Traffic Data Set Data Signature 2D nMDS Projection.
CoRR, 2017
CoRR, 2017
On Evolution-Communication P Systems with Energy Having Bounded and Unbounded Communication.
Proceedings of the Membrane Computing, 2017
Simulating Evolutional Symport/Antiport by Evolution-Communication and vice versa in Tissue P Systems with Parallel Communication.
Proceedings of the Membrane Computing, 2017
2016
Sequential spiking neural P systems with structural plasticity based on max/min spike number.
Neural Comput. Appl., 2016
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016
2015
Relating Computations in Non-cooperative Transition P Systems and Evolution-Communication P Systems with Energy.
Fundam. Informaticae, 2015
Proceedings of the Unconventional Computation and Natural Computation, 2015
On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP Systems.
Proceedings of the Membrane Computing, 2015
Proceedings of the 6th International Conference on Information, 2015
2014
Building phylogenetic trees from frequent subgraph mining techniques on reaction hypergraphs.
Proceedings of the 5th International Conference on Information, 2014
Relating the Languages of Transition P Systems and Evolution-Communication P Systems with Energy.
Proceedings of the Bio-Inspired Computing - Theories and Applications, 2014
2013
Proceedings of the Unconventional Computation and Natural Computation, 2013
Proceedings of the Membrane Computing, 2013
Traffic incident detection and modelling using Quantum Frequency Algorithm and AutoRegressive Integrated Moving Average models.
Proceedings of the 4th International Conference on Information, 2013
2012
A Quantitative Analysis-based Algorithm for Optimal Data Signature Construction of Traffic Data Sets.
J. Inf. Process., 2012
Proceedings of the Membrane Computing, 2012
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012
Data Signature-Based Multiyear Analysis of BLK-NB 6-Minute Interval Datasets of 2006 to 2009.
Proceedings of the 2012 IEEE/ACIS 11th International Conference on Computer and Information Science, Shanghai, China, May 30, 2012
2011
Int. J. Nat. Comput. Res., 2011
Proceedings of the Membrane Computing, 2011
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011
Data Signature-Based Time Series Traffic Analysis on Coarse-Grained NLEX Density Data Set.
Proceedings of the Communication and Networking, 2011
Proceedings of the Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011
2010
Proceedings of the Membrane Computing, 2010
2002
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata.
J. Autom. Lang. Comb., 2002
On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002