Time-Space Tradeoffs in the Counting Hierarchy - Eric Allender; Michal Koucký 001; Detlef Ronneburger; Sambuddha Roy; V. Vinay (Electron. Colloquium Comput. Complex., 2001)

Derandomization and Distinguishing Complexity. - Eric Allender; Michal Koucký 001; Detlef Ronneburger; Sambuddha Roy (CCC, 2003)

Topology inside NC1 - Eric Allender; Samir Datta; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2004)

Topology Inside NC¹. - Eric Allender; Samir Datta; Sambuddha Roy (CCC, 2005)

The Directed Planar Reachability Problem - Eric Allender; Samir Datta; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2005)

Grid Graph Reachability Problems - Eric Allender; David A. Mix Barrington; Tanmoy Chakraborty 001; Samir Datta; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2005)

Oblivious Symmetric Alternation. - Venkatesan T. Chakaravarthy; Sambuddha Roy (STACS, 2006)

Parity Problems in Planar Graphs. - Mark Braverman; Raghav Kulkarni; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2007)

Some Combinatorial and Algorithmic Applications of the Borsuk-Ulam Theorem. - Sambuddha Roy; William Steiger (Graphs Comb., 2007)

Extracting dense communities from telecom call graphs. - Vinayaka Pandit; Natwar Modani; Sougata Mukherjea; Amit Anil Nanavati; Sambuddha Roy; Amit Agarwal (COMSWARE, 2008)

Finding Irrefutable Certificates for S2p via Arthur and Merlin. - Venkatesan T. Chakaravarthy; Sambuddha Roy (STACS, 2008)

Effective Decision Support for Workforce Deployment Service Systems. - Kashyap Dixit; Munish Goyal; Pranav Gupta; Nanda Kambhatla; Rohit Lotlikar; Debapriyo Majumdar; Gyana R. Parija; Sambuddha Roy; Soujanya Soni (IEEE SCC, 2009)

Approximating Decision Trees with Multiway Branches. - Venkatesan T. Chakaravarthy; Vinayaka Pandit; Sambuddha Roy; Yogish Sabharwal (ICALP (1), 2009)

Space-Efficient Counting in Graphs on Surfaces. - Mark Braverman; Raghav Kulkarni; Sambuddha Roy (Comput. Complex., 2009)

Approximating maximum weight K-colorable subgraphs in chordal graphs. - Venkatesan T. Chakaravarthy; Sambuddha Roy (Inf. Process. Lett., 2009)

Planar and Grid Graph Reachability Problems. - Eric Allender; David A. Mix Barrington; Tanmoy Chakraborty 001; Samir Datta; Sambuddha Roy (Theory Comput. Syst., 2009)

Finding Independent Sets in Unions of Perfect Graphs. - Venkatesan T. Chakaravarthy; Vinayaka Pandit; Sambuddha Roy; Yogish Sabharwal (FSTTCS, 2010)

Effective decision support systems for workforce deployment. - 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 (IBM J. Res. Dev., 2010)

Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. - Samir Datta; Raghav Kulkarni; Sambuddha Roy (Theory Comput. Syst., 2010)

Scheduling Resources for Throughput Maximization. - Venkatesan T. Chakaravarthy; Amit Kumar 001; Vinayaka Pandit; Sambuddha Roy; Yogish Sabharwal (APPROX-RANDOM, 2011)

Resource Allocation for Covering Time Varying Demands. - Venkatesan T. Chakaravarthy; Amit Kumar 001; Sambuddha Roy; Yogish Sabharwal (ESA, 2011)

Maximizing throughput of jobs with multiple resource requirements. - Venkatesan T. Chakaravarthy; Sambuddha Roy; Yogish Sabharwal; Neha Sengupta (HiPC, 2011)

VMSpreader: Multi-tier application resiliency through virtual machine striping. - Pradipta De; Sambuddha Roy (Integrated Network Management, 2011)

Contact Center Scheduling with Strict Resource Requirements. - Aman Dhesi; Pranav Gupta; Amit Kumar 001; Gyana R. Parija; Sambuddha Roy (IPCO, 2011)

Minimum Cost Resource Allocation for Meeting Job Requirements. - Venkatesan T. Chakaravarthy; Gyana R. Parija; Sambuddha Roy; Yogish Sabharwal; Amit Kumar 001 (IPDPS, 2011)

Arthur and Merlin as Oracles. - Venkatesan T. Chakaravarthy; Sambuddha Roy (Comput. Complex., 2011)

