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 |
|---|---|---|
| Optimal communication complexity of chained index | 2026-07-14 | Paper |
| Better bounds for semi-streaming single-source shortest paths | 2026-07-13 | Paper |
| Coloring graphs with few colors in the streaming model | 2026-07-13 | Paper |
| Settling the pass complexity of approximate matchings in dynamic graph streams | 2026-07-03 | Paper |
| Hidden permutations to the rescue: multi-pass streaming lower bounds for approximate matchings | 2025-08-15 | Paper |
| Look before, before you leap: online vector load balancing with few reassignments | 2024-09-25 | Paper |
| (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond | 2024-05-08 | Paper |
| On the computational power of programs over \(\mathsf{BA}_2\) monoid | 2021-10-04 | Paper |
Research outcomes over time
This page was built for person: Janani Sundaresan
