default search action
Meng-Tsung Tsai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Tong-Nong Lin, Yu-Cheng Lin, Cheng-Chen Tsai, Meng-Tsung Tsai, Shih-Yu Tsai:
Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers. IWOCA 2024: 259-272 - 2023
- [j3]Wing-Kai Hon, Chung-Shou Liao, Meng-Tsung Tsai:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 33(1&2): 1-2 (2023) - [j2]Kuo-Kai Lee, Wing-Kai Hon
, Chung-Shou Liao
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries. Int. J. Comput. Geom. Appl. 33(1&2): 43-54 (2023) - [c18]Meng-Tsung Tsai
Dependent k-Set Packing on Polynomoids. MFCS 2023: 84:1-84:15 - [c17]Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang:
Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs. WADS 2023: 507-520 - 2022
- [c16]Jie Gao
Obtaining Approximately Optimal and Diverse Solutions via Dispersion. LATIN 2022: 222-239 - [i5]Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang:
Obtaining Approximately Optimal and Diverse Solutions via Dispersion. CoRR abs/2202.10028 (2022) - 2021
- [c15]Cheng-Hung Chiang, Meng-Tsung Tsai:
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests. COCOON 2021: 540-552 - 2020
- [c14]Yi-Jun Chang
Streaming Complexity of Spanning Tree Computation. STACS 2020: 34:1-34:19 - [i4]Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai:
Streaming Complexity of Spanning Tree Computation. CoRR abs/2001.07672 (2020)
2010 – 2019
- 2019
- [c13]Eric Allender
Syntactic Separation of Subset Satisfiability Problems. APPROX-RANDOM 2019: 16:1-16:23 - [c12]Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton
Optimal Ball Recycling. SODA 2019: 2527-2546 - 2018
- [c11]Yen-Ting Chen, Meng-Tsung Tsai
A Dichotomy Result for Cyclic-Order Traversing Games. ISAAC 2018: 29:1-29:13 - [c10]Martin Farach-Colton
Streaming Algorithms for Planar Convex Hulls. ISAAC 2018: 47:1-47:13 - [i3]Michael A. Bender, Jake Christensen, Alexander Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai:
Optimal Ball Recycling. CoRR abs/1807.01804 (2018) - [i2]Martin Farach-Colton, Meng Li, Meng-Tsung Tsai:
Streaming Algorithms for Planar Convex Hulls. CoRR abs/1810.00455 (2018) - 2017
- [c9]Peyman Afshani, Michael A. Bender, Martin Farach-Colton
Cross-Referenced Dictionaries and the Limits of Write Optimization. SODA 2017: 1523-1532 - 2016
- [c8]Martin Farach-Colton, Meng-Tsung Tsai
Tight Approximations of Degeneracy in Large Graphs. LATIN 2016: 429-440 - 2015
- [j1]Martin Farach-Colton
Exact Sublinear Binomial Sampling. Algorithmica 73(4): 637-651 (2015) - [c7]Martin Farach-Colton
On the Complexity of Computing Prime Tables. ISAAC 2015: 677-688 - [c6]Martin Farach-Colton
Finding Articulation Points of Large Graphs in Linear Time. WADS 2015: 363-372 - [i1]Martin Farach-Colton, Meng-Tsung Tsai:
On the complexity of computing prime tables. CoRR abs/1504.05240 (2015) - 2014
- [c5]Michael A. Bender, Martin Farach-Colton
The Batched Predecessor Problem in External Memory. ESA 2014: 112-124 - [c4]Martin Farach-Colton
Computing the Degeneracy of Large Graphs. LATIN 2014: 250-260 - 2013
- [c3]Martin Farach-Colton
Exact Sublinear Binomial Sampling. ISAAC 2013: 240-250 - 2011
- [c2]Hung-Jui Chang, Meng-Tsung Tsai
Game Tree Search with Adaptive Resolution. ACG 2011: 306-319 - 2010
- [c1]Meng-Tsung Tsai
Heterogeneous Subset Sampling. COCOON 2010: 500-509
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: