( en | de | ru )

 

Disambiguation of "Chaudhuri, Shiva"

Author of the publication

copydeleteadd this publication to your clipboard
The Randomized Complexity of Maintaining the Minimum.

, , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 4-15. Springer, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kirumakki Narayana Shivaram

Shiva Hemmati

Sunitha Shiva

Nondini Chaudhuri

Mitochondriale Bildung von reaktiven Sauerstoffspezies in Abhängigkeit vom Sauerstoffpartialdruck und der mitochondrialen Aktivität. Uni Heidelberg, (2010)

Madhuri Shivalkar

 

Other publications of authors with the same name

Deterministic Restrictions in Circuit Complexity., and . STOC, page 30-36. ACM, (1996)All-Pairs Min-Cut in Sparse Networks., , and . J. Algorithms, 29 (1): 82-110 (1998)(Probabilistic) Recurrence Realtions Revisited., and . LATIN, volume 911 of Lecture Notes in Computer Science, page 207-219. Springer, (1995)Optimal Parallel Shortest Paths in Small Treewidth Digraphs., and . ESA, volume 979 of Lecture Notes in Computer Science, page 31-45. Springer, (1995)Tight Bounds for the Chaining Problem.. SPAA, page 62-70. ACM, (1991)The Randomized Complexity of Maintaining the Minimum., , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 4-15. Springer, (1996)A Lower Bound for Linear Approximate Compaction.. ISTCS, page 25-32. IEEE Computer Society, (1993)Shortest Path Queries in Digraphs of Small Treewidth., and . ICALP, volume 944 of Lecture Notes in Computer Science, page 244-255. Springer, (1995)Sensitive Functions and Approximate Problems. FOCS, page 186-193. IEEE Computer Society, (1993)All-Pairs Min-Cut in Sparse Networks., , and . FSTTCS, volume 1026 of Lecture Notes in Computer Science, page 363-376. Springer, (1995)