The following pages link to Ching-Lueh Chang (Q340555):
Displaying 28 items.
- A lower bound for metric 1-median selection (Q340556) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection (Q497691) (← links)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Hardness of learning loops, monoids, and semirings (Q741734) (← links)
- The complexity of Tarski's fixed point theorem (Q935168) (← links)
- Optimal bounds on finding fixed points of contraction mappings (Q964391) (← links)
- Spreading messages (Q1029342) (← links)
- On Las Vegas approximations for metric 1-median selection (Q1739219) (← links)
- Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades (Q1935785) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- On random perfect matchings in metric spaces with not-too-large diameters (Q2158300) (← links)
- On ultrametric 1-median selection (Q2182656) (← links)
- Deterministic sublinear-time approximations for metric 1-median selection (Q2377240) (← links)
- Deterministic metric 1-median selection with A \(1-o(1)\) fraction of points ignored (Q2695287) (← links)
- Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
- Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs (Q3111643) (← links)
- Spreading Messages (Q3511370) (← links)
- Bounding the Number of Tolerable Faults in Majority-Based Systems (Q3562996) (← links)
- SETS OF K-INDEPENDENT STRINGS (Q3569274) (← links)
- Efficient Testing of Forecasts (Q3608854) (← links)
- TESTING EMBEDDABILITY BETWEEN METRIC SPACES (Q3634184) (← links)
- Metric 1-Median Selection (Q4973897) (← links)
- EFFICIENT TESTING OF FORECASTS (Q5187852) (← links)
- Approximating all-points furthest pairs and maximum spanning trees in metric spaces (Q6569899) (← links)
- Deterministic metric 1-median selection with very few queries (Q6590087) (← links)
