About Me

My Name

Publications & Manuscripts

  1. On Isomorphism Testing of Groups with Normal Hall Subgroups
    Youming Qiao and Jayalal Sarma M.N. and Bangsheng Tang
    The 28th Symposium on Theoretical Aspects of Computer Science (STACS), 2011
  2. Some Remarks on the Incompressibility of Width-Parameterized SAT Instances
    Bangsheng Tang
    The Sixth International Frontiers of Algorithmics Workshop (FAW), 2012
  3. Exponential Lower Bounds for the PPSZ k-SAT Algorithm
    Shiteng Chen, Dominik Scheder, Navid Talebanfard and Bangsheng Tang
    ACM-SIAM Symposium on Discrete Algorithms (SODA13), 2013
  4. Some Trade-off Results for Polynomial Calculus
    Chris Beck, Jakob Nordström and Bangsheng Tang
    The 45th ACM Symposium on Theory of Computing (STOC 2013), 2013
  5. Width-parameterized SAT: Time-Space Tradeoffs
    Eric Allender, Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou and Bangsheng Tang
    Accepted with Revision to Theory of Computing
  6. Towards Efficient Group Isomorphism Testing
    Periklis A. Papakonstantinou, Youming Qiao and Bangsheng Tang


  1. On Isomorphism Testing of Groups with Normal Hall Subgroups. STACS 2011, Dortmund.
  2. Width-parameterized SAT: Time-Space Tradeoffs. CTW 2011, Aarhus.

Teaching Assistant

  1. Advanced Algorithms, 2009 Spring, Lecturer: Elad Verbin
  2. Advanced Algorithms, 2010 Spring, Lecturers: Frans Schalekamp, Anke van Zuylen
  3. Advanced Theoretical Computer Science II, 2011 Spring, Lecturers: Andrew Wan, John Steinberger
  4. Advanced Algorithms, 2012 Fall, Lecturer: Periklis A. Papakonstantinou

Last modified: Sun Jul 28 17:48:06 CST 2013