M. Tsai

Most-cited papers

Computing the Degeneracy of Large Graphs
Martín Farach-Colton, M. Tsai
2014Latin American Symposium on Theoretical Informatics29 citations
Semantic Scholar
Exact Sublinear Binomial Sampling
Martín Farach-Colton, M. Tsai
2013Algorithmica20 citations
Semantic Scholar
Tight Approximations of Degeneracy in Large Graphs
Martín Farach-Colton, M. Tsai
2016Latin American Symposium on Theoretical Informatics17 citations
Semantic Scholar
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
Jie Ying Gao, Mayank Goswami, S. KarthikC, M. Tsai +2 more
2022Latin American Symposium on Theoretical Informatics16 citations
Semantic Scholar
Streaming Complexity of Spanning Tree Computation
Yi-Jun Chang, Martín Farach-Colton, Tsan-sheng Hsu, M. Tsai
2020Symposium on Theoretical Aspects of Computer Science15 citations
Semantic Scholar
Optimal Ball Recycling
M. Bender, Jake Christensen, A. Conway, Martín Farach-Colton +2 more
2018ACM-SIAM Symposium on Discrete Algorithms11 citations
Semantic Scholar
Finding Articulation Points of Large Graphs in Linear Time
Martín Farach-Colton, Tsan-sheng Hsu, Meng Li, M. Tsai
2015Workshop on Algorithms and Data Structures8 citations
Semantic Scholar
The Batched Predecessor Problem in External Memory
M. Bender, Martín Farach-Colton, Mayank Goswami, Dzejla Medjedovic +2 more
2014Embedded Systems and Applications7 citations Open access
Semantic Scholar
On the complexity of computing prime tables
Martín Farach-Colton, M. Tsai
2015International Symposium on Algorithms and Computation6 citations Open access
Semantic Scholar
Cross-Referenced Dictionaries and the Limits of Write Optimization
P. Afshani, M. Bender, Martín Farach-Colton, Jeremy T. Fineman +2 more
2017ACM-SIAM Symposium on Discrete Algorithms4 citations Open access
Semantic Scholar
Streaming Algorithms for Planar Convex Hulls
Martín Farach-Colton, Meng Li, M. Tsai
2018International Symposium on Algorithms and Computation3 citations
Semantic Scholar
Exact Sublinear Binomial Sampling
Martín Farach-Colton, M. Tsai
2015Algorithmica1 citations
Semantic Scholar
Dependent k-Set Packing on Polynomoids
M. Tsai, Shi-Chun Tsai, Tsung-Ta Wu
2023International Symposium on Mathematical Foundations of Computer Science0 citations
Semantic Scholar
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
Cheng-Hung Chiang, M. Tsai
2021International Computing and Combinatorics Conference0 citations
Semantic Scholar
16 : 2 Syntactic Separation of Subset Satisfiability Problems
Eric Allender, Martín Farach-Colton, M. Tsai
20190 citations
Semantic Scholar
Syntactic Separation of Subset Satisfiability Problems
Eric Allender, Martín Farach-Colton, M. Tsai
2019International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques0 citations
Semantic Scholar
A Dichotomy Result for Cyclic-Order Traversing Games
Yen-Ting Chen, M. Tsai, Shi-Chun Tsai
2018International Symposium on Algorithms and Computation0 citations
Semantic Scholar
On the algorithmic aspects of Turán's Theorem
M. Tsai
20170 citations
Semantic Scholar
Lecture 4 : Codes based on Concatenation Error-Correcting Codes
Swastik Kopparty, Aditya Potukuchi, M. Tsai
20160 citations
Semantic Scholar
C C ] 2 0 A pr 2 01 5 On the complexity of computing prime tables
Martín Farach-Colton, M. Tsai, Rutgers
0 citations
Semantic Scholar