since 2007
Embedded Files
Graduate Seminar on Algorithms, Theory and Discrete Mathematics (GS-ATDM)
Graduate Seminar on Algorithms, Theory and Discrete Mathematics (GS-ATDM)
April to July 2021 :: 4:30pm :: Wednesdays of every two weeks :: Organized and Moderated by Henry Adorna (part of CSP SIG-MACS activities)
PAUNAWA....
Ito ay mala-palihan ng mga mag-aaral ni Henry Adorna na kumukuha ng pagka-Paham sa larangan ng Informatikang Teyoretikal. Ang pawang panayan sa tipanang pangkarunungan agham, sipnayan at informatika na ito ay hango sa mga pananaliksik na ginagawa at gagawain ng bawat tagapagsalita.
Hinahangad ng pagatitipon na ito na magkabahaginan ng mga kuro-kuro at hinuha ukol sa mga suliraning pang-informatika at sipnayan maaaring maipahayag sa bawat panayam na maihahatid. Hinihikayat ang sinumang may matimyas na asam sa pag-aaral ng informatika at sipnayan na makisalamuha at makipagpalitan ng pang-unawa at kuro-kuro sa larangan ng "algorithms, theoretical informatics," at " discrete mathematics."
Kung nais mag-ambag ng panayam tungkol sa inyong pananaliksik o kaalamang nakalap mula sa mga pahayagang-agham ay maari lamang pong makipag-ugnayan at magpadala ng liham-elektroniko sa <hnadorna@up.edu.ph> at sabihin ang inyong pakay.
Maraming Salamat sa pagtangkilik ng GS-ATDM. Hanggang sa mga susunod na talakayan ...
Maraming Salamat sa pagtangkilik ng GS-ATDM. Hanggang sa mga susunod na talakayan ...
---------------------------------------------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------------------------------------------
Comparing computation in R systems and in P systems
Comparing computation in R systems and in P systems
Nestine Hope S. Hernandez
Nestine Hope S. Hernandez
Communication Complexity in Distributed P Systems
Communication Complexity in Distributed P Systems
Kelvin C. Buno
Kelvin C. Buno
On the Minimum Connected Dominating Sets of Some Biological Networks
On the Minimum Connected Dominating Sets of Some Biological Networks
Jean V. Malolos
Jean V. Malolos
Efficiency and Trade-Off of Petri Net Reduction Rules
Efficiency and Trade-Off of Petri Net Reduction Rules
Louis Anthony L. Agong
Louis Anthony L. Agong
Algorithms and Complexity of Some Variants of Poset Cover Problem
Algorithms and Complexity of Some Variants of Poset Cover Problem
Ivy D. Ordanel
Ivy D. Ordanel
Ph.D. Computer Science Thesis Oral Defence [UP Diliman]
23 June 2021, 9 am to 12noon
Public Key Encryption Schemes with CCA-Security and Additional Resilience to Other Attacks
Public Key Encryption Schemes with CCA-Security and Additional Resilience to Other Attacks
Alfonso B. Labao
Alfonso B. Labao
Some Quantum Algorithms for the Exact and Approximate String Matching Problem
Some Quantum Algorithms for the Exact and Approximate String Matching Problem
Jeffrey Aborot
Jeffrey Aborot
M.S. Computer Science (mag-aaral) UPDiliman
16 June 2021, 4:30pm - 6:30pm
On the Approximation of Phylogenetic Networks and Recombination
On the Approximation of Phylogenetic Networks and Recombination
Cherry Estabillo
Cherry Estabillo
Approaching SAT with dP Scheme
Approaching SAT with dP Scheme
Kelvin Buno
Kelvin Buno
Philippine Computing Science Congress (PCSC) 2021
Philippine Computing Science Congress (PCSC) 2021
PCSC 2021
PCSC 2021
6-7 May 2021
You are invited to a Zoom webinar.
When: May 6-7, 2021 08:30 AM Manila
Topic: Philippine Computing Science Congress (PCSC) 2021
Register in advance for this webinar:
https://up-edu.zoom.us/webinar/register/WN_bo1zo9ZuTSGZ9rtNDPo46Q
After registering, you will receive a confirmation email containing information about joining the webinar.
Solving Hard Lattice Problems
Solving Hard Lattice Problems
Richard Bryann Chua
Richard Bryann Chua
Poset Cover Problems: Different Deterministic Approaches and Some Open Problems
Poset Cover Problems: Different Deterministic Approaches and Some Open Problems
Ivy Ordanel
Ivy Ordanel
Page updated
Report abuse