%% This BibTeX bibliography file was created using BibDesk.
%% https://bibdesk.sourceforge.io/

%% Created for Michael Bender at 2026-03-01 14:18:07 -0500 


%% Saved with string encoding Unicode (UTF-8) 

Here are the BibTeX entries for your two citations:

```bibtex
@inproceedings{BenderFeFa26,
  author    = {Michael A. Bender and Guy E. Blelloch and Mart\'{\i}n Farach-Colton and Yang Hu and Rob Johnson and Rotem Oshman and Renfei Zhou},
  title     = {Fast Concurrent Primitives Despite Contention},
  booktitle = {Proceedings of the 38th {ACM} Symposium on Parallelism in Algorithms and Architectures ({SPAA})},
  month     = {July},
  year      = {2026},
  note      = {Accepted},
  annote    = {C134}
}

@inproceedings{BenderBiFa26,
  author    = {Michael A. Bender and Philip Bille and Mart\'{\i}n Farach-Colton and Jeremy Fineman and Inge Li G\o{}rtz and Michael T. Goodrich and Hanna Koml\'{o}s and Bradley C. Kuszmaul and William Kuszmaul and Rose Silver and Todd Veldhuizen and Renfei Zhou},
  title     = {The Local/Global Disk Problem: How to Use Shared High-Bandwidth},
  booktitle = {Proceedings of the 38th {ACM} Symposium on Parallelism in Algorithms and Architectures ({SPAA})},
  month     = {July},
  year      = {2026},
  note      = {Accepted},
  annote    = {C135}
}

```


