Researcher Portfolio
Dr. Chaudhuri, Shiva
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons44233
Publications
(1 - 25 of 34)
: Chaudhuri, S., Subrahmanyam, K. V., Wagner, F., & Zaroliagis, C. (2000). Computing mimicking networks. Algorithmica, 26(1), 31-49. [PubMan] : Chaudhuri, S., & Zaroliagis, C. (2000). Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms. Algorithmica, 27(3/4), 212-226. [PubMan] : Arikati, S. R., Chaudhuri, S., & Zaroliagis, C. (1998). All-Pairs Min-Cut in Sparse Networks. Journal of Algorithms, 29, 82-110. [PubMan] : Chaudhuri, S., Subrahmanyam, K. V., Wagner, F., & Zaroliagis, C. (1998). Computing Mimicking Networks. In K. G. Larsen, S. Skyum, & G. Winskel (Eds. ), Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98) (pp. 556-567). Berlin, Germany: Springer. [PubMan] : Chaudhuri, S., & Zaroliagis, C. (1998). Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms. Theoretical Computer Science, 203(2), 205-223. [PubMan] : Chaudhuri, S., Garg, N., & Ravi, R. (1998). The $p$-neighbor $k$-center problem. Information Processing Letters, 65, 131-134. [PubMan] : Chaudhuri, S., & Dubhashi, D. (1997). Probabilistic Recurrence Relations Revisited. Theoretical computer science, 181(1), 45-56. doi:10.1016/S0304-3975(96)00261-7. [PubMan] : Chaudhuri, S., & Radhakrishnan, J. (1997). The Complexity of Parallel Prefix Problems on Small Domains. Information and Computation, 138(1), 1-22. doi:10.1006/inco.1997.2654. [PubMan] : Brodal, G. S., Chaudhuri, S., & Radhakrishnan, J.(1996). The randomized complexity of maintaining the minimum (MPI-I-1996-1-014). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Chaudhuri, S., Dimopoulos, Y., & Zaroliagis, C. (1996). On the Parallel Complexity of Acyclic Logic Programs. Parallel Processing Letters, 6(2), 223-230. [PubMan] : Arikati, S., Chaudhuri, S., & Zaroliagis, C.(1996). All-pairs min-cut in sparse networks (MPI-I-1996-1-007). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Garg, N., Chaudhuri, S., & Ravi, R.(1996). Generalized $k$-Center Problems (MPI-I-1996-1-021). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Chaudhuri, S. (1996). Sensitive functions and approximate problems. Information and Computation, 126(2), 161-168. doi:10.1006/inco.1996.0043. [PubMan] : Chaudhuri, S., & Radhakrishnan, J. (1996). Deterministic restrictions in circuit complexity. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (pp. 30-36). New York: ACM. [PubMan] : Brodal, G. S., Chaudhuri, S., & Radhakrishnan, R. (1996). The Randomized Complexity of Maintaining the Minimum. Nordic Journal of Computing, 3(4), 337-351. doi:10.5555/763878.763882. [PubMan] : Brodal, G. S., Chaudhuri, S., & Radhakrishnan, J. (1996). The Randomized Complexity of Maintaining the Minimum. In R. Karlsson, & A. Lingas (Eds. ), Algorithm Theory - SWAT '96 (pp. 4-15). Berlin: Springer. [PubMan] : Chaudhuri, S., & Zaroliagis, C.(1995). Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms (MPI-I-1995-1-020). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Chaudhuri, S., & Zaroliagis, C. (1995). Optimal Parallel Shortest Paths in Small Treewidth Digraphs. In P. Spirakis (Ed. ), Algorithms - ESA '95 (pp. 31-45). Berlin: Springer. [PubMan] : Chaudhuri, S., & Zaroliagis, C. (1995). Shortest Path Queries in Digraphs of Small Treewidth. In Z. Fülöp, & F. Gecseg (Eds. ), Automata, Languages, and Programming (pp. 244-255). Berlin: Springer. [PubMan] : Chaudhuri, S., & Dubhashi, D. (1995). (Probabilistic) Recurrence Relations Revisited. In R. Baeza-Yates, E. Goles, & P. V. Poblete (Eds. ), LATIN' 95: Theoretical Informatics (pp. 207-219). Berlin: Springer. [PubMan] : Chaudhuri, S., & Zaroliagis, C.(1995). Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms (MPI-I-1995-1-021). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Chaudhuri, S., & Hagerup, T. (1995). Prefix Graphs and their Applications. In E. W. Mayr, G. Schmidt, & G. Tinhofer (Eds. ), Graph-theoretic Concepts in Computer Science (pp. 206-218). Berlin: Springer. [PubMan] : Arikati, S. R., Chaudhuri, S., & Zaroliagis, C. (1995). All-Pairs Min-Cut in Sparse Networks. In P. S. Thiagarajan (Ed. ), Proceedings of the 15th conference of the foundations of software technology and theoretical computer science (FSTTCS-95) (pp. 363-376). Berlin, Germany: Springer. [PubMan] : Chaudhuri, S. (1994). Tight Bounds on Oblivious Chaining. SIAM Journal on Computing, 23(6), 1253-1265. doi:10.1137/S0097539792230277. [PubMan] : Chaudhuri, S., & Hagerup, T.(1994). Prefix graphs and their applications (MPI-I-94-145). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan]