Tight Bounds for the Chaining Problem. - Shiva Chaudhuri (SPAA, 1991)

A Lower Bound for Linear Approximate Compaction. - Shiva Chaudhuri (ISTCS, 1993)

Approximate and Exact Deterministic Parallel Selection. - Shiva Chaudhuri; Torben Hagerup; Rajeev Raman (MFCS, 1993)

Prefix Graphs and Their Applications. - Shiva Chaudhuri; Torben Hagerup (WG, 1994)

A Lower Bound for Area-Universal Graphs. - Gianfranco Bilardi; Shiva Chaudhuri; Devdatt P. Dubhashi; Kurt Mehlhorn (Inf. Process. Lett., 1994)

Tight Pounds on Oblivious Chaining. - Shiva Chaudhuri (SIAM J. Comput., 1994)

Optimal Parallel Shortest Paths in Small Treewidth Digraphs. - Shiva Chaudhuri; Christos D. Zaroliagis (ESA, 1995)

Shortest Path Queries in Digraphs of Small Treewidth. - Shiva Chaudhuri; Christos D. Zaroliagis (ICALP, 1995)

(Probabilistic) Recurrence Realtions Revisited. - Shiva Chaudhuri; Devdatt P. Dubhashi (LATIN, 1995)

Deterministic Restrictions in Circuit Complexity - Shiva Chaudhuri; Jaikumar Radhakrishnan (Electron. Colloquium Comput. Complex., 1996)

Sensitive Functions and Approximate Problems. - Shiva Chaudhuri (Inf. Comput., 1996)

The Randomized Complexity of Maintaining the Minimum. - Gerth Stølting Brodal; Shiva Chaudhuri; Jaikumar Radhakrishnan (Nord. J. Comput., 1996)

On the Parallel Complexity of Acyclic Logic Programs. - Shiva Chaudhuri; Yannis Dimopoulos; Christos D. Zaroliagis (Parallel Process. Lett., 1996)

The Complexity of Parallel Prefix Problems on Small Domains. - Shiva Chaudhuri; Jaikumar Radhakrishnan (Inf. Comput., 1997)

Probabilistic Recurrence Relations Revisited. - Shiva Chaudhuri; Devdatt P. Dubhashi (Theor. Comput. Sci., 1997)

The p-Neighbor k-Center Problem. - Shiva Chaudhuri; Naveen Garg 001; R. Ravi 001 (Inf. Process. Lett., 1998)

All-Pairs Min-Cut in Sparse Networks. - Srinivasa Rao Arikati; Shiva Chaudhuri; Christos D. Zaroliagis (J. Algorithms, 1998)

Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. - Shiva Chaudhuri; Christos D. Zaroliagis (Theor. Comput. Sci., 1998)

Computing Mimicking Networks. - Shiva Chaudhuri; K. V. Subrahmanyam 001; Frank Wagner 001; Christos D. Zaroliagis (Algorithmica, 2000)

Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. - Shiva Chaudhuri; Christos D. Zaroliagis (Algorithmica, 2000)