Showing 21–40 of 74 results
/ Date/ Name
Mar 23, 2018Parallel Range, Segment and Rectangle Queries with Augmented MapsMar 11, 2016Sorting with Asymmetric Read and Write CostsMar 12, 2025Parallel Batch-Dynamic Maximal Matching with Constant Work per UpdateMar 21, 2019Parallel Batch-Dynamic Graph ConnectivityApr 12, 2022Turning Manual Concurrent Memory Reclamation into Automatic Reference CountingApr 12, 2022PaC-trees: Supporting Parallel and Compressed Purely-Functional CollectionsSep 25, 2018Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear AlgebraJun 27, 2018Algorithmic Building Blocks for Asymmetric MemoriesJun 12, 2018Delay-Free Concurrency on Faulty Persistent MemoryNov 18, 2022PIM-tree: A Skew-resistant Index for Processing-in-MemoryJun 14, 2023Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low SpanJun 9, 2010Parallel Approximation Algorithms for Facility-Location ProblemsMay 16, 2016Efficient Construction of Probabilistic Tree EmbeddingsMay 15, 2018The Parallel Persistent Memory ModelMay 14, 2018Theoretically Efficient Parallel Graph Algorithms Can Be Fast and ScalableMar 11, 2019Optimal (Randomized) Parallel Algorithms in the Binary-Forking ModelFeb 13, 2020Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window ModelAug 10, 2020Concurrent Fixed-Size Allocation and Free in Constant TimeJul 5, 2020Constant-Time Snapshots with Applications to Concurrent Data StructuresOct 16, 2019Identifying relationships between cognitive processes across tasks, contexts, and time