"When you want to build a ship, then do not drum the men together in order to procure wood, to give instructions or to distribute the work, but teach them longing for the wide endless sea." - A. de Saint-Exupery


This is the official web site of the Algorithms and Complexity Laboratory (ACLab) of the Department of Computer Science at the University of the Philippines Diliman. ACLab was founded in 2007 by Henry N. Adorna, Professor of Computer Science.

ACLab regular members, (under)graduate students, and collaborators conduct investigations on a diverse range of topics, all anchored on a theoretical computer science perspective. Current active research areas include formal models, natural computing, algorithmics for hard problems, bioinformatics, and data analysis and visualization.

Recent News and Announcements

19 June 2018

Theory Days 2018

Synopsis: Theory Days 2018 celebrates two main reasons: 11 years of Algorithms and Complexity at the Department of Computer Science in UP Diliman, as well as 106 years since the birth of Alan Turing, the founder of computer science. Theory Days 2018 aims to celebrate both these reasons by providing invited talks under the general theme of discrete mathematics and theoretical computer science and their related practice.

Talks and other activities in Theory Days 2018, such as brainstorming or break-out sessions, are largely informal in nature: the main reason is to initiate discussions which may lead to (in)formal collaborations, conference or journal articles, open problems for (under)graduate students and the computing community, or just for fun!

Coordinates: 21 June (9:00 AM - 2:45 PM) and 22 June (9:00 AM - 5:40 PM) 2018, ERDT Room, 2nd floor, UP Alumni Engineers Centennial Hall (UP AECH), P. Velasquez Street, Diliman, Quezon City, Philippines.

Map to venue: Google maps link HERE

Registration form: Link to free registration is HERE
Download program: PDF file of program is HERE.

Abstract: Membrane computing is a field of computer science that studies unconventional models of computa- tion known as P systems which are inspired by the biological and chemical processes in a biological cell or group of cells. In 2006, a model of computation known as spiking neural P system (SNP system) was introduced. SNP systems were inspired by networks of spiking neurons. In 2015, a variant of SNP systems known as spiking neural P system with structural plasticity (SNPSP sys- tem) was introduced. SNPSP systems incorporate the ideas of synaptogenesis and synaptic pruning (structural plasticity) as features of the model. To study structural plasticity as feature of SNPSP systems, we used SNPSP systems to generate families of languages in the Chomsky hierarchy: finite languages, regular languages, context-free languages, and recursively enumerable languages. We created procedures for constructing SNPSP systems that generate the families of languages. We discussed how structural plasticity is used for constructing the language generator SNPSP systems. We also compared the language generator SNPSP systems to existing language generator SNP systems.

"Ten years of Computer Science Theory at UP Diliman" 
presented by Henry N. Adorna during Theory Days 2017.

Selected and Recent Publications

  1. F.G.C. Cabarle, R.T.A. de la Cruz, D.P. Cailipan, D. Zhang, X. Liu, X. Zeng. On Solutions and Representations Of Spiking Neural P Systems With Rules On Synapses. (in press) Information Sciences https://doi.org/10.1016/j.ins.2019.05.070 2019 [jour/ISI/SCI]
  2. A. Bibi, F. Xu, H. Adorna, F.G. Cabarle. Sequential Spiking Neural P Systems with Local Schedule Synapses without DelayComplexity, Volume 2019, https://doi.org/10.1155/2019/7313414 [jour/ISI/SCI]
  3. J. Dizon, J. Malolos, S. Bera and H. Adorna. Minimum Connected Dominating Sets on Protein-Protein Interaction Networks. Proc. 19th Philippine Computing Science Congress (PCSC2019). National University, City of Manila, Philippines. March 28–30, 2019, [cp]
  4. M.A. Martija, N. Paglinawan and H. Adorna. Effect of k-Degree Anonymization via the UMGA Algorithm on the Performance of Machine Learning Algorithms. Proc. 19th Philippine Computing Science Congress (PCSC2019). National University, City of Manila, Philippines. March 28–30, 2019, [cp]
  5. J.K. Domoguen, R. Dang-Awan and H. Adorna.Collatz One-Way Function as a Candidate Cryptographic Hash function. Proc. 19th Philippine Computing Science Congress (PCSC2019). National University, City of Manila, Philippines. March 28–30, 2019, [cp]