Your search returned the following 19 documents:

19. Computing mimicking networks
    Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, and Christos Zaroliagis
    Algorithmica 26 (1): 31-49, 2000
    
18. Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
    Shiva Chaudhuri and Christos Zaroliagis
    Algorithmica 27 (3/4): 212-226, 2000
    
17. All-Pairs Min-Cut in Sparse Networks
    Srinivasa Rao Arikati, Shiva Chaudhuri, and Christos Zaroliagis
    Journal of Algorithms 29: 82-110, 1998
    
16. Computing Mimicking Networks
    Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, and Christos Zaroliagis
    In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), Aalborg, Denmark, July, 11-15, 1998, 556-567
    
15. Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
    Shiva Chaudhuri and Christos Zaroliagis
    Theoretical Computer Science 203 (2): 205-223, 1998. Note: Special issue on ESA'95
    
14. The $p$-neighbor $k$-center problem
    Shiva Chaudhuri, Naveen Garg, and R. Ravi
    Information Processing Letters 65: 131-134, 1998
    
13. Probabilistic recurrence relations revisited
    Shiva Chaudhuri and Devdatt Dubhashi
    Theoretical Computer Science 181 (1): 45-56, 1997
    
12. The Complexity of Parallel Prefix Problems on Small Domains
    Shiva Chaudhuri and Jaikumar Radhakrishnan
    Information and Computation 138 (1): 1-22, 1997
    
11. Deterministic restrictions in circuit complexity
    Shiva Chaudhuri and Jaikumar Radhakrishnan
    In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), Philadelphia, PA, USA, May 22-24, 1996, 30-36
    
10. On the Parallel Complexity of Acyclic Logic Programs
    Shiva Chaudhuri, Yannis Dimopoulos, and Christos Zaroliagis
    Parallel Processing Letters 6 (2): 223-230, 1996
    
9. Sensitive functions and approximate problems
   Shiva Chaudhuri
   Information and Computation 126: 161-168, 1996
   
8. The randomized complexity of maintaining the minimum
   Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan
   In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 3-5, 1996, 4-15
   
7. The randomized complexity of maintaining the minimum
   Gerth Stølting Brodal, Shiva Chaudhuri, and R. Radhakrishnan
   Nordic Journal of Computing 3 (4): 337-351, 1996
   
6. A lower bound for area-universal graphs
   Gianfranco Bilardi, Shiva Chaudhuri, Devdatt Dubhashi, and Kurt Mehlhorn
   Information Processing Letters 51 (2): 101-105, 1994
   
   
5. All-Pairs Min-Cut in Sparse Networks
   Srinivasa Rao Arikati, Shiva Chaudhuri, and Christos Zaroliagis
   In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, Bangalore, India, December, 18th - 20th, 1995, 363-376
   
4. Optimal Parallel Shortest Paths in Small Treewidth Digraphs
   Shiva Chaudhuri and Christos Zaroliagis
   In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 31-45
   
3. Prefix Graphs and their Applications
   Shiva Chaudhuri and Torben Hagerup
   In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), Hersching, Germany, June, 16th - 18th, 1994, 1995, 206-218
   
2. Probabilistic Recurrence Relations Revisited
   Shiva Chaudhuri and Devdatt Dubhashi
   In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, Valparaiso, Chile, April, 3rd - 7th, 1995, 207-219
   
1. Shortest Path Queries in Digraphs of Small Treewidth
   Shiva Chaudhuri and Christos Zaroliagis
   In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), Szeged, Hungary, July, 10th - 14th, 1995, 244-255