Sambuddha Roy

Computer Science · Physical Sciences

13h-index484citations52works2.52yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(28), Advanced Graph Theory Research(21), Optimization and Search Problems(21), Scheduling and Optimization Algorithms(9), Computational Geometry and Mesh Generation(5)

Publications52 total

Phi-4-Mini Technical Report: Compact yet Powerful Multimodal Language Models via Mixture-of-LoRAs
arXiv (Cornell University)·2025· 3 citedOpen Access
Combing for Credentials: Active Pattern Extraction from Smart Reply
2024· 2 cited
Does Prompt-Tuning Language Model Ensure Privacy?
arXiv (Cornell University)·2023· 1 citedOpen Access
Combing for Credentials: Active Pattern Extraction from Smart Reply
arXiv (Cornell University)·2022· 3 citedOpen Access
Botnet traffic identification using neural networks
Multimedia Tools and Applications·2021· 31 cited
Scheduling split intervals with non-uniform demands
Discrete Optimization·2020
Fast Algorithms for Constrained Graph Density Problems
Lecture notes in computer science·2015
Approximation algorithms for the partition vertex cover problem
Theoretical Computer Science·2014· 20 cited
Improved Algorithms for Resource Allocation under Varying Capacity
Lecture notes in computer science·2014· 17 cited
Distributed and Parallel Algorithms for Set Cover Problems with Small\n Neighborhood Covers
arXiv (Cornell University)·2013Open Access
Fenchel Duals for Drifting Adversaries
arXiv (Cornell University)·2013· 2 citedOpen Access
Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths
2013· 2 cited
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2013· 2 citedOpen Access
Scheduling Jobs with Multiple Non-uniform Tasks
Lecture notes in computer science·2013· 4 citedOpen Access
Approximation Algorithms for the Partition Vertex Cover Problem
Lecture notes in computer science·2013· 3 cited
Knapsack Cover Subject to a Matroid Constraint
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2013· 5 citedOpen Access
Scheduling Resources for Executing a Partial Set of Jobs
arXiv (Cornell University)·2012Open Access
Density Functions subject to a Co-Matroid Constraint
arXiv (Cornell University)·2012· 1 citedOpen Access
Distributed algorithms for scheduling on line and tree networks
2012· 3 cited
Distributed Algorithms for Scheduling on Line and Tree Networks
arXiv (Cornell University)·2012Open Access
page 1 of 3Next →

Frequent Co-authors

Venkatesan T. Chakaravarthy(23), Yogish Sabharwal(16), Eric Allender(9), Amit Kumar(7), Anamitra R. Choudhury(7), Vinayaka Pandit(6), Samir Datta(6), Raghav Kulkarni(4), Suman K. Bera(4), Shalmoli Gupta(4), Natwar Modani(3), Gyana R. Parija(3), Michal Koucký(3), Detlef Ronneburger(3), Mark Braverman(3), Sivaramakrishnan R. Natarajan(3), Esha Ghosh(3), Wei Dai(3), Pranjal Awasthi(2), Mukesh Mohania(2)