Sledovat
Peng Zhang
Peng Zhang
Rutgers University
E-mailová adresa ověřena na: rutgers.edu - Domovská stránka
Název
Citace
Citace
Rok
Minimizing seed set selection with probabilistic coverage guarantee in a social network
P Zhang, W Chen, X Sun, Y Wang, J Zhang
Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014
822014
Balancing covariates in randomized experiments with the gram–schmidt walk design
C Harshaw, F Sävje, DA Spielman, P Zhang
Journal of the American Statistical Association, 1-13, 2024
572024
Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time
MW Mahoney, S Rao, D Wang, P Zhang
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
272016
Optimal query complexity for estimating the trace of a matrix
K Wimmer, Y Wu, P Zhang
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
272014
Hardness results for structured linear systems
R Kyng, P Zhang
SIAM Journal on Computing 49 (4), FOCS17-280-FOCS17-349, 2020
202020
On approximate pattern matching with thresholds
P Zhang, MJ Atallah
Information Processing Letters 123, 21-26, 2017
142017
Incomplete nested dissection
R Kyng, R Peng, R Schwieterman, P Zhang
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
102018
Packing LPs are hard to solve accurately, assuming linear equations are hard
R Kyng, D Wang, P Zhang
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
92020
Hardness results for laplacians of simplicial complexes via sparse-linear equation complete gadgets
M Ding, R Kyng, MP Gutenberg, P Zhang
arXiv preprint arXiv:2202.05011, 2022
42022
Two-commodity flow is equivalent to linear programming under nearly-linear time reductions
M Ding, R Kyng, P Zhang
arXiv preprint arXiv:2201.11587, 2022
42022
Hardness Results for Weaver's Discrepancy Problem
DA Spielman, P Zhang
arXiv preprint arXiv:2205.01482, 2022
32022
Hardness results for minimizing the covariance of randomly signed sum of vectors
P Zhang
arXiv preprint arXiv:2211.14658, 2022
12022
Hardness and Tractability for Structured Numerical Problems.
P Zhang
Georgia Institute of Technology, Atlanta, GA, USA, 2019
12019
Efficient -Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences
M Ding, P Zhang
arXiv preprint arXiv:2302.06499, 2023
2023
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–14