default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSambuddha Roy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Bargav Jayaraman, Esha Ghosh, Melissa Chase, Sambuddha Roy, Wei Dai
, David Evans:
Combing for Credentials: Active Pattern Extraction from Smart Reply. SP 2024: 1443-1461- [i17]Marah I Abdin, Sam Ade Jacobs, Ammar Ahmad Awan, Jyoti Aneja, Ahmed Awadallah, Hany Awadalla, Nguyen Bach, Amit Bahree, Arash Bakhtiari, Harkirat S. Behl, Alon Benhaim, Misha Bilenko, Johan Bjorck, Sébastien Bubeck, Martin Cai, Caio César Teodoro Mendes, Weizhu Chen, Vishrav Chaudhary, Parul Chopra, Allie Del Giorno, Gustavo de Rosa, Matthew Dixon, Ronen Eldan, Dan Iter, Amit Garg, Abhishek Goswami, Suriya Gunasekar, Emman Haider, Junheng Hao, Russell J. Hewett, Jamie Huynh, Mojan Javaheripi, Xin Jin, Piero Kauffmann, Nikos Karampatziakis, Dongwoo Kim, Mahoud Khademi, Lev Kurilenko, James R. Lee, Yin Tat Lee, Yuanzhi Li, Chen Liang, Weishung Liu, Eric Lin, Zeqi Lin, Piyush Madan, Arindam Mitra, Hardik Modi, Anh Nguyen, Brandon Norick, Barun Patra, Daniel Perez-Becker, Thomas Portet, Reid Pryzant, Heyang Qin, Marko Radmilac, Corby Rosset, Sambudha Roy, Olatunji Ruwase, Olli Saarikivi, Amin Saied, Adil Salim, Michael Santacroce, Shital Shah, Ning Shang, Hiteshi Sharma, Xia Song, Masahiro Tanaka, Xin Wang, Rachel Ward, Guanhua Wang, Philipp Witte, Michael Wyatt, Can Xu, Jiahang Xu, Sonali Yadav, Fan Yang, Ziyi Yang, Donghan Yu, Chengruidong Zhang, Cyril Zhang, Jianwen Zhang, Li Lyna Zhang, Yi Zhang, Yue Zhang, Yunan Zhang, Xiren Zhou:
Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone. CoRR abs/2404.14219 (2024) - 2023
- [i16]Shangyu Xie, Wei Dai, Esha Ghosh, Sambuddha Roy, Dan Schwartz, Kim Laine:
Does Prompt-Tuning Language Model Ensure Privacy? CoRR abs/2304.03472 (2023) - 2022
- [i15]Bargav Jayaraman, Esha Ghosh, Huseyin A. Inan, Melissa Chase, Sambuddha Roy, Wei Dai:
Active Data Pattern Extraction Attacks on Generative Language Models. CoRR abs/2207.10802 (2022) - 2021
- [j14]Rajib Biswas, Sambuddha Roy:
Botnet traffic identification using neural networks. Multim. Tools Appl. 80(16): 24147-24171 (2021) - 2020
- [j13]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Scheduling split intervals with non-uniform demands. Discret. Optim. 38: 100611 (2020)
2010 – 2019
- 2018
- [j12]Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambudha Roy, Yogish Sabharwal:
Set Cover Problems with Small Neighborhood Covers. Theory Comput. Syst. 62(8): 1763-1797 (2018) - [j11]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved algorithms for resource allocation under varying capacity. J. Sched. 21(3): 313-325 (2018) - 2015
- [c32]Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy:
Fast Algorithms for Constrained Graph Density Problems. WALCOM 2015: 8-19 - 2014
- [j10]Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:
Approximation algorithms for the partition vertex cover problem. Theor. Comput. Sci. 555: 2-8 (2014) - [c31]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved Algorithms for Resource Allocation under Varying Capacity. ESA 2014: 222-234 - 2013
- [c30]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Scheduling Jobs with Multiple Non-uniform Tasks. Euro-Par 2013: 90-101 - [c29]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: 249-261 - [c28]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy:
Knapsack Cover Subject to a Matroid Constraint. FSTTCS 2013: 275-286 - [c27]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: 973-984 - [c26]Jagabondhu Hazra, Sambuddha Roy, Zainul Charbiwala, Deva P. Seetharam, Yogish Sabharwal, Saiful A. Husain, Sathyajith Mathew:
Energy delivery networks. SmartGridComm 2013: 744-749 - [c25]Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:
Approximation Algorithms for the Partition Vertex Cover Problem. WALCOM 2013: 137-145 - [i14]Suman Kalyan Bera, Anamitra R. Choudhury, Syamantak Das, Sambuddha Roy, Jayram S. Thatchachar:
Fenchel Duals for Drifting Adversaries. CoRR abs/1309.5904 (2013) - [i13]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 abs/1312.7217 (2013) - 2012
- [c24]Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Executing a Partial Set of Jobs. FSTTCS 2012: 199-210 - [c23]Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. FSTTCS 2012: 236-248 - [c22]Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal:
Distributed algorithms for scheduling on line and tree networks. PODC 2012: 345-354 - [i12]Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal:
Distributed Algorithms for Scheduling on Line and Tree Networks. CoRR abs/1205.1924 (2012) - [i11]Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. CoRR abs/1207.5215 (2012) - [i10]Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Executing a Partial Set of Jobs. CoRR abs/1210.2906 (2012) - 2011
- [j9]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Arthur and Merlin as Oracles. Comput. Complex. 20(3): 505-558 (2011) - [j8]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): 14-40 (2011) - [j7]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): 15:1-15:22 (2011) - [c21]Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Throughput Maximization. APPROX-RANDOM 2011: 111-122 - [c20]Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal:
Resource Allocation for Covering Time Varying Demands. ESA 2011: 543-554 - [c19]Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Neha Sengupta:
Maximizing throughput of jobs with multiple resource requirements. HiPC 2011: 1-9 - [c18]Pradipta De, Sambuddha Roy:
VMSpreader: Multi-tier application resiliency through virtual machine striping. Integrated Network Management 2011: 185-192 - [c17]Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy:
Contact Center Scheduling with Strict Resource Requirements. IPCO 2011: 156-169 - [c16]Venkatesan T. Chakaravarthy, Gyana R. Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar:
Minimum Cost Resource Allocation for Meeting Job Requirements. IPDPS 2011: 14-23 - [i9]Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:
Approximation Algorithms for Edge Partitioned Vertex Cover Problems. CoRR abs/1112.1945 (2011) - 2010
- [j6]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): 5 (2010) - [j5]Samir Datta, Raghav Kulkarni, Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47(3): 737-757 (2010) - [c15]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
Finding Independent Sets in Unions of Perfect Graphs. FSTTCS 2010: 251-259
2000 – 2009
- 2009
- [j4]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Space-Efficient Counting in Graphs on Surfaces. Comput. Complex. 18(4): 601-649 (2009) - [j3]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Approximating maximum weight K-colorable subgraphs in chordal graphs. Inf. Process. Lett. 109(7): 365-368 (2009) - [j2]Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675-723 (2009) - [c14]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: 104-111 - [c13]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
Approximating Decision Trees with Multiway Branches. ICALP (1) 2009: 210-221 - [i8]Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy:
The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Electron. Colloquium Comput. Complex. TR09 (2009) - [i7]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Arthur and Merlin as Oracles. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c12]Vinayaka Pandit, Natwar Modani, Sougata Mukherjea, Amit Anil Nanavati, Sambuddha Roy, Amit Agarwal:
Extracting dense communities from telecom call graphs. COMSWARE 2008: 82-89 - [c11]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Arthur and Merlin as Oracles. MFCS 2008: 229-240 - [c10]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Finding Irrefutable Certificates for S2p via Arthur and Merlin. STACS 2008: 157-168 - [c9]Samir Datta, Raghav Kulkarni, Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240 - [i6]Samir Datta, Raghav Kulkarni, Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. CoRR abs/0802.2850 (2008) - 2007
- [j1]Sambuddha Roy, William Steiger:
Some Combinatorial and Algorithmic Applications of the Borsuk-Ulam Theorem. Graphs Comb. 23(Supplement-1): 331-341 (2007) - [c8]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Parity Problems in Planar Graphs. CCC 2007: 222-235 - [c7]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania:
Decision trees for entity identification: approximation algorithms and hardness results. PODS 2007: 53-62 - [i5]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Parity Problems in Planar Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c6]Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Grid Graph Reachability Problems. CCC 2006: 299-313 - [c5]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Oblivious Symmetric Alternation. STACS 2006: 230-241 - 2005
- [c4]Eric Allender, Samir Datta, Sambuddha Roy:
Topology Inside NC¹. CCC 2005: 298-307 - [c3]Eric Allender, Samir Datta, Sambuddha Roy:
The Directed Planar Reachability Problem. FSTTCS 2005: 238-249 - [i4]Eric Allender, Samir Datta, Sambuddha Roy:
The Directed Planar Reachability Problem. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Grid Graph Reachability Problems. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i2]Eric Allender, Samir Datta, Sambuddha Roy:
Topology inside NC1. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c2]Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy:
Derandomization and Distinguishing Complexity. CCC 2003: 209-220 - 2001
- [c1]Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy. CCC 2001: 295-302 - [i1]Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy. Electron. Colloquium Comput. Complex. TR01 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
