281 results on '"Martin Farach-Colton"'
Search Results
2. History-Independent Concurrent Objects.
3. Adaptive Quotient Filters.
4. File System Aging.
5. Layered List Labeling.
6. Analyzing and Implementing GPU Hash Tables.
7. Graph Ranking and the Cost of Sybil Defense.
8. Mosaic Pages: Big TLB Reach with Small Pages.
9. Optimal Uncoordinated Unique IDs.
10. An Associativity Threshold Phenomenon in Set-Associative Caches.
11. Tight Bounds for Monotone Minimal Perfect Hashing.
12. Tiny Pointers.
13. IcebergHT: High Performance Hash Tables Through Stability and Low Associativity.
14. SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy.
15. From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071).
16. Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once.
17. Online List Labeling: Breaking the log2n Barrier.
18. BetrFS: a compleat file system for commodity SSDs.
19. On the optimal time/space tradeoff for hash tables.
20. What Does Dynamic Optimality Mean in External Memory?
21. GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams.
22. Using advanced data structures to enable responsive security monitoring.
23. Mitigating False Positives in Filters: to Adapt or to Cache?
24. Paging and the Address-Translation Problem.
25. Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design.
26. Streaming Complexity of Spanning Tree Computation.
27. SplinterDB: Closing the Bandwidth Gap for NVMe Key-Value Stores.
28. Timely Reporting of Heavy Hitters using External Memory.
29. How to Copy Files.
30. Flushing Without Cascades.
31. Copy-on-Abundant-Write for Nimble File System Clones.
32. External-memory Dictionaries in the Affine and PDAM Models.
33. Timely Reporting of Heavy Hitters Using External Memory.
34. Engineering a high-performance GPU B-Tree.
35. Achieving optimal backlog in multi-processor cup games.
36. Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design.
37. Syntactic Separation of Subset Satisfiability Problems.
38. Optimal Ball Recycling.
39. IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity.
40. Tight Bounds for Monotone Minimal Perfect Hashing.
41. Optimal Hashing in External Memory.
42. GPU LSM: A Dynamic Dictionary Data Structure for the GPU.
43. A Dynamic Hash Table for the GPU.
44. Quotient Filters: Approximate Membership Queries on the GPU.
45. Bloom Filters, Adaptivity, and the Dictionary Problem.
46. Streaming Algorithms for Planar Convex Hulls.
47. The Full Path to Full-Path Indexing.
48. Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111).
49. Tiny Pointers.
50. Better GPU Hash Tables.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.