Sambuddha Roy

According to our database1, Sambuddha Roy authored at least 48 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone.
CoRR, 2024

Combing for Credentials: Active Pattern Extraction from Smart Reply.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

2023
Does Prompt-Tuning Language Model Ensure Privacy?
CoRR, 2023

2022
Active Data Pattern Extraction Attacks on Generative Language Models.
CoRR, 2022

2021
Botnet traffic identification using neural networks.
Multim. Tools Appl., 2021

2020
Scheduling split intervals with non-uniform demands.
Discret. Optim., 2020

2018
Improved algorithms for resource allocation under varying capacity.
J. Sched., 2018

Set Cover Problems with Small Neighborhood Covers.
Theory Comput. Syst., 2018

2015
Fast Algorithms for Constrained Graph Density Problems.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Approximation algorithms for the partition vertex cover problem.
Theor. Comput. Sci., 2014

2013
Fenchel Duals for Drifting Adversaries.
CoRR, 2013

Energy delivery networks.
Proceedings of the IEEE Fourth International Conference on Smart Grid Communications, 2013

Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Knapsack Cover Subject to a Matroid Constraint.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Scheduling Jobs with Multiple Non-uniform Tasks.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012
Distributed algorithms for scheduling on line and tree networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Scheduling Resources for Executing a Partial Set of Jobs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Density Functions subject to a Co-Matroid Constraint.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Decision trees for entity identification: Approximation algorithms and hardness results.
ACM Trans. Algorithms, 2011

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory.
J. Comput. Syst. Sci., 2011

Approximation Algorithms for Edge Partitioned Vertex Cover Problems
CoRR, 2011

Arthur and Merlin as Oracles.
Comput. Complex., 2011

Minimum Cost Resource Allocation for Meeting Job Requirements.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Contact Center Scheduling with Strict Resource Requirements.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

VMSpreader: Multi-tier application resiliency through virtual machine striping.
Proceedings of the 12th IFIP/IEEE International Symposium on Integrated Network Management, 2011

Maximizing throughput of jobs with multiple resource requirements.
Proceedings of the 18th International Conference on High Performance Computing, 2011

Resource Allocation for Covering Time Varying Demands.
Proceedings of the Algorithms - ESA 2011, 2011

Scheduling Resources for Throughput Maximization.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
Theory Comput. Syst., 2010

Effective decision support systems for workforce deployment.
IBM J. Res. Dev., 2010

Finding Independent Sets in Unions of Perfect Graphs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Planar and Grid Graph Reachability Problems.
Theory Comput. Syst., 2009

Approximating maximum weight K-colorable subgraphs in chordal graphs.
Inf. Process. Lett., 2009

Space-Efficient Counting in Graphs on Surfaces.
Comput. Complex., 2009

Approximating Decision Trees with Multiway Branches.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Effective Decision Support for Workforce Deployment Service Systems.
Proceedings of the 2009 IEEE International Conference on Services Computing (SCC 2009), 2009

2008
Finding Irrefutable Certificates for S<sub>2</sub><sup>p</sup> via Arthur and Merlin.
Proceedings of the STACS 2008, 2008

Extracting dense communities from telecom call graphs.
Proceedings of the Third International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2008), 2008

2007
Some Combinatorial and Algorithmic Applications of the Borsuk-Ulam Theorem.
Graphs Comb., 2007

Parity Problems in Planar Graphs.
Electron. Colloquium Comput. Complex., 2007

2006
Oblivious Symmetric Alternation.
Proceedings of the STACS 2006, 2006

2005
Grid Graph Reachability Problems
Electron. Colloquium Comput. Complex., 2005

The Directed Planar Reachability Problem
Electron. Colloquium Comput. Complex., 2005

Topology Inside NC¹.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004
Topology inside NC<sup>1</sup>
Electron. Colloquium Comput. Complex., 2004

2003
Derandomization and Distinguishing Complexity.
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2001
Time-Space Tradeoffs in the Counting Hierarchy
Electron. Colloquium Comput. Complex., 2001


  Loading...