@article{BenderFaGo26,
  annote      = {A74},
  author    = {Bender, Michael A. and Farach-Colton, Mart{\'i}n and Goodrich, Michael T. and Koml{\'o}s, Hanna},
  title     = {History-Independent Dynamic Partitioning with Applications to {B}-Trees, Skip Lists, and Fusion Trees},
  journal   = {Transactions on Database Systems (TODS)},
  year      = {2026},
  note      = {Accepted for publication},
  doi       = {10.1145/3810240},
  url       = {https://doi.org/10.1145/3810240}
}

@phdthesis{West25,
	author = {Evan T. West},
	school = {Stony Brook University},
	title = {Useful Graph Semi-Streaming: Expanding the Scope of Dynamic Graph Processing},
	year = {2025}}

@phdthesis{Mo25,
	author = {Tianchi (Maverick) Mo},
	school = {Stony Brook University},
	title = {Theoretical and Experimental Studies on Strongly Adaptive Filters and Parallel Paging},
	year = {2025}}

@phdthesis{Huang25,
	author = {Yushen Huang},
	school = {Stony Brook University},
	title = {Intersection Checking with Non-Linear Set Representation},
	year = {2025}}

@article{BenderBeCa26,
	annote = {A73},
	author = {Michael A. Bender and Aaron Bernstein and Nairen Cao and Alex Conway and Mart{\'\i}n Farach-Colton and Hanna Koml{\'o}s and Yarin Shechter and Nicole Wein},
	date-modified = {2026-05-18 16:18:00 -0400},
	journal = {ACM Management of Data (PACMMOD) / 49th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)},
	volume = {4},
	number = {2},
	pages = {98:1--98:25},
	articleno = {98},
	month = {May},
	title = {Bounding the Fragmentation of {B}-trees Subject to Batched Insertions},
	doi = {10.1145/3801894},
	url = {https://dl.acm.org/doi/10.1145/3801894},
	year = {2026},
	bdsk-url-1 = {https://dl.acm.org/doi/10.1145/3801894}}

@article{BenderBaCo25,
	annote = {A68},
	author = {Michael A. Bender and Abhishek Bhattacharjee and Alexander Conway and Martin Farach{-}Colton and Rob Johnson and Sudarsun Kannan and William Kuszmaul and Nirjhar Mukherjee and Donald E. Porter and Guido Tagliavini and Janet Vorobyeva and Evan West},
	doi = {10.1145/3737700},
	journal = {{ACM} Trans. Algorithms},
	month = {September},
	number = {4},
	pages = {43:1--43:22},
	title = {Paging and the Address-Translation Problem},
	url = {https://doi.org/10.1145/3737700},
	volume = {21},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3737700}}

@article{BenderFiGi25,
	annote = {A71},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and John Kuszmaul and Maxwell Young},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/siamcomp/BenderFGKY25.bib},
	doi = {10.1137/24M1670743},
	journal = {{SIAM} J. Comput.},
	number = {5},
	pages = {1335--1385},
	timestamp = {Thu, 06 Nov 2025 08:39:44 +0100},
	title = {Jamming-Resistant Backoff with Polylogarithmic Sending and Listening Cost},
	url = {https://doi.org/10.1137/24m1670743},
	volume = {54},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1137/24m1670743}}

@article{BenderCoFa25-tiny-pointers,
	annote = {A69},
	author = {Michael A. Bender and Alexander Conway and Mart{\'{\i}}n Farach{-}Colton and William Kuszmaul and Guido Tagliavini},
	date-modified = {2025-12-19 19:16:07 -0500},
	doi = {10.1145/3700594},
	issn = {1549-6325},
	journal = {ACM Transactions on Algorithms, Special Issue on SODA'23},
	month = {September},
	number = {4},
	pages = {38:1--38:43},
	title = {Tiny Pointers},
	url = {https://doi.org/10.1145/3700594},
	volume = {21},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3700594}}

@article{AgrawalBeFi25,
	annote = {A67},
	author = {Kunal Agrawal and Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Maxwell Young},
	doi = {10.1007/S00446-025-00490-Y},
	journal = {Distributed Computing},
	number = {4},
	pages = {337--355},
	title = {Contention resolution with message deadlines},
	url = {https://doi.org/10.1007/s00446-025-00490-y},
	volume = {38},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1007/s00446-025-00490-y}}

@article{MoBeDa26,
	annote = {A72},
	author = {Mo, Tianchi and Bender, Michael A. and Das, Rathish and Farach-Colton, Mart{\'{\i}}n and Tench, David},
	doi = {10.1145/3786324},
	journal = {ACM Transactions on Database Systems},
	note = {To appear},
	title = {Mitigating False Positives in Filters: To Adapt or to Cache?},
	url = {https://doi.org/10.1145/3786324},
	year = {2026},
	bdsk-url-1 = {https://doi.org/10.1145/3786324}}

@inproceedings{BenderKuSh26,
	annote = {c133},
	author = {Michael A. Bender and William Kuszmaul and Elaine Shi and Rose Silver},
	booktitle = {Proc.\ 37th ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	doi = {10.1137/1.9781611978971.44},
	month = {January},
	pages = {1097-1127},
	title = {History-Independent Load Balancing},
	url = {https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.44},
	year = {2026},
	bdsk-url-1 = {https://epubs.siam.org/doi/abs/10.1137/1.9781611978971.44},
	bdsk-url-2 = {https://doi.org/10.1137/1.9781611978971.44}}

@article{Klarreich25,
	author = {Erica Klarreich},
	date = {June 30, 2025},
	journal = {Communications of the ACM},
	title = {An Algorithm for a Better Bookshelf: Managing the strategic positioning of empty spaces},
	url = {https://cacm.acm.org/news/an-algorithm-for-a-better-bookshelf/},
	bdsk-url-1 = {https://cacm.acm.org/news/an-algorithm-for-a-better-bookshelf/}}

@article{Nadis25b,
	author = {Steve Nadis},
	date = {February 16, 2025},
	journal = {Wired Magazine},
	title = {This New Algorithm for Sorting Books or Files Is Close to Perfection},
	url = {https://www.wired.com/story/new-book-sorting-algorithm-almost-reaches-perfection/},
	bdsk-url-1 = {https://www.wired.com/story/new-book-sorting-algorithm-almost-reaches-perfection/}}

@article{Nadis25a,
	author = {Steve Nadis},
	date = {January 24, 2025},
	journal = {Quanta Magazine},
	title = {New Book-Sorting Algorithm Almost Reaches Perfection},
	url = {https://www.quantamagazine.org/new-book-sorting-algorithm-almost-reaches-perfection-20250124/},
	bdsk-url-1 = {https://www.quantamagazine.org/new-book-sorting-algorithm-almost-reaches-perfection-20250124/}}

@article{BenderFaGo25,
	annote = {A66},
	author = {Michael A. Bender and Mart{\'{\i}}n Farach{-}Colton and Michael T. Goodrich and Hanna Koml{\'{o}}s},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/sigmod/BenderFGK25.bib},
	date-modified = {2025-12-19 19:24:29 -0500},
	doi = {10.1145/3733620.3733625},
	journal = {{SIGMOD} Rec.},
	month = {April},
	note = {SIGMOD Research Highlights Award},
	number = {1},
	pages = {17--26},
	timestamp = {Wed, 14 May 2025 14:09:56 +0200},
	title = {History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures},
	url = {https://doi.org/10.1145/3733620.3733625},
	volume = {54},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3733620.3733625}}

@article{10.1145/3743656,
	abstract = {Managing the strategic positioning of empty spaces.},
	address = {New York, NY, USA},
	author = {Klarreich, Erica},
	doi = {10.1145/3743656},
	issn = {0001-0782},
	issue_date = {September 2025},
	journal = {Commun. ACM},
	month = aug,
	number = {9},
	numpages = {3},
	pages = {11--13},
	publisher = {Association for Computing Machinery},
	title = {An Algorithm for a Better Bookshelf},
	url = {https://doi.org/10.1145/3743656},
	volume = {68},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3743656}}

@inproceedings{BenderCoDe25,
	annote = {C132},
	author = {Michael A. Bender and Alex Conway and Daniel DeLayo and Martin Farach{-}Colton and Jaehyun Han and Linfeng He and Rob Johnson and Sudarsun Kannan and William Kuszmaul and Donald E. Porter and Evan West},
	booktitle = {Proc.\ 37th {ACM} Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2025-09-12 15:34:53 -0400},
	doi = {10.1145/3694906.3743303},
	month = {August},
	pages = {555--565},
	title = {Don't Melt Your Cache: Low-Associativity with Heat-Sink},
	url = {https://doi.org/10.1145/3694906.3743303},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3694906.3743303}}

@inproceedings{AgrawalBePr25,
	annote = {C131},
	author = {Kunal Agrawal and Michael A. Bender and Kirk Pruhs and Benjamin Moseley and Clifford Stein},
	booktitle = {Proc.\ 37th {ACM} Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2025-09-12 15:34:36 -0400},
	doi = {10.1145/3694906.3743336},
	month = {August},
	pages = {171--180},
	title = {Managing High-Bandwidth Memory is a Parallel Scheduling Problem},
	url = {https://doi.org/10.1145/3694906.3743336},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3694906.3743336}}

@inproceedings{BenderKuZh25,
	annote = {C129},
	author = {Michael A. Bender and William Kuszmaul and Renfei Zhou},
	booktitle = {Proceedings of the 57th Annual {ACM} Symposium on Theory of Computing (STOC)},
	date-modified = {2025-09-12 14:48:29 -0400},
	doi = {10.1145/3717823.3718215},
	month = {June},
	pages = {268--277},
	title = {Optimal Non-oblivious Open Addressing},
	url = {https://doi.org/10.1145/3717823.3718215},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3717823.3718215}}

@misc{Nadis25-wired,
	author = {Steve Nadis},
	date-added = {2025-05-27 12:39:31 -0400},
	date-modified = {2025-05-27 12:52:19 -0400},
	howpublished = {\url{https://www.wired.com/story/new-book-sorting-algorithm-almost-reaches-perfection/}},
	journal = {Wired Magazine},
	month = {February},
	title = {This New Algorithm for Sorting Books or Files Is Close to Perfection},
	year = {2025}}

@misc{Nadis24,
	author = {Steve Nadis},
	date-added = {2025-05-27 12:24:04 -0400},
	date-modified = {2025-05-27 12:31:58 -0400},
	howpublished = {\url{https://www.quantamagazine.org/scientists-find-optimal-balance-of-data-storage-and-time-20240208/}},
	journal = {Quanta Magazine},
	month = {February},
	title = {Scientists Find Optimal Balance of Data Storage and Time},
	year = {2024}}

@inproceedings{BenderFaJa25,
	annote = {C130},
	author = {Michael A. Bender and Mart\'{\i}n Farach-Colton and Riko~Jacob and Hanna Koml\'os and David Tench and Evan West},
	booktitle = {SIAM Conference on Applied and Computational Discrete Algorithms (ACDA)},
	date-added = {2025-04-07 18:50:02 -0400},
	date-modified = {2025-04-07 19:09:28 -0400},
	doi = {10.1137/1.9781611978759.9},
	pages = {115-129},
	title = {The Case for External Graph Sketching},
	url = {https://epubs.siam.org/doi/abs/10.1137/1.9781611978759.9},
	year = {2025},
	bdsk-url-1 = {https://epubs.siam.org/doi/abs/10.1137/1.9781611978759.9},
	bdsk-url-2 = {https://doi.org/10.1137/1.9781611978759.9}}

@inproceedings{AttiyaBeFa25,
	annote = {C128},
	author = {Hagit Attiya and Michael A. Bender and Mart\'{\i}n Farach-Colton and Rotem Oshman and Noa Schiller},
	booktitle = {Proc.\ 57th Annual ACM Symposium on Theory of Computing (STOC)},
	date-modified = {2025-04-07 18:56:01 -0400},
	doi = {10.1145/3717823.3718283},
	month = {June},
	pages = {1283--1294},
	title = {History-Independent Concurrent Hash Tables},
	url = {https://doi.org/10.1145/3717823.3718283},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1145/3717823.3718283}}

@phdthesis{Bhattacharya24,
	author = {Arghya Bhattacharya},
	date-added = {2025-03-09 16:08:02 -0400},
	date-modified = {2025-03-09 16:09:02 -0400},
	month = {December},
	school = {Stony Brook University},
	title = {Going Beyond Worst-Case: A Study on Cache Adaptivity and Machine Learning Advice},
	year = {2024}}

@inproceedings{BenderCoFa24a,
	annote = {C126},
	author = {Michael A. Bender and Alex Conway and Mart{\'{\i}}n Farach{-}Colton and Hanna Koml{\'{o}}s and Michal Kouck{\'{y}} and William Kuszmaul and Michael E. Saks},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/conf/focs/Bender0FK0KS24.bib},
	booktitle = {Proc.\ 65th {IEEE} Annual Symposium on Foundations of Computer Science (FOCS)},
	date-modified = {2025-04-07 18:45:47 -0400},
	doi = {10.1109/FOCS61266.2024.00132},
	pages = {2253--2274},
	timestamp = {Mon, 09 Dec 2024 12:04:35 +0100},
	title = {Nearly Optimal List Labeling},
	url = {https://doi.org/10.1109/FOCS61266.2024.00132},
	year = {2024},
	bdsk-url-1 = {https://doi.org/10.1109/FOCS61266.2024.00132}}

@inproceedings{BenderKuZh24,
	annote = {C125},
	author = {Michael A. Bender and William Kuszmaul and Renfei Zhou},
	booktitle = {Proc.\ 65th {IEEE} Annual Symposium on Foundations of Computer Science (FOCS)},
	date-modified = {2025-09-12 14:49:06 -0400},
	doi = {10.1109/FOCS61266.2024.00047},
	month = oct,
	pages = {636--657},
	timestamp = {Mon, 09 Dec 2024 12:04:35 +0100},
	title = {Tight Bounds for Classical Open Addressing},
	url = {https://doi.org/10.1109/FOCS61266.2024.00047},
	year = {2024},
	bdsk-url-1 = {https://doi.org/10.1109/FOCS61266.2024.00047}}

@inproceedings{TenchWeZh25,
	annote = {C127},
	author = {David Tench and Evan West and Kenny Zhang and Michael A. Bender and Daniel Delayo and Mart{\'\i}n Farach-Colton and Gilvir Gill and Tyler Seip and Victor Zhang},
	booktitle = {Proc\ SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)},
	date-modified = {2025-03-09 15:05:05 -0400},
	month = {June},
	pages = {133-146},
	title = {Exploring the Landscape of Distributed Graph Sketching},
	year = {2025}}

@article{HanGoKu24,
	annote = {A64},
	author = {Han, Jaehyun and Gosakan, Krishnan and Kuszmaul, William and Mubarek, Ibrahim N. and Mukherjee, Nirjhar and Sriram, Karthik and Tagliavini, Guido and West, Evan and Bender, Michael A. and Bhattacharjee, Abhishek and Conway, Alex and Farach-Colton, Mart{\'\i}n and Gandhi, Jayneel and Johnson, Rob and Kannan, Sudarsun and Porter, Donald E.},
	doi = {10.1109/MM.2024.3409181},
	issn = {1937-4143},
	journal = {IEEE Micro},
	month = jul,
	number = {04},
	pages = {52-59},
	title = {Mosaic Pages: Big TLB Reach with Small Pages ({IEEE MICRO Top Picks)}},
	url = {https://doi.ieeecomputersociety.org/10.1109/MM.2024.3409181},
	volume = {44},
	year = {2024},
	bdsk-url-1 = {https://doi.ieeecomputersociety.org/10.1109/MM.2024.3409181},
	bdsk-url-2 = {https://doi.org/10.1109/MM.2024.3409181}}

@inproceedings{BenderFiGi24,
	annote = {C124},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and John Kuszmaul and Maxwell Young},
	booktitle = {Proc.\ 43rd ACM Symposium on Principles of Distributed Computing (PODC)},
	date-modified = {2024-06-19 18:53:18 -0400},
	month = {June},
	pages = {231--242},
	title = {Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution},
	url = {https://doi.org/10.1145/3662158.3662807},
	year = {2024},
	bdsk-url-1 = {https://doi.org/10.1145/3662158.3662807}}

@inproceedings{AttiyaBeFa24,
	annote = {C123},
	author = {Hagit Attiya and Michael A. Bender and Mart{\'\i}n Farach-Colton and Rotem Oshman and Noa Schiller},
	booktitle = {Proc.\ 43rd ACM Symposium on Principles of Distributed Computing (PODC)},
	month = {June},
	pages = {14--24},
	title = {History-Independent Concurrent Objects},
	year = {2024}}

@article{BenderCoFa24-list-labeling-old,
	annote = {A60},
	author = {Bender, Michael A. and Conway, Alex and Farach-Colton, Mart\'{\i}n and Koml\'{o}s, Hanna and Kuszmaul, William and Wein, Nicole},
	date-modified = {2025-12-19 16:27:14 -0500},
	doi = {10.1137/22M1534468},
	eprint = {https://doi.org/10.1137/22M1534468},
	journal = {SIAM Journal on Computing, Special Issue on FOCS'22},
	number = 0,
	pages = {FOCS22-60-FOCS22-92},
	title = {Online List Labeling: Breaking the \({\log^2 n}\) Barrier},
	url = {https://doi.org/10.1137/22M1534468},
	volume = 0,
	year = 0,
	bdsk-url-1 = {https://doi.org/10.1137/22M1534468}}

@article{BenderCoFa25-list-labeling,
	author = {Michael A. Bender and Alexander Conway and Mart{\'{\i}}n Farach{-}Colton and Hanna Koml{\'{o}}s and William Kuszmaul and Nicole Wein},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/siamcomp/BenderCFKKW25.bib},
	date-modified = {2025-12-19 16:26:50 -0500},
	doi = {10.1137/22M1534468},
	journal = {SIAM Journal on Computing, Special Issue on FOCS'22},
	month = {October},
	number = {5},
	pages = {S22--60},
	title = {Online List Labeling: Breaking the {\textbackslash}(\{{\textbackslash}log{\^{}}2 n\}{\textbackslash}) Barrier},
	url = {https://doi.org/10.1137/22m1534468},
	volume = {54},
	year = {2025},
	bdsk-url-1 = {https://doi.org/10.1137/22m1534468}}

@article{WenMcTe25,
	annote = {A65},
	articleno = {192},
	author = {Richard.~Wen and Hunter~McCoy and David~Tench and Guido~Tagliavini and Michael~A.~Bender and Alex~Conway and Mart\'{\i}n Farach-Colton and Rob Johnson and Prashant Panday},
	date-modified = {2024-06-19 20:34:54 -0400},
	doi = {10.1145/3677128},
	issue_date = {September 2024},
	journal = {{ACM} Management of Data (PACMMOD)/Proc.\ {ACM} International Conference on Management of Data (SIGMOD)},
	month = sep,
	number = {4},
	numpages = {28},
	title = {Adaptive Quotient Filters},
	url = {https://doi.org/10.1145/3677128},
	volume = {2},
	year = {2024},
	bdsk-url-1 = {https://doi.org/10.1145/3677128}}

@article{BenderCoFa24b,
	annote = {A66},
	articleno = {101},
	author = {Michael~A.~Bender and Alex~Conway and Mart\'{\i}n~Farach-Colton and Hanna Koml\'os and William~Kuszmaul},
	date-modified = {2024-12-15 16:27:26 -0500},
	doi = {10.1145/3651602},
	issue_date = {May 2024},
	journal = {{ACM} Management of Data (PACMMOD)/47th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)},
	month = may,
	number = {2},
	title = {Layered List Labeling},
	url = {https://doi.org/10.1145/3651602},
	volume = {2},
	year = {2024},
	bdsk-url-1 = {https://doi.org/10.1145/3651602}}

@article{BenderFaGo24,
	annote = {A62},
	articleno = {108},
	author = {Bender, Michael A. and Farach-Colton, Mart\'{\i}n and Goodrich, Michael T. and Koml\'{o}s, Hanna},
	doi = {10.1145/3651609},
	issue_date = {May 2024},
	journal = {{ACM} Management of Data (PACMMOD)/47th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)},
	month = may,
	note = {Best Paper Award},
	number = {2},
	numpages = {27},
	title = {History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures},
	url = {https://doi.org/10.1145/3651609},
	volume = {2},
	year = {2024},
	bdsk-url-1 = {https://doi.org/10.1145/3651609}}

@article{TenchWeZh24,
	annote = {A63},
	articleno = {9},
	author = {David Tench and Evan West and Victor Zhang and Michael A. Bender and Abiyaz Chowdhury and Daniel Delayo and J. Ahmed Dellas and Mart\'{\i}n Farach-Colton and Tyler Seip and Kenny Zhang},
	date-modified = {2024-05-03 22:12:39 -0400},
	doi = {10.1145/3643846},
	issn = {0362-5915},
	issue_date = {September 2024},
	journal = {Transactions on Database Systems},
	month = may,
	number = {3},
	numpages = {31},
	title = {GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive)},
	url = {https://doi.org/10.1145/3643846},
	volume = {49},
	year = {2024},
	bdsk-url-1 = {https://doi.org/10.1145/3643846}}

@article{BenderCoFa23b,
	annote = {A59},
	author = {Michael A. Bender and Alex Conway and Martin Farach{-}Colton and William Kuszmaul and Guido Tagliavini},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/jacm/BenderCFKT23.bib},
	doi = {10.1145/3625817},
	journal = {J. {ACM}},
	number = {6},
	pages = {40:1--40:51},
	timestamp = {Mon, 15 Jan 2024 08:08:22 +0100},
	title = {Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once},
	url = {https://doi.org/10.1145/3625817},
	volume = {70},
	year = {2023},
	bdsk-url-1 = {https://doi.org/10.1145/3625817}}

@inproceedings{PandeyBeCo23-dont-use,
	annote = {C121},
	author = {Prashant Pandey and Michael A. Bender and Alex Conway and Mart\'{\i}n Farach-Colton and William Kuszmaul and Guido Tagliavini and Rob Johnson},
	booktitle = {Proc.\ International Conference on Management of Data (SIGMOD)},
	date-modified = {2023-08-13 10:10:17 -0400},
	month = {June},
	title = {{IcebergHT}: High Performance {PMEM} Hash Tables Through Stability and Low Associativity},
	year = {2023}}

@article{PandeyBeCo23,
	annote = {A58},
	author = {Prashant Pandey and Michael A. Bender and Alex Conway and Martin Farach{-}Colton and William Kuszmaul and Guido Tagliavini and Rob Johnson},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/pacmmod/0001BCFKTJ23.bib},
	date-modified = {2023-08-13 10:10:02 -0400},
	doi = {10.1145/3588727},
	journal = {Proc.\ {ACM} Management of Data (PACMMOD)/Proc.\ {ACM} International Conference on Management of Data (SIGMOD)},
	month = {June},
	number = {1},
	pages = {47:1--47:26},
	timestamp = {Mon, 05 Jun 2023 13:45:04 +0200},
	title = {{IcebergHT}: High Performance Hash Tables Through Stability and Low Associativity},
	url = {https://doi.org/10.1145/3588727},
	volume = {1},
	year = {2023},
	bdsk-url-1 = {https://doi.org/10.1145/3588727}}

@inproceedings{BenderCoFa22,
	annote = {C116},
	author = {Michael A. Bender and Alex Conway and Mart{\'\i}n Farach-Colton and Hanna Koml{\'o}s and William Kuszmaul and Nicole Wein},
	booktitle = {Proc.\ 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS)},
	date-added = {2023-11-18 18:26:52 -0500},
	date-modified = {2023-11-18 18:26:52 -0500},
	doi = {10.1109/FOCS54457.2022.00096},
	month = {November},
	pages = {980--990},
	title = {Online List Labeling: Breaking the $\log^2 n$ Barrier},
	url = {https://doi.org/10.1109/FOCS54457.2022.00096},
	year = {2022},
	bdsk-url-1 = {https://doi.org/10.1109/FOCS54457.2022.00096}}

@inproceedings{BenderFaKu24,
	annote = {C122},
	author = {Michael A. Bender and Mart\'{\i}n Farach-Colton and John Kuszmaul and William Kuszmaul},
	booktitle = {Proc.\ SIAM Symposium on Simplicity in Algorithms (SOSA)},
	date-modified = {2024-03-06 17:19:02 -0500},
	month = {January},
	pages = {363-373},
	title = {Modern Hashing Made Simple},
	year = {2024}}

@inproceedings{AgrawalBaBe23,
	annote = {C121},
	author = {Kunal Agrawal and Sanjoy K. Baruah and Michael A. Bender and Alberto Marchetti{-}Spaccamela},
	booktitle = {Proc.\ 35th Euromicro Conference on Real-Time Systems (ECRTS)},
	doi = {10.4230/LIPIcs.ECRTS.2023.3},
	editor = {Alessandro V. Papadopoulos},
	month = {July},
	pages = {3:1--3:19},
	publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
	series = {LIPIcs},
	title = {The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems},
	url = {https://doi.org/10.4230/LIPIcs.ECRTS.2023.3},
	volume = {262},
	year = {2023},
	bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ECRTS.2023.3}}

@inproceedings{BenderDaFa23,
	annote = {C119},
	author = {Michael A. Bender and Rathish Das and Mart\'\i{}n Farach-Colton and Guido Tagliavini},
	booktitle = {Proc.\ 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2023-04-11 21:51:58 -0400},
	date-modified = {2023-04-11 21:51:58 -0400},
	doi = {10.1145/3558481.3591084},
	month = {June},
	pages = {117--127},
	title = {An Associativity Threshold Phenomenon in Set-Associative Caches},
	url = {https://doi.org/10.1145/3558481.3591084},
	year = {2023},
	bdsk-url-1 = {https://doi.org/10.1145/3490148.3538577},
	bdsk-url-2 = {https://doi.org/10.1145/3558481.3591084}}

@inproceedings{BenderDeKu23,
	annote = {C120},
	author = {Michael A. Bender and Daniel Delayo and Bradley C. Kuszmaul and William Kuszmaul and Evan West},
	booktitle = {Proc.\ 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2023-04-11 21:49:23 -0400},
	date-modified = {2023-04-11 21:52:59 -0400},
	doi = {10.1145/3558481.3591085},
	month = {June},
	pages = {129--139},
	title = {Increment-and-Freeze: Every Cache, Everywhere, All of the Time},
	url = {https://doi.org/10.1145/3558481.3591085},
	year = 2023,
	bdsk-url-1 = {https://doi.org/10.1145/3490148.3538577},
	bdsk-url-2 = {https://doi.org/10.1145/3558481.3591085}}

@inproceedings{GosakanHaKu23,
	annote = {C118},
	author = {Krishnan Gosakan and Jaehyun Han and William Kuszmaul and Ibrahim Nael Mubarek and Nirjhar Mukherjee and Guido Tagliavini and Evan West and Michael A. Bender and Abhishek Bhattacharjee and Alex Conway and Mart{\'\i}n Farach-Colton and Jayneel Gandhi and Rob Johnson and Sudarsun Kannan and Donald Porter},
	booktitle = {Proc.\ 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)},
	date-added = {2023-04-11 21:48:53 -0400},
	date-modified = {2023-04-11 21:48:53 -0400},
	doi = {10.1145/3582016.3582021},
	month = {March},
	pages = {433-448},
	title = {Mosaic Pages: Big TLB Reach with Small Pages},
	url = {https://doi.org/10.1145/3582016.3582021},
	year = {2023},
	bdsk-url-1 = {https://doi.org/10.1145/3582016.3582021}}

@inproceedings{BhattacharyaXuCh22,
	annote = {C115},
	author = {Arghya Bhattacharya and Helen Xu and Abiyaz Chowdhury and Rezaul A. Chowdhury and Rathish Das and Rob Johnson and Rishab Nithyanand and Michael A. Bender},
	booktitle = {Proc.\ 30th European Symposium on Algorithms (ESA)},
	month = {September},
	pages = {16:1-16:17},
	title = {When Are Cache-Oblivious Algorithms Cache Adaptive? {A} Case Study of Matrix Multiplication and Sorting},
	year = {2022}}

@inproceedings{BenderCoFa23a,
	annote = {C117},
	author = {Michael A. Bender and Alex Conway and Mart{\'\i}n Farach-Colton and Hanna Koml{\'o}s and William Kuszmaul and Guido Tagliavini},
	booktitle = {Proc.\ ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-modified = {2023-10-07 22:05:17 -0400},
	month = {January},
	pages = {477--508},
	title = {Tiny Pointers},
	year = {2023}}

@inproceedings{AgrawalBeDa22,
	annote = {C114},
	author = {Kunal Agrawal and Michael A. Bender and Rathish Das and William Kuszmaul and Enoch Peserico and Michele Scquizzato},
	booktitle = {Proc.\ 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2022-05-12 17:04:02 -0400},
	date-modified = {2022-07-16 13:50:29 -0400},
	doi = {10.1145/3490148.3538577},
	month = {July},
	title = {Online Parallel Paging with Optimal Makespan},
	url = {https://doi.org/10.1145/3490148.3538577},
	year = 2022,
	bdsk-url-1 = {https://doi.org/10.1145/3490148.3538577}}

@inproceedings{BenderGiKu22,
	annote = {C112},
	author = {Michael A. Bender and Seth Gilbert and Fabian Kuhn and John Kuszmaul and Muriel M{\'{e}}dard},
	booktitle = {Proc.\ 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2022-05-12 17:02:44 -0400},
	date-modified = {2022-07-16 14:00:10 -0400},
	doi = {10.1145/3490148.3538573},
	month = {July},
	title = {Contention Resolution for Coded Radio Networks},
	url = {https://doi.org/10.1145/3490148.3538573},
	year = 2022,
	bdsk-url-1 = {https://doi.org/10.1145/3490148.3538573}}

@inproceedings{DelayoZhAg22,
	annote = {C113},
	author = {Daniel Delayo$^*$ and Kenny Zhang$^*$ and Kunal Agrawal and Michael A. Bender and Jonathan Berry and Rathish Das and Benjamin Moseley and Cynthia A. Phillips},
	booktitle = {Proc.\ 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2022-05-12 16:56:46 -0400},
	date-modified = {2022-07-16 14:00:02 -0400},
	doi = {10.1145/3490148.3538570},
	month = {July},
	note = {* Joint first authors.},
	pages = {147-159},
	title = {Automatic HBM Management: Models and Algorithms},
	url = {https://doi.org/10.1145/3490148.3538570},
	year = 2022,
	bdsk-url-1 = {https://doi.org/10.1145/3490148.3538570}}

@inproceedings{erase22,
	annote = {C99},
	author = {Michael A. Bender and Rezaul A. Chowdhury and Rathish Das and Rob Johnson and William Kuszmaul and Andrea Lincoln and Quanquan C. Liu and Jayson Lynch and Helen Xu},
	booktitle = {Proc.\ 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2022-05-12 16:55:23 -0400},
	date-modified = {2022-05-12 16:56:30 -0400},
	month = {July},
	pages = {63-73},
	title = {Closing the Gap Between Cache-Oblivious and Cache-Adaptive Analysis},
	year = {2020}}

@inproceedings{BenderFaKu22b,
	annote = {C111},
	author = {Michael A. Bender and Mart\'{\i}n Farach-Colton and John Kuszmaul and William Kuszmaul and Mingmou Liu},
	booktitle = {Proc.\ 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)},
	date-added = {2022-04-01 14:50:15 -0400},
	date-modified = {2022-07-16 13:52:54 -0400},
	doi = {10.1145/3519935.3519969},
	month = {June},
	pages = {1284-1297},
	title = {On the Optimal Time/Space Tradeoff for Hash Tables},
	url = {https://doi.org/10.1145/3519935.3519969},
	year = {2022},
	bdsk-url-1 = {https://doi.org/10.1145/3519935.3519969}}

@inproceedings{TenchWeZh22,
	annote = {C110},
	author = {David Tench and Evan West and Victor Zhang and Michael A. Bender and Abiyaz Chowdhury and J. Ahmed Dellas and Mart\'{\i}n Farach-Colton and Tyler Seip and Kenny Zhang},
	booktitle = {Proc.\ International Conference on Management of Data (SIGMOD)},
	date-added = {2022-04-01 14:48:39 -0400},
	date-modified = {2022-07-16 13:44:43 -0400},
	doi = {10.1145/3514221.3526146},
	month = {June},
	pages = {325-339},
	title = {{GraphZeppelin}: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams},
	url = {https://doi.org/10.1145/3514221.3526146},
	year = {2022},
	bdsk-url-1 = {https://doi.org/10.1145/3514221.3526146}}

@inproceedings{BenderFaKu22a,
	annote = {C108},
	author = {Michael A. Bender and Mart\'{\i}n Farach-Colton and William Kuszmaul},
	booktitle = {Proc.\ 13th Innovations in Theoretical Computer Science (ITCS) Conference},
	date-added = {2021-12-27 18:19:28 -0500},
	date-modified = {2022-04-20 13:37:52 -0400},
	doi = {10.4230/LIPIcs.ITCS.2022.18},
	month = {January-February},
	pages = {18:1-18:23},
	title = {What Does Dynamic Optimality Mean in External Memory?},
	url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.18},
	year = {2022},
	bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ITCS.2022.18}}

@inproceedings{BenderKoKu21,
	annote = {C106},
	author = {Michael A. Bender and Tsvi Kopelowitz and William Kuszmaul and Ely Porat and Clifford Stein.},
	booktitle = {Proc.\ 28th Annual European Symposium on Algorithms (ESA)},
	date-added = {2021-08-18 17:11:31 -0400},
	date-modified = {2022-04-01 12:58:21 -0400},
	doi = {10.4230/LIPIcs.ESA.2021.12},
	month = {September},
	pages = {12:1-12:18},
	title = {Incremental Edge Orientation in Forests},
	url = {https://doi.org/10.4230/LIPIcs.ESA.2021.12},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ESA.2021.12}}

@inproceedings{PandeySiBe20,
	annote = {C95},
	author = {Prashant Pandey$^*$ and Shikha Singh$^*$ and Michael A. Bender and Jonathan W. Berry and Mart\'\i{}n Farach-Colton and Rob Johnson and Thomas M. Kroeger and Cynthia A. Phillips},
	booktitle = {Proc.\ International Conference on Management of Data (SIGMOD)},
	date-added = {2021-07-07 12:21:33 -0400},
	date-modified = {2021-07-07 12:21:33 -0400},
	month = {June},
	note = {* Joint first authors.},
	pages = {1431-1446},
	title = {Timely Reporting of Heavy Hitters using External Memory},
	year = 2020}

@inproceedings{BenderKuKu22,
	annote = {C106},
	author = {Michael A. Bender and Bradley C. Kuszmaul and William Kuszmaul.},
	booktitle = {Proc.\ 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
	date-added = {2021-06-25 16:36:58 -0400},
	date-modified = {2022-04-01 13:01:38 -0400},
	pages = {171-1182},
	title = {Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering.},
	year = {2021}}

@phdthesis{Das21,
	annote = {student},
	author = {Rathish Das},
	date-added = {2021-04-24 07:47:19 -0400},
	date-modified = {2021-04-24 07:51:41 -0400},
	school = {Stony Brook University},
	title = {Algorithmic Foundation of Parallel Paging and Scheduling under Memory Constraints},
	year = {2021}}

@inproceedings{AhmadChDa21,
	annote = {student},
	author = {Ahmad, Zafar and Chowdhury, Rezaul and Das, Rathish and Ganapathi, Pramod and Gregory, Aaron and Javanmard, Mohammad Mahdi},
	booktitle = {Proc. 33st ACM on Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2021-04-24 07:32:39 -0400},
	date-modified = {2021-04-24 07:32:39 -0400},
	month = {July},
	title = {Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics},
	year = {2021}}

@inproceedings{AhmadCD2021,
	annote = {student},
	author = {Ahmad, Zafar and Chowdhury, Rezaul and Das, Rathish and Ganapathi, Pramod and Gregory, Aaron and Zhu, Yimin},
	booktitle = {Proc.\ 33st ACM on Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2021-04-24 07:32:39 -0400},
	date-modified = {2022-11-22 15:29:40 -0500},
	doi = {10.1145/3409964.3461803},
	month = {July},
	title = {Fast Stencil Computations using Fast Fourier Transforms},
	url = {https://doi.org/10.1145/3409964.3461803},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1145/3409964.3461803}}

@inproceedings{ArkinDaGa20,
	annote = {student},
	author = {Arkin, Esther and Das, Rathish and Gao, Jie and Goswami, Mayank and Mitchell, Joseph and Polishchuk, Valentin and Toth, Csaba},
	booktitle = {Proc. 28th Annual European Symposium on Algorithms (ESA-Track A)},
	date-added = {2021-04-24 07:32:39 -0400},
	date-modified = {2021-04-24 07:32:39 -0400},
	month = {September},
	title = {Cutting Polygons into Small Pieces with Chords: Laser-Based Localization},
	year = {2020}}

@article{BenderCoFa21,
	annote = {A55},
	author = {Michael A. Bender and Alex Conway and Mart\'\i{}n Farach-Colton and William Jannen and Yizheng Jiao and Rob Johnson and Eric Knorr and Sara McAllister and Nirjhar Mukherjee and Prashant Pandey and Donald E. Porter and Jun Yuan and Yang Zhan},
	doi = {10.1145/3470635},
	journal = {ACM Transactions on Parallel Computing},
	month = {September},
	number = {3},
	pages = {15:1--15:20},
	title = {External-Memory Dictionaries in the Affine and PDAM Models},
	url = {https://doi.org/10.1145/3470635},
	volume = {8},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1145/3323165.3323210},
	bdsk-url-2 = {https://doi.org/10.1145/3470635}}

@inproceedings{BenderBhCo21,
	annote = {C105},
	author = {Michael A. Bender and Abhishek Bhattacharjee and Alex Conway and Mart\'{\i}n Farach-Colton and Rob Johnson and William Kuszmaul and Don Porter and Guido Tagliavini and Janet Vorobyeva and Evan West},
	booktitle = {Proc.\ 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2021-07-07 13:51:23 -0400},
	doi = {10.1145/3409964.3461814},
	month = {July},
	pages = {105-117},
	title = {Paging and the Address-Translation Problem},
	url = {https://doi.org/10.1145/3409964.3461814},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1145/3409964.3461814}}

@inproceedings{PandeyCoDu21,
	annote = {C104},
	author = {Prashant Pandey and Alex Conway and Joe Durie and Michael A. Bender and Martin Farach-Colton and Rob Johnson},
	booktitle = {Proc.\ International Conference on Management of Data (SIGMOD)},
	date-added = {2021-02-15 09:25:07 -0500},
	date-modified = {2021-07-07 13:50:27 -0400},
	doi = {10.1145/3448016.3452841},
	month = {June},
	pages = {1386-1399},
	title = {Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design},
	url = {https://doi.org/10.1145/3448016.3452841},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1145/3448016.3452841}}

@article{ZhanCoJi21,
	annote = {A54},
	articleno = 5,
	author = {Zhan, Yang and Conway, Alex and Jiao, Yizheng and Mukherjee, Nirjhar and Groombridge, Ian and Bender, Michael A. and Farach-Colton, Martin and Jannen, William and Johnson, Rob and Porter, Donald E. and Yuan, Jun},
	doi = {10.1145/3423495},
	issue_date = {February 2022},
	journal = {ACM Trans. Storage},
	month = jan,
	number = 1,
	numpages = 27,
	title = {Copy-on-Abundant-Write for Nimble File System Clones},
	url = {https://doi.org/10.1145/3423495},
	volume = 17,
	year = 2021,
	bdsk-url-1 = {https://doi.org/10.1145/3423495}}

@inproceedings{BenderDaFa21,
	annote = {C101},
	author = {Michael A. Bender and Rathish Das and Mart\'{\i}n Farach-Colton and Tianchi Mo and David Tench and Yung Ping Wang},
	booktitle = {Proc. 2nd Symposium on Algorithmic Principles of Computer System (APoCS)},
	date-added = {2020-11-07 15:53:45 -0500},
	date-modified = {2021-01-20 22:20:16 -0500},
	doi = {10.1137/1.9781611976489.2},
	month = {January},
	pages = {16-24},
	title = {Mitigating False Positives in Filters: to Adapt or to Cache?},
	url = {https://doi.org/10.1137/1.9781611976489.2},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1137/1.9781611976489.2}}

@inproceedings{AgrawalBeDa21,
	annote = {C102},
	author = {Kunal Agrawal and Michael A. Bender and Rathish Das and William Kuszmaul and Enoch Peserico and Michele Scquizzato},
	booktitle = {Proc.\ 32th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-modified = {2020-11-07 15:52:22 -0500},
	month = {January},
	pages = {3022-3041},
	title = {Tight Bounds for Parallel Paging and Green Paging},
	year = {2021}}

@misc{BenderFaKu21,
	annote = {C XXXX},
	author = {Michael A. Bender and Mart\'{\i}n Farach-Colton and William Kuszmaul.},
	date-modified = {2020-07-26 12:10:29 -0400},
	howpublished = {under review},
	title = {Read-Write Dynamic Optimality Against a Speed-Limited Adversary},
	year = {2021}}

@inproceedings{BenderKu21,
	annote = {C103},
	author = {Bender, Michael A. and Kuszmaul, William},
	booktitle = {Proc.\ 32th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-modified = {2022-11-21 20:02:02 -0500},
	doi = {10.1137/1.9781611976465.123},
	month = {January},
	pages = {2059-2077},
	title = {Randomized Cup Game Algorithms Against Strong Adversaries},
	url = {https://doi.org/10.1137/1.9781611976465.123},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1145/3313276.3316342},
	bdsk-url-2 = {https://doi.org/10.1137/1.9781611976465.123}}

@inproceedings{JavanmardGaDa19PPoPP,
	annote = {student},
	author = {Javanmard, Mohammad Mahdi and Ganapathr, Pramod and Das, Rathish and Ahmad, Zafar and Tschudi, Stephen and Chowdhury, Rezaul},
	booktitle = {Proc. 24th Symposium on Principles and Practice of Parallel Programming (PPoPP)},
	date-added = {2020-07-25 17:42:24 -0400},
	date-modified = {2020-07-25 20:56:53 -0400},
	month = {February},
	pages = {413--414},
	title = {Toward efficient architecture-independent algorithms for dynamic programs: poster},
	year = {2019}}

@inproceedings{AgrawalBeDa20,
	annote = {C100},
	author = {Kunal Agrawal and Michael A. Bender and Rathish Das and William Kuszmaul and Enoch Peserico and Michele Scquizzato},
	booktitle = {Proc.\ 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2020-07-25 13:18:12 -0400},
	month = {July},
	pages = {493-495},
	title = {Green Paging and Parallel Paging},
	year = {2020}}

@inproceedings{BenderChDa20,
	annote = {C99},
	author = {Michael A. Bender and Rezaul A. Chowdhury and Rathish Das and Rob Johnson and William Kuszmaul and Andrea Lincoln and Quanquan C. Liu and Jayson Lynch and Helen Xu},
	booktitle = {Proc.\ 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2020-07-25 13:19:32 -0400},
	month = {July},
	pages = {63-73},
	title = {Closing the Gap Between Cache-Oblivious and Cache-Adaptive Analysis},
	year = {2020}}

@inproceedings{DasAgBe20,
	annote = {C98},
	author = {Rathish Das and Kunal Agrawal and Michael A. Bender and Jonathan Berry and Benjamin Moseley and Cynthia A. Phillips},
	booktitle = {Proc.\ 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2020-07-25 13:18:53 -0400},
	month = {July},
	pages = {187-199},
	title = {How to Manage High-Bandwidth Memory Automatically},
	year = {2020}}

@inproceedings{AgrawalBeFi20,
	annote = {C97},
	author = {Kunal Agrawal and Michael A. Bender and Jeremy Fineman and Seth Gilbert and Maxwell Young},
	booktitle = {Proc.\ 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2020-07-25 13:19:59 -0400},
	month = {July},
	pages = {23-35},
	title = {Contention Resolution with Message Deadlines},
	year = {2020}}

@inproceedings{BenderKoKu20,
	annote = {C96},
	author = {Michael A. Bender and Tsvi Kopelowitz and William Kuszmaul and Seth Pettie},
	booktitle = {Proc.\ 52st Annual ACM Symposium on the Theory of Computing (STOC)},
	date-modified = {2020-07-25 13:17:18 -0400},
	month = {June},
	pages = {105-118},
	title = {Contention Resolution without Collision Detection},
	year = 2020}

@article{SinghPaBe21,
	annote = {A56},
	author = {Shikha Singh$^*$ and Prashant Pandey$^*$ and Michael A. Bender and Jonathan W. Berry and Mart\'\i{}n Farach-Colton and Rob Johnson and Thomas M. Kroeger and Cynthia A. Phillips},
	doi = {10.1145/3472392},
	journal = {{ACM} Transactions on Database Systems},
	note = {* Joint first authors.},
	number = {4},
	pages = {14:1--14:35},
	title = {Timely Reporting of Heavy Hitters Using External Memory},
	url = {https://doi.org/10.1145/3472392},
	volume = {46},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1145/3472392}}

@inproceedings{BenderGoMe21,
	annote = {C94},
	author = {Michael A. Bender and Mayank Goswami and Dzejla Medjedovic and Pablo Montes and Kostas Tsichlas},
	booktitle = {Proc.\ 14th Latin American Theoretical Informatics Symposium (LATIN)},
	date-modified = {2021-04-24 07:42:32 -0400},
	doi = {10.1007/978-3-030-61792-9\_13},
	month = {January},
	pages = {155-167},
	title = {Batched Predecessor and Sorting with Size-Priced Information in External Memory},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1007/978-3-030-61792-9%5C_13}}

@inproceedings{SinghMaBe20,
	annote = {C93},
	author = {Shikha Singh and Sergey Madaminov and Michael A.~Bender and Michael Ferdman and Ryan Johnson and Benjamin Moseley and Hung Ngo and Dung Nguyen and Soeren Olesen and Kurt Stirewalt and Geoffrey Washburn},
	booktitle = {Proc.\ 34th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
	date-modified = {2020-07-25 13:15:35 -0400},
	month = {May},
	pages = {864-873},
	title = {A Scheduling Approach to Incremental Maintenance of Datalog Programs},
	year = {2020}}

@inproceedings{ZhanCoJi20a,
	annote = {C92},
	author = {Yang Zhan and Alexander Conway and Yizheng Jiao and Nirjhar Mukherjee and Ian Groombridge and Michael A. Bender and Martin Farach-Colton and William Jannen and Rob Johnson and Donald E. Porter and Jun Yuan.},
	booktitle = {Proc.\ 20th {USENIX} Conference on File and Storage Technologies (FAST)},
	date-added = {2020-02-11 15:45:45 -0500},
	date-modified = {2020-07-26 11:57:02 -0400},
	month = {February},
	pages = {75-89},
	title = {How to Copy Files},
	year = {2020}}

@inproceedings{DasTsDu19,
	annote = {student},
	author = {Das, Rathish and Tsai, Shih-Yu and Duppala, Sharmila and Lynch, Jayson and Arkin, Esther M and Chowdhury, Rezaul and Mitchell, Joseph SB and Skiena, Steven},
	booktitle = {Proc.\ 31st ACM on Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2019-10-05 11:55:36 -0400},
	date-modified = {2020-07-25 20:59:45 -0400},
	month = {June},
	pages = {359--368},
	title = {Data races and the discrete resource-time tradeoff problem with resource reuse over paths},
	year = {2019}}

@inproceedings{JavanmardGaDa19ISC,
	annote = {student},
	author = {Javanmard, Mohammad Mahdi and Ganapathi, Pramod and Das, Rathish and Ahmad, Zafar and Tschudi, Stephen and Chowdhury, Rezaul},
	booktitle = {International Conference on High Performance Computing (ISC)},
	date-added = {2019-10-05 11:55:36 -0400},
	date-modified = {2020-07-25 21:01:36 -0400},
	month = {June},
	pages = {143--164},
	title = {Toward Efficient Architecture-Independent Algorithms for Dynamic Programs},
	year = {2019}}

@inproceedings{BenderDaFo20,
	annote = {C91},
	author = {Michael A. Bender and Rathish Das and Mart\'\i{}n Farach-Colton and Rob Johnson and William Kuszmaul},
	booktitle = {Proc.\ 31th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-added = {2019-10-05 11:26:44 -0400},
	date-modified = {2020-02-21 11:44:12 -0500},
	month = {January},
	pages = {650--669},
	title = {Flushing without Cascades},
	year = {2020}}

@inproceedings{AlmodaresiPaFe18,
	author = {Almodaresi, Fatemeh and Pandey, Prashant and Ferdman, Michael and Johnson, Rob and Patro, Rob},
	booktitle = {Research in Computational Molecular Biology},
	organization = {Springer},
	pages = {1},
	title = {An Efficient, Scalable and Exact Representation of High-Dimensional Color Information Enabled via de Bruijn Graph Search},
	year = {2018}}

@article{AngelNgSi18,
	annote = {student},
	author = {Eric Angel and Thang Nguyen Kim and Shikha Singh},
	date-added = {2019-05-01 07:45:01 -0400},
	date-modified = {2019-05-01 07:45:01 -0400},
	doi = {https://doi.org/10.1016/j.tcs.2018.11.029},
	issn = {0304-3975},
	journal = {Theoretical Computer Science},
	title = {Approximating k-forest with resource augmentation: A primal-dual approach},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397518307229},
	year = {2018},
	bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397518307229},
	bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2018.11.029}}

@inproceedings{AlmodaresiPFJP18,
	author = {Almodaresi, Fatemeh and Pandey, Prashant and Ferdman, Michael and Johnson, Rob and Patro, Rob},
	booktitle = {Research in Computational Molecular Biology},
	organization = {Springer},
	pages = {1},
	title = {An Efficient, Scalable and Exact Representation of High-Dimensional Color Information Enabled via de Bruijn Graph Search},
	year = {2018}}

@inproceedings{BenderCoFa19,
	address = {Phoenix, AZ},
	annote = {C88},
	author = {Michael A. Bender and Alex Conway and Mart\'\i{}n Farach-Colton and William Jannen and Yizheng Jiao and Rob Johnson and Eric Knorr and Sara McAllister and Nirjhar Mukherjee and Prashant Pandey and Donald E. Porter and Jun Yuan and Yang Zhan},
	booktitle = {Proc.\ 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2019-04-29 16:21:42 -0400},
	date-modified = {2019-07-03 15:36:58 -0400},
	doi = {https://doi.org/10.1145/3323165.3323210},
	month = {June},
	pages = {265--274},
	title = {Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design},
	year = {2019},
	bdsk-url-1 = {https://doi.org/10.1145/3323165.3323210}}

@inproceedings{ConwayKnJi19,
	address = {Renton, WA, USA},
	annote = {C90},
	author = {Alex Conway and Eric Knorr and Yizheng Jiao and Michael A. Bender and William Jannen and Rob Johnson and Donald E. Porter and Martin Farach{-}Colton},
	booktitle = {11th {USENIX} Workshop on Hot Topics in Storage and File Systems (HotStorage)},
	date-modified = {2019-10-05 11:07:25 -0400},
	month = {July},
	title = {Filesystem Aging: It's more Usage than Fullness},
	year = 2019,
	bdsk-url-1 = {https://www.usenix.org/conference/hotstorage19/presentation/conway}}

@phdthesis{Pandey19,
	annote = {student},
	author = {Prashant Pandey},
	date-added = {2019-04-29 16:17:04 -0400},
	month = {December},
	school = {Stony Brook University},
	title = {Fast and Space-Efficient Maps: Shrinking Big Data Down to Size},
	year = 2018}

@article{BenderFiGi19,
	annote = {A53},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Maxwell Young},
	date-modified = {2019-04-29 15:24:28 -0400},
	journal = {J. {ACM}},
	month = {January},
	number = {1},
	pages = {6:1--6:33},
	title = {Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness},
	url = {https://dl.acm.org/citation.cfm?id=3276769},
	volume = {66},
	year = {2019},
	bdsk-url-1 = {https://dl.acm.org/citation.cfm?id=3276769}}

@article{BenderKoPe18,
	annote = {A52},
	author = {Michael A. Bender and Tsvi Kopelowitz and Seth Pettie and Maxwell Young},
	date-modified = {2019-04-29 15:22:23 -0400},
	doi = {10.1137/17M1158604},
	journal = {{SIAM} J. Comput.},
	month = {October},
	number = {5},
	pages = {1735--1754},
	title = {Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses},
	url = {https://doi.org/10.1137/17M1158604},
	volume = {47},
	year = {2018},
	bdsk-url-1 = {https://doi.org/10.1137/17M1158604}}

@inproceedings{BenderFaKu19,
	address = {Phoenix, AZ},
	annote = {C89},
	author = {Michael A. Bender and Mart\'\i{}n Farach-Colton and William Kuszmaul},
	booktitle = {Proc.\ 51st Annual ACM Symposium on the Theory of Computing (STOC)},
	date-added = {2019-03-21 11:53:18 -0400},
	date-modified = {2019-07-03 15:35:15 -0400},
	month = {June},
	pages = {1148--1157},
	title = {Achieving Optimal Backlog in Multi-Processor Cup Games},
	year = {2019}}

@inproceedings{ChenMcSi18,
	annote = {student},
	author = {Chen, Jing and McCauley, Samuel and Singh, Shikha},
	booktitle = {Proceedings of the 11th International Symposium on Algorithmic Game Theory (SAGT)},
	date-added = {2018-07-22 20:47:49 +0000},
	date-modified = {2019-04-29 16:15:45 -0400},
	month = {August},
	title = {Efficient Rational Proofs with Strong Utility-Gap Guarantees},
	year = {2018}}

@article{GoswamiMeMe18,
	annote = {student},
	author = {Goswami, Mayank and Medjedovic, Dzejla and Mekic, Emina and Pandey, Prashant},
	date-added = {2018-07-22 16:55:33 +0000},
	date-modified = {2019-04-29 15:33:44 -0400},
	journal = {European Symposium on Algorithms},
	month = {August},
	title = {Buffered Count-Min Sketch on SSD: Theory and Experiments},
	year = {2018}}

@article{PandeyAlBe18,
	annote = {A51},
	author = {Pandey, Prashant and Almodaresi, Fatemeh and Bender, Michael A. and Ferdman, Michael and Johnson, Rob and Patro, Rob},
	date-added = {2018-07-22 14:26:03 +0000},
	date-modified = {2019-04-15 16:53:58 -0400},
	doi = {10.1016/j.cels.2018.05.021},
	issn = {2405-4712},
	journal = {Cell Systems},
	month = {August},
	number = {2},
	pages = {201--207.E4},
	title = {Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index},
	url = {http://dx.doi.org/10.1016/j.cels.2018.05.021},
	volume = {7},
	year = {2018},
	bdsk-url-1 = {http://dx.doi.org/10.1016/j.cels.2018.05.021}}

@phdthesis{Singh18,
	annote = {student},
	author = {Shikha Singh},
	date-added = {2018-07-22 15:20:25 +0000},
	date-modified = {2019-05-01 14:16:08 -0400},
	month = {August},
	school = {Stony Brook University},
	title = {The Mechanism Design Approach to Interactive Proofs},
	year = {2018}}

@phdthesis{Mayer18,
	annote = {student},
	author = {Tyler Mayer},
	date-added = {2018-07-22 15:19:08 +0000},
	date-modified = {2019-05-01 14:19:19 -0400},
	month = {May},
	school = {Stony Brook University},
	title = {Addressing Robustness in Some Optimization Problems Including Uncertainty},
	year = {2018}}

@inproceedings{BenderFaGo18,
	address = {Paris, France},
	annote = {C86},
	author = {Michael A. Bender and Martin Farach{-}Colton and Mayank Goswami and Rob Johnson and Samuel McCauley and Shikha Singh},
	booktitle = {Proc.\ 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
	date-added = {2018-07-22 14:48:58 +0000},
	date-modified = {2019-01-18 14:19:35 -0500},
	month = {October},
	pages = {182-193},
	title = {Bloom Filters, Adaptivity, and the Dictionary Problem},
	year = {2018}}

@inproceedings{ZhanCoJi18,
	address = {Oakland, CA, USA},
	annote = {C85},
	author = {Yang Zhan and Alexander Conway and Yizheng Jiao and Eric Knorr and Michael A. Bender and Martin Farach{-}Colton and William Jannen and Rob Johnson and Donald E. Porter and Jun Yuan},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/bib/conf/fast/ZhanCJKBFJJPY18},
	booktitle = {Proc.\ 16th {USENIX} Conference on File and Storage Technologies (FAST)},
	date-added = {2018-07-22 14:12:20 +0000},
	date-modified = {2022-11-22 15:29:22 -0500},
	month = {February},
	pages = {123--138},
	title = {The Full Path to Full-Path Indexing},
	url = {https://www.usenix.org/conference/fast18/presentation/zhan},
	year = {2018},
	bdsk-url-1 = {https://www.usenix.org/conference/fast18/presentation/zhan}}

@article{PandeyBeJo18,
	annote = {A48},
	author = {Prashant Pandey and Michael A. Bender and Rob Johnson and Robert Patro},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/bib/journals/bioinformatics/PandeyBJP18},
	date-added = {2018-07-22 13:58:14 +0000},
	date-modified = {2019-04-29 16:13:34 -0400},
	doi = {10.1093/bioinformatics/btx636},
	journal = {Bioinformatics},
	month = {February},
	number = {4},
	pages = {568--575},
	title = {Squeakr: an exact and approximate k-mer counting system},
	url = {https://doi.org/10.1093/bioinformatics/btx636},
	volume = {34},
	year = {2018},
	bdsk-url-1 = {https://doi.org/10.1093/bioinformatics/btx636}}

@article{PandeyBeJo17c,
	annote = {A47},
	author = {Pandey, Prashant and Bender, Michael A. and Johnson, Rob and Patro, Rob},
	date-added = {2017-07-23 22:28:18 +0000},
	date-modified = {2019-04-15 16:43:24 -0400},
	doi = {10.1093/bioinformatics/btx261},
	eprint = {/oup/backfile/content_public/journal/bioinformatics/33/14/10.1093_bioinformatics_btx261/2/btx261.pdf},
	journal = {Bioinformatics},
	month = {July},
	number = {14},
	pages = {i133-i141},
	title = {{deBGR}: An Efficient and Near-Exact Representation of the Weighted de {Bruijn} Graph},
	url = {+ http://dx.doi.org/10.1093/bioinformatics/btx261},
	volume = {33},
	year = {2017},
	bdsk-url-1 = {+%20http://dx.doi.org/10.1093/bioinformatics/btx261},
	bdsk-url-2 = {http://dx.doi.org/10.1093/bioinformatics/btx261}}

@inproceedings{AlmodaresiPaPa17,
	annote = {student},
	author = {Almodaresi, Fatemeh and Pandey, Prashant and Patro, Rob},
	booktitle = {Proc.\ Workshop on Algorithms in Bioinformatics (WABI)},
	month = {August},
	title = {Rainbowfish: A Succinct Colored de Bruijn Graph Representation},
	year = {2017}}

@inproceedings{LiuMaYa17,
	annote = {student},
	author = {Liu, Kin Sum and Mayer, Tyler and Yang, Hao Tsung and Arkin, Esther and Gao, Jie and Goswami, Mayank and JohnsonS, Matthew P and KumarP, Nirman and Lin, Shan},
	booktitle = {IEEE International Conference on Computer Communications},
	title = {Joint Sensing Duty Cycle Scheduling for Heterogeneous Coverage Guarantee},
	year = {2017}}

@inproceedings{PandeyBeJo17b,
	abstract = {A48},
	annote = {C84.5},
	author = {Prashant Pandey and Michael A. Bender and Rob Johnson and Rob Patro},
	booktitle = {Proc.\ Intelligent Systems in Molecular Biology (ISMB/ECCB)},
	date-added = {2017-07-14 11:09:57 +0000},
	date-modified = {2018-07-22 14:19:58 +0000},
	month = {July},
	title = {{deBGR}: An Efficient and Near-Exact Representation of the Weighted de {Bruijn} Graph},
	year = {2017}}

@article{BenderFaFe17,
	annote = {A46},
	author = {Michael A. Bender and Martin Farach-Colton and S{\'a}ndor P. Fekete and Jeremy T. Fineman and Seth Gilbert},
	doi = {10.1145/3070693},
	journal = {{ACM} Transactions on Algorithms},
	month = may,
	number = {3},
	pages = {38:1--38:20},
	title = {Cost-Oblivious Storage Reallocation},
	url = {http://doi.acm.org/10.1145/3070693},
	volume = {13},
	year = {2017},
	bdsk-url-1 = {http://doi.acm.org/10.1145/3070693},
	bdsk-url-2 = {https://doi.org/10.1145/3070693}}

@article{YuanZhJa17,
	annote = {A45},
	author = {Jun Yuan and Yang Zhan and William Jannen and Prashant Pandey and Amogh Akshintala and Kanchan Chandnani and Pooja Deo and Zardosht Kasheff and Leif Walsh and Michael A. Bender and Martin Farach-Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter},
	date-modified = {2019-04-14 11:52:51 -0400},
	journal = {Transactions on Storage---Special Issue on USENIX FAST 2016},
	month = {March},
	number = {1},
	pages = {3:1-3:21},
	title = {Writes Wrought Right, and Other Adventures in File System Optimization},
	volume = {13},
	year = {2017}}

@article{BenderBeHa17,
	annote = {A44},
	author = {Michael A. Bender and Jonathan W. Berry and Simon D. Hammond and K. Scott Hemmert and Samuel McCauley and Branden Moore and Benjamin Moseley and Cynthia A. Phillips and David S. Resnick and Arun Rodrigues},
	date-modified = {2019-04-14 11:52:29 -0400},
	doi = {10.1016/j.jpdc.2016.12.009},
	journal = {Journal of Parallel and Distributed Computing},
	pages = {213--228},
	title = {Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation},
	url = {http://dx.doi.org/10.1016/j.jpdc.2016.12.009},
	volume = {102},
	year = {2017},
	bdsk-url-1 = {http://dx.doi.org/10.1016/j.jpdc.2016.12.009}}

@inproceedings{BenderFaJo17,
	address = {Chicago, IL, USA},
	annote = {C84},
	author = {Michael A. Bender and Martin Farach-Colton and Rob Johnson and Simon Mauras and Tyler Mayer and Cynthia Phillips and Helen Xu},
	booktitle = {Proc.\ 36th ACM Symposium on Principles of Database Systems (PODS)},
	date-modified = {2018-07-22 13:39:18 +0000},
	month = {May},
	pages = {69-78},
	title = {Write-Optimized Skip Lists},
	year = {2017}}

@inproceedings{PandeyBeJo17a,
	annote = {C83},
	author = {Prashant Pandey and Michael A. Bender and Rob Johnson and Rob Patro},
	booktitle = {Proc.\ 2017 International Conference on Management of Data (SIGMOD)},
	date-added = {2017-01-01 18:31:04 +0000},
	date-modified = {2017-01-01 18:35:25 +0000},
	month = {May},
	pages = {775-787},
	title = {A General-Purpose Counting Filter: Making Every Bit Count},
	year = {2017}}

@inproceedings{ConwayBaJi17a,
	annote = {C82},
	author = {Alexander Conway and Ainesh Bakshi and Yizheng Jiao and Yang Zhan and Michael A. Bender and William Jannen and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter and Jun Yuan and Martin Farach-Colton},
	booktitle = {Proc.\ 15th {USENIX} Conference on File and Storage Technologies (FAST)},
	date-modified = {2019-06-09 22:27:23 +0200},
	month = {February},
	pages = {45--58},
	title = {File Systems Fated for Senescence? Nonsense, Says Science!},
	year = {2017}}

@inproceedings{AfshaniBeFa17,
	annote = {C81},
	author = {Peyman Afshani and Michael A. Bender and Martin Farach-Colton and Jeremy T. Fineman and Mayank Goswami and Meng-Tsung Tsai},
	booktitle = {Proc.\ 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	month = {January},
	pages = {1523--1532},
	title = {Cross-Referenced Dictionaries and the Limits of Write Optimization},
	year = {2017}}

@inproceedings{BenderFiGi17,
	annote = {C80},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Tsvi Kopelowitz and Pablo Montes},
	booktitle = {Proc.\ 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-added = {2016-10-23 19:29:35 +0000},
	date-modified = {2017-03-02 17:48:59 +0000},
	month = {January},
	pages = {1503-1522},
	title = {File Maintenance: When in Doubt, Change the Layout!},
	year = {2017}}

@article{BenderChGa16-old,
	annote = {A44-old},
	author = {Michael A. Bender and Rezaul A. Chowdhury and Pramod Ganapathi and Samuel McCauley and Yuan Tang},
	date-modified = {2019-04-15 16:48:10 -0400},
	doi = {http://dx.doi.org/10.1016/j.tcs.2015.12.040},
	journal = {Theoretical Computer Science},
	note = {available online},
	title = {The range 1 query {(R1Q)} problem},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397515012219},
	year = {2016},
	bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397515012219},
	bdsk-url-2 = {http://dx.doi.org/10.1016/j.tcs.2015.12.040}}

@article{BenderHuKu16,
	annote = {A43},
	author = {Michael A. Bender and Roozbeh Ebrahimi and Haodong Hu and Bradley C. Kuszmaul},
	date-modified = {2017-04-26 20:09:58 +0000},
	journal = {Transactions on Database Systems},
	month = jul,
	number = {3},
	pages = {19:1--19:33},
	title = {{B}-trees and Cache-Oblivious {B}-trees with Different-Sized Atomic Keys},
	volume = {41},
	year = {2016}}

@inproceedings{JannenBeFa16,
	address = {Denver},
	annote = {C77},
	author = {William Jannen and Michael A. Bender and Martin Farach-Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter},
	booktitle = {8th {USENIX} Workshop on Hot Topics in Storage and File Systems (HotStorage)},
	date-added = {2016-05-21 12:17:05 +0000},
	date-modified = {2016-05-21 12:21:05 +0000},
	month = {June},
	title = {Lazy Analytics: Let Other Queries Do the Work For You},
	year = {2016}}

@inproceedings{BenderMcSi16,
	annote = {C75},
	author = {Michael A. Bender and Samuel McCauley and Bertrand Simon and Shikha Singh and Fr\'e{}d\'e{}ric Vivien},
	booktitle = {Proc.\ Eighth International Conference on Fun with Algorithms (FUN)},
	date-added = {2016-05-01 16:19:59 +0000},
	date-modified = {2016-08-20 11:47:56 +0000},
	month = {June},
	pages = {7:1--7:20},
	title = {Resource Optimization for Program Committee Members: A Subreview Article},
	year = {2016}}

@inproceedings{BenderKoPe16,
	annote = {C76},
	author = {Michael A. Bender and Tsvi Kopelowitz and Seth Pettie and Maxwell Young},
	booktitle = {Proc.\ 48th Annual Symposium on the Theory of Computing (STOC)},
	date-added = {2016-03-12 13:56:00 +0000},
	date-modified = {2016-06-29 18:50:05 +0000},
	month = {June},
	pages = {499-508},
	title = {Contention Resolution with Log-Logstar Channel Accesses},
	year = {2016}}

@inproceedings{BenderBeJo16,
	annote = {C78},
	author = {Michael A.~Bender and Jon Berry and Rob Johnson and Thomas M. Kroeger and Samuel McCauley and Cynthia A. Phillips and Bertrand Simon and Shikha Singh and David Zage},
	booktitle = {Proc.\ 35th ACM Symposium on Principles of Database Systems (PODS)},
	date-added = {2016-03-12 13:46:52 +0000},
	date-modified = {2016-06-29 18:49:12 +0000},
	month = {June},
	pages = {289-302},
	title = {Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries},
	year = {2016}}

@article{BenderFiGi16b,
	annote = {A42},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Robert E. Tarjan},
	date-added = {2016-03-12 13:21:47 +0000},
	date-modified = {2019-04-15 16:55:11 -0400},
	doi = {10.1145/2756553},
	journal = {{ACM} Transactions on Algorithms},
	month = {February},
	number = {2},
	pages = {14:1--14:22},
	title = {A New Approach to Incremental Cycle Detection and Related Problems},
	volume = {12},
	year = {2016},
	bdsk-url-1 = {http://doi.acm.org/10.1145/2756553},
	bdsk-url-2 = {http://dx.doi.org/10.1145/2756553}}

@inproceedings{YuanZhJa16,
	address = {Santa Clara, CA},
	annote = {C73},
	author = {Jun Yuan and Yang Zhan and William Jannen and Prashant Pandey and Amogh Akshintala and Kanchan Chandnani and Pooja Deo and Zardosht Kasheff and Leif Walsh and Michael A. Bender and Martin Farach{-}Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter},
	booktitle = {Proc.\ 14th {USENIX} Conference on File and Storage Technologies (FAST)},
	date-added = {2016-03-12 13:19:03 +0000},
	date-modified = {2016-08-20 11:54:09 +0000},
	month = {February},
	pages = {1--14},
	title = {Optimizing Every Operation in a Write-optimized File System},
	year = {2016},
	bdsk-url-1 = {https://www.usenix.org/conference/fast16/technical-sessions/presentation/yuan}}

@inproceedings{BenderEbFi13,
	address = {Sophia Antipolis, France},
	annote = {W8},
	author = {Michael A. Bender and Roozbeh Ebrahimi and Jeremy T. Fineman and Golnaz Ghasemiesfeh and Rob Johnson and Samuel McCauley},
	booktitle = {Fifth Workshop on Massive Data Algorithmics ({MASSIVE} 2013)},
	date-added = {2015-12-27 23:25:58 +0000},
	date-modified = {2015-12-27 23:25:58 +0000},
	month = {September},
	title = {Cache-Adaptive Algorithms},
	year = {2013}}

@article{BenderFaJa15,
	annote = {technical_maganize_2},
	author = {Michael A. Bender and Martin Farach-Colton and William Jannen and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter and Jun Yuan and Yang Zhan},
	date-added = {2015-12-27 14:58:13 +0000},
	date-modified = {2015-12-27 23:29:21 +0000},
	journal = {:login; magazine},
	month = {October},
	number = {5},
	pages = {22-28},
	title = {An Introduction to B$^\epsilon$-Trees and Write-Optimization},
	volume = {40},
	year = {2015}}

@article{ConwayBaJi17b,
	annote = {technical_maganize_3},
	author = {Alex Conway and Ainesh Bakshi and Yizheng Jiao and Yang Zhan and Michael A. Bender and William Jannen and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter and Jun Yuan and Martin Farach{-}Colton},
	date-modified = {2019-06-09 22:27:13 +0200},
	journal = {;login:},
	number = {2},
	title = {How to Fragment Your File System},
	volume = {42},
	year = {2017}}

@article{ZhanCoJi20b,
	annote = {technical_maganize_4},
	author = {Yang Zhan and Alexander Conway and Yizheng Jiao and Nirjhar Mukherjee and Ian Groombridge and Michael A. Bender and Mart{\'\i}n Farach-Colton and William Jannen and Rob Johnson and Donald E. Porter and Jun Yuan},
	date-modified = {2021-01-20 22:41:29 -0500},
	journal = {;login:},
	number = {3},
	title = {How to Not Copy Files},
	volume = {45},
	year = {2020}}

@inproceedings{BenderChCo16,
	annote = {C74},
	author = {Michael A. Bender and Rezaul Chowdhury and Alex Conway and Mart\'i{}n Farach-Colton and Pramod Ganapathi and Rob Johnson and Samuel McCauley and Bertrand Simon and Shikha Singh},
	booktitle = {Proc.\ 12th Latin American Theoretical Informatics Symposium (LATIN)},
	date-added = {2015-12-25 22:53:06 +0000},
	date-modified = {2016-04-23 14:58:26 +0000},
	month = {April},
	pages = {192-206},
	title = {The {I/O} Complexity of Computing Prime Tables},
	year = {2016}}

@inproceedings{BenderMcMc15b,
	annote = {C71},
	author = {Michael A. Bender and Samuel McCauley and Andrew McGregor and Shikha Singh and Hoa T. Vu},
	booktitle = {Proc.\ 26th International Symposium on Algorithms and Computation (ISAAC)},
	date-added = {2015-08-31 16:21:01 +0000},
	date-modified = {2016-06-29 17:10:53 +0000},
	month = {December},
	pages = {703-714},
	title = {Run Generation Revisited: What Goes Up May or May Not Come Down},
	year = {2015}}

@article{BenderFaFe15b,
	annote = {A39},
	author = {Bender, Michael A. and Farach-Colton, Mart\'\i{}n and Fekete, S\'a{}ndor P. and Fineman, Jeremy T. and Gilbert, Seth},
	date-modified = {2016-06-29 17:14:45 +0000},
	doi = {10.1007/s00453-014-9930-4},
	journal = {Algorithmica},
	month = {June},
	pages = {389--409},
	title = {Reallocation Problems in Scheduling},
	url = {http://dx.doi.org/10.1007/s00453-014-9930-4},
	volume = {73},
	year = {2015},
	bdsk-url-1 = {http://dx.doi.org/10.1007/s00453-014-9930-4}}

@inproceedings{BenderFaFe15a,
	address = {Portland, OR, USA},
	annote = {C69},
	author = {Michael A. Bender and Mart\'i{}n Farach-Colton and S\'a{}ndor P. Fekete and Jeremy T. Fineman and Seth Gilbert},
	booktitle = {Proc.\ 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2015-01-22 17:45:59 +0000},
	date-modified = {2015-09-14 21:40:45 +0000},
	month = {June},
	pages = {143-154},
	title = {Cost-Oblivious Reallocation for Scheduling and Planning},
	year = {2015}}

@inproceedings{BenderFiGi16a,
	annote = {C72},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Maxwell Young},
	booktitle = {Proc.\ 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-added = {2015-01-22 17:43:22 +0000},
	date-modified = {2016-03-12 13:51:58 +0000},
	month = {January},
	pages = {636-654},
	title = {How to Scale Exponential Backoff: {Constant} Throughput, Polylog Access Attempts, and Robustness},
	year = {2016}}

@inproceedings{BenderDeEb16,
	annote = {C79},
	author = {Michael A. Bender and Erik D. Demaine and Roozbeh Ebrahimi and Jeremy T. Fineman and Rob Johnson and Andrea Lincoln and Jayson Lynch and Samuel McCauley},
	booktitle = {Proc.\ 28th {ACM} Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2017-01-01 18:57:29 +0000},
	month = {July},
	pages = {135-144},
	title = {Cache-Adaptive Analysis},
	year = {2016}}

@inproceedings{JannenYuZh15a,
	annote = {C67},
	author = {William Jannen and Jun Yuan and Yang Zhan and Amogh Akshintala and John Esmet and Yizheng Jiao and Ankur Mittal and Prashant Pandey and Phaneendra Reddy and Leif Walsh and Michael A. Bender and Martin Farach{-}Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter},
	booktitle = {Proc.\ 13th {USENIX} Conference on File and Storage Technologies (FAST)},
	date-modified = {2015-12-26 02:56:32 +0000},
	editor = {Jiri Schindler and Erez Zadok},
	location = {Santa Clara, CA, USA},
	month = {February},
	pages = {301--315},
	title = {BetrFS: {A} Right-Optimized Write-Optimized File System},
	year = {2015}}

@inproceedings{BenderBeHa15a,
	address = {Hyderabad, INDIA},
	annote = {C68},
	author = {Michael A. Bender and Jonathan Berry and Simon D. Hammond and K. Scott Hemmert and Samuel McCauley and Branden Moore and Benjamin Moseley and Cynthia A. Phillips and David Resnick and Arun Rodrigues},
	booktitle = {Proc.\ 29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
	date-added = {2015-01-22 17:11:35 +0000},
	date-modified = {2015-07-13 11:49:41 +0000},
	month = {May},
	title = {Two-Level Main Memory Co-Design: Multi-Threaded Algorithmic Primitives, Analysis, and Simulation},
	year = {2015}}

@misc{BenderBigData12,
	annote = {press},
	author = {{Stony Brook News}},
	date-added = {2013-09-06 02:47:06 +0000},
	date-modified = {2015-12-27 14:56:14 +0000},
	month = {October},
	note = {\url{http://commcgi.cc.stonybrook.edu/am2/publish/General_University_News_2/SBU_Researchers_Receive_NSF_Award_For_Big_Data_Storage.shtml}},
	title = {{SBU Researchers Receive NSF Award For Big Data Storage}},
	url = {http://commcgi.cc.stonybrook.edu/am2/publish/General_University_News_2/SBU_Researchers_Receive_NSF_Award_For_Big_Data_Storage.shtml},
	year = {2012},
	bdsk-url-1 = {http://commcgi.cc.stonybrook.edu/am2/publish/General_University_News_2/SBU_Researchers_Receive_NSF_Award_For_Big_Data_Storage.shtml}}

@misc{Sandia06,
	annote = {press},
	author = {{Sandia New Media Contact}},
	date-modified = {2015-12-27 14:52:45 +0000},
	month = {July},
	note = {\url{https://share.sandia.gov/news/resources/releases/2006/rd100-awards.html}},
	title = {Sandia Wins Two {R\&D 100 Awards}},
	url = {http://www.sandia.gov/LabNews/060331.html},
	year = {2006},
	bdsk-url-1 = {http://www.sandia.gov/LabNews/060331.html}}

@misc{TokuMX,
	author = {{Tokutek, Inc.}},
	date-added = {2013-09-04 13:58:39 +0000},
	date-modified = {2013-09-04 16:24:32 +0000},
	howpublished = {\url{http://www.tokutek.com/products/tokumx-for-mongodb/}},
	title = {{TokuMX---MongoDB Performance Engine}}}

@misc{Tokutek,
	author = {{Tokutek, Inc.}},
	date-added = {2013-09-04 13:52:43 +0000},
	date-modified = {2013-09-04 19:04:46 +0000},
	howpublished = {\url{http://tokutek.com}},
	title = {{Tokutek---Delivering Database Performance at Scale}}}

@misc{TokuDB,
	author = {{Tokutek, Inc.}},
	date-added = {2013-09-04 13:52:43 +0000},
	date-modified = {2013-09-04 16:26:02 +0000},
	howpublished = {\url{http://www.tokutek.com/products/tokudb-for-mysql/}},
	title = {{TokuDB: MySQL Performance, MariaDB Performance }}}

@article{BenderSt93,
	annote = {A1},
	author = {Michael A. Bender and Howard A. Stone},
	journal = {Journal of Electroanalytical Chemistry and Interfacial Chemistry},
	pages = {29--55},
	title = {An Integral Equation Approach to the Study of the Steady-State Current at Surface Microelectrodes},
	volume = {351},
	year = 1993}

@article{BenderGaMo95,
	annote = {A2},
	author = {Michael A. Bender and Michel Gastaldo and Michel Morvan},
	journal = {Theoretical Computer Science},
	number = {1},
	pages = {73--91},
	title = {Parallel Interval Order Recognition and Construction of Interval Representations},
	volume = {143},
	year = {1995}}

@article{AumannBeZh97,
	annote = {A3},
	author = {Yonatan Aumann and Michael A. Bender and Lisa Zhang},
	journal = {Information and Computation},
	month = {25~} # nov,
	number = {1},
	pages = {1--16},
	title = {Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems},
	volume = {139},
	year = {1997}}

@article{BenderCh00,
	annote = {A4},
	author = {Michael A. Bender and Chandra Chekuri},
	journal = {Information Processing Letters},
	number = {1--2},
	pages = {17--21},
	title = {Performance Guarantees for the {TSP} with a Parameterized Triangle Inequality},
	volume = {73},
	year = {2000}}

@article{SatoBiBe00b,
	annote = {A5},
	author = {Mie Sato and Ingmar Bitter and Michael A. Bender and Arie E. Kaufman and Masayuki Nakajima},
	date-modified = {2013-09-06 02:46:59 +0000},
	journal = {The Journal of the Institute of Image Information and Television Engineers},
	title = {Tree-structure Extraction Algorithm for Accurate and Robust Skeletons (in {Japanese})},
	year = {2000}}

@article{ChekuriBe01,
	annote = {A6},
	author = {Chandra Chekuri and Michael A. Bender},
	date-modified = {2013-04-17 17:30:11 +0000},
	journal = {Journal of Algorithms},
	pages = {212--224},
	title = {An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines},
	volume = 41,
	year = 2001}

@article{BenderRo02,
	annote = {A7},
	author = {Michael A. Bender and Dana Ron},
	date-modified = {2013-04-17 17:30:51 +0000},
	journal = {Random Structures and Algorithms},
	number = {2},
	pages = {184--205},
	title = {Testing Properties of Directed Graphs: Acyclicity and Connectivity},
	volume = {20},
	year = {2002}}

@article{AndrewsBeZh02,
	annote = {A8},
	author = {Matthew Andrews and Michael A. Bender and Lisa Zhang},
	journal = {Algorithmica},
	month = {February},
	number = {2},
	pages = {277--301},
	title = {New Algorithms for the Disk Scheduling Problem},
	volume = {32},
	year = {2002}}

@article{BenderRa02,
	annote = {A9},
	author = {Michael A. Bender and Michael O. Rabin},
	date-modified = {2013-04-17 17:30:58 +0000},
	journal = {Theory of Computing Systems Special Issue on SPAA00},
	pages = {289--304},
	title = {Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to {Cilk}},
	volume = {35},
	year = {2002}}

@article{BenderFeRo02,
	annote = {A10},
	author = {Michael A. Bender and Antonio Fern{\'a}ndez and Dana Ron and Amit Sahai and Salil P. Vadhan},
	date-modified = {2013-04-17 17:31:14 +0000},
	journal = {Information and Computation},
	pages = {1--21},
	title = {The Power of a Pebble: Exploring and Mapping Directed Graphs},
	volume = {176},
	year = {2002}}

@article{ArkinBeMi03,
	annote = {A11},
	author = {Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell and Steven Skiena},
	journal = {Information and Computation},
	number = {1},
	pages = {129--146},
	title = {The Lazy Bureaucrat Scheduling Problem},
	volume = {184},
	year = {2003}}

@article{BenderBeDe04,
	annote = {A12},
	author = {Carl M. Bender and Michael A. Bender and Erik D. Demaine and S{\'a}ndor P. Fekete},
	journal = {Journal of Physics A: Mathematical and General},
	pages = {147-159},
	title = {What is the Optimal Shape of a City?},
	volume = {37},
	year = {2004}}

@article{BenderFa04,
	annote = {A13},
	author = {Michael A. Bender and Martin Farach-Colton},
	journal = {Theoretical Computer Science},
	number = {1},
	pages = {5--12},
	title = {The Level Ancestor Problem Simplified},
	volume = {321},
	year = {2004}}

@article{ArkinBeDe04,
	annote = {A14},
	author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and Martin L. Demaine and Joseph S. B. Mitchell and Saurabh Sethia and Steven Skiena},
	date-modified = {2013-04-19 16:26:16 +0000},
	journal = {Computational Geometry: Theory and Applications},
	journalurl = {http://www.elsevier.com/locate/issn/09257721},
	month = {September},
	note = {Special issue of selected papers from the 10th Annual Fall Workshop on Computational Geometry, 2000.},
	number = 1,
	pages = {23--46},
	title = {When Can You Fold a Map?},
	volume = 29,
	year = 2004}

@article{SztainbergArBe04,
	annote = {A15},
	author = {Marcelo Sztainberg and Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell},
	date-modified = {2014-01-15 18:46:10 +0000},
	journal = {IEEE Transactions on Robotics and Automation},
	month = {August},
	number = {4},
	pages = {691-701},
	title = {Theoretical and Experimental Analysis of Heuristics for the Freeze-Tag Robot Awakening Problem},
	volume = {20},
	year = {2004}}

@article{BenderMuRa04,
	annote = {A16},
	author = {Michael A. Bender and S. Muthukrishnan and Rajmohan Rajaraman},
	journal = {Journal of Scheduling},
	note = {Special issue of selected papers from SODA 2002},
	number = {3},
	pages = {195-222},
	title = {Approximation Algorithms for Average Stretch Scheduling},
	volume = {7},
	year = {2004}}

@article{BenderDuIa04,
	annote = {A17},
	author = {Michael A. Bender and Ziyang Duan and John Iacono and Jing Wu},
	journal = {Journal of Algorithms},
	number = {2},
	pages = {115--136},
	title = {A Locality-Preserving Cache-Oblivious Dynamic Dictionary},
	volume = {3},
	year = {2004}}

@article{BenderSeSk04,
	annote = {A18},
	author = {Michael A. Bender and Saurabh Sethia and Steven Skiena},
	date-modified = {2013-04-19 16:23:13 +0000},
	journal = {Random Structures and Algorithms},
	number = {1},
	pages = {43--67},
	title = {Data Structures for Maintaining Set Partitions},
	volume = {25},
	year = {2004}}

@article{AumannBe04,
	annote = {A19},
	author = {Yonatan Aumann and Michael A. Bender},
	journal = {Distributed Computing},
	number = {3},
	pages = {191-207},
	title = {Efficient Low-Contention Asynchronous Consensus with the Value-Oblivious Adversary Scheduler},
	volume = {17},
	year = {2005}}

@article{BenderDeFa05,
	annote = {A20},
	author = {Michael A. Bender and Erik D. Demaine and Martin Farach-Colton},
	journal = {{SIAM} Journal on Computing},
	number = {2},
	pages = {341-358},
	title = {Cache-Oblivious {B}-Trees},
	volume = {35},
	year = {2005}}

@article{ArkinBeDe05,
	annote = {A21},
	author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Saurabh Sethia},
	date-modified = {2013-04-17 17:51:16 +0000},
	journal = {{SIAM} Journal on Computing},
	number = {3},
	pages = {531-566},
	title = {Optimal Covering Tours with Turn Costs},
	volume = {35},
	year = {2005}}

@article{BenderFaPe05,
	annote = {A22},
	author = {Michael A. Bender and Martin Farach-Colton and Giridhar Pemmasani and Steven Skiena and Pavel Sumazin},
	date-modified = {2013-04-19 16:23:52 +0000},
	journal = {Journal of Algorithms},
	number = {2},
	pages = {75-94},
	title = {Lowest Common Ancestors in Trees and Directed Acyclic Graphs},
	volume = {57},
	year = {2005}}

@article{BenderFaMo06,
	annote = {A23},
	author = {Michael A. Bender and Martin Farach-Colton and Miguel A. Mosteiro},
	journal = {Theory of Computing Systems},
	note = {Special Issue on \emph{FUN '04}},
	number = {3},
	pages = {391-397},
	title = {Insertion Sort is {$O(n \log n)$}},
	volume = {39},
	year = {2006}}

@article{ArkinBeFe06,
	annote = {A24},
	author = {Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Martin Skutella},
	date-modified = {2013-04-17 17:49:50 +0000},
	journal = {Algorithmica},
	number = {2},
	pages = {193-221},
	title = {The Freeze-Tag Problem: How to Wake Up a Swarm of Robots},
	volume = {46},
	year = {2006}}

@article{ArgeBeDe07,
	annote = {A25},
	author = {Lars Arge and Michael A. Bender and Erik D. Demaine and Bryan Holland-Minkley and J. Ian Munro},
	date-modified = {2013-04-17 17:48:03 +0000},
	journal = {{SIAM} Journal on Computing},
	number = {6},
	pages = {1672-1695},
	title = {Cache-Oblivious Priority Queue and Graph Algorithm Applications},
	volume = {36},
	year = {2007}}

@article{BenderBrJa07,
	annote = {A26},
	author = {Michael A. Bender and Bryan Bradley and Geetha Jagannathan and Krishnan Pillaipakkamnatt},
	date-modified = {2015-12-27 14:50:56 +0000},
	journal = {Journal of Experimental Algorithmics},
	pages = {2.3},
	title = {Sum-of-Squares Heuristics for Bin Packing and Memory Allocation},
	volume = {12},
	year = {2007}}

@article{BenderBe07,
	annote = {A27},
	author = {Michael A. Bender and Carl M. Bender},
	journal = {Journal of Mathematical Physics},
	number = {7},
	title = {Optimal Shape of a Blob},
	volume = {8},
	year = {2007}}

@article{BenderHu07,
	annote = {A28},
	author = {Michael A. Bender and Haodong Hu},
	journal = {{ACM} Trans. Database Syst.},
	month = nov,
	number = {4},
	pages = {26:1-26:43},
	title = {An adaptive packed-memory array},
	volume = {32},
	year = {2007}}

@article{BenderClTs08,
	annote = {A29},
	author = {Michael A. Bender and Raphael Clifford and Kostas Tsichlas},
	journal = {Journal of Scheduling},
	number = {2},
	pages = {95-104},
	title = {Scheduling Algorithms for Procrastinators},
	volume = {11},
	year = {2008}}

@article{BenderGeHe08,
	annote = {A30},
	author = {Michael A. Bender and Dongdong Ge and Simai He and Haodong Hu and Ron Y. Pinter and Steven Skiena and Firas Swidan},
	date-modified = {2013-04-19 16:24:37 +0000},
	journal = {Journal of Computer and System Sciences},
	number = {5},
	pages = {744-774},
	title = {Improved Bounds on Sorting by Length-Weighted Reversals},
	volume = {74},
	year = {2008}}

@article{BenderBuDe08,
	annote = {A31},
	author = {Michael A. Bender and David P. Bunde and Erik D. Demaine and S{\'a}ndor P. Fekete and Vitus J. Leung and Henk Meijer and Cynthia A. Phillips},
	date-modified = {2013-04-17 17:46:26 +0000},
	journal = {Algorithmica},
	number = {2},
	pages = {279-298},
	title = {Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance},
	volume = {50},
	year = {2008}}

@article{AgrawalBeFi09,
	annote = {A32},
	author = {Kunal Agrawal and Michael A. Bender and Jeremy T. Fineman},
	journal = {Theory of Computing Systems},
	number = {2},
	pages = {175-185},
	title = {The Worst Page-Replacement Policy},
	volume = {44},
	year = {2009}}

@article{BenderBrFa10,
	annote = {A33},
	author = {Michael A. Bender and Gerth St{\o}lting Brodal and Rolf Fagerberg and Riko Jacob and Elias Vicari},
	date-modified = {2015-12-27 14:54:51 +0000},
	journal = {Theory of Computing Systems},
	note = {Special Issue on {\em SPAA '07}},
	number = {4},
	pages = {934-962},
	title = {Optimal Sparse Matrix Dense Vector Multiplication in the {I/O}-Model},
	volume = {47},
	year = {2010}}

@article{BenderKuTe11,
	annote = {A34},
	author = {Michael A. Bender and Bradley C. Kuszmaul and Shang-Hua Teng and Kebin Wang},
	journal = {Theory of Computing Systems},
	number = {2},
	title = {Optimal Cache-Oblivious Mesh Layouts},
	volume = {48},
	year = {2011}}

@article{BenderBrFa11,
	annote = {A35},
	author = {Michael A. Bender and Gerth St{\o}lting Brodal and Rolf Fagerberg and Dongdong Ge and Simai He and Haodong Hu and John Iacono and Alejandro L{\'o}pez-Ortiz},
	date-modified = {2015-12-27 14:57:16 +0000},
	journal = {Algorithmica},
	number = {2},
	pages = {463-505},
	title = {The Cost of Cache-Oblivious Searching},
	volume = {61},
	year = {2011}}

@article{ArkinBeMi11,
	annote = {A36},
	author = {Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell and Valentin Polishchuk},
	date-modified = {2015-12-27 14:56:35 +0000},
	journal = {Compututational Geometry},
	number = {8},
	pages = {370-384},
	title = {The Snowblower Problem},
	volume = {44},
	year = {2011}}

@article{BenderFaJo12,
	annote = {A37},
	author = {Michael A. Bender and Martin Farach-Colton and Rob Johnson and Russell Kraner and Bradley C. Kuszmaul and Dzejla Medjedovic and Pablo Montes and Pradeep Shetty and Richard P. Spillane and Erez Zadok},
	date-modified = {2013-04-17 17:22:22 +0000},
	journal = {PVLDB},
	number = {11},
	pages = {1627-1637},
	title = {Don't Thrash: How to Cache Your Hash on Flash},
	volume = {5},
	year = {2012}}

@article{BenderBoCh13,
	annote = {A38},
	author = {Michael A. Bender and Ritwik Bose and Rezaul Chowdhury and Samuel McCauley},
	doi = {10.1007/s00224-013-9484-x},
	journal = {Theory of Computing Systems Special Issue on FUN12},
	pages = {1-16},
	publisher = {Springer-Verlag},
	ssn = {1432-4350},
	title = {The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye},
	year = {2014},
	bdsk-url-1 = {http://dx.doi.org/10.1007/s00224-013-9484-x}}

@inproceedings{BenderSl94,
	annote = {C1},
	author = {Michael A. Bender and Donna K. Slonim},
	booktitle = {Proc.\ 35th Annual Symposium on Foundations of Computer Science (FOCS)},
	month = {November},
	pages = {75--85},
	title = {The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs},
	year = {1994}}

@inproceedings{AumannBe96a,
	annote = {C2},
	author = {Yonatan Aumann and Michael A. Bender},
	booktitle = {Proc.\ 23rd International Colloquium on Automata, Languages, and Programming (ICALP)},
	date-modified = {2013-04-19 00:50:50 +0000},
	month = {July},
	pages = {622--633},
	title = {Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler},
	year = {1996}}

@inproceedings{AndrewsBeZh96,
	annote = {C3},
	author = {Matthew Andrews and Michael A. Bender and Lisa Zhang},
	booktitle = {Proc.\ 37th Annual Symposium on Foundations of Computer Science (FOCS)},
	date-modified = {2013-04-19 00:50:28 +0000},
	pages = {580--589},
	title = {New Algorithms for the Disk Scheduling Problem},
	year = {1996}}

@inproceedings{AumannBeZh96,
	annote = {C4},
	author = {Yonatan Aumann and Michael A. Bender and Lisa Zhang},
	booktitle = {Proc.\ 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)},
	date-modified = {2013-04-19 00:49:59 +0000},
	pages = {270--276},
	title = {Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems},
	year = {1996}}

@inproceedings{AumannBe96b,
	annote = {C5},
	author = {Yonatan Aumann and Michael A. Bender},
	booktitle = {Proc.\ 37th Annual Symposium on Foundations of Computer Science (FOCS)},
	date-modified = {2013-04-19 00:51:01 +0000},
	month = {October},
	pages = {580--589},
	title = {Fault Tolerant Data Structures},
	year = {1996}}

@inproceedings{BenderChMu98,
	annote = {C6},
	author = {Michael A. Bender and Soumen Chakrabarti and S. Muthukrishnan},
	booktitle = {Proc.\ 9th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)},
	pages = {270--279},
	title = {Flow and Stretch Metrics for Scheduling Continuous Job Streams},
	year = {1998}}

@inproceedings{BenderFeRo98,
	annote = {C7},
	author = {Michael A. Bender and Antonio Fern{\'a}ndez and Dana Ron and Amit Sahai and Salil P. Vadhan},
	booktitle = {Proc.\ 30th Annual {ACM} Symposium on Theory of Computing ({STOC})},
	pages = {269--278},
	title = {The Power of a Pebble: Exploring and Mapping Directed Graphs},
	year = {1998}}

@inproceedings{ChekuriBe98,
	annote = {C8},
	author = {Chandra Chekuri and Michael A. Bender},
	booktitle = {Proc.\ 6th Conference on Integer Programming and Combinatorial Optimization (IPCO)},
	date-modified = {2013-04-19 00:52:08 +0000},
	journal = {Lecture Notes in Computer Science},
	pages = {383--393},
	title = {An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines},
	volume = {1412},
	year = {1998}}

@inproceedings{ArkinBeMi99,
	annote = {C9},
	author = {Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell and Steven Skiena},
	booktitle = {Proc.\ 6th Workshop on Discrete Algorithms {(WADS)}},
	date-modified = {2013-04-19 01:12:06 +0000},
	pages = {122--133},
	title = {The Lazy Bureaucrat Scheduling Problem},
	year = {1999}}

@inproceedings{BenderCh99,
	annote = {C10},
	author = {Michael. A. Bender and Chandra Chekuri},
	booktitle = {Proc.\ 6th Workshop on Discrete Algorithms (WADS)},
	pages = {80--85},
	title = {Performance Guarantees for the {TSP} with a Parametrized Triangle Inequality},
	year = {1999}}

@inproceedings{BenderFa00,
	annote = {C11},
	author = {Michael A. Bender and Martin Farach-Colton},
	booktitle = {Proc.\ Latin American Theoretical {IN}formatics (LATIN)},
	pages = {88--94},
	title = {The {LCA} Problem Revisited},
	year = {2000}}

@inproceedings{BenderSeSk00,
	annote = {C12},
	author = {Michael A. Bender and Saurabh Sethia and Steven Skiena},
	booktitle = {Proc.\ 7th Scandinavian Workshop on Algorithm Theory (SWAT)},
	pages = {83--96},
	title = {Data Structures for Maintaining Set Partitions},
	year = {2000}}

@inproceedings{BenderRo00,
	annote = {C13},
	author = {Michael A. Bender and Dana Ron},
	booktitle = {Proc.\ 27th International Colloquium on Automata, Languages, and Programming (ICALP)},
	pages = {809-820},
	title = {Testing Acyclicity of Directed Graphs in Sublinear Time},
	year = {2000}}

@inproceedings{BenderRa00,
	annote = {C14},
	author = {Michael A. Bender and Michael O. Rabin},
	booktitle = {Proc.\ 12th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA)},
	doi = {https://doi.org/10.1145/341800.341803},
	month = {July},
	pages = {13--21},
	title = {Scheduling {Cilk} Multithreaded Computations on Processors of Different Speeds},
	year = {2000},
	bdsk-url-1 = {https://doi.org/10.1145/341800.341803}}

@inproceedings{BitterSaBe00,
	annote = {C15},
	author = {Ingmar Bitter and Mie Sato and Michael A. Bender and Kevin T. McDonnell and Arie E. Kaufman and Min Wan},
	booktitle = {IEEE Visualization 2000},
	month = {October},
	pages = {45--52},
	title = {{CEASAR}: A Smooth, Accurate, and Robust Centerline Extraction Algorithm},
	year = {2000}}

@inproceedings{SatoBiBe00,
	address = {Hong Kong, China},
	annote = {C16},
	author = {Mie Sato and Ingmar Bitter and Michael A. Bender and Arie E. Kaufman},
	booktitle = {Eighth Pacific Conference on Computer Graphics and Applications Graphics},
	month = {October},
	pages = {281--287},
	title = {{TEASAR}: Tree-structure Extraction Algorithm for Accurate and Robust Skeletons},
	year = {2000}}

@inproceedings{BenderDeFa00,
	annote = {C17},
	author = {Michael A. Bender and Erik D. Demaine and Martin Farach-Colton},
	booktitle = {Proc.\ 41st Annual Symposium on Foundations of Computer Science (FOCS)},
	pages = {399--409},
	title = {Cache-Oblivious {B}-Trees},
	year = {2000}}

@inproceedings{ArkinBeDe01a,
	annote = {C18},
	author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Saurabh Sethia},
	booktitle = {Proc.\ 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-modified = {2013-04-17 17:29:53 +0000},
	pages = {138-147},
	title = {Optimal Covering Tours with Turn Costs},
	year = {2001}}

@inproceedings{BenderPeSk01,
	annote = {C19},
	author = {Michael A. Bender and Giridhar Pemmasani and Steven Skiena and Pavel Sumazin},
	booktitle = {Proc.\ 12th Annual Symposium on Discrete Algorithms (SODA)},
	date-modified = {2013-04-19 16:25:05 +0000},
	pages = {845-854},
	title = {Finding Least Common Ancestors in Directed Acyclic Graphs},
	year = {2001}}

@inproceedings{ArkinBeDe01b,
	annote = {C20},
	author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and Martin L. Demaine and Joseph S. B. Mitchell and Saurabh Sethia and Steven Skiena},
	booktitle = {Proc.\ 7th International Workshop Algorithms and Data Structures (WADS)},
	date-modified = {2013-04-19 16:25:26 +0000},
	pages = {401-413},
	title = {When Can You Fold a Map?},
	year = {2001}}

@inproceedings{ArkinBeFe02,
	annote = {C21},
	author = {Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Martin Skutella},
	booktitle = {Proc.\ 13th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)},
	pages = {568-577},
	title = {The Freeze-Tag Problem: How to Wake up a Swarm of Robots},
	year = {2002}}

@inproceedings{BenderDuIa02,
	annote = {C22},
	author = {Michael A. Bender and Ziyang Duan and John Iacono and Jing Wu},
	booktitle = {Proc.\ 13th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)},
	date-modified = {2013-04-17 17:31:27 +0000},
	pages = {29--38},
	title = {A Locality-Preserving Cache-Oblivious Dynamic Dictionary},
	year = {2002}}

@inproceedings{BenderMuRa02,
	annote = {C23},
	author = {Michael A. Bender and S. Muthukrishnan and Rajmohan Rajaraman},
	booktitle = {Proc.\ 13th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)},
	date-modified = {2013-04-17 17:31:54 +0000},
	pages = {762--771},
	title = {Improved Algorithms for Stretch Scheduling},
	year = {2002}}

@inproceedings{BenderFa02,
	annote = {C24},
	author = {Michael A. Bender and Martin Farach-Colton},
	bibnote = {was BenderFarach02},
	booktitle = {Proc.\ Latin American Theoretical {IN}formatics (LATIN)},
	pages = {508--515},
	title = {The Level Ancestor Problem Simplified},
	year = {2002}}

@inproceedings{ArgeBeDe02,
	annote = {C25},
	author = {Lars Arge and Michael A. Bender and Erik D. Demaine and Bryan Holland-Minkley and J. Ian Munro},
	booktitle = {Proc.\ 34th Annual {ACM} Symposium on Theory of Computing ({STOC})},
	pages = {268--276},
	title = {Cache-Oblivious Priority Queue and Graph Algorithm Applications},
	year = {2002}}

@inproceedings{BenderCoRa02,
	annote = {C26},
	author = {Michael A. Bender and Richard Cole and Rajeev Raman},
	booktitle = {Proc.\ 29th International Colloquium on Automata, Languages, and Programming (ICALP)},
	pages = {195-207},
	title = {Exponential Structures for Efficient Cache-Oblivious Algorithms},
	year = {2002}}

@inproceedings{SztainbergArBe02,
	annote = {C27},
	author = {Marcelo O. Sztainberg and Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell},
	booktitle = {Proc.\ 8th Scandinavian Workshop on Algorithm Theory (SWAT)},
	date-modified = {2014-01-15 18:49:08 +0000},
	pages = {270-279},
	publisher = {Springer},
	series = {Lecture Notes in Computer Science},
	title = {Analysis of Heuristics for the Freeze-Tag Problem},
	volume = {2368},
	year = {2002}}

@inproceedings{BenderCoDe02a,
	annote = {C28},
	author = {Michael A. Bender and Richard Cole and Erik D. Demaine and Martin Farach-Colton},
	booktitle = {Proc.\ 10th European Symposium on Algorithms (ESA)},
	pages = {139--151},
	title = {Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy},
	year = {2002}}

@inproceedings{BenderCoDe02b,
	annote = {C29},
	author = {Michael A. Bender and Richard Cole and Erik D. Demaine and Martin Farach-Colton and J. Zito},
	booktitle = {Proc.\ 10th European Symposium on Algorithms (ESA)},
	pages = {152--164},
	title = {Two Simplified Algorithms for Maintaining Order in a List},
	year = {2002}}

@inproceedings{BenderDeFa02,
	annote = {C30},
	author = {Michael A. Bender and Erik D. Demaine and Martin Farach-Colton},
	booktitle = {Proc.\ 10th European Symposium on Algorithms (ESA)},
	pages = {165--173},
	title = {Efficient Tree Layout in a Multilevel Memory Hierarchy},
	year = {2002}}

@inproceedings{LeungArBe02,
	annote = {C31},
	author = {Vitus J. Leung and Esther M. Arkin and Michael A. Bender and David P. Bunde and Jeanette Johnston and Alok Lal and Joseph S. B. Mitchell and Cynthia A. Phillips and Steven S. Seiden},
	booktitle = {Proc.\ 4th {IEEE} International Conference on Cluster Computing (CLUSTER)},
	pages = {296--304},
	title = {Processor Allocation on {Cplant}: Achieving General Processor Locality Using One-Dimensional Allocation Strategies},
	year = {2002}}

@inproceedings{HsiangArBe04,
	annote = {C32},
	author = {Tien-Ruey Hsiang and Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell},
	booktitle = {Proc.\ 5th International Workshop on Algorithmic Foundations of Robotics (WAFR)},
	title = {Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments},
	year = {2004}}

@inproceedings{HsiangArBe03,
	annote = {C33},
	author = {Tien-Ruey Hsiang and Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell},
	booktitle = {Proc.\ 19th ACM Symposium on Computational (SoCG)},
	note = {Video},
	pages = {382-383},
	title = {Online Dispersion Algorithms for Swarms of Robots},
	year = {2003}}

@inproceedings{ArkinBeGe03,
	annote = {C34},
	author = {Esther M. Arkin and Michael A. Bender and Dongdong Ge and Simai He and Joseph S. B. Mitchell},
	booktitle = {Proc.\ 15th Annual {ACM} Symposium on Parallelism in Algorithms and Architecture (SPAA)},
	pages = {295--303},
	title = {Improved Approximation Algorithms for the Freeze-Tag Problem},
	year = {2003}}

@inproceedings{BenderBrFa03,
	annote = {C35},
	author = {Michael A. Bender and Gerth S. Brodal and Rolf Fagerberg and Dongdong Ge and Simai He and Haodong Hu and John Iacono and Alejandro Lopez-Ortiz},
	booktitle = {Proc.\ 44th Annual Symposium on Foundations of Computer Science {(FOCS)}},
	pages = {271-280},
	title = {The Cost of Cache-Oblivious Searching},
	year = {2003}}

@inproceedings{BenderGeHe02,
	annote = {C36},
	author = {Michael A. Bender and Dongdong Ge and Simai He and Haodong Hu and Ron Y. Pinter and Steven Skiena and Firas Swidan},
	booktitle = {Proc.\ 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-modified = {2013-04-19 16:26:06 +0000},
	pages = {919-928},
	title = {Improved Bounds on Sorting with Length-Weighted Reversals},
	year = {2004}}

@inproceedings{BenderBrJa04,
	annote = {C37},
	author = {Michael A. Bender and Bryan Bradley and Geetha Jagannathan and Krishnan Pillaipakkamnatt},
	booktitle = {Proc.\ 6th Workshop on Algorithm Engineering and Experiments {(ALENEX)}},
	pages = {18-30},
	title = {The Robustness of the Sum-of-Squares Algorithm for Bin Packing},
	year = {2004}}

@inproceedings{BenderFiGi04,
	annote = {C38},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Charles E. Leiserson},
	booktitle = {Proc.\ 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)},
	month = {June},
	pages = {133--144},
	title = {On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs},
	year = {2004}}

@inproceedings{BenderFaMo04,
	annote = {C39},
	author = {Michael A. Bender and Martin Farach-Colton and Miguel Mosteiro},
	booktitle = {Proc.\ 3rd International Conference on Fun with Algorithms (FUN)},
	pages = {16-23},
	title = {Insertion Sort is $O(n \log n)$},
	year = {2004}}

@inproceedings{SwidanBeGe04,
	annote = {C40},
	author = {Firas Swidan and Michael A. Bender and Dongdong Ge and Simai He and Haodong Hu and Ron Y. Pinter},
	booktitle = {Proc.\ 15th Annual Symposium on Combinatorial Pattern Matching (CPM)},
	pages = {32-46},
	title = {Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity},
	year = {2004}}

@inproceedings{BenderFiGi05,
	annote = {C41},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Bradley C. Kuszmaul},
	booktitle = {Proc.\ 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	pages = {228-237},
	title = {Concurrent Cache-Oblivious {B}-trees},
	year = {2005}}

@inproceedings{BenderFaHe05,
	annote = {C42},
	author = {Michael A. Bender and Martin Farach-Colton and Simai He and Bradley C. Kuszmaul and Charles E. Leiserson},
	booktitle = {Proc.\ 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-modified = {2013-04-17 17:52:33 +0000},
	pages = {325--332},
	title = {Adversarial Contention Resolution for Simple Channels},
	year = {2005}}

@inproceedings{BenderBuDe05,
	annote = {C43},
	author = {Michael A. Bender and David P. Bunde and Erik D. Demaine and S{\'a}ndor P. Fekete and Vitus J. Leung and Henk Meijer and Cynthia A. Phillips},
	booktitle = {Proc.\ 9th International Workshop on Algorithms and Data Structures (WADS)},
	date-modified = {2013-04-17 17:50:20 +0000},
	pages = {169-181},
	title = {Communication-Aware Processor Allocation for Supercomputers},
	year = {2005}}

@inproceedings{BenderHu06,
	annote = {C44},
	author = {Michael A. Bender and Haodong Hu},
	booktitle = {Proc.\ 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)},
	date-modified = {2013-04-17 17:53:17 +0000},
	pages = {20-29},
	title = {An Adaptive Packed-Memory Array},
	year = {2006}}

@inproceedings{BenderFaKu06,
	annote = {C45},
	author = {Michael A. Bender and Martin Farach-Colton and Bradley Kuszmaul},
	booktitle = {Proc.\ 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)},
	pages = {233-242},
	title = {Cache-Oblivious String {B}-Trees},
	year = {2006}}

@inproceedings{ArkinBeMi06,
	annote = {C46},
	author = {Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell and Valentin Polishchuk},
	booktitle = {Proc.\ 7th Workshop on Algorithmic Foundations of Robotics (WAFR)},
	date-modified = {2013-04-17 17:49:33 +0000},
	title = {The Snowblower Problem},
	year = {2006}}

@inproceedings{BenderFiGi06,
	annote = {C47},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert},
	booktitle = {Proc.\ 14th Annual European Symposium on Algorithms (ESA)},
	pages = {112--123},
	title = {Contention Resolution with Heterogeneous Job Sizes},
	year = {2006}}

@inproceedings{BenderPh07,
	annote = {C48},
	author = {Michael A. Bender and Cynthia A. Phillips},
	booktitle = {Proc.\ 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)},
	date-modified = {2013-04-17 17:53:51 +0000},
	pages = {35--45},
	title = {Scheduling DAGs on Asynchronous Processors},
	year = {2007}}

@inproceedings{BenderBrFa07,
	annote = {C49},
	author = {Michael A. Bender and Gerth S. Brodal and Rolf Fagerberg and Riko Jacob and Elias Vicari},
	booktitle = {Proc.\ 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)},
	date-modified = {2013-04-17 17:47:27 +0000},
	pages = {61--70},
	title = {Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model},
	year = {2007}}

@inproceedings{BenderFaFi07,
	annote = {C50},
	author = {Michael A. Bender and Martin Farach-Colton and Jeremy T. Fineman and Yonatan R. Fogel and Bradley C. Kuszmaul and Jelani Nelson},
	booktitle = {Proc.\ 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)},
	date-modified = {2013-04-17 17:47:00 +0000},
	pages = {81--92},
	title = {Cache-Oblivious Streaming {B}-trees},
	year = {2007}}

@inproceedings{AgrawalBeFi07,
	annote = {C51},
	author = {Kunal Agrawal and Michael A. Bender and Jeremy T. Fineman},
	booktitle = {Proc.\ 4rd International Conference on Fun with Algorithms (FUN)},
	date-modified = {2013-04-17 17:48:22 +0000},
	pages = {135--145},
	title = {The Worst Page-Replacement Policy},
	year = {2007}}

@inproceedings{BenderFiGi09,
	address = {New York, NY, USA},
	annote = {C52},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert},
	booktitle = {Proc.\ 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-modified = {2014-01-24 02:12:09 +0000},
	month = {January},
	pages = {1108-1115},
	title = {A New Approach to Incremental Topological Ordering},
	year = {2009}}

@inproceedings{BenderFeKa09,
	address = {Wroc{\l}aw, Poland},
	annote = {C53},
	author = {Michael A. Bender and S{\'a}ndor P. Fekete and Tom Kamphans and Nils Schweer},
	booktitle = {Proc.\ 17th International Symposium on Fundamentals of Computation Theory (FCT)},
	date-modified = {2014-01-23 23:29:34 +0000},
	pages = {14--25},
	series = {Lecture Notes Comput. Sci.},
	title = {Maintaining Arrays of Contiguous Objects},
	volume = 5699,
	year = {2009}}

@inproceedings{BenderHuKu10,
	address = {Indianapolis, Indiana, USA},
	annote = {C54},
	author = {Michael A. Bender and Haodong Hu and Bradley C. Kuszmaul},
	booktitle = {Proc.\ 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)},
	date-modified = {2014-01-23 23:31:14 +0000},
	pages = {305--316},
	title = {Performance Guarantees for {B}-Trees with Different-Sized Atomic Keys},
	year = {2010}}

@inproceedings{BenderFaJo11,
	annote = {C55},
	author = {Michael A. Bender and Martin Farach-Colton and Rob Johnson and Bradley C. Kuszmaul and Dzejla Medjedovic and Pablo Montes and Pradeep Shetty and Richard P. Spillane and Erez Zadok},
	booktitle = {Proc.\ 3rd USENIX Workshop on Hot Topics in Storage (HotStorage)},
	date-modified = {2014-01-24 02:14:02 +0000},
	location = {Portland, OR, USA},
	month = {June},
	title = {Don't Thrash: How to Cache your Hash on Flash},
	year = {2011}}

@inproceedings{BenderGi11,
	address = {Palm Springs, CA, USA},
	annote = {C56},
	author = {Michael A. Bender and Seth Gilbert},
	booktitle = {Proc.\ 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
	date-modified = {2014-01-24 02:11:48 +0000},
	month = {October},
	pages = {728-737},
	title = {Mutual Exclusion with $O(\log^2 \log n)$ Amortized Work},
	year = {2011}}

@inproceedings{BenderBoCh12,
	address = {San Servolo Island, Venice, Italy},
	annote = {C57},
	author = {Michael A. Bender and Ritwik Bose and Rezaul Chowdhury and Samuel McCauley},
	booktitle = {Proc.\ 6th International Conference on Fun with Algorithms (FUN)},
	date-modified = {2014-01-24 02:20:15 +0000},
	month = {June},
	pages = {28-39},
	title = {The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye},
	year = {2012}}

@inproceedings{EsmetBeFa12,
	address = {Boston, MA, USA},
	annote = {C58},
	author = {John Esmet and Michael A. Bender and Martin Farach-Colton and Bradley C. Kuszmaul},
	booktitle = {Proc.\ 4th USENIX Workshop on Hot Topics in Storage (HotStorage)},
	date-modified = {2014-01-24 02:23:45 +0000},
	month = {June},
	title = {The {TokuFS} Streaming File System},
	year = {2012}}

@inproceedings{AlistarhBeGi12,
	annote = {C59},
	author = {Dan Alistarh and Michael A. Bender and Seth Gilbert and Rachi Guerraoui},
	booktitle = {Proc.\ 53nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
	date-modified = {2013-04-17 17:55:47 +0000},
	pages = {331-340},
	title = {How to Allocate Tasks Asynchronously},
	year = {2012}}

@inproceedings{BenderFaFe13,
	address = {Montreal, Canada},
	annote = {C60},
	author = {Michael A. Bender and Martin Farach-Colton and S{\'a}ndor P. Fekete and Jeremy T. Fineman and Seth Gilbert},
	booktitle = {Proc.\ 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2013-04-17 17:33:01 +0000},
	date-modified = {2014-01-24 02:25:41 +0000},
	month = {July},
	pages = {271-279},
	title = {Reallocation Problems in Scheduling},
	year = {2013}}

@inproceedings{BenderBuLe13,
	address = {Montreal, Canada},
	annote = {C61},
	author = {Michael A. Bender and David P. Bunde and Vitus J. Leung and Samuel McCauley and Cynthia A. Phillips},
	booktitle = {Proc.\ 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	date-added = {2013-04-17 18:08:14 +0000},
	date-modified = {2014-02-01 22:38:04 +0000},
	pages = {280-287},
	title = {Efficient Scheduling to Minimize Calibrations},
	year = {2013}}

@inproceedings{AlistarhAsBe14,
	address = {Portland, OR, USA},
	annote = {C62},
	author = {Dan Alistarh and James Aspnes and Michael A. Bender and Rati Gelashvili and Seth Gilbert},
	booktitle = {Proc.\ 25th {ACM-SIAM} Symposium on Discrete Algorithms (SODA)},
	date-modified = {2014-02-21 22:48:47 +0000},
	month = {January},
	pages = {416-435},
	title = {Dynamic Task Allocation},
	year = {2014}}

@inproceedings{BenderEbFi14,
	address = {Portland, OR, USA},
	annote = {C63},
	author = {Michael A. Bender and Roozbeh Ebrahimi and Jeremy T. Fineman and Golnaz Ghasemiesfeh and Rob Johnson and Samuel McCauley},
	booktitle = {Proc.\ 25th {ACM-SIAM} Symposium on Discrete Algorithms (SODA)},
	date-modified = {2014-02-21 22:49:25 +0000},
	month = {January},
	pages = {958-971},
	title = {Cache-Adaptive Algorithms},
	year = {2014}}

@inproceedings{BenderFaFe14,
	annote = {C64},
	author = {Michael A. Bender and Martin Farach-Colton and S{\'a}ndor P. Fekete and Jeremy T. Fineman and Seth Gilbert},
	booktitle = {Proc.\ 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)},
	date-modified = {2015-09-14 21:40:35 +0000},
	pages = {278-288},
	title = {Cost-Oblivious Storage Reallocation},
	year = {2014}}

@inproceedings{BenderChGa14,
	address = {Atlanta, GA, USA},
	annote = {C65},
	author = {Michael A. Bender and Rezaul Chowdhury and Pramod Ganapathi and Samuel McCauley and Yuan Tang},
	booktitle = {Proc.\ 20th International Computing and Combinatorics Conference (COCOON)},
	date-added = {2014-04-26 21:42:29 +0000},
	date-modified = {2015-11-25 22:56:33 +0000},
	month = {August},
	pages = {116-128},
	title = {The Range 1 Query {(R1Q)} Problem},
	year = {2014}}

@inproceedings{BenderFaGo14,
	annote = {C65},
	author = {Michael A. Bender and Mart\'\i{}n Farach-Colton and Mayank Goswami and Dzejla Medjedovic and Pablo Montes and Meng-Tsung Tsai},
	booktitle = {Proc.\ 22nd Annual European Symposium on Algorithms (ESA) 2014},
	date-modified = {2015-01-22 17:56:35 +0000},
	pages = {112-124},
	title = {The Batched Predecessor Problem in External Memory},
	year = {2014}}

@unpublished{BenderGoMe15,
	annote = {unpublished},
	author = {Michael A. Bender and Mayank Goswami and Dzejla Medjedovic and Pablo Montes and Kostas Tsichlas},
	date-added = {2014-01-04 18:15:34 +0000},
	date-modified = {2015-12-27 14:55:51 +0000},
	note = {Under review},
	title = {Sorting Different-Sized Keys in External Memory},
	year = {2015}}

@misc{TreeLayout_Manuscript2002,
	annote = {report1},
	author = {Stephen Alstrup and Michael A. Bender and Erik D. Demaine and Martin Farach-Colton and J. Ian Munro and Theis Rauhe and Mikkel Thorup},
	date-modified = {2015-12-27 19:16:19 +0000},
	month = {November 11},
	note = {\url{http://www.arXiv.org/abs/cs.DS/0211010}},
	title = {Efficient Tree Layout in a Multilevel Memory Hierarchy},
	year = 2002}

@article{BenderFiGi11,
	annote = {report4},
	author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Robert Endre Tarjan},
	bibsource = {DBLP, http://dblp.uni-trier.de},
	date-modified = {2015-12-27 19:17:09 +0000},
	ee = {http://arxiv.org/abs/1112.0784},
	journal = {CoRR},
	title = {A New Approach to Incremental Cycle Detection and Related Problems},
	volume = {abs/1112.0784},
	year = {2011}}

@techreport{LeungArBe02b,
	annote = {report2},
	author = {Vitus J. Leung and Esther M. Arkin and Michael A. Bender and David P. Bunde and Jeanette Johnston and Alok Lal and Joseph S. B. Mitchell and Cynthia A. Phillips and Steven S. Seiden},
	bibnote = {was leung02b},
	date-modified = {2015-12-27 19:16:34 +0000},
	institution = {Sandia National Laboratories},
	number = {SAND2002-1488},
	title = {Processor Allocation on {Cplant}: Achieving General Processor Locality Using One-Dimensional Allocation Strategies},
	type = {Technical Report},
	year = {2002}}

@misc{AlstrupBeDe02,
	annote = {report3},
	author = {Stephen Alstrup and Michael A. Bender and Erik D. Demaine and Martin Farach-Colton and J. Ian Munro and Theis Rauhe and Mikkel Thorup},
	date-modified = {2015-12-27 19:16:59 +0000},
	howpublished = {\url{arXiv:cs.DS/0211010}},
	month = {November},
	note = {\url{http://www.arXiv.org/abs/cs.DS/0211010}},
	title = {Efficient Tree Layout in a Multilevel Memory Hierarchy},
	year = 2002}

@misc{BenderChMu00,
	annote = {P1},
	author = {M.~A. Bender and S.~Chakrabarti and S.~Muthukrishnan},
	howpublished = {United States Patent 6,112,221.},
	title = {A System and Method for Scheduling Webservers with a Quality-of-Service Guarantee for Each User},
	year = {2000}}

@misc{LeungBeBuPh05,
	annote = {P2},
	author = {V. J. Leung and M. A. Bender and D. P. Bunde and C. A. Phillips},
	howpublished = {United States Patent Application Serial No. 11/110,466},
	title = {Fault Tolerant, Deadlock-Free Routing, and Routing-Based Processor Allocation in a Multiple Processor Computing Apparatus},
	year = {2005}}

@misc{KuszmaulBeFa12,
	annote = {P3},
	author = {Bradley C. Kuszmaul and Michael A. Bender and Martin Farach-Colton},
	howpublished = {US Patent No.~8,185,551},
	month = {May},
	title = {Disk-Resident Streaming Dictionary},
	year = 2012}

@misc{KuszmaulBeFa13,
	annote = {P4},
	author = {Bradley C. Kuszmaul and Michael A. Bender and Martin Farach-Colton},
	howpublished = {US Patent No.~8,489,638},
	month = {July},
	title = {Disk-Resident Streaming Dictionary},
	year = 2013}

@unpublished{AumannBender2003,
	annote = {U1},
	author = {Yonatan Aumann and Michael A. Bender},
	note = {Submitted to the {\em Journal of Computer System Sciences}},
	title = {Fault Tolerant Data Structures},
	year = {2003}}

@misc{ArgeBeDe04,
	annote = {W1},
	author = {Lars Arge and Michael A. Bender and Erik D. Demaine and Charles E. Leiserson and Kurt Mehlhorn},
	date-modified = {2013-04-17 17:51:59 +0000},
	howpublished = {http://www.dagstuhl.de/04301/},
	month = {July},
	title = {{Dagstuhl Seminar Number 04301: Cache-Oblivious and Cache-Aware Algorithms}},
	year = {2004}}

@misc{TrystramBlBe06,
	annote = {W2},
	author = {Denis Trystram and Jacek Blazewicz and Michael A. Bender and Klaus Ecker and Erwin Pesch},
	howpublished = {\url{http://www.cirm.univ-mrs.fr/web.ang/liste_rencontre/Rencontres2006/Tryst06/Tryst06.html}},
	month = {May},
	title = {{CIRM Workshop: Scheduling Algorithms for New Emerging Applications}},
	year = {2006}}

@misc{BenderBlPe08,
	annote = {W2},
	author = {Denis Trystram and Jacek Blazewicz and Michael A. Bender and Klaus Ecker and Erwin Pesch},
	howpublished = {\url{http://www-id.imag.fr/NCST08/}},
	month = {May},
	title = {New Challenges on Scheduling Theory},
	year = {2008}}

@misc{BenderBlPe10,
	annote = {W3},
	author = {Michael A. Bender and Jacek Blazewicz and Erwin Pesch and Denis Trystram and Guochuan Zhang},
	howpublished = {\url{http://www-id.imag.fr/FREJUS10/}},
	month = {May},
	title = {{New Challenges in Scheduling Theory}},
	year = {2010}}

@misc{BenderFa12,
	annote = {W5},
	author = {Michael A. Bender and Mart\'\i{}n Farach-Colton},
	howpublished = {\url{http://www.cs.rutgers.edu/~farach/stocextmem.html}},
	location = {New York},
	month = {May},
	title = {{STOC Tutorial on Algorithms for Memory-Sensitive Computing}},
	year = {2012}}

@inproceedings{BenderFaJo13,
	address = {Sophia Antipolis, France},
	annote = {W6},
	author = {Michael A. Bender and Martin Farach-Colton and Rob Johnson and Russell Kraner and Bradley C. Kuszmaul and Dzejla Medjedovic and Pradeep Shetty and Richard P. Spillane and Erez Zadok},
	booktitle = {Fifth Workshop on Massive Data Algorithmics ({MASSIVE} 2013)},
	date-modified = {2014-01-30 00:01:18 +0000},
	month = {September},
	title = {Don't Thrash: How to Cache Your Hash on Flash},
	year = {2013}}

@inproceedings{BenderGoMe13,
	address = {Sophia Antipolis, France},
	annote = {W7},
	author = {Michael A. Bender and Mayank Goswami and Dzejla Medjedovic},
	booktitle = {Fifth Workshop on Massive Data Algorithmics ({MASSIVE} 2013)},
	date-modified = {2014-01-30 00:06:58 +0000},
	month = {September},
	title = {The {I/O}-Complexity of Sorting with Two Key Lengths},
	year = {2013}}

@inproceedings{BenderMcMc15a,
	annote = {W9},
	author = {Michael A. Bender and Samuel McCauley and Andrew McGregor and Shikha Singh and Hoa T. Vu},
	booktitle = {Seventh Workshop on Massive Data Algorithmics ({MASSIVE})},
	date-modified = {2016-06-29 17:18:03 +0000},
	month = {September},
	title = {Run Generation Revisited: What Goes Up May or May Not Come Down},
	year = {2015}}

@phdthesis{Ebrahimi15,
	annote = {student},
	author = {Roozbeh Ebrahimi},
	date-added = {2015-08-11 20:11:58 +0000},
	date-modified = {2015-12-27 14:53:19 +0000},
	month = {July},
	school = {Stony Brook University},
	title = {Cache-Adaptive Algorithms},
	year = 2015}

@article{MengMcKa14,
	annote = {student},
	author = {Meng, Jie and McCauley, Samuel and Kaplan, Fulya and Leung, Vitus and Coskun, Ayse K},
	date-modified = {2015-12-27 14:55:40 +0000},
	journal = {Sustainable Computing (SUSCOM) Special Issue for the International Green Computing Conference},
	title = {Simulation and Optimization of HPC Job Allocation for Reducing Communication and Cooling Costs},
	year = {2014}}

@article{JannenYuZh15b,
	annote = {A40},
	author = {William Jannen and Jun Yuan and Yang Zhan and Amogh Akshintala and John Esmet and Yizheng Jiao and Ankur Mittal and Prashant Pandey and Phaneendra Reddy and Leif Walsh and Michael A. Bender and Martin Farach{-}Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter},
	date-modified = {2015-12-26 16:34:31 +0000},
	journal = {Transactions on Storage---Special Issue on USENIX FAST 2015},
	month = {October},
	number = {4},
	pages = {18:1-18:29},
	title = {BetrFS: Write-Optimization in a Kernel File System},
	volume = {11},
	year = {2015}}

@article{BenderFeKr15,
	annote = {A41},
	author = {Michael A. Bender and S{\'{a}}ndor P. Fekete and Alexander Kr{\"{o}}ller and Vincenzo Liberatore and Joseph S. B. Mitchell and Valentin Polishchuk and Jukka Suomela},
	date-modified = {2016-06-29 17:12:47 +0000},
	journal = {Theoretical Computer Science},
	month = {November},
	number = {9},
	pages = {51--61},
	title = {The Minimum Backlog Problem},
	volume = {605},
	year = {2015}}

@article{BenderFiMo15,
	annote = {technical_magazine_1},
	author = {Michael A. Bender and Jeremy T. Fineman and Mahnush Movahedi and Jared Saia and Varsha Dani and Seth Gilbert and Seth Pettie and Maxwell Young},
	date-modified = {2016-06-29 17:16:58 +0000},
	journal = {{SIGACT} News},
	month = {September},
	number = {3},
	pages = {57--71},
	title = {Resource-Competitive Algorithms},
	volume = {46},
	year = {2015}}

@inproceedings{BenderBeHa15b,
	address = {Washington DC, USA},
	annote = {C70},
	author = {Michael A. Bender and Jonathan W. Berry and Simon D. Hammond and Branden Moore and Benjamin Moseley and Cynthia A. Phillips},
	booktitle = {Proc.\ 2015 International Symposium on Memory Systems, (MEMSYS)},
	editor = {Bruce Jacob},
	month = {October},
	pages = {197--205},
	title = {k-Means Clustering on Two-Level Memory Systems},
	year = {2015}}

@inproceedings{EbrahimiMcMo15,
	annote = {student},
	author = {Ebrahimi, Roozbeh and McCauley, Samuel and Moseley, Benjamin},
	booktitle = {Proceedings of the Thirteenth Workshop on Approximation and Online Algorithms (WAOA)},
	date-added = {2015-12-27 14:08:49 +0000},
	date-modified = {2016-06-29 17:19:44 +0000},
	month = {September},
	pages = {183-195},
	title = {Scheduling Parallel Jobs Online with Convex and Concave Parallelizability},
	year = {2015}}

@inproceedings{ChenMcSi16,
	annote = {student},
	author = {Chen, Jing and McCauley, Samuel and Singh, Shikha},
	booktitle = {Proceedings of the Seventh Innovations in Theoretical Computer Science Conference (ITCS)},
	date-added = {2015-12-27 14:08:42 +0000},
	date-modified = {2016-05-30 00:17:11 +0000},
	month = {January},
	pages = {237-248},
	title = {Rational Proofs with Multiple Provers},
	year = {2016}}

@inproceedings{GhasemiesfehEbGa13,
	annote = {student},
	author = {Golnaz Ghasemiesfeh and Roozbeh Ebrahimi and Jie Gao},
	booktitle = {Proceedings of the 14th ACM Symposium on Electronic Commerce (EC)},
	date-added = {2015-12-27 14:00:08 +0000},
	date-modified = {2015-12-27 23:35:38 +0000},
	month = {June},
	pages = {504--527},
	title = {Complex Contagion and the Weakness of Long Ties in Social Networks: Revisited},
	year = {2013}}

@inproceedings{PatilGhEb13,
	annote = {student},
	author = {Akshay Patil and Golnaz Ghasemiesfeh and Roozbeh Ebrahimi and Jie Gao},
	booktitle = {Proceedings of the ASE/IEEE International Conference on Social Computing (SocialCom)},
	date-added = {2015-12-27 14:00:08 +0000},
	date-modified = {2015-12-27 23:36:41 +0000},
	month = {September},
	pages = {87--92},
	title = {Quantifying Social Influence in Epinions},
	year = {2013}}

@inproceedings{EbrahimiGhGa15,
	address = {Rehovot, Israel},
	annote = {student},
	author = {Roozbeh Ebrahimi and Jie Gao and Golnaz Ghasemiesfeh and Grant Schoenebeck},
	booktitle = {Proceedings of the 6th ACM SIGACT Conference on Innovations in Theoretical Computer Science (ITCS)},
	date-added = {2015-08-11 20:13:10 +0000},
	date-modified = {2015-12-27 23:35:06 +0000},
	month = {January},
	pages = {63-72},
	title = {Complex Contagions on Kleinberg's Small World Model},
	year = 2015}

@phdthesis{Montes14,
	annote = {student},
	author = {Pablo Montes},
	date-added = {2015-01-22 17:04:49 +0000},
	date-modified = {2015-12-27 23:36:25 +0000},
	month = {August},
	school = {Stony Brook University},
	title = {Theoretical and Practical Aspects of Compact Data Structures for Range and Membership Queries in Sparse Sets},
	year = 2014}

@phdthesis{Medjedovic14,
	annote = {student},
	author = {Dzejla Medjedovic},
	date-added = {2014-06-25 19:25:39 +0000},
	date-modified = {2015-12-27 23:35:45 +0000},
	school = {Stony Brook University},
	title = {Upper and Lower Bounds for Sorting and Searching in External Memory},
	year = 2014}

@article{MengMcKa15,
	annote = {student},
	author = {Meng, Jie and McCauley, Samuel and Kaplan, Fulya and Leung, Vitus and Coskun, Ayse K},
	date-modified = {2015-12-27 23:36:18 +0000},
	journal = {Sustainable Computing (SUSCOM) Special Issue for the International Green Computing Conference},
	title = {Simulation and Optimization of HPC Job Allocation for Reducing Communication and Cooling Costs},
	volume = 5,
	year = 2015}

@misc{BenderFaFo15,
	annote = {P5},
	author = {Michael A. Bender and Martin Farach-Colton and Yonatan R. Fogel and Zardosht Kasheff and Bradley C. Kuszmaul and Vincenzo Liberatore and Barry Perlman and Rich Prohaska and David S. Wells},
	date-modified = {2016-08-02 18:04:08 +0000},
	howpublished = {US Patent No.~8,996,563},
	month = {March},
	title = {High-Performance Streaming Dictionary},
	year = 2015}

@phdthesis{McCauley16,
	annote = {student},
	author = {Samuel McCauley},
	month = {July},
	school = {Stony Brook University},
	title = {Using Locality to Tackle Modern Algorithmic Challenges},
	year = 2016}

@inproceedings{BenderChCo19,
	address = {San Diego, CA},
	annote = {C87},
	author = {Michael A.~Bender and Jake Christensen and Alex Conway and Martin Farach-Colton and Rob Johnson and Meng-Tsung Tsai},
	booktitle = {Proc.\ 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
	date-modified = {2019-01-18 14:32:20 -0500},
	month = {January},
	pages = {2527--2546},
	title = {Optimal Ball Recycling},
	year = {2019}}

@article{ZhanJaPo18,
	annote = {A50},
	author = {Yang Zhan and Yizheng Jiao and Donald E. Porter and Alex Conway and Eric Knorr and Martin Farach{-}Colton and Michael A. Bender and Jun Yuan and William Jannen and Rob Johnson},
	date-modified = {2019-04-29 15:23:32 -0400},
	doi = {https://doi.org/10.1145/3241061},
	journal = {ACM Transactions on Storage ({TOS})},
	month = {November},
	number = {3},
	pages = {22:1--22:27},
	title = {Efficient Directory Mutations in a Full-Path-Indexed File System},
	url = {https://dl.acm.org/citation.cfm?id=3241061},
	volume = {14},
	year = {2018},
	bdsk-url-1 = {https://dl.acm.org/citation.cfm?id=3241061},
	bdsk-url-2 = {https://doi.org/10.1145/3241061}}

@article{BenderChGa18,
	annote = {A49},
	author = {Michael A. Bender and Rezaul Alam Chowdhury and Pramod Ganapathi and Samuel McCauley and Yuan Tang},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/bib/journals/tcs/BenderCGMT18},
	date-modified = {2019-04-15 16:46:41 -0400},
	doi = {10.1016/j.tcs.2015.12.040},
	journal = {Theor. Comput. Sci.},
	month = {September},
	pages = {130--147},
	title = {The range 1 query {(R1Q)} problem},
	url = {https://doi.org/10.1016/j.tcs.2015.12.040},
	volume = {743},
	year = {2018},
	bdsk-url-1 = {https://doi.org/10.1016/j.tcs.2015.12.040}}

@inproceedings{AlmodaresiPaFe19,
	address = {Washington, DC, USA},
	annote = {student},
	author = {Fatemeh Almodaresi and Prashant Pandey and Michael Ferdman and Rob Johnson and Robert Patro},
	booktitle = {Proc.\ 23rd Annual International Conference on Research in Computational Molecular Biology (RECOMB) 2019},
	date-modified = {2019-10-05 12:01:40 -0400},
	doi = {10.1007/978-3-030-17083-7\_1},
	month = {May},
	pages = {1--18},
	publisher = {Springer},
	series = {Lecture Notes in Computer Science},
	title = {An Efficient, Scalable and Exact Representation of High-Dimensional Color Information Enabled via de Bruijn Graph Search},
	url = {https://doi.org/10.1007/978-3-030-17083-7\_1},
	volume = {11467},
	year = {2019},
	bdsk-url-1 = {https://doi.org/10.1007/978-3-030-17083-7%5C_1}}

@inproceedings{JiaoBePa22,
	annote = {C109},
	author = {Yizheng Jiao and Simon Bertron and Sagar Patel and Luke Zeller and Rory Bennett and Nirjhar Mukherjee and Michael A. Bender and Michael Condict and Alex Conway and Mart{\'{\i}}n Farach{-}Colton and Xiongzi Ge and William Jannen and Rob Johnson and Donald E. Porter and Jun Yuan},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/conf/eurosys/JiaoBPZBMBCCFGJ22.bib},
	booktitle = {Proc.\ Seventeenth European Conference on Computer Systems, Rennes (EuroSys)},
	date-modified = {2022-04-01 13:13:08 -0400},
	doi = {10.1145/3492321.3519571},
	pages = {610--627},
	timestamp = {Wed, 30 Mar 2022 15:02:06 +0200},
	title = {BetrFS: a compleat file system for commodity SSDs},
	url = {https://doi.org/10.1145/3492321.3519571},
	year = {2022},
	bdsk-url-1 = {https://doi.org/10.1145/3492321.3519571}}

@article{VorobyevaDeBe22,
	annote = {A57},
	author = {Janet Vorobyeva and Delayo, {Daniel R.} and Bender, {Michael A.} and Mart{\'\i}n Farach-Colton and Prashant Pandey and Phillips, {Cynthia A.} and Shikha Singh and Thomas, {Eric D.} and Kroeger, {Thomas M.}},
	date-modified = {2022-04-20 13:39:56 -0400},
	doi = {10.1007/s10586-021-03463-5},
	issn = {1386-7857},
	journal = {Cluster Computing},
	number = {4},
	pages = {2893--2914},
	publisher = {Kluwer Academic Publishers},
	title = {Using advanced data structures to enable responsive security monitoring},
	url = {https://doi.org/10.1007/s10586-021-03463-5},
	volume = {25},
	year = {2022},
	bdsk-url-1 = {https://doi.org/10.1007/s10586-021-03463-5}}

@article{BenderCoFa21-tiny,
	author = {Michael A. Bender and Alex Conway and Martin Farach{-}Colton and William Kuszmaul and Guido Tagliavini},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/corr/abs-2111-12800.bib},
	eprint = {2111.12800},
	eprinttype = {arXiv},
	journal = {CoRR},
	timestamp = {Wed, 01 Dec 2021 15:16:43 +0100},
	title = {Tiny Pointers},
	url = {https://arxiv.org/abs/2111.12800},
	volume = {abs/2111.12800},
	year = {2021},
	bdsk-url-1 = {https://arxiv.org/abs/2111.12800}}

@article{BenderCoFa21-hashing,
	author = {Michael A. Bender and Alex Conway and Martin Farach{-}Colton and William Kuszmaul and Guido Tagliavini},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/corr/abs-2109-04548.bib},
	eprint = {2109.04548},
	eprinttype = {arXiv},
	journal = {CoRR},
	timestamp = {Tue, 21 Sep 2021 17:46:04 +0200},
	title = {All-Purpose Hashing},
	url = {https://arxiv.org/abs/2109.04548},
	volume = {abs/2109.04548},
	year = {2021},
	bdsk-url-1 = {https://arxiv.org/abs/2109.04548}}