According to our database
1,
Ching-Lueh Chang
authored at least 33 papers
between 2007 and 2024.
Collaborative distances:
2024
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces.
Int. J. Found. Comput. Sci., August, 2024
Enumerating Furthest Pairs in Ultrametric Spaces.
J. Inf. Sci. Eng., March, 2024
Deterministic metric 1-median selection with very few queries.
Theor. Comput. Sci., 2024
2022
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters.
Theory Comput. Syst., 2022
2021
Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
2020
On ultrametric 1-median selection.
Theor. Comput. Sci., 2020
2019
On Las Vegas approximations for metric 1-median selection.
Inf. Process. Lett., 2019
2018
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio.
ACM Trans. Comput. Theory, 2018
A Note on Metric 1-median Selection.
Proceedings of the New Trends in Computer Technologies and Applications, 2018
2017
A lower bound for metric 1-median selection.
J. Comput. Syst. Sci., 2017
Metric random matchings with applications.
CoRR, 2017
A Las Vegas approximation algorithm for metric 1-median selection.
CoRR, 2017
2016
Metric 1-median selection with fewer queries.
CoRR, 2016
2015
Triggering cascades on strongly connected directed graphs.
Theor. Comput. Sci., 2015
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection.
Theor. Comput. Sci., 2015
2014
Hardness of learning loops, monoids, and semirings.
Discret. Appl. Math., 2014
2013
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades.
Theor. Comput. Sci., 2013
On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs.
Theory Comput. Syst., 2013
Deterministic sublinear-time approximations for metric 1-median selection.
Inf. Process. Lett., 2013
2012
Some results on approximate 1-median selection in metric spaces.
Theor. Comput. Sci., 2012
2011
Spreading of Messages in Random Graphs.
Theory Comput. Syst., 2011
Triggering cascades on undirected connected graphs.
Inf. Process. Lett., 2011
Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
2010
Optimal bounds on finding fixed points of contraction mappings.
Theor. Comput. Sci., 2010
Sets of k-Independent Strings.
Int. J. Found. Comput. Sci., 2010
Efficient Testing of Forecasts.
Int. J. Found. Comput. Sci., 2010
On reversible cascades in scale-free and Erdős-Rényi random graphs
CoRR, 2010
Bounding the Number of Tolerable Faults in Majority-Based Systems.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
Theor. Comput. Sci., 2009
Testing Embeddability between Metric Spaces.
Int. J. Found. Comput. Sci., 2009
On irreversible dynamic monopolies in general graphs
CoRR, 2009
2008
The complexity of Tarski's fixed point theorem.
Theor. Comput. Sci., 2008
2007
Parallelized approximation algorithms for minimum routing cost spanning trees
CoRR, 2007
