Sam McCauley
Sam McCauley
Conference Publications:
  1. Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
    S. McCauley
    European Symposium on Algorithms (ESA), 2024.
    [
    arXiv]     [pdf]     [bibtex]

  2. Incremental Topological Ordering and Cycle Detection with Predictions
    S. McCauley, B. Moseley, A. Niaparast, and S. Singh
    International Conference on Machine Learning (ICML), 2024.
    [arXiv]     [bibtex]

  3. Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees
    C. Chung, W. Jannen, S. McCauley, and B. Simon
    Symposium on Parellelism in Algorithms and Architectures (SPAA), 2024.
    [arXiv]     [bibtex]

  4. SPIDER: Improved Succinct Rank and Select Performance
    M. D. Laws, J. Bliven, K. Conklin, E. Laalai, S. McCauley, and Z. S. Sturdevant
    Symposium on Experimental Algorithms (SEA), 2024.
    [pdf]     [arXiv]     [bibtex]

  5. Online List Labelling with Predictions
    S. McCauley, B. Moseley, A. Niaparast, and S. Singh
    Neural Information Processing Systems (NeurIPS), 2023.
    [arXiv]     [bibtex]

  6. Telescoping Filter: A Practical Adaptive Filter
    D. J. Lee, S. McCauley, S. Singh, and M. Stein
    European Symposium on Algorithms (ESA), 2021.
    [arXiv]     [bibtex]

  7. Support Optimality and Adaptive Cuckoo Filters
    T. Kopelowitz, S. McCauley, and E. Porat
    Algorithms and Data Structures Symposium (WADS), 2021.
    [arXiv]     [bibtex]

  8. Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing
    S. McCauley
    International Conference on Database Theory (ICDT), 2021.
    [arXiv]     [pdf]     [bibtex]

  9. Non-Cooperative Rational Interactive Proofs
    J. Chen, S. McCauley, and S. Singh
    European Symposium on Algorithms (ESA), 2019.
    [arXiv]     [bibtex]

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

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

  12. Set Similarity Search for Skewed Data
    S. McCauley, J. W. Mikkelsen, and R. Pagh
    Principles of Database Systems (PODS), 2018.
    [arXiv]     [bibtex]

  13. Adaptive MapReduce Similarity Joins (extended abstract)
    S. McCauley and F. Silvestri
    Algorithms and Systems for MapReduce and Beyond (BeyondMR), 2018.
    [arXiv]     [bibtex]

  14. Minimizing Total Weighted Flow Time With Calibrations
    V. Chau, M. Li, S. McCauley, and K. Wang
    Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017.
    [pdf]         [bibtex]

  15. Minimizing I/Os in Out-of-Core Task Tree Scheduling
    L. Marchal, S. McCauley, B. Simon, and F. Vivien
    Workshop on Advances in Parallel and Distributed Computational Models (APDCM), 2017.
    [pdf]         [bibtex]

  16. Cache-Adaptive Analysis
    M. A. Bender, E. D. Demaine, R. Ebrahimi, J. T. Fineman, R. Johnson, A. Lincoln, J. Lynch, and S. McCauley
    Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.
    [pdf]         [bibtex]

  17. 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]         [bibtex]

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

  19. 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]         [bibtex]

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

  21. Run Generation Revisted: 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]     [bibtex]

  22. Scheduling Parallel Jobs Online with Convex and Concave Parallelizability.
    R. Ebrahimi, S. McCauley, and B. Moseley.
    Workshop on Approximation and Online Algorithms (WAOA), 2015.
    [pdf]         [bibtex]

  23. Two-Level Main Memory Co-Design: Multi-Threaded Algorithmic Primitives, Analysis, and Simulation.
    M. A. Bender, J. Berry, S. D. Hammond, K. S. Hemmert, S. McCauley, B. Moore, B. Moseley, C. A. Phillips, D. Resnick, and A. Rodrigues.
    International Parallel and Distributed Processing Symposium (IPDPS), 2015.
    Selected as Best Paper.
    [pdf]         [bibtex]

  24. The Range 1 Query (R1Q) Problem.
    M. A. Bender, R. Chowdhury, P. Ganapathi, S. McCauley, and Y. Tang.
    International Computing and Combinatorics Conference (COCOON), 2014.
    [pdf]         [bibtex]

  25. Cache-Adaptive Algorithms.
    M. A. Bender, R. Ebrahimi, J. T. Fineman, G. Ghasemiesfeh, R. Johnson, and S. McCauley.
    Symposium on Discrete Algorithms (SODA), 2014.
    [pdf]         [bibtex]

  26. Efficient Scheduling to Minimize Calibrations.
    M. A. Bender, D. P. Bunde, V. J. Leung, S. McCauley, and C. A. Phillips.
    Symposium on Parallelsm in Algorithms and Architectures (SPAA), 2013.
    [pdf]         [bibtex]

  27. The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye.
    M. A. Bender, R. Bose, R. Chowdhury, and S. McCauley.
    International Conference on Fun with Algorithms (FUN), 2012.
    [pdf]         [bibtex]

Journal Publications:
  1. Minimizing I/Os in Out-of-Core Task Tree Scheduling
    L. Marchal, S. McCauley, B. Simon, and F. Vivien.
    International Journal of Foundations of Computer Science (IFJCS), 2023.
    [
    bibtex]

  2. Two-Level Main Memory Co-Design: Multi-Threaded Algorithmic Primitives, Analysis, and Simulation.
    M. A. Bender, J. Berry, S. D. Hammond, K. S. Hemmert, S. McCauley, B. Moore, B. Moseley, C. A. Phillips, D. Resnick, and A. Rodrigues.
    Journal of Parallel and Distributed Computing (JPDC), 2017.
    [bibtex]

  3. Scheduling Parallel Jobs Online with Convex and Concave Parallelizability.
    R. Ebrahimi, S. McCauley, and B. Moseley.
    Theory of Computing Systems (TOCS) Special Issue for Workshop on Approximation and Online Algorithms, 2016.
    [pdf]         [bibtex]

  4. The Range 1 Query (R1Q) Problem.
    M. A. Bender, R. Chowdhury, P. Ganapathi, S. McCauley, and Y. Tang.
    Theoretical Computer Science (TCS) Special Issue for Computing and Combinatorics Conference, 2016.
    [bibtex]

  5. Simulation and Optimization of HPC Job Allocation for Reducing Communication and Cooling Costs.
    J. Meng, S. McCauley, F. Kaplan, V. Leung, and A. K. Coskun. (Non-alphabetical ordering)
    Sustainable Computing: Informatics and Systems (SUSCOM) Special Issue for International Green Computing Conference, June 2015.
    [pdf]         [bibtex]

  6. The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye.
    M. A. Bender, R. Bose, R. Chowdhury, and S. McCauley.
    Theory of Computing Systems (TOCS) Special Issue on Fun With Algorithms, May 2013.
    [pdf]         [bibtex]