• 師資陣容

    • 行政技術人員

蔡孟宗 Meng-Tsung Tsai 助理教授
  • 美國羅格斯大學資訊工程博士

經歷

1. Assistant Professor, Computer Science, NCTU, 2017/08 – present
2. Research Assistant, Computer Science, Rutgers, 2012/09 – 2017/06
3. Research Assistant, Information Science, Academia Sinica, 2009/07 – 2012/05
4. Assistant Coach, ACM-ICPC Contest, NTU, 2006/09 – 2007/02

研究興趣

巨量資料演算法、資料庫、圖論

代表著作

1. Cross-Referenced Dictionaries and the Limits of Write Optimization, with Peyman Afshani, Michael A. Bender, Martín Farach-Colton, Jeremy Fineman, and Mayank Goswami. In: the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1523-1532. SIAM (2017)
2. Tight Approximations of Graph Degeneracy in Large Graphs, with Martín Farach-Colton. In: the 12th Latin American Symposium on Theoretical Informatics (LATIN), pp. 429-440. Springer (2016)
3. On the Complexity of Computing Prime Tables, with Martín Farach-Colton. In: the 26th International Symposium on Algorithms and Computation (ISAAC), pp. 677-688. Springer (2015)
4. Finding Articulation Points of Large Graphs in Linear Time, with Martín Farach-Colton, Tsan-sheng Hsu, and Meng Li. In: the 14th International Symposium on Algorithms and Data Structures (WADS), pp. 363-372. Springer (2015)
5. The Batched Predecessor Problem in External Memory, with Michael A. Bender, Martín Farach-Colton, Mayank Goswami, Dzejla Medjedovic, and Pablo Montes Arango. In: the 22nd European Symposium on Algorithms (ESA), pp. 112-124. Springer (2014)
6. Computing the Degeneracy of Large Graphs, with Martín Farach-Colton. In: the 11th Latin American Symposium on Theoretical Informatics (LATIN), pp. 250-260. Springer (2014)
7. Exact Sublinear Binomial Sampling, with Martín Farach-Colton. In: the 24th International Symposium on Algorithms and Computation (ISAAC), pp. 240-250. Springer (2013) This paper is selected for a special issue of Algorithmica.