Skip to content

Author

Diptaksho Palit

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Query Complexity of Testing Structured Parenthesis Languages

We study the query complexity of testing membership in structured string languages, focusing on Dyck languages and natural generalizations. A tester receives query access to a word and must distinguish valid inputs from words that are far in Hamming distance, while inspecting only a sublinear number of positions. Our r...

Tim Jackman, Diptaksho Palit, Sofya Raskhodnikova · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.