( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower bounds for randomized read/write stream algorithms.

, , и . STOC, стр. 689-698. ACM, (2007)

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.

Christopher Rudram

Rudra Prosad Choudhury

Rudra Sekhar Manna

Freidun Raghi-Atri

Rudra P. Pradhan

 

Другие публикации лиц с тем же именем

Beyond worst-case analysis for joins with minesweeper., , , и . PODS, стр. 234-245. ACM, (2014)An energy complexity model for algorithms., , и . ITCS, стр. 283-304. ACM, (2013)Data Stream Algorithms for Codeword Testing., и . ICALP (1), том 6198 из Lecture Notes in Computer Science, стр. 629-640. Springer, (2010)Efficient List Decoding of Explicit Codes with Optimal Redundancy.. AAECC, том 4851 из Lecture Notes in Computer Science, стр. 38-46. Springer, (2007)Limits to List Decoding Random Codes.. COCOON, том 5609 из Lecture Notes in Computer Science, стр. 27-36. Springer, (2009)Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk).. STOC, стр. 4. ACM, (2017)Energy Aware Algorithmic Engineering., , и . MASCOTS, стр. 321-330. IEEE Computer Society, (2014)Topology Dependent Bounds For FAQs., , , и . PODS, стр. 432-449. ACM, (2019)Joins via Geometric Resolutions: Worst-case and Beyond., , , и . PODS, стр. 213-228. ACM, (2015)Lower bounds for randomized read/write stream algorithms., , и . STOC, стр. 689-698. ACM, (2007)