He Sun

From MaRDI portal
Person:391099

Available identifiers

zbMath Open sun.heMaRDI QIDQ391099

List of research outcomes





PublicationDate of PublicationType
The support of open versus closed random walks2024-11-14Paper
Fully-dynamic graph sparsifiers against an adaptive adversary2024-06-24Paper
https://portal.mardi4nfdi.de/entity/Q58745422023-02-07Paper
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem2022-05-11Paper
Balls into bins via local search2019-05-15Paper
Constructing linear-sized spectral sparsification in almost-linear time2018-12-19Paper
Solving Lyapunov equation by quantum algorithm2018-07-18Paper
Minimum Manhattan network is NP-complete2017-10-20Paper
Gossip vs. Markov chains, and randomness-efficient rumor spreading2017-10-05Paper
Randomized rumour spreading: the effect of the network topology2017-10-04Paper
Multiproduct price optimization under the multilevel nested logit model2017-08-25Paper
An SDP-based algorithm for linear-sized spectral sparsification2017-08-17Paper
Partitioning well-clustered graphs: spectral clustering works!2017-05-30Paper
Balls into bins via local search: cover time and maximum load2017-03-03Paper
Balls into bins via local search: cover time and maximum load2016-07-25Paper
Soliton interactions of the ``good Boussinesq equation on a nonzero background2015-11-18Paper
Choice-based recommender systems: a unified approach to achieving relevancy and diversity2015-09-11Paper
Dirichlet eigenvalues, local random walks, and analyzing clusters in graphs2015-09-11Paper
Deterministic polynomial-time algorithms for designing short DNA words2014-01-10Paper
Counting Hypergraphs in Data Streams2013-04-28Paper
Counting arbitrary subgraphs in data streams2012-11-01Paper
Low randomness rumor spreading via hashing2012-08-23Paper
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies2012-01-12Paper
Approximate counting of cycles in streams2011-09-16Paper
Greedy construction of 2-approximate minimum Manhattan networks2011-08-23Paper
Minimum Manhattan network is NP-complete2011-06-03Paper
Deterministic polynomial-time algorithms for designing short DNA words2010-06-17Paper
ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS2009-09-22Paper
On Construction of Almost-Ramanujan Graphs2009-07-07Paper
Two improved range-efficient algorithms for \(F_0\) estimation2009-03-20Paper
Greedy Construction of 2-Approximation Minimum Manhattan Network2009-01-29Paper
THE SZNAJD MODEL WITH TEAM WORK2008-10-17Paper
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem2008-07-10Paper
Two Improved Range-Efficient Algorithms for F 0 Estimation2007-11-13Paper

Research outcomes over time

This page was built for person: He Sun