Ruosong Wang
From MaRDI portal
Person:3174900
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Tight Bounds for ℓ 1 Oblivious Subspace Embeddings ACM Transactions on Algorithms | 2023-10-31 | Paper |
| scientific article; zbMATH DE number 7559066 (Why is no real title available?) (available as arXiv preprint) | 2022-07-18 | Paper |
| Tight bounds for the subspace sketch problem with applications SIAM Journal on Computing | 2021-08-06 | Paper |
| The Communication Complexity of Optimization Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Tight Bounds for the Subspace Sketch Problem with Applications Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| An improved algorithm for incremental DFS tree in undirected graphs (available as arXiv preprint) | 2020-08-25 | Paper |
| Exponential Separations in the Energy Complexity of Leader Election ACM Transactions on Algorithms | 2019-12-02 | Paper |
| Tight bounds for \(\ell_p\) oblivious subspace embeddings Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| \(k\)-regret minimizing set: efficient algorithms and hardness | 2018-07-18 | Paper |
| Exponential separations in the energy complexity of leader election Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Research outcomes over time
This page was built for person: Ruosong Wang
