He Sun

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
The support of open versus closed random walks	2024-11-14	Paper
Fully-dynamic graph sparsifiers against an adaptive adversary	2024-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q5874542	2023-02-07	Paper
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem	2022-05-11	Paper
Balls into Bins via Local Search	2019-05-15	Paper
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time	2018-12-19	Paper
Solving Lyapunov equation by quantum algorithm	2018-07-18	Paper
Minimum Manhattan network is NP-complete	2017-10-20	Paper
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading	2017-10-05	Paper
Randomized Rumour Spreading: The Effect of the Network Topology	2017-10-04	Paper
Multiproduct price optimization under the multilevel nested logit model	2017-08-25	Paper
An SDP-based algorithm for linear-sized spectral sparsification	2017-08-17	Paper
Partitioning Well-Clustered Graphs: Spectral Clustering Works!	2017-05-30	Paper
Balls into bins via local search: cover time and maximum load	2017-03-03	Paper
Balls into bins via local search: Cover time and maximum load	2016-07-25	Paper
Soliton Interactions of the “Good” Boussinesq Equation on a Nonzero Background	2015-11-18	Paper
Choice-Based Recommender Systems: A Unified Approach to Achieving Relevancy and Diversity	2015-09-11	Paper
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs	2015-09-11	Paper
Deterministic polynomial-time algorithms for designing short DNA words	2014-01-10	Paper
Counting Hypergraphs in Data Streams	2013-04-28	Paper
Counting Arbitrary Subgraphs in Data Streams	2012-11-01	Paper
Low randomness rumor spreading via hashing	2012-08-23	Paper
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies	2012-01-12	Paper
Approximate Counting of Cycles in Streams	2011-09-16	Paper
GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS	2011-08-23	Paper
Minimum Manhattan network is NP-complete	2011-06-03	Paper
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words	2010-06-17	Paper
ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS	2009-09-22	Paper
On Construction of Almost-Ramanujan Graphs	2009-07-07	Paper
Two improved range-efficient algorithms for \(F_0\) estimation	2009-03-20	Paper
Greedy Construction of 2-Approximation Minimum Manhattan Network	2009-01-29	Paper
THE SZNAJD MODEL WITH TEAM WORK	2008-10-17	Paper
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem	2008-07-10	Paper
Two Improved Range-Efficient Algorithms for F 0 Estimation	2007-11-13	Paper

Research outcomes over time

This page was built for person: He Sun