Showing 41–60 of 74 results
/ Date/ Name
Dec 27, 2022Practically and Theoretically Efficient Garbage Collection for MultiversioningDec 14, 2011Evaluation of Competing J domain:Hsp70 Complex Models in Light of Existing Mutational and NMR DataOct 7, 2017Implicit Decomposition for Write-Efficient Connectivity AlgorithmsJun 2, 2011Selective MemoizationMay 14, 2021Efficient Parallel Self-Adjusting ComputationApr 16, 2026Fast Concurrent Primitives Despite ContentionOct 12, 2018Parallelism in Randomized Incremental AlgorithmsOct 27, 2019Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMsMay 7, 2023ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search AlgorithmsApr 6, 2020NVTraverse: In NVRAM Data Structures, the Destination is More Important than the JourneyFeb 17, 2020Concurrent Reference Counting and Resource Management in Wait-free Constant TimeJun 14, 2019Robustly estimating the marginal likelihood for cognitive models via importance samplingFeb 12, 2021Efficient Selection Between Hierarchical Cognitive Models: Cross-validation With Variational BayesFeb 11, 2016Parallel Shortest-Paths Using Radius SteppingDec 16, 2016PAM: Parallel Augmented MapsFeb 18, 2025Range Retrieval with Graph-Based IndicesJan 13, 2025Big AtomicsNov 7, 2011Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch SubgraphsNov 14, 2025TD-Orch: Scalable Load-Balancing for Distributed Systems with Applications to Graph ProcessingFeb 12, 2020Parallel Batch-dynamic Trees via Change Propagation