@InProceedings{sundaresan:LIPIcs.ITCS.2025.89,
  author =	{Sundaresan, Janani},
  title =	{{Optimal Communication Complexity of Chained Index}},
  booktitle =	{16th Innovations in Theoretical Computer Science Conference (ITCS 2025)},
  pages =	{89:1--89:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-361-4},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{325},
  editor =	{Meka, Raghu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.89},
  URN =		{urn:nbn:de:0030-drops-227172},
  doi =		{10.4230/LIPIcs.ITCS.2025.89},
  annote =	{Keywords: communication complexity, index communciation problem}
}