Sambuddha Roy

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 6

Top Topics

Resource Allocation

Approximation Algorithms

Scheduling Jobs

Top Venues

Discret. Optim.

Publications

Shangyu Xie, Wei Dai, Esha Ghosh, Sambuddha Roy, Dan Schwartz, Kim Laine
Does Prompt-Tuning Language Model Ensure Privacy? CoRR (2023)
Bargav Jayaraman, Esha Ghosh, Huseyin A. Inan, Melissa Chase, Sambuddha Roy, Wei Dai
Active Data Pattern Extraction Attacks on Generative Language Models. CoRR (2022)
Rajib Biswas, Sambuddha Roy
Botnet traffic identification using neural networks. Multim. Tools Appl. 80 (16) (2021)
Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal
Scheduling split intervals with non-uniform demands. Discret. Optim. 38 (2020)
Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal
Improved algorithms for resource allocation under varying capacity. J. Sched. 21 (3) (2018)
Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy
Fast Algorithms for Constrained Graph Density Problems. WALCOM (2015)
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
Approximation algorithms for the partition vertex cover problem. Theor. Comput. Sci. 555 (2014)
Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal
Improved Algorithms for Resource Allocation under Varying Capacity. ESA (2014)
Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. FSTTCS (2013)
Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal
Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths. IPDPS (2013)
Jagabondhu Hazra, Sambuddha Roy, Zainul Charbiwala, Deva P. Seetharam, Yogish Sabharwal, Saiful A. Husain, Sathyajith Mathew
Energy delivery networks. SmartGridComm (2013)
Suman Kalyan Bera, Anamitra R. Choudhury, Syamantak Das, Sambuddha Roy, Jayram S. Thatchachar
Fenchel Duals for Drifting Adversaries. CoRR (2013)
Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal
Scheduling Jobs with Multiple Non-uniform Tasks. Euro-Par (2013)
Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. CoRR (2013)
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
Approximation Algorithms for the Partition Vertex Cover Problem. WALCOM (2013)
Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy
Knapsack Cover Subject to a Matroid Constraint. FSTTCS (2013)
Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal
Density Functions subject to a Co-Matroid Constraint CoRR (2012)
Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal
Scheduling Resources for Executing a Partial Set of Jobs. FSTTCS (2012)
Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal
Distributed algorithms for scheduling on line and tree networks. PODC (2012)
Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal
Scheduling Resources for Executing a Partial Set of Jobs CoRR (2012)
Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal
Density Functions subject to a Co-Matroid Constraint. FSTTCS (2012)
Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal
Distributed Algorithms for Scheduling on Line and Tree Networks CoRR (2012)
Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Neha Sengupta
Maximizing throughput of jobs with multiple resource requirements. HiPC (2011)
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
Approximation Algorithms for Edge Partitioned Vertex Cover Problems CoRR (2011)
Venkatesan T. Chakaravarthy, Sambuddha Roy
Arthur and Merlin as Oracles. Comput. Complex. 20 (3) (2011)
Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal
Resource Allocation for Covering Time Varying Demands. ESA (2011)
Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. J. Comput. Syst. Sci. 77 (1) (2011)
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania
Decision trees for entity identification: Approximation algorithms and hardness results. ACM Trans. Algorithms 7 (2) (2011)
Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy
Contact Center Scheduling with Strict Resource Requirements. IPCO (2011)
Venkatesan T. Chakaravarthy, Gyana R. Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar
Minimum Cost Resource Allocation for Meeting Job Requirements. IPDPS (2011)
Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal
Scheduling Resources for Throughput Maximization. APPROX-RANDOM (2011)
Pradipta De, Sambuddha Roy
VMSpreader: Multi-tier application resiliency through virtual machine striping. Integrated Network Management (2011)
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal
Finding Independent Sets in Unions of Perfect Graphs. FSTTCS (2010)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47 (3) (2010)
Vijil Chenthamarakshan, Kashyap Dixit, M. Gattani, Munish Goyal, Pranav Gupta, Nanda Kambhatla, Rohit Lotlikar, Debapriyo Majumdar, Gyana R. Parija, Sambuddha Roy, Soujanya Soni, Karthik Visweswariah
Effective decision support systems for workforce deployment. IBM J. Res. Dev. 54 (6) (2010)
Venkatesan T. Chakaravarthy, Sambuddha Roy
Approximating maximum weight K-colorable subgraphs in chordal graphs. Inf. Process. Lett. 109 (7) (2009)
Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Electron. Colloquium Comput. Complex. 16 (2009)
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal
Approximating Decision Trees with Multiway Branches. ICALP (1) (2009)
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45 (4) (2009)
Kashyap Dixit, Munish Goyal, Pranav Gupta, Nanda Kambhatla, Rohit Lotlikar, Debapriyo Majumdar, Gyana R. Parija, Sambuddha Roy, Soujanya Soni
Effective Decision Support for Workforce Deployment Service Systems. IEEE SCC (2009)
Venkatesan T. Chakaravarthy, Sambuddha Roy
Arthur and Merlin as Oracles. Electron. Colloquium Comput. Complex. 16 (2009)
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
Space-Efficient Counting in Graphs on Surfaces. Comput. Complex. 18 (4) (2009)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS (2008)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR (2008)
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea, Amit Anil Nanavati, Sambuddha Roy, Amit Agarwal
Extracting dense communities from telecom call graphs. COMSWARE (2008)
Venkatesan T. Chakaravarthy, Sambuddha Roy
Arthur and Merlin as Oracles. MFCS (2008)
Venkatesan T. Chakaravarthy, Sambuddha Roy
via Arthur and Merlin. STACS (2008)
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
Parity Problems in Planar Graphs. Computational Complexity Conference (2007)
Sambuddha Roy, William Steiger
Some Combinatorial and Algorithmic Applications of the Borsuk-Ulam Theorem. Graphs Comb. 23 (Supplement-1) (2007)
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
Parity Problems in Planar Graphs. Electron. Colloquium Comput. Complex. 14 (035) (2007)
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania
Decision trees for entity identification: approximation algorithms and hardness results. PODS (2007)
Venkatesan T. Chakaravarthy, Sambuddha Roy
Oblivious Symmetric Alternation. STACS (2006)
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Grid Graph Reachability Problems. Computational Complexity Conference (2006)
Eric Allender, Samir Datta, Sambuddha Roy
The Directed Planar Reachability Problem. FSTTCS (2005)
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Grid Graph Reachability Problems Electron. Colloquium Comput. Complex. (149) (2005)
Eric Allender, Samir Datta, Sambuddha Roy
The Directed Planar Reachability Problem Electron. Colloquium Comput. Complex. (148) (2005)
Eric Allender, Samir Datta, Sambuddha Roy
Topology Inside NC¹. Computational Complexity Conference (2005)
Eric Allender, Samir Datta, Sambuddha Roy
Electron. Colloquium Comput. Complex. (108) (2004)
Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
Derandomization and Distinguishing Complexity. Computational Complexity Conference (2003)
Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
Time-Space Tradeoffs in the Counting Hierarchy. Computational Complexity Conference (2001)
Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
Time-Space Tradeoffs in the Counting Hierarchy Electron. Colloquium Comput. Complex. 8 (41) (2001)