Meng-Tsung Tsai

According to our database, Meng-Tsung Tsai authored at least 20 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries.

Kuo-Kai Lee, Wing-Kai Hon, Chung-Shou Liao, Kunihiko Sadakane, Meng-Tsung Tsai

Int. J. Comput. Geom. Appl., 2023

Guest Editors' Foreword.

Wing-Kai Hon, Chung-Shou Liao, Meng-Tsung Tsai

Int. J. Comput. Geom. Appl., 2023

Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs.

Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Dependent k-Set Packing on Polynomoids.

Meng-Tsung Tsai, Shi-Chun Tsai, Tsung-Ta Wu

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Obtaining Approximately Optimal and Diverse Solutions via Dispersion.

Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Single-Pass Streaming Algorithms to Partition Graphs into Few Forests.

Cheng-Hung Chiang, Meng-Tsung Tsai

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Streaming Complexity of Spanning Tree Computation.

Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

Optimal Ball Recycling.

Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Syntactic Separation of Subset Satisfiability Problems.

Eric Allender, Martin Farach-Colton, Meng-Tsung Tsai

Proceedings of the Approximation, 2019

2018

Streaming Algorithms for Planar Convex Hulls.

Martin Farach-Colton, Meng Li, Meng-Tsung Tsai

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

A Dichotomy Result for Cyclic-Order Traversing Games.

Yen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Cross-Referenced Dictionaries and the Limits of Write Optimization.

Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Tight Approximations of Degeneracy in Large Graphs.

Martin Farach-Colton, Meng-Tsung Tsai

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Exact Sublinear Binomial Sampling.

Martin Farach-Colton, Meng-Tsung Tsai

Algorithmica, 2015

Finding Articulation Points of Large Graphs in Linear Time.

Martin Farach-Colton, Tsan-sheng Hsu, Meng Li, Meng-Tsung Tsai

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

On the Complexity of Computing Prime Tables.

Martin Farach-Colton, Meng-Tsung Tsai

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Computing the Degeneracy of Large Graphs.

Martin Farach-Colton, Meng-Tsung Tsai

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Batched Predecessor Problem in External Memory.

Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai

Proceedings of the Algorithms - ESA 2014, 2014

2011

Game Tree Search with Adaptive Resolution.

Hung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu

Proceedings of the Advances in Computer Games - 13th International Conference, 2011

2010

Heterogeneous Subset Sampling.

Meng-Tsung Tsai, Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010