Chinese
English
Assistant Research Fellow/Professor  |  Tsai, Meng-Tsung  
 
contact
education
experience
interests
publications
 
 
 
 
 
Publications
 
1. Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, and Meng-Tsung Tsai, "Streaming Complexity of Spanning Tree Computation," 37th International Symposium on Theoretical Aspects of Computer Science (STACS'20), pages 34:1--34:19, March 2020.
2. Eric Allender, Martin Farach-Colton, and Meng-Tsung Tsai, "Syntactic Separation of Subset Satisfiability Problems," 22th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'19), pages 16:1--16:23, September 2019.
3. Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, and Meng-Tsung Tsai, "Optimal Ball Recycling," 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'19), pages 2527--2546, January 2019.
4. Yen-Ting Chen, Meng-Tsung Tsai, and Shi-Chun Tsai, "A Dichotomy Result for Cyclic-Order Traversing Games," 29th International Symposium on Algorithms and Computation (ISAAC'18), pages 29:1--29:13, December 2018.
5. Martin Farach-Colton, Meng Li, and Meng-Tsung Tsai, "Streaming Algorithms for Planar Convex Hulls," 29th International Symposium on Algorithms and Computation (ISAAC'18), pages 47:1--47:13, December 2018.
6. Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, and Meng-Tsung Tsai, "Cross-Referenced Dictionaries and the Limits of Write Optimization," 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'17), pages 1523--1532, January 2017.
 
 
bg