2 citations · 4 across the 5 of their papers we have counts for
5 papers
Approximation Algorithms for Key Management in Secure Multicast
Agnes Chan, Rajmohan Rajaraman, Zhifeng Sun +1
Many data dissemination and publish-subscribe systems that guarantee the privacy and authenticity of the participants rely on symmetric key cryptography. An important problem in su…
Reducibility Among Fractional Stability Problems
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman +2
In this paper, we resolve the computational complexity of a number of outstanding open problems with practical applications. Here is the list of problems we show to be PPAD-complet…
Preference Games and Personalized Equilibria, with Applications to Fractional BGP
Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram +1
We study the complexity of computing equilibria in two classes of network games based on flows - fractional BGP (Border Gateway Protocol) games and fractional BBC (Bounded Budget C…
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman +2
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players or…
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Guolong Lin, Rajmohan Rajaraman
Motivated by applications in grid computing and project management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs w…