default search action
Ching-Lueh Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Ching-Lueh Chang
, Chun-Wei Chang:
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces. Int. J. Found. Comput. Sci. 35(5): 595-603 (2024) - [j22]Hui-Ting Chen, Ching-Lueh Chang:
Enumerating Furthest Pairs in Ultrametric Spaces. J. Inf. Sci. Eng. 40(2): 245-251 (2024) - [j21]Ching-Lueh Chang:
Deterministic metric 1-median selection with very few queries. Theor. Comput. Sci. 1011: 114720 (2024) - 2022
- [j20]Ching-Lueh Chang:
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters. Theory Comput. Syst. 66(4): 847-860 (2022) - [i11]Ching-Lueh Chang:
Deterministic metric 1-median selection with very few queries. CoRR abs/2201.01436 (2022) - 2021
- [c10]Ching-Lueh Chang:
Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored. COCOON 2021: 215-220 - 2020
- [j19]Ching-Lueh Chang
On ultrametric 1-median selection. Theor. Comput. Sci. 828-829: 65-69 (2020)
2010 – 2019
- 2019
- [j18]Ching-Lueh Chang
On Las Vegas approximations for metric 1-median selection. Inf. Process. Lett. 146: 44-48 (2019) - [i10]Ching-Lueh Chang:
On ultrametric 1-median selection. CoRR abs/1909.02400 (2019) - 2018
- [j17]Ching-Lueh Chang
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio. ACM Trans. Comput. Theory 9(4): 20:1-20:23 (2018) - [c9]Ching-Lueh Chang
A Note on Metric 1-median Selection. ICS 2018: 457-459 - 2017
- [j16]Ching-Lueh Chang:
A lower bound for metric 1-median selection. J. Comput. Syst. Sci. 84: 44-51 (2017) - [i9]Ching-Lueh Chang:
A Las Vegas approximation algorithm for metric 1-median selection. CoRR abs/1702.03106 (2017) - [i8]Ching-Lueh Chang:
Metric random matchings with applications. CoRR abs/1703.08433 (2017) - 2016
- [c8]Ching-Lueh Chang:
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio. COCOON 2016: 131-142 - [i7]Ching-Lueh Chang:
Metric 1-median selection with fewer queries. CoRR abs/1612.08654 (2016) - 2015
- [j15]Ching-Lueh Chang, Yuh-Dauh Lyuu
Triggering cascades on strongly connected directed graphs. Theor. Comput. Sci. 593: 62-69 (2015) - [j14]Ching-Lueh Chang:
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection. Theor. Comput. Sci. 602: 149-157 (2015) - [i6]Ching-Lueh Chang:
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection. CoRR abs/1502.06764 (2015) - [i5]Ching-Lueh Chang:
Metric $1$-median selection: Query complexity vs. approximation ratio. CoRR abs/1509.05662 (2015) - 2014
- [j13]Ching-Lueh Chang:
Hardness of learning loops, monoids, and semirings. Discret. Appl. Math. 162: 149-158 (2014) - [i4]Ching-Lueh Chang:
A lower bound for metric 1-median selection. CoRR abs/1401.2195 (2014) - 2013
- [j12]Ching-Lueh Chang:
Deterministic sublinear-time approximations for metric 1-median selection. Inf. Process. Lett. 113(8): 288-292 (2013) - [j11]Ching-Lueh Chang, Chao-Hong Wang:
On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs. Theory Comput. Syst. 52(2): 303-318 (2013) - [j10]Ching-Lueh Chang, Yuh-Dauh Lyuu
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades. Theor. Comput. Sci. 468: 37-49 (2013) - 2012
- [j9]Ching-Lueh Chang:
Some results on approximate 1-median selection in metric spaces. Theor. Comput. Sci. 426: 1-12 (2012) - [c7]Ching-Lueh Chang, Yuh-Dauh Lyuu
Triggering Cascades on Strongly Connected Directed Graphs. PAAP 2012: 95-99 - 2011
- [j8]Ching-Lueh Chang:
Triggering cascades on undirected connected graphs. Inf. Process. Lett. 111(19): 973-978 (2011) - [j7]Ching-Lueh Chang, Yuh-Dauh Lyuu
Spreading of Messages in Random Graphs. Theory Comput. Syst. 48(2): 389-401 (2011) - [c6]Ching-Lueh Chang, Yuh-Dauh Lyuu
Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs. IWOCA 2011: 96-105 - 2010
- [j6]Ching-Lueh Chang, Yuh-Dauh Lyuu
Efficient Testing of Forecasts. Int. J. Found. Comput. Sci. 21(1): 61-72 (2010) - [j5]Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu
Sets of k-Independent Strings. Int. J. Found. Comput. Sci. 21(3): 321-327 (2010) - [j4]Ching-Lueh Chang, Yuh-Dauh Lyuu
Optimal bounds on finding fixed points of contraction mappings. Theor. Comput. Sci. 411(16-18): 1742-1749 (2010) - [c5]Ching-Lueh Chang, Yuh-Dauh Lyuu
Bounding the Number of Tolerable Faults in Majority-Based Systems. CIAC 2010: 109-119 - [i3]Ching-Lueh Chang:
On reversible cascades in scale-free and Erdős-Rényi random graphs. CoRR abs/1011.0653 (2010)
2000 – 2009
- 2009
- [j3]Ching-Lueh Chang, Yuh-Dauh Lyuu
Testing Embeddability between Metric Spaces. Int. J. Found. Comput. Sci. 20(2): 313-329 (2009) - [j2]Ching-Lueh Chang, Yuh-Dauh Lyuu
Spreading messages. Theor. Comput. Sci. 410(27-29): 2714-2724 (2009) - [c4]Ching-Lueh Chang, Yuh-Dauh Lyuu:
Spreading of Messages in Random Graphs. CATS 2009: 3-7 - [i2]Ching-Lueh Chang, Yuh-Dauh Lyuu:
On irreversible dynamic monopolies in general graphs. CoRR abs/0904.2306 (2009) - 2008
- [j1]Ching-Lueh Chang, Yuh-Dauh Lyuu
The complexity of Tarski's fixed point theorem. Theor. Comput. Sci. 401(1-3): 228-235 (2008) - [c3]Ching-Lueh Chang, Yen-Wu Ti, Yuh-Dauh Lyuu:
Testing Embeddability Between Metric Spaces. CATS 2008: 117-124 - [c2]Ching-Lueh Chang, Yuh-Dauh Lyuu
Spreading Messages. COCOON 2008: 587-599 - 2007
- [c1]Ching-Lueh Chang, Yuh-Dauh Lyuu:
Efficient Testing of Forecasts. COCOON 2007: 285-295 - [i1]Ching-Lueh Chang, Yuh-Dauh Lyuu:
Parallelized approximation algorithms for minimum routing cost spanning trees. CoRR abs/0705.2125 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: