The following pages link to He Sun (Q391099):
Displaying 32 items.
- Deterministic polynomial-time algorithms for designing short DNA words (Q391100) (← links)
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- Two improved range-efficient algorithms for \(F_0\) estimation (Q1007249) (← links)
- Multiproduct price optimization under the multilevel nested logit model (Q2400012) (← links)
- (Q2904772) (← links)
- Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs (Q2942665) (← links)
- Choice-Based Recommender Systems: A Unified Approach to Achieving Relevancy and Diversity (Q2942694) (← links)
- Balls into bins via local search: cover time and maximum load (Q2965483) (← links)
- GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS (Q3089095) (← links)
- Approximate Counting of Cycles in Streams (Q3092270) (← links)
- Counting Arbitrary Subgraphs in Data Streams (Q3167047) (← links)
- ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS (Q3397509) (← links)
- Soliton Interactions of the “Good” Boussinesq Equation on a Nonzero Background (Q3451733) (← links)
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem (Q3511430) (← links)
- THE SZNAJD MODEL WITH TEAM WORK (Q3528835) (← links)
- Deterministic Polynomial-Time Algorithms for Designing Short DNA Words (Q3569085) (← links)
- Greedy Construction of 2-Approximation Minimum Manhattan Network (Q3596702) (← links)
- On Construction of Almost-Ramanujan Graphs (Q3637066) (← links)
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
- Solving Lyapunov equation by quantum algorithm (Q4574760) (← links)
- An SDP-based algorithm for linear-sized spectral sparsification (Q4978013) (← links)
- Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Q5075818) (← links)
- Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading (Q5362983) (← links)
- Randomized Rumour Spreading: The Effect of the Network Topology (Q5364236) (← links)
- Minimum Manhattan network is NP-complete (Q5370740) (← links)
- Two Improved Range-Efficient Algorithms for F 0 Estimation (Q5425479) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
- Balls into bins via local search: Cover time and maximum load (Q5740271) (← links)
- Balls into Bins via Local Search (Q5741710) (← links)
- (Q5874542) (← links)
- Fully-dynamic graph sparsifiers against an adaptive adversary (Q6560806) (← links)
- The support of open versus closed random walks (Q6638109) (← links)
