421 results on '"Guy, E"'
Search Results
2. VERLIB: Concurrent Versioned Pointers.
3. ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.
4. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees.
5. Lock-Free Locks Revisited (Abstract).
6. The Geometry of Tree-Based Sorting.
7. Practically and Theoretically Efficient Garbage Collection for Multiversioning.
8. PIM-trie: A Skew-resistant Trie for Processing-in-Memory.
9. FliT: a library for simple and efficient persistent algorithms.
10. Lock-free locks revisited.
11. Parallel block-delayed sequences.
12. Fast and Fair Randomized Wait-Free Locks.
13. Parallel Nearest Neighbors in Low Dimensions with Batch Updates.
14. PaC-trees: supporting parallel and compressed purely-functional collections.
15. Turning manual concurrent memory reclamation into automatic reference counting.
16. The problem-based benchmark suite (PBBS), V2.
17. PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract).
18. Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract).
19. Constant-time snapshots with applications to concurrent data structures.
20. The Read-Only Semi-External Model.
21. Space and Time Bounded Multiversion Garbage Collection.
22. Efficient Parallel Self-Adjusting Computation.
23. Parallel Minimum Cuts in O(m log2n) Work and Low Depth.
24. SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures.
25. The Processing-in-Memory Model.
26. Concurrent deferred reference counting with constant-time overhead.
27. Are Parallel Algorithms Ready for Prime Time?
28. Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract].
29. LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS.
30. Parallel Batch-Dynamic Trees via Change Propagation.
31. Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.
32. Randomized Incremental Convex Hull is Highly Parallel.
33. Optimal Parallel Algorithms in the Binary-Forking Model.
34. NVTraverse: in NVRAM data structures, the destination is more important than the journey.
35. The Graph Based Benchmark Suite (GBBS).
36. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees
37. Implementing parallel and concurrent tree structures.
38. Parallel Range, Segment and Rectangle Queries with Augmented Maps.
39. Batch-Parallel Euler Tour Trees.
40. Unfair Scheduling Patterns in NUMA Architectures.
41. Parallel Batch-Dynamic Graph Connectivity.
42. Delay-Free Concurrency on Faulty Persistent Memory.
43. Multiversion Concurrency with Bounded Delay and Precise Garbage Collection.
44. Low-latency graph streaming using compressed purely-functional trees.
45. Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time.
46. ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines.
47. VERLIB: Concurrent Versioned Pointers
48. Implicit Decomposition for Write-Efficient Connectivity Algorithms.
49. PAM: parallel augmented maps.
50. Algorithmic Building Blocks for Asymmetric Memories.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.