1. Bloom Filters, Adaptivity, and the Dictionary Problem
    M. A. Bender, M. Farach-Colton, M. Goswami, R. Johnson, S. McCauley, and S. Singh.
    Symposium on Foundations of Computer Science (FOCS) 2018. [arXiv]

  2. Efficient Rational Proofs with Strong Utility-Gap Guarantees.
    J. Chen, S. McCauley, and S. Singh.
    Symposium on Algorithmic Game Theory (SAGT) 2018.

  3. Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach
    E. Angel, K. T. Nguyen, and S. Singh.
    Conference on Combinatorial Optimization and Applications (COCOA) 2017. [PDF]
    Received the Best Paper Runner-Up Award.

  4. Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries.
    M. A. Bender, J. Berry, R. Johnson, T. M. Kroeger, S. McCauley, C. A. Phillips, B. Simon, S. Singh, and D Zage.
    Principles of Database Systems (PODS) 2016. [PDF]

  5. Resource Optimization for Program Committee Members: A Subreview Article.
    M. A. Bender, S. McCauley, B. Simon, S. Singh, and F. Vivien.
    Fun with Algorithms (FUN) 2016. [PDF]

  6. The I/O Complexity of Computing Prime Tables.
    M. A. Bender, R. Chowdhury, A. Conway, M. Farach-Colton, P. Ganapathi, R. Johnson, S. McCauley, B. Simon, and S. Singh.
    Latin American Theoretical Informatics Symposium (LATIN) 2016. [PDF]

  7. Rational Proofs with Multiple Provers.
    J. Chen, S. McCauley, and S. Singh.
    Innovations in Theoretical Computer Science (ITCS) 2016. [arXiv][Slides][Poster]

  8. Run Generation Revisited: What Goes Up May or May Not Come Down.
    M. A. Bender, S. McCauley, A. McGregor, S. Singh, and H. Vu.
    International Symposium on Algorithms and Computation (ISAAC) 2015. [arXiv] [Slides] [Poster]

In Preparation

  1. Rational Proofs with Non-Cooperative Provers
    J. Chen, S. McCauley, and S. Singh. [arXiv]

  2. The Online Event-Detection Problem
    M. A. Bender, J. W. Berry, M. Farach-Colton, R. Johnson, T. Kroeger, P. Pandey, C. Phillips and S. Singh. [arxiv]
Back to Home Page