Assistant Research Fellow/Professor  |  Tsai, Meng-Tsung       Publications   Journal Articles   1. Kuo-Kai Lee, Wing-Kai Hon, Chung-Shou Liao, Kunihiko Sadakane, Meng-Tsung Tsai, "Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries," International Journal of Computational Geometry & Applications, volume 33, number 1&2, pages 43-54, 2023. 2. Martín Farach-Colton and Meng-Tsung Tsai, "Exact Sublinear Binomial Sampling," Algorithmica, volume 73, number 4, pages 637-651, October 2015. 3. Meng-Tsung Tsai, Tsurng-Chen Chern, Jen-Hsiang Chuang, Chih-Wen Hsueh, Hsu-Sung Kuo, Churn-Jung Liau, Steven Riley, Bing-Jie Shen, Chih-Hao Shen, Da-Wei Wang, and Tsan-Sheng Hsu, "Efficient Simulation of the Spatial Transmission Dynamics of Influenza," PLoS ONE, volume 5, number 11, pages e13292, November 2010.     Conference Papers   1. Meng-Tsung Tsai, Shi-Chun Tsai, and Tsung-Ta Wu, "Dependent k-Set Packing on Polynomoids," to appear in the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS), Dagstubl. 2. Wing-Kai Hon, Meng-Tsung Tsai, and Hung-Lung Wang, "Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs," to appear in the 18th International Symposium on Algorithms and Data Structures (WADS), Springer. 3. Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang, "Obtaining Approximately Optimal and Diverse Solutions via Dispersion," In: the 15th Theoretical Informatics - Latin American Symposium (LATIN), Springer, pages 222-239, November 2022. 4. Cheng-Hung Chiang and Meng-Tsung Tsai, "Single-Pass Streaming Algorithms to Partition Graphs into Few Forests," In: the 27th International Conference on Computing and Combinatorics (COCOON), Springer, pages 540-552, October 2021. 5. Yi-Jun Chang, Martín Farach-Colton, Tsan-Sheng Hsu, and Meng-Tsung Tsai, "Streaming Complexity of Spanning Tree Computation," In: the 37th International Symposium on Theoretical Aspects of Computer Science (STACS), Dagstubl, pages 30:1-30:19, March 2020. 6. Eric Allender, Martín Farach-Colton, and Meng-Tsung Tsai, "Syntactic Separation of Subset Satisfiability Problems," In: the 22th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Dagstubl, pages 16:1--16:23, September 2019. 7. Michael A. Bender, Jake Christensen, Alex Conway, Martín Farach-Colton, Rob Johnson, and Meng-Tsung Tsai, "Optimal Ball Recycling," In: the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, pages 2527--2546, January 2019. 8. Yen-Ting Chen, Meng-Tsung Tsai, and Shi-Chun Tsai, "A Dichotomy Result for Cyclic-Order Traversing Games," In: the 29th International Symposium on Algorithms and Computation (ISAAC), Dagstuhl, pages 29:1--29:13, December 2018. 9. Martín Farach-Colton, Meng Li, and Meng-Tsung Tsai, "Streaming Algorithms for Planar Convex Hulls," In: the 29th International Symposium on Algorithms and Computation (ISAAC), Dagstuhl, pages 47:1--47:13, December 2018. 10. Peyman Afshani, Michael A. Bender, Martín Farach-Colton, Jeremy Fineman, Mayank Goswami, and Meng-Tsung Tsai, "Cross-Referenced Dictionaries and the Limits of Write Optimization," In: the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, pages 1523--1532, January 2017. 11. Martín Farach-Colton and Meng-Tsung Tsai, "Tight Approximations of Graph Degeneracy in Large Graphs," In: the 12th Latin American Symposium on Theoretical Informatics (LATIN), Springer, pages 429-440, March 2016. 12. Martín Farach-Colton and Meng-Tsung Tsai, "On the Complexity of Computing Prime Tables," In: the 26th International Symposium on Algorithms and Computation (ISAAC), Springer, pages 677-688, November 2015. 13. Martín Farach-Colton, Tsan-sheng Hsu, Meng Li, and Meng-Tsung Tsai, "Finding Articulation Points of Large Graphs in Linear Time," In: the 14th International Symposium on Algorithms and Data Structures (WADS), Springer, pages 363-372, July 2015. 14. Michael A. Bender, Martín Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes Arango, and Meng-Tsung Tsai, "The Batched Predecessor Problem in External Memory," In: the 22nd European Symposium on Algorithms (ESA), Springer, pages 112-124, September 2014. 15. Martín Farach-Colton and Meng-Tsung Tsai, "Computing the Degeneracy of Large Graphs," In: the 11th Latin American Symposium on Theoretical Informatics (LATIN), Springer, pages 250-260, March 2014. 16. Hung-Jui Chang, Meng-Tsung Tsai, and Tsan-sheng Hsu, "Game Tree Search with Adaptive Resolution," In: the 13th International Conference on Advances in Computer Games (ACG), Springer, pages 306-319, November 2011. 17. Meng-Tsung Tsai, Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "Heterogeneous Subset Sampling," In: the 16th International Conference on Computing and Combinatorics (COCOON), Springer, pages 500-509, July 2010.