PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Chaudhuri, Shiva"

Author of the publication

copydeleteadd this publication to your clipboard
A Lower Bound for Area-Universal Graphs.

, , , and . Inf. Process. Lett., 51 (2): 101-105 (1994)

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.

No persons found for author name Chaudhuri, Shiva
add a person with the name Chaudhuri, Shiva
 

Other publications of authors with the same name

A Lower Bound for Area-Universal Graphs., , , and . Inf. Process. Lett., 51 (2): 101-105 (1994)The Complexity of Parallel Prefix Problems on Small Domains., and . Inf. Comput., 138 (1): 1-22 (1997)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)Shortest Path Queries in Digraphs of Small Treewidth., and . ICALP, volume 944 of Lecture Notes in Computer Science, page 244-255. Springer, (1995)(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)On the Parallel Complexity of Acyclic Logic Programs., , and . Parallel Processing Letters, 6 (2): 223-230 (1996)All-Pairs Min-Cut in Sparse Networks., , and . J. Algorithms, 29 (1): 82-110 (1998)Tight Pounds on Oblivious Chaining.. SIAM J. Comput., 23 (6): 1253-1265 (1994)