The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shiva Chaudhuri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shiva Chaudhuri, Christos D. Zaroliagis
    Shortest Path Queries in Digraphs of Small Treewidth. [Citation Graph (1, 0)][DBLP]
    ICALP, 1995, pp:244-255 [Conf]
  2. Shiva Chaudhuri, Christos D. Zaroliagis
    Optimal Parallel Shortest Paths in Small Treewidth Digraphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:31-45 [Conf]
  3. Shiva Chaudhuri
    Sensitive Functions and Approximate Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:186-193 [Conf]
  4. Shiva Chaudhuri, Jaikumar Radhakrishnan
    The Complexity of Parallel Prefix Problems on Small Domains [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:638-647 [Conf]
  5. 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]
  6. Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
    Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:556-567 [Conf]
  7. Shiva Chaudhuri
    A Lower Bound for Linear Approximate Compaction. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:25-32 [Conf]
  8. Shiva Chaudhuri, Devdatt P. Dubhashi
    (Probabilistic) Recurrence Realtions Revisited. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:207-219 [Conf]
  9. Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
    Approximate and Exact Deterministic Parallel Selection. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:352-361 [Conf]
  10. Shiva Chaudhuri
    Tight Bounds for the Chaining Problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:62-70 [Conf]
  11. Shiva Chaudhuri, Jaikumar Radhakrishnan
    Deterministic Restrictions in Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:30-36 [Conf]
  12. 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]
  13. Shiva Chaudhuri, Torben Hagerup
    Prefix Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:206-218 [Conf]
  14. 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]
  15. 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]
  16. Shiva Chaudhuri
    Sensitive Functions and Approximate Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:126, n:2, pp:161-168 [Journal]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. Shiva Chaudhuri
    Tight Pounds on Oblivious Chaining. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1253-1265 [Journal]
  23. 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]
  24. 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.031secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002