( en | de | ru )

 

Disambiguation of "Banerjee, Suman"

Author of the publication

copydeleteadd this publication to your clipboard
Peer-to-peer streaming of stored media: the indirect approach.

, , , , and . SIGMETRICS/Performance, page 371-372. ACM, (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.

Nimisha Suman

Hazem Suman

Suman Baidya

Suman Jha

Suman Sahai

 

Other publications of authors with the same name

BlackOut and Obfuscator: An Exploration of the Design Space for Privacy-Preserving Interventions for Voice Assistants, , , , and . arXiv preprint arXiv:1812.00263, (2018)Guest editor introduction.. ACM SIGMOBILE Mob. Comput. Commun. Rev., 12 (1): 55 (2008)Water or slime? A platform for automating water treatment systems: poster abstract., , , and . BuildSys@SenSys, page 216-217. ACM, (2014)DySky: Dynamic Skyline Queries on Uncertain Graphs., , and . WISE (1), volume 12342 of Lecture Notes in Computer Science, page 242-254. Springer, (2020)A Distributed Algorithm for Constructing an Independent Dominating Set., , , and . ICDCIT, volume 13145 of Lecture Notes in Computer Science, page 79-95. Springer, (2022)All Roads Lead to Rome: An MPTCP-Aware Layer-4 Load Balancer., , and . Networking, page 1-9. IEEE, (2021)Wire speed packet classification without tcams: a few more registers (and a bit of logic) are enough., , , and . SIGMETRICS, page 253-264. ACM, (2007)Maximizing the Earned Benefit in an Incentivized Social Networking Environment: An Integer Programming-Based Approach., , and . COMAD/CODS, page 322-325. ACM, (2019)Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract)., , , and . AAAI, page 16148-16149. AAAI Press, (2023)OMNI: An efficient overlay multicast infrastructure for real-time applications., , , , and . Comput. Networks, 50 (6): 826-841 (2006)