Ching-Lueh Chang

According to our database, Ching-Lueh Chang authored at least 32 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Enumerating Furthest Pairs in Ultrametric Spaces.

Hui-Ting Chen, Ching-Lueh Chang

J. Inf. Sci. Eng., March, 2024

2022

On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters.

Ching-Lueh Chang

Theory Comput. Syst., 2022

Deterministic metric 1-median selection with very few queries.

Ching-Lueh Chang

CoRR, 2022

2021

Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored.

Ching-Lueh Chang

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

On ultrametric 1-median selection.

Ching-Lueh Chang

Theor. Comput. Sci., 2020

2019

On Las Vegas approximations for metric 1-median selection.

Ching-Lueh Chang

Inf. Process. Lett., 2019

2018

Metric 1-Median Selection: Query Complexity vs. Approximation Ratio.

Ching-Lueh Chang

ACM Trans. Comput. Theory, 2018

A Note on Metric 1-median Selection.

Ching-Lueh Chang

Proceedings of the New Trends in Computer Technologies and Applications, 2018

2017

A lower bound for metric 1-median selection.

Ching-Lueh Chang

J. Comput. Syst. Sci., 2017

Metric random matchings with applications.

Ching-Lueh Chang

CoRR, 2017

A Las Vegas approximation algorithm for metric 1-median selection.

Ching-Lueh Chang

CoRR, 2017

2016

Metric 1-median selection with fewer queries.

Ching-Lueh Chang

CoRR, 2016

2015

Triggering cascades on strongly connected directed graphs.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Theor. Comput. Sci., 2015

A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection.

Ching-Lueh Chang

Theor. Comput. Sci., 2015

2014

Hardness of learning loops, monoids, and semirings.

Ching-Lueh Chang

Discret. Appl. Math., 2014

2013

Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Theor. Comput. Sci., 2013

On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs.

Ching-Lueh Chang, Chao-Hong Wang

Theory Comput. Syst., 2013

Deterministic sublinear-time approximations for metric 1-median selection.

Ching-Lueh Chang

Inf. Process. Lett., 2013

2012

Some results on approximate 1-median selection in metric spaces.

Ching-Lueh Chang

Theor. Comput. Sci., 2012

2011

Spreading of Messages in Random Graphs.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Theory Comput. Syst., 2011

Triggering cascades on undirected connected graphs.

Ching-Lueh Chang

Inf. Process. Lett., 2011

Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

Optimal bounds on finding fixed points of contraction mappings.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Theor. Comput. Sci., 2010

Sets of k-Independent Strings.

Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu, Alexander Shen

Int. J. Found. Comput. Sci., 2010

Efficient Testing of Forecasts.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Int. J. Found. Comput. Sci., 2010

On reversible cascades in scale-free and Erdős-Rényi random graphs

Ching-Lueh Chang

CoRR, 2010

Bounding the Number of Tolerable Faults in Majority-Based Systems.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Spreading messages.

Ching-Lueh Chang, Yuh-Dauh Lyuu

Theor. Comput. Sci., 2009

Testing Embeddability between Metric Spaces.

Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti

Int. J. Found. Comput. Sci., 2009

On irreversible dynamic monopolies in general graphs

Ching-Lueh Chang, Yuh-Dauh Lyuu

CoRR, 2009

2008

The complexity of Tarski's fixed point theorem.

Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti

Theor. Comput. Sci., 2008

2007

Parallelized approximation algorithms for minimum routing cost spanning trees

Ching-Lueh Chang, Yuh-Dauh Lyuu

CoRR, 2007