default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamuel McCauley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Samuel McCauley:
Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion. ESA 2024: 88:1-88:19- [c26]Samuel McCauley, Benjamin Moseley, Aidin Niaparast, Shikha Singh:
Incremental Topological Ordering and Cycle Detection with Predictions. ICML 2024 - [c25]Christopher Chung
, William Jannen, Samuel McCauley, Bertrand Simon:
Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees. SPAA 2024: 475-477 - [c24]Matthew D. Laws, Jocelyn Bliven, Kit Conklin, Elyes Laalai, Samuel McCauley, Zach S. Sturdevant:
SPIDER: Improved Succinct Rank and Select Performance. SEA 2024: 21:1-21:18 - [i15]Samuel McCauley, Benjamin Moseley, Aidin Niaparast, Shikha Singh:
Incremental Topological Ordering and Cycle Detection with Predictions. CoRR abs/2402.11028 (2024) - [i14]Christopher Chung, William Jannen, Samuel McCauley, Bertrand Simon:
Root-to-Leaf Scheduling in Write-Optimized Trees. CoRR abs/2404.17544 (2024) - [i13]Matthew D. Laws, Jocelyn Bliven, Kit Conklin, Elyes Laalai, Samuel McCauley, Zach S. Sturdevant:
SPIDER: Improved Succinct Rank and Select Performance. CoRR abs/2405.05214 (2024) - [i12]Samuel McCauley:
Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion. CoRR abs/2407.02468 (2024) - 2023
- [j6]Loris Marchal, Samuel McCauley, Bertrand Simon, Frédéric Vivien:
Minimizing I/Os in Out-of-Core Task Tree Scheduling. Int. J. Found. Comput. Sci. 34(1): 51-80 (2023) - [c23]Samuel McCauley, Benjamin Moseley, Aidin Niaparast, Shikha Singh:
Online List Labeling with Predictions. NeurIPS 2023 - [i11]Samuel McCauley, Benjamin Moseley, Aidin Niaparast, Shikha Singh:
Online List Labeling with Predictions. CoRR abs/2305.10536 (2023) - 2021
- [c22]David J. Lee, Samuel McCauley, Shikha Singh, Max Stein:
Telescoping Filter: A Practical Adaptive Filter. ESA 2021: 60:1-60:18 - [c21]Samuel McCauley:
Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing. ICDT 2021: 21:1-21:22 - [c20]Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. WADS 2021: 556-570 - [i10]Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. CoRR abs/2105.10622 (2021) - [i9]David J. Lee, Samuel McCauley, Shikha Singh, Max Stein:
Telescoping Filter: A Practical Adaptive Filter. CoRR abs/2107.02866 (2021)
2010 – 2019
- 2019
- [c19]Jing Chen, Samuel McCauley, Shikha Singh:
Non-Cooperative Rational Interactive Proofs. ESA 2019: 29:1-29:16 - [i8]Samuel McCauley:
Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing. CoRR abs/1907.01600 (2019) - 2018
- [j5]Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. Theory Comput. Syst. 62(2): 304-318 (2018) - [j4]Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang:
The range 1 query (R1Q) problem. Theor. Comput. Sci. 743: 130-147 (2018) - [c18]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. FOCS 2018: 182-193 - [c17]Samuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh:
Set Similarity Search for Skewed Data. PODS 2018: 63-74 - [c16]Jing Chen, Samuel McCauley, Shikha Singh:
Efficient Rational Proofs with Strong Utility-Gap Guarantees. SAGT 2018: 150-162 - [c15]Samuel McCauley, Francesco Silvestri:
Adaptive MapReduce Similarity Joins. BeyondMR@SIGMOD 2018: 4:1-4:4 - [i7]Samuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh:
Set Similarity Search for Skewed Data. CoRR abs/1804.03054 (2018) - [i6]Samuel McCauley, Francesco Silvestri:
Adaptive MapReduce Similarity Joins. CoRR abs/1804.05615 (2018) - [i5]Jing Chen, Samuel McCauley, Shikha Singh:
Efficient Rational Proofs with Strong Utility-Gap Guarantees. CoRR abs/1807.01389 (2018) - 2017
- [j3]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, K. Scott Hemmert, Samuel McCauley, Branden Moore, Benjamin Moseley, Cynthia A. Phillips, David S. Resnick, Arun Rodrigues:
Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation. J. Parallel Distributed Comput. 102: 213-228 (2017) - [c14]Loris Marchal, Samuel McCauley, Bertrand Simon, Frédéric Vivien:
Minimizing I/Os in Out-of-Core Task Tree Scheduling. IPDPS Workshops 2017: 884-893 - [c13]Vincent Chau, Minming Li, Samuel McCauley, Kai Wang:
Minimizing Total Weighted Flow Time with Calibrations. SPAA 2017: 67-76 - [i4]Jing Chen, Samuel McCauley, Shikha Singh:
Rational Proofs with Non-Cooperative Provers. CoRR abs/1708.00521 (2017) - [i3]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. CoRR abs/1711.01616 (2017) - 2016
- [c12]Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, Frédéric Vivien:
Resource Optimization for Program Committee Members: A Subreview Article. FUN 2016: 7:1-7:20 - [c11]Jing Chen, Samuel McCauley, Shikha Singh:
Rational Proofs with Multiple Provers. ITCS 2016: 237-248 - [c10]Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh:
The I/O Complexity of Computing Prime Tables. LATIN 2016: 192-206 - [c9]Michael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh, David Zage:
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. PODS 2016: 289-302 - [c8]Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley:
Cache-Adaptive Analysis. SPAA 2016: 135-144 - 2015
- [j2]Jie Meng, Samuel McCauley, Fulya Kaplan, Vitus J. Leung, Ayse K. Coskun:
Simulation and optimization of HPC job allocation for jointly reducing communication and cooling costs. Sustain. Comput. Informatics Syst. 6: 48-57 (2015) - [c7]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, K. Scott Hemmert, Samuel McCauley, Branden Moore, Benjamin Moseley, Cynthia A. Phillips, David S. Resnick, Arun Rodrigues:
Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation. IPDPS 2015: 835-846 - [c6]Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu:
Run Generation Revisited: What Goes Up May or May Not Come Down. ISAAC 2015: 703-714 - [c5]Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. WAOA 2015: 183-195 - [i2]Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu:
Run Generation Revisited: What Goes Up May or May Not Come Down. CoRR abs/1504.06501 (2015) - [i1]Jing Chen, Samuel McCauley, Shikha Singh:
Rational Proofs with Multiple Provers. CoRR abs/1504.08361 (2015) - 2014
- [j1]Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley:
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. Theory Comput. Syst. 54(4): 715-730 (2014) - [c4]Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang:
The Range 1 Query (R1Q) Problem. COCOON 2014: 116-128 - [c3]Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley:
Cache-Adaptive Algorithms. SODA 2014: 958-971 - 2013
- [c2]Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, Cynthia A. Phillips:
Efficient scheduling to minimize calibrations. SPAA 2013: 280-287 - 2012
- [c1]Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley:
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. FUN 2012: 28-39
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
