授過課程

• 離散數學
• 電腦與網路安全概論
• 計算理論

研究領域

• 離散數學
• 次線性演算法
• 圖過程

主要經歷

• 銘傳大學兼任講師

期刊論文

• Ching-Lueh Chang, 2022, "On random perfect matchings in metric spaces with not-too-large diameters," Theory of Computing Systems, forthcoming
• Ching-Lueh Chang, 2020, "On ultrametric 1-median selection," Theoretical Computer Science, 828--829: 65--69.
• Ching-Lueh Chang, 2019, "On Las Vegas approximations for metric 1-median selection," Information Processing Letters, 146: 44--48.
• Ching-Lueh Chang, 2018, "Metric 1-median selection: Query complexity vs. approximation ratio," ACM Transactions on Computation Theory, 9(4): Article 20.
• Ching-Lueh Chang, 2017, "A lower bound for metric 1-median selection," Journal of Computer and System Sciences, 84: 44-51. 演算法與計算理論學會之2017年度最佳期刊論文獎
• Ching-Lueh Chang and Yuh-Dauh Lyuu, 2015, "Triggering cascades on strongly connected directed graphs," Theoretical Computer Science, 593: 62--69.
• Ching-Lueh Chang, 2015, "A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection," Theoretical Computer Science, 602: 149--157.
• Ching-Lueh Chang, 2014, "Hardness of learning loops, monoids, and semirings," Discrete Applied Mathematics, 162: 149--158.
• Ching-Lueh Chang and Yuh-Dauh Lyuu, 2013, "Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades," Theoretical Computer Science, 468: 37-49.
• Ching-Lueh Chang, 2013, "Deterministic sublinear-time approximations for metric 1-median selection," Information Processing Letters, 113(8): 288–-292.
• Ching-Lueh Chang and Chao-Hong Wang, 2013, "On reversible cascades in scale-free and Erdős-Rényi random graphs," Theory of Computing Systems, 52(2): 303--318.
• Ching-Lueh Chang, 2012, "Some results on approximate 1-median selection in metric spaces," Theoretical Computer Science, 426--427: 1--12.
• Ching-Lueh Chang and Yuh-Dauh Lyuu, 2011, , "Spreading of messages in random graphs," Theory of Computing Systems, 48(2): 389--401.
• Ching-Lueh Chang, 2011, "Triggering cascades on undirected connected graphs," Information Processing Letters, 111(19): 973--978.
• Ching-Lueh Chang and Yuh-Dauh Lyuu, 2010, , "Optimal bounds on finding fixed points of contraction mappings," Theoretical Computer Science, 411(16-18): 1742--1749.
• Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu and Alexander Shen, 2010, , "Sets of k-independent strings," International Journal of Foundations of Computer Science, 21(3): 321--327.
• Ching-Lueh Chang and Yuh-Dauh Lyuu, 2010, , "Efficient testing of forecasts," International Journal of Foundations of Computer Science, 21(1): 61--72.
• Ching-Lueh Chang and Yuh-Dauh Lyuu, 2009, , "Spreading messages," Theoretical Computer Science, 410(27--29): 2714--2724.
• Ching-Lueh Chang, Yuh-Dauh Lyuu and Yen-Wu Ti, 2009, , "Testing embeddability between metric spaces," International Journal of Foundations of Computer Science, 20(2): 313--329.
• Ching-Lueh Chang, Yuh-Dauh Lyuu and Yen-Wu Ti, 2008, , "The complexity of Tarski's fixed point theorem," Theoretical Computer Science, 401(1--3): 228--235.

研究計畫