Ching-Lueh Chang

45 papers A 1C 2Misc 4Journal 35Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Finding ultrametric minimum-diameter spanning trees.
Theor. Comput. Sci.
Ching-Lueh Chang
2024 J jnl
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces.
Int. J. Found. Comput. Sci.
Ching-Lueh Chang, Chun-Wei Chang
2024 J jnl
Deterministic metric 1-median selection with very few queries.
Theor. Comput. Sci.
Ching-Lueh Chang
2024 J jnl
Enumerating Furthest Pairs in Ultrametric Spaces.
J. Inf. Sci. Eng.
Hui-Ting Chen, Ching-Lueh Chang
2022 J jnl
Deterministic metric 1-median selection with very few queries.
CoRR
Ching-Lueh Chang
2022 J jnl
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters.
Theory Comput. Syst.
Ching-Lueh Chang
2021 Misc conf
Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored.
COCOON
Ching-Lueh Chang
2020 J jnl
On ultrametric 1-median selection.
Theor. Comput. Sci.
Ching-Lueh Chang
2019 J jnl
On Las Vegas approximations for metric 1-median selection.
Inf. Process. Lett.
Ching-Lueh Chang
2019 J jnl
On ultrametric 1-median selection.
CoRR
Ching-Lueh Chang
2018 A conf
A Note on Metric 1-median Selection.
ICS
Ching-Lueh Chang
2018 J jnl
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio.
ACM Trans. Comput. Theory
Ching-Lueh Chang
2017 J jnl
A Las Vegas approximation algorithm for metric 1-median selection.
CoRR
Ching-Lueh Chang
2017 J jnl
A lower bound for metric 1-median selection.
J. Comput. Syst. Sci.
Ching-Lueh Chang
2017 J jnl
Metric random matchings with applications.
CoRR
Ching-Lueh Chang
2016 Misc conf
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio.
COCOON
Ching-Lueh Chang
2016 J jnl
Metric 1-median selection with fewer queries.
CoRR
Ching-Lueh Chang
2015 J jnl
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection.
CoRR
Ching-Lueh Chang
2015 J jnl
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection.
Theor. Comput. Sci.
Ching-Lueh Chang
2015 J jnl
Metric $1$-median selection: Query complexity vs. approximation ratio.
CoRR
Ching-Lueh Chang
2015 J jnl
Triggering cascades on strongly connected directed graphs.
Theor. Comput. Sci.
Ching-Lueh Chang, Yuh-Dauh Lyuu
2014 J jnl
A lower bound for metric 1-median selection.
CoRR
Ching-Lueh Chang
2014 J jnl
Hardness of learning loops, monoids, and semirings.
Discret. Appl. Math.
Ching-Lueh Chang
2013 J jnl
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades.
Theor. Comput. Sci.
Ching-Lueh Chang, Yuh-Dauh Lyuu
2013 J jnl
Deterministic sublinear-time approximations for metric 1-median selection.
Inf. Process. Lett.
Ching-Lueh Chang
2013 J jnl
On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs.
Theory Comput. Syst.
Ching-Lueh Chang, Chao-Hong Wang
2012 J jnl
Some results on approximate 1-median selection in metric spaces.
Theor. Comput. Sci.
Ching-Lueh Chang
2012 — conf
Triggering Cascades on Strongly Connected Directed Graphs.
PAAP
Ching-Lueh Chang, Yuh-Dauh Lyuu
2011 J jnl
Spreading of Messages in Random Graphs.
Theory Comput. Syst.
Ching-Lueh Chang, Yuh-Dauh Lyuu
2011 C conf
Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs.
IWOCA
Ching-Lueh Chang, Yuh-Dauh Lyuu
2011 J jnl
Triggering cascades on undirected connected graphs.
Inf. Process. Lett.
Ching-Lueh Chang
2010 C conf
Bounding the Number of Tolerable Faults in Majority-Based Systems.
CIAC
Ching-Lueh Chang, Yuh-Dauh Lyuu
2010 J jnl
Efficient Testing of Forecasts.
Int. J. Found. Comput. Sci.
Ching-Lueh Chang, Yuh-Dauh Lyuu
2010 J jnl
On reversible cascades in scale-free and Erdős-Rényi random graphs
CoRR
Ching-Lueh Chang
2010 J jnl
Optimal bounds on finding fixed points of contraction mappings.
Theor. Comput. Sci.
Ching-Lueh Chang, Yuh-Dauh Lyuu
2010 J jnl
Sets of k-Independent Strings.
Int. J. Found. Comput. Sci.
Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu, Alexander Shen
2009 J jnl
On irreversible dynamic monopolies in general graphs
CoRR
Ching-Lueh Chang, Yuh-Dauh Lyuu
2009 J jnl
Spreading messages.
Theor. Comput. Sci.
Ching-Lueh Chang, Yuh-Dauh Lyuu
2009 — conf
Spreading of Messages in Random Graphs.
CATS
Ching-Lueh Chang, Yuh-Dauh Lyuu
2009 J jnl
Testing Embeddability between Metric Spaces.
Int. J. Found. Comput. Sci.
Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti
2008 Misc conf
Spreading Messages.
COCOON
Ching-Lueh Chang, Yuh-Dauh Lyuu
2008 — conf
Testing Embeddability Between Metric Spaces.
CATS
Ching-Lueh Chang, Yen-Wu Ti, Yuh-Dauh Lyuu
2008 J jnl
The complexity of Tarski's fixed point theorem.
Theor. Comput. Sci.
Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti
2007 Misc conf
Efficient Testing of Forecasts.
COCOON
Ching-Lueh Chang, Yuh-Dauh Lyuu
2007 J jnl
Parallelized approximation algorithms for minimum routing cost spanning trees
CoRR
Ching-Lueh Chang, Yuh-Dauh Lyuu