Optimal sampling of genetic algorithms on polynomial regression. - Tian-Li Yu 001; Wei-Kai Lin (GECCO, 2008)

Co-evolvability of games in coevolutionary genetic algorithms. - Wei-Kai Lin; Tian-Li Yu 001 (GECCO, 2009)

3D high-brightness autostereoscopic display systems with LED backlight. - Yeong-Lin Lai; Wei-Kai Lin (ICCE, 2012)

Delegating RAM Computations with Adaptive Soundness and Privacy. - Prabhanjan Ananth; Yu-Chi Chen; Kai-Min Chung; Huijia Lin; Wei-Kai Lin (IACR Cryptol. ePrint Arch., 2015)

Computation-Trace Indistinguishability Obfuscation and its Applications. - Yu-Chi Chen; Sherman S. M. Chow; Kai-Min Chung; Russell W. F. Lai; Wei-Kai Lin; Hong-Sheng Zhou (IACR Cryptol. ePrint Arch., 2015)

Cryptography for Parallel RAM from Indistinguishability Obfuscation. - Yu-Chi Chen; Sherman S. M. Chow; Kai-Min Chung; Russell W. F. Lai; Wei-Kai Lin; Hong-Sheng Zhou (ITCS, 2016)

Cache-Oblivious and Data-Oblivious Sorting and Applications. - T.-H. Hubert Chan; Yue Guo; Wei-Kai Lin; Elaine Shi (IACR Cryptol. ePrint Arch., 2017)

Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. - T.-H. Hubert Chan; Yue Guo; Wei-Kai Lin; Elaine Shi (IACR Cryptol. ePrint Arch., 2017)

OptORAMa: Optimal Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Kartik Nayak; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

Game Theoretic Notions of Fairness in Multi-Party Coin Toss. - Kai-Min Chung; Yue Guo; Wei-Kai Lin; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

Can We Overcome the n log n Barrier for Oblivious Sorting? - Wei-Kai Lin; Elaine Shi; Tiancheng Xie (IACR Cryptol. ePrint Arch., 2018)

A machine learning approach for predicting urine output after fluid administration. - Pei-Chen Lin; Hsu-Cheng Huang; Matthieu Komorowski; Wei-Kai Lin; Chun-Min Chang; Kuan-Ta Chen; Yu-Chuan Li; Ming-Chin Lin (Comput. Methods Programs Biomed., 2019)

Automation of the kidney function prediction and classification through ultrasound-based kidney imaging using deep learning. - Chin-Chi Kuo; Chun-Min Chang; Kuan-Ting Liu; Wei-Kai Lin; Hsiu-Yin Chiang; Chih-Wei Chung; Meng-Ru Ho; Pei-Ran Sun; Rong-Lin Yang; Kuan-Ta Chen (npj Digit. Medicine, 2019)

Oblivious Parallel Tight Compaction. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Enoch Peserico; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Optimal Oblivious Parallel RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Enoch Peserico; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. - T.-H. Hubert Chan; Kai-Min Chung; Wei-Kai Lin; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead. - T.-H. Hubert Chan; Wei-Kai Lin; Kartik Nayak; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Lower Bound for Oblivious RAM with Large Cells. - Ilan Komargodski; Wei-Kai Lin (IACR Cryptol. ePrint Arch., 2020)

Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. - T.-H. Hubert Chan; Elaine Shi; Wei-Kai Lin; Kartik Nayak (ITC, 2021)

Sorting Short Keys in Circuits of Size o(n log n). - Gilad Asharov; Wei-Kai Lin; Elaine Shi (SODA, 2021)

Optimal Oblivious RAM and Its Extensions. - Wei-Kai Lin (2021)

Optimal Sorting Circuits for Short Keys. - Wei-Kai Lin; Elaine Shi (SODA, 2022)

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. - Wei-Kai Lin; Ethan Mook; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

NanoGRAM: Garbled RAM with $ widetilde{O}( log N)$ Overhead. - Andrew Park; Wei-Kai Lin; Elaine Shi (IACR Cryptol. ePrint Arch., 2022)

Optimal Single-Server Private Information Retrieval. - Mingxun Zhou; Wei-Kai Lin; Yiannis Tselekounis; Elaine Shi (IACR Cryptol. ePrint Arch., 2022)

Sorting Short Keys in Circuits of Size ${o(n log n)}$. - Gilad Asharov; Wei-Kai Lin; Elaine Shi (SIAM J. Comput., 2022)

Deep Learning-based AOI System for Detecting Component Marks. - Yi-Ming Chang; Ti-Li Lin; Hung-Chun Chi; Wei-Kai Lin (BigComp, 2023)

OptORAMa: Optimal Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Kartik Nayak; Enoch Peserico; Elaine Shi (J. ACM, 2023)

Oblivious RAM with Worst-Case Logarithmic Overhead. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Elaine Shi (J. Cryptol., 2023)

Efficient Garbled Pseudorandom Functions and Lookup Tables from Minimal Assumption. - Wei-Kai Lin; Zhenghao Lu; Hong-Sheng Zhou (IACR Cryptol. ePrint Arch., 2025)

Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. - Wei-Kai Lin; Ethan Mook; Daniel Wichs (IACR Cryptol. ePrint Arch., 2025)

Black Box Crypto is Useless for Doubly Efficient PIR. - Wei-Kai Lin; Ethan Mook; Daniel Wichs (IACR Cryptol. ePrint Arch., 2025)

A Logarithmic Lower Bound for Oblivious RAM (For All Parameters). - Ilan Komargodski; Wei-Kai Lin (SIAM J. Comput., 2025)