Current Registered Graduate Students:

• Gali Sheffi, Ph.D.
• Galy Milman, Ph.D.
• Almog Zur, M.Sc.
• Chiara Meiohas, M.Sc.

Past Students:

• Michal Friedman, Ph.D., 2021, "Concurrent Data-Structures for Non-Volatile Memory".
  
  
• Yoav Zuriel, M.Sc., 2020, "Efficient Lock-Free Durable Sets".
  
  
• Galy Milman Sela, M.Sc., 2020, "BQ: A Lock-Free Queue with Batching".
  
  
• Avner Elizarov, M.Sc., 2019, "LOFT: Lock-Free Transactional Data Structures".
  
  
• Nurit Moscovici, M.Sc., 2018, "A GPU-Friendly Skiplist Algorithm".
  
  
• Gal Sheffi, M.Sc., March 2017, "A Scalable Linearizable Multi-Index Table".
  
  
• Nachshon Cohen, Ph.D., June 2016, "Memory Management: From Theory to Practice".
  
  
• Anastasia Braginsky, Ph.D., June 2015, "Multi-Threaded Coordination Methods for Constructing Non-blocking Data Structures".
  
  
• Sharar Timnat, Ph.D., June 2015, "Practical Parallel Data Structures".
  
  
• Haggai Eran, M.Sc., July 2012, "A Study of Data Structures with a Deep Heap Shape".



• Katherina Barabash, M.Sc., October 2010, "Scalable Garbage Collection on Highly Parallel Platforms".

• Anna Bendersky, M.Sc.., June 2010, "On the Limits of Partial Compaction".

• Harel Paz, Ph.D., July 2006, "Efficient Memory Management for Servers".

• Haim Kermany, M.Sc., July 2006, "The Compressor: Concurrent, Incremental, and Parallel Compaction".

• Liza Fireman, M.Sc., June 2006, "The Complexity of SIMD Alignment".

• Niv Buchbinder, M.Sc., November 2003, ``Oblivious Data Structures''.

• Yael Gavish, M.Sc., July 2003, "Cache-conscious Garbage Collection for Servers''.

• Tzafrir Cohen, M.Sc., July 2003, "Responsive Round Complexity and Concurrent Zero-Knowledge''.

• Hezi Azatchi, M.Sc., May 2003, "Generational Reference Counting Garbage Collection''.

• Dafna Frank-Szarfman, M.Sc., December 2002, "Reducing Cache Conflicts via Garbage Collection''.

• Yossi Levanoni, M.Sc., April 2001, "On-the-fly Garbage Collection via Sliding Views''.
   

More work with students (for whom I was not an advisor):

• Alex Kogan and Erez Petrank. A Methodology for Creating Fast Wait-Free Data Structures. The 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2012). February 2012.

• Alex Kogan and Erez Petrank. Wait-Free Queues With Multiple Enqueuers and Dequeuers. The 16th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2011). February 2011.

• Gabriel Kliot, Erez Petrank, and Bjarne Steensgaard. A Lock-Free, Concurrent, and Incremental Stack Scanning for Garbage Collectors. Proceedings of the 2009 ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE'09), March 2009.

• Filip Pizlo, Erez Petrank, and Bjarne Steensgaard. A study of concurrent real-time garbage collectors. Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation (PLDI’08), pp. 33 - 44, June 2008.

• Filip Pizlo, Erez Petrank, and Bjarne Steensgaard. Path specialization: reducing phased execution overheads. The 2008 International Symposium on Memory Management (ISMM'08), pp. 81-90, June, 2008.

• Filip Pizlo, Daniel Frampton, Erez Petrank, and Bjarne Steensgaard. Stopless: A Real-Time Garbage Collector for Multiprocessors. The 2007 International Symposium on Memory Management (ISMM'07), pp. 159-172, Canada, October, 2007.

• Erez Petrank and Dror Rawitz,  "The Hardness of Cache Conscious Data Placement'', Proceedings of  the 29th Annual ACM Symposium on Principles of Programming Languages, (POPL'02), January, 2002.

• Erez Petrank and Guy Rothblum,  "Selection from Structured Data Sets'', Technical Report.