Amitabha Roy
Assistant Professor, 
Computer Science Dept, 
Boston College.

Office: Fulton 460A
phone: 617.552.6452
Email: aroy  AT cs.bc.edu

Computer Science Department
Fulton 460, Boston College
140 Commonwealth Avenue
Chestnut Hill, MA 02467
Fax: +1.617.552.6790

Circuit complexity, finite model theory, computational algebra and its applications to search and optimization, extremal combinatorics.

Frederic Green, Howard Straubing, David Joslin, Matthew Ginsberg, Eugene Luks, Steve Miller, James Crawford, Leo Kontorovich, Eduardo Duenez.

PDF

• Models of Virus Propagation, by L. Kontorovich, S. Miller, A. Roy, in progress.
  
  
• The Uniqueness of Optimal Mod 3 Circuits for Parity , by F. Green and A. Roy, submitted.
  
  
• Combinatorics of Symmetry-Breaking, by A. Roy (2007), submitted.
  
  
• Symmetry-Breaking Formulas for Groups with Bounded Orbit Projections , by A. Roy, to appear in the Seventh International Workshop on Symmetry and Constraint Satisfaction Problems (SymCon '07), 2007.
  
  
• Definability of Languages by Generalized First-Order Formulas over (N,+) , by A. Roy and H. Straubing, SIAM Journal on Computing, 37 (2), 502-521, 2007.
  
  
• Incomplete Exponential Sums in Several Variables by E. Duenez, S. Miller, A. Roy and H. Straubing, Journal of Number Theory, 116 (2006), no. 1, 168--199. [Read AMS Mathscinet Review: MR2197866 (2007c:11092)]
  
  
• Definability of First Order Languages over (N, +), by A. Roy, H. Straubing, STACS 2006. Appeared in Lecture Notes in Computer Science (LNCS) 3884, 489-499.
  
  
• Combinatorics of Singly Repairable Families, by E. M. Luks, A. Roy, Electronic Journal of Combinatorics (2005) , Volume 12(1), R59. [Read AMS Mathscinet Review: MR2180796 (2006f:94047) or Zentralbatt Review: an:1081.05102]
  
  
• Bounds on an exponential sum arising in boolean circuit complexity by F. Green, A. Roy, H. Straubing, Comptes Rendus Mathematique, C.R. Acad. Sci. Paris, Ser I 341(2005), pages 279-282.
  [Read AMS Mathscinet Review: MR2166139 (2006e:11117) ]
  
  
• Fault Tolerant Boolean Satisfiability, by A. Roy, Journal of Artificial Intelligence Research (JAIR), v. 25 (2006), 503-527.
  
  
• The complexity of symmetry breaking formulas by E. M. Luks, A. Roy, Annals of Mathematics and Artificial Intelligence, 41:19-45, 2004.
  
  
• Symmetry Breaking in Constraint Satisfaction by E. M. Luks, A. Roy, appeared in the 7th International Conference of Artificial Intelligence and Mathematics, Ft. Lauderdale, Florida, Jan 2-4, 2002.
  
  
• Symmetry Breaking and Fault Tolerance in Boolean Satisfiability, by Amitabha Roy, PhD. dissertation, University of Oregon.
  
  
• Supermodels and Robustness by M. Ginsberg, A. Parkes and A. Roy, AAAI 98.
  
  
• Exploiting symmetries in lifted CSPs by D. Joslin and A. Roy, AAAI 97.
  
  
• Symmetry Breaking Predicates for Search Problems by James Crawford, Matt Ginsberg, Eugene M. Luks, Amitabha Roy, KR 96.

   

American Mathematical Society, Mathematical Association of America.

Current Semester: Discrete Mathematics (Webct) [BC Access Only]

Past Semesters:
Discrete Mathematics, Algorithms, Theory of Computation, Computer Science I and II, Computer Algebra.