Approximation Algorithms for Edge Partitioned Vertex Cover Problems - Suman Kalyan Bera; Shalmoli Gupta; Amit Kumar 001; Sambuddha Roy (CoRR, 2011)

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. - Eric Allender; Michal Koucký 001; Detlef Ronneburger; Sambuddha Roy (J. Comput. Syst. Sci., 2011)

Decision trees for entity identification: Approximation algorithms and hardness results. - Venkatesan T. Chakaravarthy; Vinayaka Pandit; Sambuddha Roy; Pranjal Awasthi; Mukesh K. Mohania (ACM Trans. Algorithms, 2011)

Density Functions subject to a Co-Matroid Constraint. - Venkatesan T. Chakaravarthy; Natwar Modani; Sivaramakrishnan R. Natarajan; Sambuddha Roy; Yogish Sabharwal (FSTTCS, 2012)

Scheduling Resources for Executing a Partial Set of Jobs. - Venkatesan T. Chakaravarthy; Arindam Pal 001; Sambuddha Roy; Yogish Sabharwal (FSTTCS, 2012)

Distributed algorithms for scheduling on line and tree networks. - Venkatesan T. Chakaravarthy; Sambuddha Roy; Yogish Sabharwal (PODC, 2012)

Scheduling Jobs with Multiple Non-uniform Tasks. - Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Sambuddha Roy; Yogish Sabharwal (Euro-Par, 2013)

Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. - Archita Agarwal; Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Sambuddha Roy; Yogish Sabharwal (FSTTCS, 2013)

Knapsack Cover Subject to a Matroid Constraint. - Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Sivaramakrishnan R. Natarajan; Sambuddha Roy (FSTTCS, 2013)

Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths. - Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Sambuddha Roy; Yogish Sabharwal (IPDPS, 2013)

Energy delivery networks. - Jagabondhu Hazra; Sambuddha Roy; Zainul Charbiwala; Deva P. Seetharam; Yogish Sabharwal; Saiful A. Husain; Sathyajith Mathew (SmartGridComm, 2013)

Fenchel Duals for Drifting Adversaries. - Suman Kalyan Bera; Anamitra R. Choudhury; Syamantak Das; Sambuddha Roy; Jayram S. Thatchachar (CoRR, 2013)

Approximation algorithms for the partition vertex cover problem. - Suman Kalyan Bera; Shalmoli Gupta; Amit Kumar 001; Sambuddha Roy (Theor. Comput. Sci., 2014)

Fast Algorithms for Constrained Graph Density Problems. - Venkatesan T. Chakaravarthy; Neelima Gupta; Aditya Pancholi; Sambuddha Roy (WALCOM, 2015)

Set Cover Problems with Small Neighborhood Covers. - Archita Agarwal; Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Sambudha Roy; Yogish Sabharwal (Theory Comput. Syst., 2018)

Improved algorithms for resource allocation under varying capacity. - Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Shalmoli Gupta; Sambuddha Roy; Yogish Sabharwal (J. Sched., 2018)

Scheduling split intervals with non-uniform demands. - Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Sambuddha Roy; Yogish Sabharwal (Discret. Optim., 2020)

Botnet traffic identification using neural networks. - Rajib Biswas; Sambuddha Roy (Multim. Tools Appl., 2021)

Active Data Pattern Extraction Attacks on Generative Language Models. - Bargav Jayaraman; Esha Ghosh; Huseyin A. Inan; Melissa Chase; Sambuddha Roy; Wei Dai 007 (CoRR, 2022)

Does Prompt-Tuning Language Model Ensure Privacy? - Shangyu Xie; Wei Dai 007; Esha Ghosh; Sambuddha Roy; Dan Schwartz; Kim Laine (CoRR, 2023)

Combing for Credentials: Active Pattern Extraction from Smart Reply. - Bargav Jayaraman; Esha Ghosh; Melissa Chase; Sambuddha Roy; Wei Dai 007; David Evans 001 (SP, 2024)

Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone. - Marah I Abdin; Sam Ade Jacobs; Ammar Ahmad Awan; Jyoti Aneja; Ahmed Awadallah 001; Hany Awadalla; Nguyen Bach; Amit Bahree; Arash Bakhtiari; Harkirat S. Behl; Alon Benhaim; Misha Bilenko; et al. (CoRR, 2024)

Phi-4-Mini Technical Report: Compact yet Powerful Multimodal Language Models via Mixture-of-LoRAs. - Abdelrahman Abouelenin; Atabak Ashfaq; Adam Atkinson; Hany Awadalla; Nguyen Bach; Jianmin Bao; Alon Benhaim; Martin Cai; Vishrav Chaudhary; Congcong Chen; Dong Chen 003; Dongdong Chen 001; et al. (CoRR, 2025)