Shiva Chaudhuri

	2000
26		Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000)
25		Shiva Chaudhuri, Christos D. Zaroliagis: Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica 27(3): 212-226 (2000)
	1998
24		Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. ICALP 1998: 556-567
23		Shiva Chaudhuri, Naveen Garg, R. Ravi: The p-Neighbor k-Center Problem. Inf. Process. Lett. 65(3): 131-134 (1998)
22		Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. J. Algorithms 29(1): 82-110 (1998)
21		Shiva Chaudhuri, Christos D. Zaroliagis: Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. Theor. Comput. Sci. 203(2): 205-223 (1998)
	1997
20		Shiva Chaudhuri, Jaikumar Radhakrishnan: The Complexity of Parallel Prefix Problems on Small Domains. Inf. Comput. 138(1): 1-22 (1997)
19		Shiva Chaudhuri, Devdatt P. Dubhashi: Probabilistic Recurrence Relations Revisited. Theor. Comput. Sci. 181(1): 45-56 (1997)
	1996
18		Shiva Chaudhuri, Jaikumar Radhakrishnan: Deterministic Restrictions in Circuit Complexity. STOC 1996: 30-36
17		Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan: The Randomized Complexity of Maintaining the Minimum. SWAT 1996: 4-15
16		Shiva Chaudhuri, Jaikumar Radhakrishnan: Deterministic Restrictions in Circuit Complexity Electronic Colloquium on Computational Complexity (ECCC) 3(4): (1996)
15		Shiva Chaudhuri: Sensitive Functions and Approximate Problems. Inf. Comput. 126(2): 161-168 (1996)
14		Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan: The Randomized Complexity of Maintaining the Minimum. Nord. J. Comput. 3(4): 337-351 (1996)
13		Shiva Chaudhuri, Yannis Dimopoulos, Christos D. Zaroliagis: On the Parallel Complexity of Acyclic Logic Programs. Parallel Processing Letters 6(2): 223-230 (1996)
	1995
12		Shiva Chaudhuri, Christos D. Zaroliagis: Optimal Parallel Shortest Paths in Small Treewidth Digraphs. ESA 1995: 31-45
11		Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. FSTTCS 1995: 363-376
10		Shiva Chaudhuri, Christos D. Zaroliagis: Shortest Path Queries in Digraphs of Small Treewidth. ICALP 1995: 244-255
9		Shiva Chaudhuri, Devdatt P. Dubhashi: (Probabilistic) Recurrence Realtions Revisited. LATIN 1995: 207-219
	1994
8		Shiva Chaudhuri, Torben Hagerup: Prefix Graphs and Their Applications. WG 1994: 206-218
7		Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn: A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994)
6		Shiva Chaudhuri: Tight Pounds on Oblivious Chaining. SIAM J. Comput. 23(6): 1253-1265 (1994)
	1993
5		Shiva Chaudhuri: Sensitive Functions and Approximate Problems FOCS 1993: 186-193
4		Shiva Chaudhuri: A Lower Bound for Linear Approximate Compaction. ISTCS 1993: 25-32
3		Shiva Chaudhuri, Torben Hagerup, Rajeev Raman: Approximate and Exact Deterministic Parallel Selection. MFCS 1993: 352-361
	1992
2		Shiva Chaudhuri, Jaikumar Radhakrishnan: The Complexity of Parallel Prefix Problems on Small Domains FOCS 1992: 638-647
	1991
1		Shiva Chaudhuri: Tight Bounds for the Chaining Problem. SPAA 1991: 62-70

Coauthor Index

1	Srinivasa Rao Arikati	[11] [22]
2	Gianfranco Bilardi	[7]
3	Gerth Stølting Brodal	[14] [17]
4	Yannis Dimopoulos	[13]
5	Devdatt P. Dubhashi	[7] [9] [19]
6	Naveen Garg	[23]
7	Frank Geraets (Frank Wagner)	[24] [26]
8	Torben Hagerup	[3] [8]
9	Kurt Mehlhorn	[7]
10	Jaikumar Radhakrishnan	[2] [14] [16] [17] [18] [20]
11	Rajeev Raman	[3]
12	R. Ravi	[23]
13	K. V. Subrahmanyam	[24] [26]
14	Christos D. Zaroliagis	[10] [11] [12] [13] [21] [22] [24] [25] [26]

Colors in the list of coauthors