Peng Zhang

CoRR, 2023

Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets.

[BibT_eX]

[DOI]

Maximilian Probst Gutenberg

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020

Hardness Results for Structured Linear Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard.

[BibT_eX]

[DOI]

Di Wang

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Hardness and Tractability for Structured Numerical Problems.

[BibT_eX]

[DOI]

PhD thesis, 2019

2018

Incomplete nested dissection.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

On approximate pattern matching with thresholds.

[BibT_eX]

[DOI]

Mikhail J. Atallah

Inf. Process. Lett., 2017

2016

Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014

Minimizing seed set selection with probabilistic coverage guarantee in a social network.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Optimal Query Complexity for Estimating the Trace of a Matrix.

[BibT_eX]

[DOI]

Karl Wimmer

Yi Wu