( en | de | ru )

 

Disambiguation of "Rangan, C. Pandu"

Author of the publication

copydeleteadd this publication to your clipboard
A Navigation Algorithm Inspired by Human Navigation.

, , , , , and . ASONAM, page 1309-1314. IEEE Computer Society, (2012)

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.

Sigrid Pandurevi

Milan Pandurovi

Venkatasubbaiah Panduranga

Mila Pandurovi

Petra Pandur

 

Other publications of authors with the same name

Splitting and Aggregating Signatures in Cryptocurrency Protocols., , , , and . DAPPCON, page 100-108. IEEE, (2019)On Composability of Reliable Unicast and Broadcast., , , and . ICDCN, volume 5935 of Lecture Notes in Computer Science, page 54-66. Springer, (2010)Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience., and . ICITS, volume 6673 of Lecture Notes in Computer Science, page 206-226. Springer, (2011)Cryptanalysis of Unidirectional Proxy Re-Encryption Scheme., , and . ICT-EurAsia, volume 8407 of Lecture Notes in Computer Science, page 564-575. Springer, (2014)Trading Players for Efficiency in Unconditional Multiparty Computation., , and . SCN, volume 2576 of Lecture Notes in Computer Science, page 342-353. Springer, (2002)Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries., , and . ACISP, volume 2384 of Lecture Notes in Computer Science, page 497-512. Springer, (2002)On Proactive Perfectly Secure Message Transmission., , and . ACISP, volume 4586 of Lecture Notes in Computer Science, page 461-473. Springer, (2007)Non-perfect Secret Sharing over General Access Structures., , and . INDOCRYPT, volume 2551 of Lecture Notes in Computer Science, page 409-421. Springer, (2002)Breaking and Fixing of an Identity Based Multi-Signcryption Scheme., , and . ProvSec, volume 5848 of Lecture Notes in Computer Science, page 61-75. Springer, (2009)A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs., , and . WALCOM, volume 6552 of Lecture Notes in Computer Science, page 191-201. Springer, (2011)