Chaudhuri, S., K.V. Subrahmanyam, F. Wagner and C. Zaroliagis: Computing mimicking networks. In: Algorithmica 26, 1, 31-49 (2000).
localid: C1256428004B93B8-5EE8B1BB2C1A5F68C1256A0F004D1844-ChaudhuriSubrahmanyamWagnerZaroliagis2000
Chaudhuri, S. and C. Zaroliagis: Shortest paths in digraphs of small treewidth. Part I, {Sequential} algorithms. In: Algorithmica 27, 3/4, 212-226 (2000).
localid: C1256428004B93B8-08065B16CD009B6AC1256A0F004E2366-ChaudhuriZaroliagis2000
Arikati, S.R., S. Chaudhuri and C. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. In: Journal of Algorithms 29, 82-110 (1998).
localid: C1256428004B93B8-4F5288722A23EA07C125672300615D50-Arikati-Chaudhuri-Zaroliagis-98
Chaudhuri, S., K.V. Subrahmanyam, F. Wagner and C. Zaroliagis: Computing Mimicking Networks. In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), (Eds.) Larsen, Kim G.; Skyum, Sven; Winskel, Glynn. Lecture Notes in Computer Science. Springer, Berlin, Germany (1998) 556-567.
localid: C1256428004B93B8-1774120C925E283DC1256723006321B1-Chauduri-Subrahmanyam-Wagner-Zaroliagis-98
Chaudhuri, S. and C. Zaroliagis: Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms. In: Theoretical Computer Science 203, 2, 205-223 (1998).
localid: C1256428004B93B8-0FAB3FA4CE2F4A9CC125648400504A55-Chaudhuri-Zaroliagis-2-97
Chaudhuri, S., N. Garg and R. Ravi: The $p$-neighbor $k$-center problem. In: Information Processing Letters 65, 131-134 (1998).
localid: C1256428004B93B8-F6308D88EAD42BFEC12567440033521F-ChaudhuriGargRavi
Chaudhuri, S. and D. Dubhashi: Probabilistic recurrence relations revisited. In: Theoretical Computer Science 181, 1, 45-56 (1997).
localid: C1256428004B93B8-59529483D23A8BE1C12565D80039AB47-ChaudhuriDubhashi97
Chaudhuri, S. and J. Radhakrishnan: The Complexity of Parallel Prefix Problems on Small Domains. In: Information and Computation 138, 1, 1-22 (1997).
localid: C1256428004B93B8-836E4D784DD91946C125655A0041EF23-Chaudhuri-Radhakrishnan97
Chaudhuri, S. and J. Radhakrishnan: Deterministic restrictions in circuit complexity. In: Theory of Computing : 28th Annual ACM Symposium (STOC-28) ACM Press, New York (1996) 30-36.
localid: C1256428004B93B8-5E6352B660DD01DAC125646600504769-ChaudhuriRadhakrishnan96
Chaudhuri, S., Y. Dimopoulos and C. Zaroliagis: On the Parallel Complexity of Acyclic Logic Programs. In: Parallel Processing Letters 6, 2, 223-230 (1996).
localid: C1256428004B93B8-038852548B12F015C12564290057E931-Chaudhuri-Zaroliagis-96
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.