Christopher Ye
From MaRDI portal
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 |
|---|---|---|
| The computational complexity of factored graphs | 2026-07-14 | Paper |
| Distribution testing in the presence of arbitrarily dominant noise with verification queries | 2026-07-13 | Paper |
| Fine-grained optimality of partially dynamic shortest paths and more | 2026-07-03 | Paper |
| Replicability in high dimensional statistics | 2026-06-23 | Paper |
| On the complexity of algorithms with predictions for dynamic graph problems | 2025-11-04 | Paper |
| Faster approximate all pairs shortest paths | 2024-11-28 | Paper |
Research outcomes over time
This page was built for person: Christopher Ye
