Kittiphon Phalakarn

Kittiphon Phalakarn (Kitty, กิตติภณ พละการ, キッティポンパラカーン) is a researcher at Research Center for Mathematical Trust in Software and Systems, Information Systems Architecture Science Research Division, National Institute of Informatics, Tokyo, Japan, led by Prof. Ichiro Hasuo.

My CV is available here.

Interests

Probabilistic model checking: quantitative properties of Markov models and games
Lattice theory and fixed point computation: value iteration, fixed point uniqueness
Algorithm design and analysis: graph-based algorithms

Contact

kphalakarn [at] nii [dot] ac [dot] jp
kphalakarn [at] gmail [dot] com

Publication

dblp
Google Scholar
ORCID
researchmap
K. Phalakarn, S. Pruekprasert, and I. Hasuo. Strategy Templates for Almost-Sure and Positive Winning of Stochastic Parity Games towards Permissive and Resilient Control, Theoretical Computer Science (TCS), vol. 1057, no. 115535, 2025, pp. 1–15. [Elsevier, arXiv]
K. Phalakarn, Y.C. Tsai, and I. Hasuo. Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games, Proc. of the 23rd International Symposium on Automated Technology for Verification and Analysis (ATVA 2025), pp. 109–131. [LNCS, arXiv]
Y.C. Tsai, K. Phalakarn, S. Akshay, and I. Hasuo. Chance and Mass Interpretations of Probabilities in Markov Decision Processes, Proc. of the 36th International Conference on Concurrency Theory (CONCUR 2025), pp. 33:1–33:19. [LIPIcs, arXiv]
K. Phalakarn, S. Pruekprasert, and I. Hasuo. Winning Strategy Templates for Stochastic Parity Games Towards Permissive and Resilient Control, Proc. of the 21st International Colloquium on Theoretical Aspects of Computing (ICTAC 2024), pp. 197–214. (with Best Paper Award) [LNCS, arXiv]
K. Phalakarn, V. Suppakitpaisarn, F. Rodríguez-Henríquez, and M. A. Hasan. Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling, IACR Trans. on Cryptographic Hardware and Embedded Systems (TCHES), vol. 2023, issue 3, pp. 246–269. [TCHES, ePrint]
K. Phalakarn, V. Suppakitpaisarn, and M. A. Hasan. Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny Using Precedence-Constrained Scheduling, Proc. of the 27th Australasian Conference on Information Security and Privacy (ACISP 2022), pp. 309–331. [LNCS, ePrint]
K. Phalakarn, V. Suppakitpaisarn, and M. A. Hasan. Single-round Lattice-based Multisignatures, Proc. of the 8th International Workshop on Information and Communication Security (WICS 2021), pp. 365–371. [IEEE, ePrint]
K. Phalakarn, T. Takisaka, T. Haas, and I. Hasuo. Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games, Proc. of the 32nd International Conference on Computer Aided Verification (CAV 2020), pp. 349–371. [LNCS, arXiv]
Kittiphon Phalakarn, Kittiphop Phalakarn, and V. Suppakitpaisarn. Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication, International Journal of Networking and Computing (IJNC), vol. 8, no. 2, 2018, pp. 166–185. [pdf]
K. Phalakarn, and A. Surarerks. A Matrix Decomposition Method for Odd-Type Gaussian Normal Basis Multiplication, Proc. of the 3rd International Conference on Computer and Communication Systems (ICCCS 2018), pp. 99–103. [IEEE, arXiv]
Kittiphon Phalakarn, Kittiphop Phalakarn, and V. Suppakitpaisarn. Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication, Proc. of the 4th International Workshop on Information and Communication Security (WICS 2017), pp. 482–488. [IEEE, arXiv]
K. Phalakarn, and A. Surarerks. An Analysis of Computer Programs using λ-calculus, Proc. of the 7th International Workshop on Computer Science and Engineering (WCSE 2017), pp. 214–218. (with Best Oral Presentation Award) [pdf]
Kittiphop Phalakarn, Kittiphon Phalakarn, and V. Suppakitpaisarn. Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-chains, Proc. of the 4th International Symposium on Computing and Networking (CANDAR 2016), pp. 140–146. [IEEE, ePrint]