( en | de | ru )

 

Disambiguation of "Panigrahy, Rina"

Author of the publication

copydeleteadd this publication to your clipboard
Balanced allocation on graphs.

, and . SODA, page 434-443. ACM Press, (2006)

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.

Rina Backhaus

Madhusmita Panigrahy

Rina Zuraida

Rina Barkol

Rina Saha

 

Other publications of authors with the same name

An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.. LATIN, volume 4957 of Lecture Notes in Computer Science, page 387-398. Springer, (2008)Debiasing social wisdom., , , and . KDD, page 500-508. ACM, (2013)Sparse Cut Projections in Graph Streams., , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 480-491. Springer, (2009)Faster Algorithms for Binary Matrix Factorization., , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 3551-3559. PMLR, (2019)Recursive Sketches for Modular Deep Learning., , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 2211-2220. PMLR, (2019)Estimating Sum by Weighted Sampling., , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 53-64. Springer, (2007)On the decidability of accessibility problems (extended abstract)., , , and . STOC, page 306-315. ACM, (2000)Hashing, searching, sketching.. Stanford University, USA, (2007)Beyond bloom filters: from approximate membership checks to approximate state machines., , , , and . SIGCOMM, page 315-326. ACM, (2006)Representing Graph Metrics with Fewest Edges., , , , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 355-366. Springer, (2003)