Folgen
Alex Conway
Alex Conway
Assistant Professor, Cornell Tech
Bestätigte E-Mail-Adresse bei ajhconway.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
File Systems Fated for Senescence? Nonsense, Says Science!
A Conway, A Bakshi, Y Jiao, W Jannen, Y Zhan, J Yuan, MA Bender, ...
Proceedings of the 15th USENIX Conference on File and Storage Technologies …, 2017
862017
SplinterDB: Closing the Bandwidth Gap for NVMe Key-Value Stores
A Conway, A Gupta, V Chidambaram, M Farach-Colton, R Spillane, A Tai, ...
2020 USENIX Annual Technical Conference (USENIX ATC 20), 49-63, 2020
732020
Vector Quotient Filters: Overcoming the Time/Space Trade-off in Filter Design
P Pandey, A Conway, J Durie, MA Bender, M Farach-Colton, R Johnson
Proceedings of the 2021 International Conference on Management of Data, 1386 …, 2021
342021
The Full Path to Full-Path Indexing
Y Zhan, A Conway, Y Jiao, E Knorr, MA Bender, M Farach-Colton, ...
Proceedings of the 16th USENIX Conference on File and Storage Technologies …, 2018
322018
Optimal Hashing in External Memory
A Conway, M Farach-Colton, P Shilane
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
282018
Filesystem Aging: It’s more Usage than Fullness
A Conway, E Knorr, Y Jiao, MA Bender, W Jannen, R Johnson, D Porter, ...
11th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 19), 2019
272019
Small Refinements to the DAM can have Big Consequences for Data-Structure Design
MA Bender, A Conway, M Farach-Colton, W Jannen, Y Jiao, R Johnson, ...
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 265-274, 2019
242019
All-Purpose Hashing
MA Bender, A Conway, M Farach-Colton, W Kuszmaul, G Tagliavini
arXiv preprint arXiv:2109.04548, 2021
192021
Sharding the State Machine: Automated Modular Reasoning for Complex Concurrent Systems
T Hance, Y Zhou, A Lattuada, R Achermann, A Conway, R Stutsman, ...
17th USENIX Symposium on Operating Systems Design and Implementation (OSDI …, 2023
162023
Mosaic pages: Big TLB reach with small pages
K Gosakan, J Han, W Kuszmaul, IN Mubarek, N Mukherjee, K Sriram, ...
Proceedings of the 28th ACM International Conference on Architectural …, 2023
152023
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity
P Pandey, MA Bender, A Conway, M Farach-Colton, W Kuszmaul, ...
Proceedings of the ACM on Management of Data 1 (1), 1-26, 2023
13*2023
Tiny Pointers
MA Bender, A Conway, M Farach-Colton, W Kuszmaul, G Tagliavini
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
122023
Paging and the Address-Translation Problem
MA Bender, A Bhattacharjee, A Conway, M Farach-Colton, R Johnson, ...
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
112021
Optimal Ball Recycling
MA Bender, J Christensen, A Conway, M Farach-Colton, R Johnson, ...
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
112019
Iceberg hashing: Optimizing many hash-table criteria at once
MA Bender, A Conway, M Farach-Colton, W Kuszmaul, G Tagliavini
Journal of the ACM 70 (6), 1-51, 2023
102023
How to Copy Files
Y Zhan, A Conway, Y Jiao, N Mukherjee, I Groombridge, MA Bender, ...
18th USENIX Conference on File and Storage Technologies (FAST 20), 75-89, 2020
102020
Efficient Directory Mutations in a Full-Path-Indexed File System
Y Zhan, Y Jiao, DE Porter, A Conway, E Knorr, M Farach-Colton, ...
ACM Transactions on Storage (TOS) 14 (3), 1-27, 2018
102018
SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy
A Conway, M Farach-Colton, R Johnson
Proceedings of the ACM on Management of Data 1 (1), 1-27, 2023
92023
Online List Labeling: Breaking the Barrier
MA Bender, A Conway, M Farach-Colton, H Komlós, W Kuszmaul, N Wein
SIAM Journal on Computing, FOCS22-60-FOCS22-92, 2024
82024
External-Memory Dictionaries in the Affine and PDAM Models
MA Bender, A Conway, M Farach-Colton, W Jannen, Y Jiao, R Johnson, ...
ACM Transactions on Parallel Computing 8 (3), 1-20, 2021
72021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20