( en | de | ru )

 

Disambiguation of "Kondapally, Ranganath"

Author of the publication

copydeleteadd this publication to your clipboard
Certifying Equality With Limited Interaction.

, , , , and . Algorithmica, 76 (3): 796-845 (2016)

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.

Ranganath Gopalakrishnan

N. SANTOSH RANGANATH

 

Other publications of authors with the same name

Large-Scale Information Extraction under Privacy-Aware Constraints., and . CIKM, page 4845-4848. ACM, (2021)Algorithmic Aspects of Planning under Uncertainty for Service Delivery Organizations., , and . ICSOC, volume 7636 of Lecture Notes in Computer Science, page 615-622. Springer, (2012)Certifying Equality With Limited Interaction., , , , and . APPROX-RANDOM, volume 28 of LIPIcs, page 545-581. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Certifying Equality With Limited Interaction., , , , and . Algorithmica, 76 (3): 796-845 (2016)Beyond set disjointness: the communication complexity of finding the intersection., , , , and . PODC, page 106-113. ACM, (2014)Large-Scale Information Extraction from Emails with Data Constraints., , and . BDA, volume 11932 of Lecture Notes in Computer Science, page 124-139. Springer, (2019)Certifying Equality With Limited Interaction., , and . Electron. Colloquium Comput. Complex., (2012)Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming., , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 483-494. Springer, (2012)Everywhere-Tight Information Cost Tradeoffs for Augmented Index., and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 448-459. Springer, (2011)Large-Scale Entity Extraction from Enterprise Data., and . AIMLSystems, page 29:1-29:2. ACM, (2022)