Shiva Chaudhuri

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