Obserwuj
Yu Chen
Yu Chen
EPFL
Zweryfikowany adres z epfl.ch - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Sublinear algorithms for (Δ+ 1) vertex coloring
S Assadi, Y Chen, S Khanna
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
892019
Polynomial pass lower bounds for graph streaming algorithms
S Assadi, Y Chen, S Khanna
Proceedings of the 51st Annual ACM SIGACT Symposium on theory of computing …, 2019
242019
Near-linear size hypergraph cut sparsifiers
Y Chen, S Khanna, A Nagda
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 61-72, 2020
212020
Sublinear algorithms and lower bounds for metric TSP cost estimation
Y Chen, S Kannan, S Khanna
arXiv preprint arXiv:2006.05490, 2020
132020
Network formation under random attack and probabilistic spread
Y Chen, S Jabbari, M Kearns, S Khanna, J Morgenstern
arXiv preprint arXiv:1906.00241, 2019
52019
A polynomial lower bound on the number of rounds for parallel submodular function minimization and matroid intersection
D Chakrabarty, Y Chen, S Khanna
SIAM Journal on Computing, FOCS21-1-FOCS21-29, 2023
32023
On weighted graph sparsification by linear sketching
Y Chen, S Khanna, H Li
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
32022
Sublinear algorithms and lower bounds for estimating mst and tsp cost in general metrics
Y Chen, S Khanna, Z Tan
arXiv preprint arXiv:2203.14798, 2022
32022
Near-perfect recovery in the one-dimensional latent space model
Y Chen, S Kannan, S Khanna
Proceedings of The Web Conference 2020, 1932-1942, 2020
22020
Sublinear time hypergraph sparsification via cut and edge sampling queries
Y Chen, S Khanna, A Nagda
arXiv preprint arXiv:2106.10386, 2021
12021
Space-efficient Query Evaluation over Probabilistic Event Streams
R Alur, Y Chen, K Jothimurugan, S Khanna
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
12020
The beachcombers’ problem: Walking and searching from an inner point of a line
Y Chen, X Deng, Z Ji, C Liao
Language and Automata Theory and Applications: 10th International Conference …, 2016
12016
Query Complexity of the Metric Steiner Tree Problem
Y Chen, S Khanna, Z Tan
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
2023
Sublinear Algorithm and Lower Bound for Combinatorial Problems
Y Chen
University of Pennsylvania, 2022
2022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–14