( en | de | ru )

 

Disambiguation of "Ramnarayan, Govind"

Author of the publication

copydeleteadd this publication to your clipboard
From Soft Classifiers to Hard Decisions: How fair can we be?

, , , , , and . FAT, page 309-318. ACM, (2019)

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.

Govind Ganatra

Govind Rao

Govind Mirchandani

Govind Phadke

Govind Athavale

 

Other publications of authors with the same name

How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories., , , , and . RECOMB, volume 11467 of Lecture Notes in Computer Science, page 136-157. Springer, (2019)Relaxed Locally Correctable Codes., , and . ITCS, volume 94 of LIPIcs, page 27:1-27:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Relaxed Locally Correctable Codes., , and . Electron. Colloquium Comput. Complex., (2017)How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories., , , , and . J. Comput. Biol., 27 (4): 613-625 (2020)From Soft Classifiers to Hard Decisions: How fair can we be?, , , , , and . CoRR, (2018)Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't., , and . ITCS, volume 124 of LIPIcs, page 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Relaxed Locally Correctable Codes., , and . Theory Comput., (2020)Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions., , and . PODC, page 137-146. ACM, (2019)Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise., , and . IEEE Trans. Inf. Theory, 68 (7): 4723-4749 (2022)Efficient Multiparty Interactive Coding - Part I: Oblivious Insertions, Deletions and Substitutions., , and . IEEE Trans. Inf. Theory, 67 (6): 3411-3437 (2021)