( en | de | ru )

 

Disambiguation of "Bhatt, Sandeep N."

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds for On-Line Tree Embeddings.

, , , and . SODA, page 344-350. ACM/SIAM, (1991)

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.

n n n

Lavinia Bhatt

Alpana Bhatt

Sandeep Sadanandan

Sandeep Kumar

 

Other publications of authors with the same name

Tight Bounds for On-Line Tree Embeddings., , , and . SODA, page 344-350. ACM/SIAM, (1991)TED Models for ATM Internetworks., , and . SIGMETRICS Perform. Evaluation Rev., 25 (4): 12-21 (1998)Federated Security Management for Dynamic Coalitions., , and . DISCEX (2), page 47-48. IEEE Computer Society, (2003)Routing Multiple Paths in Hypercubes., and . SPAA, page 45-54. ACM, (1990)Taking Random Walks to Grow Trees in Hypercubes., and . J. ACM, 40 (3): 741-764 (1993)Traversing Directed Eulerian Mazes., , , and . WG, volume 1928 of Lecture Notes in Computer Science, page 35-46. Springer, (2000)Analyzing end-to-end network reachability., , , and . Integrated Network Management, page 585-590. IEEE, (2009)Fast, Cheap, and in Control: Towards Pain-Free Security!, , and . LISA, page 75-90. USENIX Association, (2008)Optimal Simulations of Tree Machines (Preliminary Version), , , and . FOCS, page 274-282. IEEE Computer Society, (1986)Tight Bounds on Parallel List Marking., , , , and . Euro-Par, volume 966 of Lecture Notes in Computer Science, page 231-242. Springer, (1995)