259 results on '"Erez Petrank"'
Search Results
2. Concurrent Size (Abstract).
3. POSTER: RELAX: Durable Data Structures with Swift Recovery.
4. Concurrent aggregate queries.
5. Automated Verification of Practical Garbage Collectors
6. Linear-Mark: Locality vs. Accuracy in Mark-Sweep Garbage Collection.
7. The ERA Theorem for Safe Memory Reclamation.
8. FliT: a library for simple and efficient persistent algorithms.
9. EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation.
10. Towards Hardware Accelerated Garbage Collection with Near-Memory Processing.
11. BQ: A Lock-Free Queue with Batching.
12. Concurrent size.
13. VBR: Version Based Reclamation.
14. Brief Announcement: Linearizability: A Typo.
15. Durable Queues: The Second Amendment.
16. Mirror: making lock-free data structures persistent.
17. Functional Faults.
18. NVTraverse: in NVRAM data structures, the destination is more important than the journey.
19. The ERA Theorem for Safe Memory Reclamation.
20. A persistent lock-free queue for non-volatile memory.
21. Passing Messages while Sharing Memory.
22. A Scalable Linearizable Multi-Index Table.
23. BQ: A Lock-Free Queue with Batching.
24. Efficient lock-free durable sets.
25. FliT: A Library for Simple and Efficient Persistent Algorithms.
26. Linearizability: a Typo.
27. Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications.
28. Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory.
29. A GPU-Friendly Skiplist Algorithm.
30. The Teleportation Design Pattern for Hardware Transactional Memory.
31. Parallelization of dynamic languages: synchronizing built-in collections.
32. CBPQ: High Performance Lock-Free Priority Queue.
33. LOFT: lock-free transactional data structures.
34. Limitations of Partial Compaction: Towards Practical Bounds.
35. New Challenges in Parallelism (Dagstuhl Seminar 17451).
36. Data structure aware garbage collector.
37. A Practical Transactional Memory Interface.
38. Help!
39. Automatic memory reclamation for lock-free data structures.
40. Automated and Modular Refinement Reasoning for Concurrent Programs.
41. Efficient Memory Management for Lock-Free Data Structures with Optimistic Access.
42. A practical wait-free simulation for lock-free data structures.
43. LCD: Local Combining on Demand.
44. BQ: A Lock-Free Queue with Batching
45. Reducing transaction aborts by looking to the future.
46. Lock-Free Data-Structure Iterators.
47. Drop the anchor: lightweight memory management for non-blocking data structures.
48. Limitations of partial compaction: towards practical bounds.
49. A study of data structures with a deep heap shape.
50. A methodology for creating fast wait-free data structures.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.