|
Search the dblp DataBase
Shiva Chaudhuri:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Shiva Chaudhuri, Christos D. Zaroliagis
Shortest Path Queries in Digraphs of Small Treewidth. [Citation Graph (1, 0)][DBLP] ICALP, 1995, pp:244-255 [Conf]
- Shiva Chaudhuri, Christos D. Zaroliagis
Optimal Parallel Shortest Paths in Small Treewidth Digraphs. [Citation Graph (0, 0)][DBLP] ESA, 1995, pp:31-45 [Conf]
- Shiva Chaudhuri
Sensitive Functions and Approximate Problems [Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:186-193 [Conf]
- Shiva Chaudhuri, Jaikumar Radhakrishnan
The Complexity of Parallel Prefix Problems on Small Domains [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:638-647 [Conf]
- Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
All-Pairs Min-Cut in Sparse Networks. [Citation Graph (0, 0)][DBLP] FSTTCS, 1995, pp:363-376 [Conf]
- Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP] ICALP, 1998, pp:556-567 [Conf]
- Shiva Chaudhuri
A Lower Bound for Linear Approximate Compaction. [Citation Graph (0, 0)][DBLP] ISTCS, 1993, pp:25-32 [Conf]
- Shiva Chaudhuri, Devdatt P. Dubhashi
(Probabilistic) Recurrence Realtions Revisited. [Citation Graph (0, 0)][DBLP] LATIN, 1995, pp:207-219 [Conf]
- Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
Approximate and Exact Deterministic Parallel Selection. [Citation Graph (0, 0)][DBLP] MFCS, 1993, pp:352-361 [Conf]
- Shiva Chaudhuri
Tight Bounds for the Chaining Problem. [Citation Graph (0, 0)][DBLP] SPAA, 1991, pp:62-70 [Conf]
- Shiva Chaudhuri, Jaikumar Radhakrishnan
Deterministic Restrictions in Circuit Complexity. [Citation Graph (0, 0)][DBLP] STOC, 1996, pp:30-36 [Conf]
- Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
The Randomized Complexity of Maintaining the Minimum. [Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:4-15 [Conf]
- Shiva Chaudhuri, Torben Hagerup
Prefix Graphs and Their Applications. [Citation Graph (0, 0)][DBLP] WG, 1994, pp:206-218 [Conf]
- Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:26, n:1, pp:31-49 [Journal]
- Shiva Chaudhuri, Christos D. Zaroliagis
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. [Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:27, n:3, pp:212-226 [Journal]
- Shiva Chaudhuri
Sensitive Functions and Approximate Problems. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:126, n:2, pp:161-168 [Journal]
- Shiva Chaudhuri, Jaikumar Radhakrishnan
The Complexity of Parallel Prefix Problems on Small Domains. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1997, v:138, n:1, pp:1-22 [Journal]
- Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
A Lower Bound for Area-Universal Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:51, n:2, pp:101-105 [Journal]
- Shiva Chaudhuri, Naveen Garg, R. Ravi
The p-Neighbor k-Center Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:65, n:3, pp:131-134 [Journal]
- Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
All-Pairs Min-Cut in Sparse Networks. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:29, n:1, pp:82-110 [Journal]
- Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
The Randomized Complexity of Maintaining the Minimum. [Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1996, v:3, n:4, pp:337-351 [Journal]
- Shiva Chaudhuri
Tight Pounds on Oblivious Chaining. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:6, pp:1253-1265 [Journal]
- Shiva Chaudhuri, Devdatt P. Dubhashi
Probabilistic Recurrence Relations Revisited. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:181, n:1, pp:45-56 [Journal]
- Shiva Chaudhuri, Christos D. Zaroliagis
Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:203, n:2, pp:205-223 [Journal]
Search in 0.005secs, Finished in 0.281secs
|