Shiva Chaudhuri

Publication Activity (10 Years)

Years Active: 1991-2000
Publications (10 Years): 0

Publications

Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. Algorithmica 26 (1) (2000)
Shiva Chaudhuri, Christos D. Zaroliagis
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica 27 (3) (2000)
Shiva Chaudhuri, Christos D. Zaroliagis
Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. Theor. Comput. Sci. 203 (2) (1998)
Shiva Chaudhuri, Naveen Garg, R. Ravi
-Center Problem. Inf. Process. Lett. 65 (3) (1998)
Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. ICALP (1998)
Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
All-Pairs Min-Cut in Sparse Networks. J. Algorithms 29 (1) (1998)
Shiva Chaudhuri, Devdatt P. Dubhashi
Probabilistic Recurrence Relations Revisited. Theor. Comput. Sci. 181 (1) (1997)
Shiva Chaudhuri, Jaikumar Radhakrishnan
The Complexity of Parallel Prefix Problems on Small Domains. Inf. Comput. 138 (1) (1997)
Shiva Chaudhuri
Sensitive Functions and Approximate Problems. Inf. Comput. 126 (2) (1996)
Shiva Chaudhuri, Jaikumar Radhakrishnan
Deterministic Restrictions in Circuit Complexity. STOC (1996)
Shiva Chaudhuri, Yannis Dimopoulos, Christos D. Zaroliagis
On the Parallel Complexity of Acyclic Logic Programs. Parallel Process. Lett. 6 (2) (1996)
Shiva Chaudhuri, Jaikumar Radhakrishnan
Deterministic Restrictions in Circuit Complexity Electron. Colloquium Comput. Complex. 3 (4) (1996)
Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
The Randomized Complexity of Maintaining the Minimum. Nord. J. Comput. 3 (4) (1996)
Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
The Randomized Complexity of Maintaining the Minimum. SWAT (1996)
Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
All-Pairs Min-Cut in Sparse Networks. FSTTCS (1995)
Shiva Chaudhuri, Christos D. Zaroliagis
Optimal Parallel Shortest Paths in Small Treewidth Digraphs. ESA (1995)
Shiva Chaudhuri, Christos D. Zaroliagis
Shortest Path Queries in Digraphs of Small Treewidth. ICALP (1995)
Shiva Chaudhuri, Devdatt P. Dubhashi
(Probabilistic) Recurrence Realtions Revisited. LATIN (1995)
Shiva Chaudhuri
Tight Pounds on Oblivious Chaining. SIAM J. Comput. 23 (6) (1994)
Shiva Chaudhuri, Torben Hagerup
Prefix Graphs and Their Applications. WG (1994)
Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51 (2) (1994)
Shiva Chaudhuri
Sensitive Functions and Approximate Problems FOCS (1993)
Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
Approximate and Exact Deterministic Parallel Selection. MFCS (1993)
Shiva Chaudhuri
A Lower Bound for Linear Approximate Compaction. ISTCS (1993)
Shiva Chaudhuri, Jaikumar Radhakrishnan
The Complexity of Parallel Prefix Problems on Small Domains FOCS (1992)
Shiva Chaudhuri
Tight Bounds for the Chaining Problem. SPAA (1991)