Yang P. Liu

Generating author description...

All published works

Action	Title	Year	Authors
+	Vertex Sparsification for Edge Connectivity	2021	Parinya Chalermsook Syamantak Das Yunbum Kook Bundit Laekhanukit Yang P. Liu Richard Peng Mark Sellke Daniel Vaz
+	The "Riemann Hypothesis" is True for Period Polynomials of Almost All Newforms	2016	Yang P. Liu Peter S. Park Zhuo Qun Song
+	Bounded Gaps Between Products of Distinct Primes	2016	Yang P. Liu Peter S. Park Zhuo Qun Song

Common Coauthors

Coauthor	Papers Together
Zhuo Qun Song	2
Peter S. Park	2
Mark Sellke	1
Parinya Chalermsook	1
Yunbum Kook	1
Syamantak Das	1
Bundit Laekhanukit	1
Richard Peng	1
Daniel Vaz	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Towards (1 + ε)-approximate flow sparsifiers	2014	Alexandr Andoni Anupam Gupta Robert Krauthgamer	1
+	ON THE REPRESENTATION OF A LARGER EVEN INTEGER AS THE SUM OF A PRIME AND THE PRODUCT OF AT MOST TWO PRIMES	1973	Chen Jing-Run	1
+ PDF Chat	Representative Sets and Irrelevant Vertices: New Tools for Kernelization	2012	Stefan Kratsch Magnus Wahlström	1
+ PDF Chat	Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability	2010	Konstantin Makarychev Yury Makarychev	1
+	Periods of modular forms and Jacobi theta functions	1991	Don Zagier	1
+ PDF Chat	Small gaps between primes or almost primes	2009	D. A. Goldston S. W. Graham J. Pintz C. Y. Yıldırım	1
+ PDF Chat	Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems	2004	Daniel A. Spielman Shang‐Hua Teng	1
+ PDF Chat	Vertex Sparsifiers: New Results from Old Techniques	2010	Matthias Englert Anupam Gupta Robert Krauthgamer Harald Räcke Inbal Talgam-Cohen Kunal Talwar	1
+ PDF Chat	Vertex Sparsifiers and Abstract Rounding Algorithms	2010	Moses Charikar Tom Leighton Shi Li Ankur Moitra	1
+ PDF Chat	On mimicking networks representing minimum terminal cuts	2014	Arindam Khan Prasad Raghavendra	1
+ PDF Chat	Primes in arithmetic progressions to large moduli	1986	Enrico Bombieri John Friedlander Henryk Iwaniec	1
+ PDF Chat	Nearly Maximum Flows in Nearly Linear Time	2013	Jonah Sherman	1
+ PDF Chat	None	1997	Ken Ono	1
+ PDF Chat	Small gaps between products of two primes	2008	D. A. Goldston S. W. Graham J. Pintz C. Y. Yıldırım	1
+	Minimum cuts in near-linear time	1996	David R. Karger	1
+ PDF Chat	On vertex sparsifiers with Steiner nodes	2012	Julia Chuzhoy	1
+	Unimodularity of zeros of period polynomials of Hecke eigenforms	2014	Ahmad El‐Guindy Wissam Raji	1
+ PDF Chat	Bounded gaps between primes in Chebotarev sets	2014	Jesse Thorner	1
+ PDF Chat	An induction principle for the generalization of Bombieri's prime number theorem	1976	Yoichi Motohashi	1
+ PDF Chat	Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back	2013	Aleksander Mądry	1
+ PDF Chat	Some new results on the Eichler cohomology of automorphic forms	1974	Marvin I. Knopp	1
+ PDF Chat	Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems	2014	Amir Abboud Virginia Vassilevska Williams	1
+	Bounded gaps between products of primes with applications to ideal class groups and elliptic curves	2008	Frank Thorne	1
+	Preprocessing under uncertainty	2015	Stefan Fafianie Stefan Kratsch Voung Anh Quyen	1
+ PDF Chat	Riemann hypothesis for period polynomials of modular forms	2016	Seokho Jin Wenjun Ma Ken Ono K. Soundararajan	1
+ PDF Chat	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations	2013	Jonathan A. Kelner Yin Tat Lee Lorenzo Orecchia Aaron Sidford	1
+	Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches	2015	Sepehr Assadi Sanjeev Khanna Li Yang Val Tannen	1
+	Sparsified Cholesky and multigrid solvers for connection laplacians	2016	Rasmus Kyng Yin Tat Lee Richard Peng Sushant Sachdeva Daniel A. Spielman	1
+	Sampling random spanning trees faster than matrix multiplication	2017	David Durfee Rasmus Kyng John Peebles Anup Rao Sushant Sachdeva	1
+ PDF Chat	Vertex Sparsification in Trees	2017	Gramoz Goranci Harald Räcke	1
+	Improved Guarantees for Vertex Sparsification in Planar Graphs	2017	Gramoz Goranci Monika Henzinger Pan Peng	1
+	Refined Vertex Sparsifiers of Planar Graphs	2017	Robert Krauthgamer Havana rika	1
+	The Power of Vertex Sparsifiers in Dynamic Graph Algorithms	2017	Gramoz Goranci Monika Henzinger Pan Peng	1
+	Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs	2018	Gramoz Goranci Monika Henzinger Pan Peng	1
+ PDF Chat	Expander Decomposition and Pruning: Faster, Stronger, and Simpler	2019	Thatchaphol Saranurak Di Wang	1
+	A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems	2019	Sebastian Forster Yang Liu	1
+	Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries	2019	Danupon Nanongkai Thatchaphol Saranurak Sorrachai Yingchareonthawornchai	1
+ PDF Chat	Mimicking Networks and Succinct Representations of Terminal Cuts	2013	Robert Krauthgamer Havana Rika	1
+	Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time	2016	Gramoz Goranci Monika Henzinger Mikkel Thorup	1
+	Sensitive Distance and Reachability Oracles for Large Batch Updates	2019	Jan van den Brand Thatchaphol Saranurak	1
+	Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs	2018	Gramoz Goranci Monika Henzinger Pan Peng	1
+ PDF Chat	Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple	2016	Rasmus Kyng Sushant Sachdeva	1
+ PDF Chat	The Nontrivial Zeros of Period Polynomials of Modular Forms Lie on the Unit Circle	2012	J. Brian Conrey David W. Farmer Özlem Imamoğlu	1
+ PDF Chat	Computing Maximum Flow with Augmenting Electrical Flows	2016	Aleksander Mądry	1
+	Survivable Network Design for Group Connectivity in Low-Treewidth Graphs	2018	Parinya Chalermsook Syamantak Das Guy Even Bundit Laekhanukit Daniel Vaz	1
+	Preprocessing under uncertainty	2016	Stefan Fafianie Stefan Kratsch Vuong Anh Quyen	1
+ PDF Chat	Breaking quadratic time for small vertex connectivity and an approximation scheme	2019	Danupon Nanongkai Thatchaphol Saranurak Sorrachai Yingchareonthawornchai	1
+	The Power of Vertex Sparsifiers in Dynamic Graph Algorithms	2017	Gramoz Goranci Monika Henzinger Pan Peng	1
+	Expander decomposition and pruning: faster, stronger, and simpler	2019	Thatchaphol Saranurak Di Wang	1
+	Fully dynamic spectral vertex sparsifiers and applications	2019	David Durfee Yu Gao Gramoz Goranci Richard Peng	1