Sambuddha Roy

发表

Extracting dense communities from telecom call graphs

Sougata Mukherjea, Sambuddha Roy, Amit Agarwal, 2008, 2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08).

Complexity theoretic aspects of planar restrictions and obliviousness

E. Allender, Sambuddha Roy, 2006 .

Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs

Raghav Kulkarni, Samir Datta, Sambuddha Roy, 2008, Theory of Computing Systems.

Active Data Pattern Extraction Attacks on Generative Language Models

Huseyin A. Inan, Wei Dai, Melissa Chase, 2022, ArXiv.

Combing for Credentials: Active Pattern Extraction from Smart Reply

Huseyin A. Inan, Melissa Chase, Bargav Jayaraman, 2022, 2207.10802.

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Eric Allender, Sambuddha Roy, Michal Koucký, 2009, J. Comput. Syst. Sci..

Botnet traffic identification using neural networks

Sambuddha Roy, Rajib Biswas, Sambuddha Roy, 2021, Multimedia Tools and Applications.

Scheduling split intervals with non-uniform demands

Anamitra R. Choudhury, Yogish Sabharwal, Sambuddha Roy, 2020, Discret. Optim..

Scheduling Resources for Executing a Partial Set of Jobs pdf

Yogish Sabharwal, Sambuddha Roy, Venkatesan T. Chakaravarthy, 2012, FSTTCS.

Arthur and Merlin as Oracles

Sambuddha Roy, Venkatesan T. Chakaravarthy, Sambuddha Roy, 2008, computational complexity.

Time-space tradeoffs in the counting hierarchy

Eric Allender, V. Vinay, Sambuddha Roy, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Derandomization and distinguishing complexity

Eric Allender, Sambuddha Roy, Michal Koucký, 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

Does Prompt-Tuning Language Model Ensure Privacy?

Kim Laine, Sambuddha Roy, Wei Dai, 2023, ArXiv.

Grid graph reachability problems

Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

Approximation algorithms for the partition vertex cover problem

Amit Kumar, Sambuddha Roy, Shalmoli Gupta, 2013, Theor. Comput. Sci..

Minimum Cost Resource Allocation for Meeting Job Requirements

Amit Kumar, Yogish Sabharwal, Sambuddha Roy, 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

Approximating maximum weight K-colorable subgraphs in chordal graphs

Sambuddha Roy, Venkatesan T. Chakaravarthy, Sambuddha Roy, 2009, Inf. Process. Lett..

Decision trees for entity identification: approximation algorithms and hardness results

Mukesh K. Mohania, Sambuddha Roy, Venkatesan T. Chakaravarthy, 2007, TALG.

Finding Irrefutable Certificates for S2p via Arthur and Merlin

Sambuddha Roy, Venkatesan T. Chakaravarthy, Sambuddha Roy, 2008, STACS.

Decision trees for entity identification: Approximation algorithms and hardness results

Venkatesan T. Chakaravarthy, Vinayaka Pandit, Pranjal Awasthi, 2011, TALG.

VMSpreader: Multi-tier application resiliency through virtual machine striping

Pradipta De, Sambuddha Roy, Sambuddha Roy, 2011, 12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops.

Fenchel Duals for Drifting Adversaries pdf

Anamitra R. Choudhury, Sambuddha Roy, Syamantak Das, 2013, ArXiv.

Energy delivery networks

Yogish Sabharwal, Sambuddha Roy, Zainul Charbiwala, 2013, 2013 IEEE International Conference on Smart Grid Communications (SmartGridComm).