activity
20232026
most citedHidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2024

Optimal Communication Complexity of Chained Index

Janani Sundaresan

We study the CHAIN communication problem introduced by Cormode et al. [ICALP 2019]. It is a generalization of the well-studied INDEX problem. For , in CHAIN, there…