He Sun - RankMe

79 papers A* 19A 6B 4C 4Journal 43Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Can We Measure the Impact of a Database? Commun. ACM Peter Buneman, Dennis Dosso, Matteo Lissandrini, Gianmaria Silvello, He Sun
2025	A*	`conf`	Coreset Spectral Clustering. ICLR Ben Jourdan, Gregory Schwartzman, Peter Macgregor, He Sun
2025	J	`jnl`	Coreset Spectral Clustering. CoRR Ben Jourdan, Gregory Schwartzman, Peter Macgregor, He Sun
2025	A*	`conf`	Dynamic Similarity Graph Construction with Kernel Density Estimation. ICML Steinar Laenen, Peter Macgregor, He Sun
2025	J	`jnl`	Dynamic Similarity Graph Construction with Kernel Density Estimation. CoRR Steinar Laenen, Peter Macgregor, He Sun
2025	A*	`conf`	Signed Laplacians for Constrained Graph Clustering. ICML John Stewart Fabila-Carrasco, He Sun
2024	J	`jnl`	Can we measure the impact of a database? CoRR Peter Buneman, Dennis Dosso, Matteo Lissandrini, Gianmaria Silvello, He Sun
2024	A*	`conf`	Dynamic Spectral Clustering with Provable Approximation Guarantee. ICML Steinar Laenen, He Sun
2024	J	`jnl`	Dynamic Spectral Clustering with Provable Approximation Guarantee. CoRR Steinar Laenen, He Sun
2024	J	`jnl`	Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime. CoRR Ben Jourdan, Peter Macgregor, He Sun
2024	J	`jnl`	Spectral Toolkit of Algorithms for Graphs: Technical Report (2). CoRR Peter Macgregor, He Sun
2023	A*	`conf`	Fast Approximation of Similarity Graphs with Kernel Density Estimation. NeurIPS Peter Macgregor, He Sun
2023	J	`jnl`	Fast Approximation of Similarity Graphs with Kernel Density Estimation. CoRR Peter Macgregor, He Sun
2023	B	`conf`	Is the Algorithmic Kadison-Singer Problem Hard? ISAAC Ben Jourdan, Peter Macgregor, He Sun
2023	A*	`conf`	Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs. ICML Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun
2023	J	`jnl`	Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs. CoRR Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun
2023	J	`jnl`	Spectral Toolkit of Algorithms for Graphs: Technical Report (1). CoRR Peter Macgregor, He Sun
2023	A*	`conf`	The Support of Open Versus Closed Random Walks. ICALP Thomas Sauerwald, He Sun, Danny Vagnozzi
2023	J	`jnl`	Three Hardness Results for Graph Similarity Problems. CoRR He Sun, Danny Vagnozzi
2022	A*	`conf`	A Tighter Analysis of Spectral Clustering, and Beyond. ICML Peter Macgregor, He Sun
2022	J	`jnl`	A Tighter Analysis of Spectral Clustering, and Beyond. CoRR Peter Macgregor, He Sun
2022	J	`jnl`	Finding Bipartite Components in Hypergraphs. CoRR Peter Macgregor, He Sun
2022	A*	`conf`	Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
2022	J	`jnl`	Is the Algorithmic Kadison-Singer Problem Hard? CoRR Ben Jourdan, Peter Macgregor, He Sun
2021	A*	`conf`	Finding Bipartite Components in Hypergraphs. NeurIPS Peter Macgregor, He Sun
2021	A*	`conf`	Hierarchical Clustering: O(1)-Approximation for Well-Clustered Graphs. NeurIPS Bogdan-Adrian Manghiuc, He Sun
2021	J	`jnl`	Hierarchical Clustering: O(1)-Approximation for Well-Clustered Graphs. CoRR Bogdan-Adrian Manghiuc, He Sun
2021	A*	`conf`	Local Algorithms for Finding Densely Connected Clusters. ICML Peter Macgregor, He Sun
2021	J	`jnl`	Local Algorithms for Finding Densely Connected Clusters. CoRR Peter Macgregor, He Sun
2020	A	`conf`	Augmenting the Algebraic Connectivity of Graphs. ESA Bogdan-Adrian Manghiuc, Pan Peng, He Sun
2020	J	`jnl`	Augmenting the Algebraic Connectivity of Graphs. CoRR Bogdan-Adrian Manghiuc, Pan Peng, He Sun
2020	J	`jnl`	Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
2020	A	`conf`	Hermitian matrices for clustering directed graphs: insights and applications. AISTATS Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti
2020	A*	`conf`	Higher-Order Spectral Clustering of Directed Graphs. NeurIPS Steinar Laenen, He Sun
2020	J	`jnl`	Higher-Order Spectral Clustering of Directed Graphs. CoRR Steinar Laenen, He Sun
2019	J	`jnl`	Distributed Graph Clustering and Sparsification. ACM Trans. Parallel Comput. He Sun, Luca Zanetti
2019	A	`conf`	Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. ESA Huan Li, He Sun, Luca Zanetti
2019	J	`jnl`	Hermitian matrices for clustering directed graphs: insights and applications. CoRR Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti
2018	J	`jnl`	Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. SIAM J. Comput. Yin Tat Lee, He Sun
2018	J	`jnl`	Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem. CoRR Huan Li, He Sun, Luca Zanetti
2017	J	`jnl`	An SDP-Based Algorithm for Linear-Sized Spectral Sparsification. CoRR Yin Tat Lee, He Sun
2017	A*	`conf`	An SDP-based algorithm for linear-sized spectral sparsification. STOC Yin Tat Lee, He Sun
2017	J	`jnl`	Communication-Optimal Distributed Clustering. CoRR Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang
2017	J	`jnl`	Distributed Graph Clustering and Sparsification. CoRR He Sun, Luca Zanetti
2017	B	`conf`	Distributed Graph Clustering by Load Balancing. SPAA He Sun, Luca Zanetti
2017	J	`jnl`	Partitioning Well-Clustered Graphs: Spectral Clustering Works! SIAM J. Comput. Richard Peng, He Sun, Luca Zanetti
2016	J	`jnl`	Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
2016	—	`conf`	Communication-Optimal Distributed Clustering. NIPS Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang
2015	A*	`conf`	Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. FOCS Yin Tat Lee, He Sun
2015	J	`jnl`	Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. CoRR Yin Tat Lee, He Sun
2015	A*	`conf`	Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. SODA Zeyu Guo, He Sun
2015	A*	`conf`	Partitioning Well-Clustered Graphs: Spectral Clustering Works! COLT Richard Peng, He Sun, Luca Zanetti
2015	J	`jnl`	Randomized Rumour Spreading: The Effect of the Network Topology. Comb. Probab. Comput. Konstantinos Panagiotou, Xavier Pérez-Giménez, Thomas Sauerwald, He Sun
2014	A	`conf`	Balls into bins via local search: cover time and maximum load. STACS Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
2014	B	`conf`	Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs. ISAAC Pavel Kolev, He Sun
2014	J	`jnl`	Partitioning Well-Clustered Graphs with k-Means and Heat Kernel. CoRR Richard Peng, He Sun, Luca Zanetti
2013	A*	`conf`	Balls into Bins via Local Search. SODA Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun
2013	J	`jnl`	Balls into bins via local search: cover time and maximum load. CoRR Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
2013	J	`jnl`	Counting Hypergraphs in Data Streams CoRR He Sun
2013	J	`jnl`	Deterministic polynomial-time algorithms for designing short DNA words. Theor. Comput. Sci. Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
2013	J	`jnl`	Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. CoRR Zeyu Guo, He Sun
2012	J	`jnl`	Balls into Bins via Local Search CoRR Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun
2012	—	`conf`	Counting Arbitrary Subgraphs in Data Streams. ICALP (2) Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun
2012	J	`jnl`	Deterministic Polynomial-Time Algorithms for Designing Short DNA Words CoRR Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
2012	A	`conf`	Low Randomness Rumor Spreading via Hashing. STACS George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel
2012	J	`jnl`	Multi-Attribute Profit-Maximizing Pricing (Extended Abstract) CoRR Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun
2012	J	`jnl`	Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies CoRR Thomas Sauerwald, He Sun
2012	A*	`conf`	Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. FOCS Thomas Sauerwald, He Sun
2011	A	`conf`	Approximate Counting of Cycles in Streams. ESA Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun
2011	J	`jnl`	Greedy Construction of 2-Approximate Minimum Manhattan Networks. Int. J. Comput. Geom. Appl. Zeyu Guo, He Sun, Hong Zhu
2011	J	`jnl`	Minimum Manhattan Network is NP-Complete. Discret. Comput. Geom. Francis Y. L. Chin, Zeyu Guo, He Sun
2010	C	`conf`	Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. TAMC Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
2009	—	`conf`	Minimum Manhattan network is NP-complete. SCG Francis Y. L. Chin, Zeyu Guo, He Sun
2009	C	`conf`	On Construction of Almost-Ramanujan Graphs. COCOA He Sun, Hong Zhu
2009	J	`jnl`	On Construction of Almost-Ramanujan Graphs. Discret. Math. Algorithms Appl. He Sun, Hong Zhu
2009	J	`jnl`	Two improved range-efficient algorithms for F Theor. Comput. Sci. He Sun, Chung Keung Poon
2008	C	`conf`	A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. AAIM Zeyu Guo, He Sun, Hong Zhu
2008	B	`conf`	Greedy Construction of 2-Approximation Minimum Manhattan Network. ISAAC Zeyu Guo, He Sun, Hong Zhu
2007	C	`conf`	Two Improved Range-Efficient Algorithms for TAMC He Sun, Chung Keung Poon