A Study of Synchronization Methods for Concurrent Size.

Erez Petrank https://www.cs.technion.ac.il/~erez/ https://scholar.google.com/citations?user=ME7VLY8AAAAJ https://zbmath.org/authors/?q=ai:petrank.erez https://mathgenealogy.org/id.php?id=75202 https://en.wikipedia.org/wiki/Erez_Petrank https://orcid.org/0000-0002-6353-956X https://www.wikidata.org/entity/Q5385748 https://www.wikidata.org/entity/Q130953084 Technion, Haifa, Israel Hen Kas-Sharir Gal Sela 0001 Erez Petrank A Study of Synchronization Methods for Concurrent Size. 382-396 2025 SPAA https://doi.org/10.1145/3694906.3743316 conf/spaa/2025 db/conf/spaa/spaa2025.html#Kas-Sharir0P25

Hen Kas-Sharir Gal Sela 0001 Erez Petrank A Study of Synchronization Methods for Concurrent Size. 2025 June abs/2506.16350 CoRR https://doi.org/10.48550/arXiv.2506.16350 db/journals/corr/corr2506.html#abs-2506-16350 streams/journals/corr

Gal Sela 0001 Erez Petrank Concurrent Size (Abstract). 2024 HOPC@SPAA https://doi.org/10.1145/3670684.3673409 conf/hopc/2024 db/conf/hopc/hopc2024.html#0001P24 Tomer Cory Erez Petrank The One Pass (OP) Compactor: An Intellectual Abstract. 108-120 2024 ISMM https://doi.org/10.1145/3652024.3665513 conf/iwmm/2024 db/conf/iwmm/ismm2024.html#CoryP24 Almog Zur Nachshon Cohen Michal Friedman 0001 Erez Petrank POSTER: RELAX: Durable Data Structures with Swift Recovery. 475-476 2024 PPoPP https://doi.org/10.1145/3627535.3638469 conf/ppopp/2024 db/conf/ppopp/ppopp2024.html#ZurC0P24 Gal Sela 0001 Erez Petrank Brief Announcement: Concurrent Aggregate Queries. 53:1-53:7 2024 DISC https://doi.org/10.4230/LIPIcs.DISC.2024.53 conf/wdag/2024 db/conf/wdag/disc2024.html#0001P24 Kunal Agrawal 0001 Erez Petrank Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, June 17-21, 2024 SPAA ACM 2024 https://doi.org/10.1145/3626183 db/conf/spaa/spaa2024.html

Gal Sela 0001 Erez Petrank Concurrent aggregate queries. 2024 abs/2405.07434 CoRR https://doi.org/10.48550/arXiv.2405.07434 db/journals/corr/corr2405.html#abs-2405-07434

Chiara Meiohas Stephen M. Blackburn Erez Petrank Linear-Mark: Locality vs. Accuracy in Mark-Sweep Garbage Collection. 11:1-11:12 2023 MEMSYS https://doi.org/10.1145/3631882.3631893 conf/memsys/2023 db/conf/memsys/memsys2023.html#MeiohasBP23 Gali Sheffi Erez Petrank The ERA Theorem for Safe Memory Reclamation. 102-112 2023 PODC https://doi.org/10.1145/3583668.3594564 https://www.wikidata.org/entity/Q130953085 conf/podc/2023 db/conf/podc/podc2023.html#SheffiP23 Gali Sheffi Erez Petrank The ERA Theorem for Safe Memory Reclamation. 435-437 2023 PPoPP https://doi.org/10.1145/3572848.3577491 https://www.wikidata.org/entity/Q130955470 conf/ppopp/2023 db/conf/ppopp/ppopp2023.html#SheffiP23 Stephen M. Blackburn Erez Petrank Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management, ISMM 2023, Orlando, FL, USA, 18 June 2023 ISMM ACM 2023 https://doi.org/10.1145/3591195 db/conf/iwmm/ismm2023.html

Gal Sela 0001 Erez Petrank Concurrent size. 345-372 2022 6 Proc. ACM Program. Lang. OOPSLA2 https://doi.org/10.1145/3563300 db/journals/pacmpl/pacmpl6.html#SelaP22

Gal Milman-Sela Alex Kogan Yossi Lev Victor Luchangco Erez Petrank BQ: A Lock-Free Queue with Batching. 5:1-5:49 2022 9 ACM Trans. Parallel Comput. 1 https://doi.org/10.1145/3512757 db/journals/topc/topc9.html#Milman-SelaKLLP22

Samuel Thomas Jiwon Choe Ofir Gordon Erez Petrank Tali Moreshet Maurice Herlihy R. Iris Bahar Towards Hardware Accelerated Garbage Collection with Near-Memory Processing. 1-6 2022 HPEC https://doi.org/10.1109/HPEC55821.2022.9926323 conf/hpec/2022 db/conf/hpec/hpec2022.html#ThomasCGPMHB22 Gali Sheffi Pedro Ramalhete Erez Petrank EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. 5:1-5:22 2022 OPODIS https://doi.org/10.4230/LIPIcs.OPODIS.2022.5 conf/opodis/2022 db/conf/opodis/opodis2022.html#SheffiRP22 Yuanhao Wei Naama Ben-David Michal Friedman 0001 Guy E. Blelloch Erez Petrank FliT: a library for simple and efficient persistent algorithms. 309-321 2022 PPoPP https://doi.org/10.1145/3503221.3508436 conf/ppopp/2022 db/conf/ppopp/ppopp2022.html#WeiB0BP22

Gal Sela 0001 Erez Petrank Concurrent Size. 2022 abs/2209.07100 CoRR https://doi.org/10.48550/arXiv.2209.07100 db/journals/corr/corr2209.html#abs-2209-07100

Gali Sheffi Pedro Ramalhete Erez Petrank EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. 2022 abs/2210.17086 CoRR https://doi.org/10.48550/arXiv.2210.17086 db/journals/corr/corr2210.html#abs-2210-17086

Gali Sheffi Erez Petrank The ERA Theorem for Safe Memory Reclamation. 2022 abs/2211.04351 CoRR https://doi.org/10.48550/arXiv.2211.04351 db/journals/corr/corr2211.html#abs-2211-04351

Michal Friedman 0001 Erez Petrank Pedro Ramalhete Mirror: making lock-free data structures persistent. 1218-1232 2021 PLDI https://doi.org/10.1145/3453483.3454105 conf/pldi/2021 db/conf/pldi/pldi2021.html#FriedmanPR21 Gal Sela 0001 Maurice Herlihy Erez Petrank Brief Announcement: Linearizability: A Typo. 561-564 2021 PODC https://doi.org/10.1145/3465084.3467944 conf/podc/2021 db/conf/podc/podc2021.html#0001HP21 Gal Sela 0001 Erez Petrank Durable Queues: The Second Amendment. 385-397 2021 SPAA https://doi.org/10.1145/3409964.3461791 conf/spaa/2021 db/conf/spaa/spaa2021.html#0001P21 Gali Sheffi Maurice Herlihy Erez Petrank VBR: Version Based Reclamation. 443-445 2021 SPAA https://doi.org/10.1145/3409964.3461817 conf/spaa/2021 db/conf/spaa/spaa2021.html#SheffiHP21 Gali Sheffi Maurice Herlihy Erez Petrank VBR: Version Based Reclamation. 35:1-35:18 2021 DISC https://doi.org/10.4230/LIPIcs.DISC.2021.35 conf/wdag/2021 db/conf/wdag/disc2021.html#SheffiHP21 Jaejin Lee Erez Petrank PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Virtual Event, Republic of Korea, February 27- March 3, 2021 ACM PPoPP 2021 978-1-4503-8294-6 https://doi.org/10.1145/3437801 db/conf/ppopp/ppopp2021.html

Gal Sela 0001 Maurice Herlihy Erez Petrank Linearizability: a Typo. 2021 abs/2105.06737 CoRR https://arxiv.org/abs/2105.06737 db/journals/corr/corr2105.html#abs-2105-06737

Gal Sela 0001 Erez Petrank Durable Queues: The Second Amendment. 2021 abs/2105.08706 CoRR https://arxiv.org/abs/2105.08706 db/journals/corr/corr2105.html#abs-2105-08706

Gali Sheffi Maurice Herlihy Erez Petrank VBR: Version Based Reclamation. 2021 abs/2107.13843 CoRR https://arxiv.org/abs/2107.13843 db/journals/corr/corr2107.html#abs-2107-13843

Yuanhao Wei Naama Ben-David Michal Friedman 0001 Guy E. Blelloch Erez Petrank FliT: A Library for Simple and Efficient Persistent Algorithms. 2021 abs/2108.04202 CoRR https://arxiv.org/abs/2108.04202 db/journals/corr/corr2108.html#abs-2108-04202

Michal Friedman 0001 Naama Ben-David Yuanhao Wei Guy E. Blelloch Erez Petrank NVTraverse: in NVRAM data structures, the destination is more important than the journey. 377-392 2020 PLDI https://doi.org/10.1145/3385412.3386031 conf/pldi/2020 db/conf/pldi/pldi2020.html#FriedmanBWBP20 Gali Sheffi Erez Petrank Functional faults. 417-418 2020 PPoPP https://doi.org/10.1145/3332466.3374539 conf/ppopp/2020 db/conf/ppopp/ppopp2020.html#SheffiP20 Gali Sheffi Erez Petrank Functional Faults. 453-463 2020 SPAA https://doi.org/10.1145/3350755.3400261 conf/spaa/2020 db/conf/spaa/spaa2020.html#SheffiP20

Michal Friedman 0001 Naama Ben-David Yuanhao Wei Guy E. Blelloch Erez Petrank NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey. 2020 abs/2004.02841 CoRR https://arxiv.org/abs/2004.02841 db/journals/corr/corr2004.html#abs-2004-02841

Yoav Zuriel Michal Friedman 0001 Gali Sheffi Nachshon Cohen Erez Petrank Efficient lock-free durable sets. 128:1-128:26 2019 3 Proc. ACM Program. Lang. OOPSLA https://doi.org/10.1145/3360554 https://www.wikidata.org/entity/Q112146432 db/journals/pacmpl/pacmpl3.html#ZurielFSCP19

Avner Elizarov Guy Golan-Gueta Erez Petrank LOFT: lock-free transactional data structures. 425-426 2019 PPoPP https://doi.org/10.1145/3293883.3301491 conf/ppopp/2019 db/conf/ppopp/ppopp2019.html#ElizarovGP19

Yoav Zuriel Michal Friedman 0001 Gali Sheffi Nachshon Cohen Erez Petrank Efficient Lock-Free Durable Sets. 2019 abs/1909.02852 CoRR http://arxiv.org/abs/1909.02852 db/journals/corr/corr1909.html#abs-1909-02852

Benoit Daloze Arie Tal Stefan Marr Hanspeter Mössenböck Erez Petrank Parallelization of dynamic languages: synchronizing built-in collections. 108:1-108:30 2018 2 Proc. ACM Program. Lang. OOPSLA https://doi.org/10.1145/3276478 https://www.wikidata.org/entity/Q130968914 db/journals/pacmpl/pacmpl2.html#DalozeTMMP18

Gali Sheffi Guy Golan-Gueta Erez Petrank A Scalable Linearizable Multi-Index Table. 200-211 2018 ICDCS https://doi.org/10.1109/ICDCS.2018.00029 https://doi.ieeecomputersociety.org/10.1109/ICDCS.2018.00029 conf/icdcs/2018 db/conf/icdcs/icdcs2018.html#SheffiGP18 Marcos K. Aguilera Naama Ben-David Irina Calciu Rachid Guerraoui Erez Petrank Sam Toueg Passing Messages while Sharing Memory. 51-60 2018 PODC https://doi.org/10.1145/3212734.3212741 conf/podc/2018 db/conf/podc/podc2018.html#AguileraBCGPT18 Michal Friedman 0001 Maurice Herlihy Virendra J. Marathe Erez Petrank A persistent lock-free queue for non-volatile memory. 28-40 2018 PPoPP https://doi.org/10.1145/3178487.3178490 https://doi.org/10.1145/3200691.3178490 https://www.wikidata.org/entity/Q128301383 conf/ppopp/2018 db/conf/ppopp/ppopp2018.html#FriedmanHMP18 Nachshon Cohen Erez Petrank James R. Larus Reducing transaction aborts by looking to the future. 385-386 2018 PPoPP https://doi.org/10.1145/3178487.3178518 https://doi.org/10.1145/3200691.3178518 https://www.wikidata.org/entity/Q128301630 conf/ppopp/2018 db/conf/ppopp/ppopp2018.html#CohenPL18 Gal Milman Alex Kogan Yossi Lev Victor Luchangco Erez Petrank BQ: A Lock-Free Queue with Batching. 99-109 2018 SPAA https://doi.org/10.1145/3210377.3210388 conf/spaa/2018 db/conf/spaa/spaa2018.html#MilmanKLLP18

Nachshon Cohen Erez Petrank Limitations of Partial Compaction: Towards Practical Bounds. 2:1-2:44 2017 39 ACM Trans. Program. Lang. Syst. 1 https://doi.org/10.1145/2994597 db/journals/toplas/toplas39.html#CohenP17

Nurit Moscovici Nachshon Cohen Erez Petrank A GPU-Friendly Skiplist Algorithm. 246-259 2017 PACT https://doi.org/10.1109/PACT.2017.13 https://doi.ieeecomputersociety.org/10.1109/PACT.2017.13 conf/IEEEpact/2017 db/conf/IEEEpact/pact2017.html#MoscoviciCP17 Nachshon Cohen Maurice Herlihy Erez Petrank Elias Wald The Teleportation Design Pattern for Hardware Transactional Memory. 10:1-10:16 2017 OPODIS https://doi.org/10.4230/LIPIcs.OPODIS.2017.10 conf/opodis/2017 db/conf/opodis/opodis2017.html#CohenHPW17 Nachshon Cohen Arie Tal Erez Petrank Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications. 17-29 2017 PPoPP https://doi.org/10.1145/3018743.3018753 https://doi.org/10.1145/3155284.3018753 conf/ppopp/2017 db/conf/ppopp/ppopp2017.html#CohenTP17 Nachshon Cohen Maurice Herlihy Erez Petrank Elias Wald POSTER: State Teleportation via Hardware Transactional Memory. 437-438 2017 PPoPP https://doi.org/10.1145/3018743.3019026 https://doi.org/10.1145/3155284.3019026 conf/ppopp/2017 db/conf/ppopp/ppopp2017.html#CohenHPW17 Nurit Moscovici Nachshon Cohen Erez Petrank POSTER: A GPU-Friendly Skiplist Algorithm. 449-450 2017 PPoPP https://doi.org/10.1145/3018743.3019032 https://doi.org/10.1145/3155284.3019032 conf/ppopp/2017 db/conf/ppopp/ppopp2017.html#MoscoviciCP17 Michal Friedman 0001 Maurice Herlihy Virendra J. Marathe Erez Petrank Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory. 50:1-50:4 2017 DISC https://doi.org/10.4230/LIPIcs.DISC.2017.50 conf/wdag/2017 db/conf/wdag/disc2017.html#FriedmanHMP17

Annette Bieniusa Hans-Juergen Boehm Maurice Herlihy Erez Petrank New Challenges in Parallelism (Dagstuhl Seminar 17451). 1-27 2017 7 Dagstuhl Reports 11 https://doi.org/10.4230/DagRep.7.11.1 db/journals/dagstuhl-reports/dagstuhl-reports7.html#BieniusaBHP17

Anastasia Braginsky Nachshon Cohen Erez Petrank CBPQ: High Performance Lock-Free Priority Queue. 460-474 2016 Euro-Par https://doi.org/10.1007/978-3-319-43659-3_34 conf/europar/2016 db/conf/europar/europar2016.html#BraginskyCP16 Chris Hawblitzel Erez Petrank Shaz Qadeer Serdar Tasiran Automated and Modular Refinement Reasoning for Concurrent Programs. 449-465 2015 CAV (2) https://doi.org/10.1007/978-3-319-21668-3_26 conf/cav/2015 db/conf/cav/cav2015.html#HawblitzelPQT15 Shahar Timnat Maurice Herlihy Erez Petrank A Practical Transactional Memory Interface. 387-401 2015 Euro-Par https://doi.org/10.1007/978-3-662-48096-0_30 conf/europar/2015 db/conf/europar/europar2015.html#TimnatHP15 Nachshon Cohen Erez Petrank Data structure aware garbage collector. 28-40 2015 ISMM https://doi.org/10.1145/2754169.2754176 https://doi.org/10.1145/2887746.2754176 conf/iwmm/2015 db/conf/iwmm/ismm2015.html#CohenP15 Nachshon Cohen Erez Petrank Automatic memory reclamation for lock-free data structures. 260-279 2015 OOPSLA https://doi.org/10.1145/2814270.2814298 https://doi.org/10.1145/2858965.2814298 conf/oopsla/2015 db/conf/oopsla/oopsla2015.html#CohenP15 Keren Censor-Hillel Erez Petrank Shahar Timnat Help! 241-250 2015 PODC https://doi.org/10.1145/2767386.2767415 conf/podc/2015 db/conf/podc/podc2015.html#Censor-HillelPT15 Nachshon Cohen Erez Petrank Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. 254-263 2015 SPAA https://doi.org/10.1145/2755573.2755579 conf/spaa/2015 db/conf/spaa/spaa2015.html#CohenP15 Dana Drachsler-Cohen Erez Petrank LCD: Local Combining on Demand. 355-371 2014 OPODIS https://doi.org/10.1007/978-3-319-14472-6_24 conf/opodis/2014 db/conf/opodis/opodis2014.html#Drachsler-CohenP14 Shahar Timnat Erez Petrank A practical wait-free simulation for lock-free data structures. 357-368 2014 PPoPP https://doi.org/10.1145/2555243.2555261 https://doi.org/10.1145/2692916.2555261 https://www.wikidata.org/entity/Q56337296 conf/ppopp/2014 db/conf/ppopp/ppopp2014.html#TimnatP14 Shahar Timnat Maurice Herlihy Erez Petrank A Practical Transactional Memory Interface. 542-543 2014 DISC https://link.springer.com/content/pdf/bbm%3A978-3-662-45174-8%2F1.pdf#page=12 conf/wdag/2014 db/conf/wdag/disc2014.html#TimnatHP14 Martin Hirzel Erez Petrank Dan Tsafrir 10th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, VEE '14, Salt Lake City, UT, USA, March 01 - 02, 2014 ACM VEE 2014 978-1-4503-2764-0 https://doi.org/10.1145/2576195 https://doi.org/10.1145/2674025 db/conf/vee/vee2014.html Haggai Eran Erez Petrank A study of data structures with a deep heap shape. 2:1-2:8 2013 MSPC@PLDI https://doi.org/10.1145/2492408.2492413 conf/pldi/2013mspc db/conf/pldi/mspc2013.html#EranP13 Nachshon Cohen Erez Petrank Limitations of partial compaction: towards practical bounds. 309-320 2013 PLDI https://doi.org/10.1145/2491956.2491973 https://doi.org/10.1145/2499370.2491973 conf/pldi/2013 db/conf/pldi/pldi2013.html#CohenP13 Anastasia Braginsky Alex Kogan Erez Petrank Drop the anchor: lightweight memory management for non-blocking data structures. 33-42 2013 SPAA https://doi.org/10.1145/2486159.2486184 conf/spaa/2013 db/conf/spaa/spaa2013.html#BraginskyKP13 Erez Petrank Shahar Timnat Lock-Free Data-Structure Iterators. 224-238 2013 DISC https://doi.org/10.1007/978-3-642-41527-2_16 conf/wdag/2013 db/conf/wdag/disc2013.html#PetrankT13 Perry Cheng Erez Petrank International Symposium on Memory Management, ISMM 2013, Seattle, WA, USA, June 20, 2013 ACM ISMM 2013 978-1-4503-2100-6 https://doi.org/10.1145/2491894 https://doi.org/10.1145/2555670 db/conf/iwmm/ismm2013.html

Erez Petrank Benjamin Zorn 0001 SIGPLAN professional activities committee report. 13 2012 47 ACM SIGPLAN Notices 4a https://doi.org/10.1145/2442776.2448984 db/journals/sigplan/sigplan47.html#Petrank012

Anna Bendersky Erez Petrank Space overhead bounds for dynamic memory management with partial compaction. 13:1-13:43 2012 34 ACM Trans. Program. Lang. Syst. 3 https://doi.org/10.1145/2362389.2362392 db/journals/toplas/toplas34.html#BenderskyP12

Shahar Timnat Anastasia Braginsky Alex Kogan Erez Petrank Wait-Free Linked-Lists. 330-344 2012 OPODIS https://doi.org/10.1007/978-3-642-35476-2_23 conf/opodis/2012 db/conf/opodis/opodis2012.html#TimnatBKP12 Erez Petrank Can parallel data structures rely on automatic memory managers? 1 2012 MSPC https://doi.org/10.1145/2247684.2247685 conf/pldi/2012mspc db/conf/pldi/mspc2012.html#Petrank12 Alex Kogan Erez Petrank A methodology for creating fast wait-free data structures. 141-150 2012 PPoPP https://doi.org/10.1145/2145816.2145835 https://doi.org/10.1145/2370036.2145835 https://www.wikidata.org/entity/Q56337295 conf/ppopp/2012 db/conf/ppopp/ppopp2012.html#KoganP12 Shahar Timnat Anastasia Braginsky Alex Kogan Erez Petrank Wait-free linked-lists. 309-310 2012 PPoPP https://doi.org/10.1145/2145816.2145869 https://doi.org/10.1145/2370036.2145869 conf/ppopp/2012 db/conf/ppopp/ppopp2012.html#TimnatBKP12 Anastasia Braginsky Erez Petrank A lock-free B+tree. 58-67 2012 SPAA https://doi.org/10.1145/2312005.2312016 conf/spaa/2012 db/conf/spaa/spaa2012.html#BraginskyP12

Yuval Ishai Jonathan Katz Eyal Kushilevitz Yehuda Lindell Erez Petrank On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. 122-141 2011 40 SIAM J. Comput. 1 https://doi.org/10.1137/100783224 db/journals/siamcomp/siamcomp40.html#IshaiKKLP11

Iftach Haitner Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank Black-Box Constructions of Protocols for Secure Computation. 225-266 2011 40 SIAM J. Comput. 2 https://doi.org/10.1137/100790537 db/journals/siamcomp/siamcomp40.html#HaitnerIKLP11

Anastasia Braginsky Erez Petrank Locality-Conscious Lock-Free Linked Lists. 107-118 2011 ICDCN https://doi.org/10.1007/978-3-642-17679-1_10 conf/icdcn/2011 db/conf/icdcn/icdcn2011.html#BraginskyP11 Anna Bendersky Erez Petrank Space overhead bounds for dynamic memory management with partial compaction. 475-486 2011 POPL https://doi.org/10.1145/1926385.1926441 https://doi.org/10.1145/1925844.1926441 conf/popl/2011 db/conf/popl/popl2011.html#BenderskyP11 Alex Kogan Erez Petrank Wait-free queues with multiple enqueuers and dequeuers. 223-234 2011 PPoPP https://doi.org/10.1145/1941553.1941585 https://doi.org/10.1145/2038037.1941585 https://www.wikidata.org/entity/Q56337293 conf/ppopp/2011 db/conf/ppopp/ppopp2011.html#KoganP11 Erez Petrank Doug Lea Proceedings of the 7th International Conference on Virtual Execution Environments, VEE 2011, Newport Beach, CA, USA, March 9-11, 2011 (co-located with ASPLOS 2011) VEE ACM 2011 978-1-4503-0687-4 https://doi.org/10.1145/1952682 https://doi.org/10.1145/2007477 db/conf/vee/vee2011.html

Chris Hawblitzel Erez Petrank Automated Verification of Practical Garbage Collectors http://arxiv.org/abs/1004.3808 2010 Log. Methods Comput. Sci. 6 db/journals/lmcs/lmcs6.html#abs-1004-3808 3

Katherine Barabash Erez Petrank Tracing garbage collection on highly parallel platforms. 1-10 2010 ISMM https://doi.org/10.1145/1806651.1806653 https://doi.org/10.1145/1837855.1806653 conf/iwmm/2010 db/conf/iwmm/ismm2010.html#BarabashP10

Yuval Ishai Jonathan Katz Eyal Kushilevitz Yehuda Lindell Erez Petrank On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. 29 2010 2010 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2010/029 db/journals/iacr/iacr2010.html#IshaiKKLP10

Iftach Haitner Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank Black-Box Constructions of Protocols for Secure Computation. 164 2010 2010 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2010/164 db/journals/iacr/iacr2010.html#HaitnerIKLP10

Gabriel Kliot Erez Petrank Bjarne Steensgaard A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors. 3-13 2009 43 ACM SIGOPS Oper. Syst. Rev. 3 https://doi.org/10.1145/1618525.1618527 db/journals/sigops/sigops43.html#KliotPS09

Erez Petrank Madanlal Musuvathi Bjarne Steensgaard Progress guarantee for parallel programs via bounded lock-freedom. 144-154 2009 PLDI https://doi.org/10.1145/1542476.1542493 https://doi.org/10.1145/1543135.1542493 conf/pldi/2009 db/conf/pldi/pldi2009.html#PetrankMS09 Chris Hawblitzel Erez Petrank Automated verification of practical garbage collectors. 441-453 2009 POPL https://doi.org/10.1145/1480881.1480935 https://doi.org/10.1145/1594834.1480935 conf/popl/2009 db/conf/popl/popl2009.html#HawblitzelP09 Gabriel Kliot Erez Petrank Bjarne Steensgaard A lock-free, concurrent, and incremental stack scanning for garbage collectors. 11-20 2009 VEE https://doi.org/10.1145/1508293.1508296 conf/vee/2009 db/conf/vee/vee2009.html#KliotPS09 Filip Pizlo Erez Petrank Bjarne Steensgaard Path specialization: reducing phased execution overheads. 81-90 2008 ISMM https://doi.org/10.1145/1375634.1375647 conf/iwmm/2008 db/conf/iwmm/ismm2008.html#PizloPS08 Filip Pizlo Erez Petrank Bjarne Steensgaard A study of concurrent real-time garbage collectors. 33-44 2008 PLDI https://doi.org/10.1145/1375581.1375587 https://doi.org/10.1145/1379022.1375587 conf/pldi/2008 db/conf/pldi/pldi2008.html#PizloPS08

Harel Paz David F. Bacon Elliot K. Kolodner Erez Petrank V. T. Rajan An efficient on-the-fly cycle collection. 2007 29 ACM Trans. Program. Lang. Syst. 4 https://doi.org/10.1145/1255450.1255453 https://www.wikidata.org/entity/Q56060790 db/journals/toplas/toplas29.html#PazBKPR07 20

Liza Fireman Erez Petrank Ayal Zaks New Algorithms for SIMD Alignment. 1-15 2007 conf/cc/2007 CC https://doi.org/10.1007/978-3-540-71229-9_1 db/conf/cc/cc2007.html#FiremanPZ07 Harel Paz Erez Petrank Using Prefetching to Improve Reference-Counting Garbage Collectors. 48-63 2007 conf/cc/2007 CC https://doi.org/10.1007/978-3-540-71229-9_4 db/conf/cc/cc2007.html#PazP07 Filip Pizlo Daniel Frampton Erez Petrank Bjarne Steensgaard Stopless: a real-time garbage collector for multiprocessors. 159-172 2007 conf/iwmm/2007 ISMM https://doi.org/10.1145/1296907.1296927 db/conf/iwmm/ismm2007.html#PizloFPS07

Hezi Azatchi Erez Petrank Integrating generations with advanced reference counting garbage collectors. 959-995 2006 18 Concurr. Comput. Pract. Exp. 9 https://doi.org/10.1002/cpe.1005 db/journals/concurrency/concurrency18.html#AzatchiP06

Niv Buchbinder Erez Petrank Lower and upper bounds on obtaining history independence. 291-337 2006 204 Inf. Comput. 2 https://doi.org/10.1016/j.ic.2005.11.001 db/journals/iandc/iandc204.html#BuchbinderP06

Yossi Levanoni Erez Petrank An on-the-fly reference-counting garbage collector for java. 1-69 2006 28 ACM Trans. Program. Lang. Syst. 1 https://doi.org/10.1145/1111596.1111597 https://www.wikidata.org/entity/Q56060788 db/journals/toplas/toplas28.html#LevanoniP06

Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. 483-500 2006 conf/crypto/2006 CRYPTO https://doi.org/10.1007/11818175_29 db/conf/crypto/crypto2006.html#IshaiKLP06 Haim Kermany Erez Petrank The Compressor: concurrent, incremental, and parallel compaction. 354-363 2006 conf/pldi/2006 PLDI https://doi.org/10.1145/1133981.1134023 https://doi.org/10.1145/1133255.1134023 db/conf/pldi/pldi2006.html#KermanyP06 Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank Black-box constructions for secure computation. 99-108 2006 conf/stoc/2006 STOC https://doi.org/10.1145/1132516.1132531 db/conf/stoc/stoc2006.html#IshaiKLP06 Erez Petrank J. Eliot B. Moss Proceedings of the 5th International Symposium on Memory Management, ISMM 2006, Ottawa, Ontario, Canada, June 10-11, 2006 ISMM ACM 2006 1-59593-221-6 https://doi.org/10.1145/1133956 db/conf/iwmm/ismm2006.html

Joe Kilian Charles Rackoff Erez Petrank Lower Bounds For Concurrent Zero Knowledge*. 217-249 2005 25 Comb. 2 https://doi.org/10.1007/s00493-005-0014-6 db/journals/combinatorica/combinatorica25.html#KilianRP05

Erez Petrank Dror Rawitz The Hardness of Cache Conscious Data Placement. 275-307 2005 12 Nord. J. Comput. 3 db/journals/njc/njc12.html#PetrankR05

Katherine Barabash Ori Ben-Yitzhak Irit Goft Elliot K. Kolodner Victor Leikehman Yoav Ossia Avi Owshanko Erez Petrank A parallel, incremental, mostly concurrent garbage collector for servers. 1097-1146 2005 27 ACM Trans. Program. Lang. Syst. 6 https://doi.org/10.1145/1108970.1108972 db/journals/toplas/toplas27.html#BarabashBGKLOOP05

Harel Paz Erez Petrank Stephen M. Blackburn Age-Oriented Concurrent Garbage Collection. 121-136 https://doi.org/10.1007/978-3-540-31985-6_9 2005 conf/cc/2005 CC db/conf/cc/cc2005.html#PazPB05 Harel Paz Erez Petrank David F. Bacon Elliot K. Kolodner V. T. Rajan An Efficient On-the-Fly Cycle Collection. 156-171 https://doi.org/10.1007/978-3-540-31985-6_11 2005 conf/cc/2005 CC db/conf/cc/cc2005.html#PazPBKR05

Erez Petrank Elliot K. Kolodner Parallel Copying Garbage Collection Using Delayed Allocation. 271-286 2004 14 Parallel Process. Lett. 2 https://doi.org/10.1142/S0129626404001878 db/journals/ppl/ppl14.html#PetrankK04

Diab Abuaiadh Yoav Ossia Erez Petrank Uri Silbershtein An efficient parallel heap compaction algorithm. 224-236 2004 conf/oopsla/2004p OOPSLA https://doi.org/10.1145/1028976.1028995 https://doi.org/10.1145/1035292.1028995 db/conf/oopsla/oopsla2004p.html#AbuaiadhOPS04

Erez Petrank Guy N. Rothblum Selection from Structured Data Sets Electron. Colloquium Comput. Complex. 2004 TR04 TR04-085 db/journals/eccc/eccc11.html#TR04-085 https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-085/index.html

Hezi Azatchi Erez Petrank Integrating Generations with Advanced Reference Counting Garbage Collectors. 185-199 2003 conf/cc/2003 CC https://doi.org/10.1007/3-540-36579-6_14 db/conf/cc/cc2003.html#AzatchiP03 Yuval Ishai Joe Kilian Kobbi Nissim Erez Petrank Extending Oblivious Transfers Efficiently. 145-161 https://doi.org/10.1007/978-3-540-45146-4_9 2003 conf/crypto/2003 CRYPTO db/conf/crypto/crypto2003.html#IshaiKNP03 Niv Buchbinder Erez Petrank Lower and Upper Bounds on Obtaining History Independence. 445-462 https://doi.org/10.1007/978-3-540-45146-4_26 2003 conf/crypto/2003 CRYPTO db/conf/crypto/crypto2003.html#BuchbinderP03 Daniele Micciancio Erez Petrank Simulatable Commitments and Efficient Concurrent Zero-Knowledge. 140-159 2003 conf/eurocrypt/2003 EUROCRYPT https://doi.org/10.1007/3-540-39200-9_9 db/conf/eurocrypt/eurocrypt2003.html#MicciancioP03 Katherine Barabash Yoav Ossia Erez Petrank Mostly concurrent garbage collection revisited. 255-268 2003 conf/oopsla/2003p OOPSLA https://doi.org/10.1145/949305.949328 https://doi.org/10.1145/949343.949328 db/conf/oopsla/oopsla2003p.html#BarabashOP03 Hezi Azatchi Yossi Levanoni Harel Paz Erez Petrank An on-the-fly mark and sweep garbage collector based on sliding views. 269-281 2003 conf/oopsla/2003p OOPSLA https://doi.org/10.1145/949305.949329 https://doi.org/10.1145/949343.949329 db/conf/oopsla/oopsla2003p.html#AzatchiLPP03

Erez Petrank Gábor Tardos On the Knowledge Complexity of <i>NP</i>. 83-121 2002 22 Comb. 1 https://doi.org/10.1007/s004930200005 db/journals/combinatorica/combinatorica22.html#PetrankT02

Ran Canetti Joe Kilian Erez Petrank Alon Rosen Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. 1-47 2002 32 SIAM J. Comput. 1 https://doi.org/10.1137/S0097539701392949 db/journals/siamcomp/siamcomp32.html#CanettiKPR02

Tamar Domani Gal Goldshtein Elliot K. Kolodner Ethan Lewis Erez Petrank Dafna Sheinwald Thread-local heaps for Java. 183-194 2002 conf/iwmm/2002 MSP/ISMM https://doi.org/10.1145/512429.512439 https://doi.org/10.1145/773039.512439 db/conf/iwmm/ismm2002.html#DomaniGKLPS02 Erez Petrank Dror Rawitz The hardness of cache conscious data placement. 101-112 2002 conf/popl/2002 POPL https://doi.org/10.1145/503272.503283 https://doi.org/10.1145/565816.503283 db/conf/popl/popl2002.html#PetrankR02

Daniele Micciancio Erez Petrank Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol Electron. Colloquium Comput. Complex. 2002 TR02 TR02-045 db/journals/eccc/eccc9.html#ECCC-TR02-045 https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-045/index.html

Daniele Micciancio Erez Petrank Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol. 90 2002 2002 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2002/090 db/journals/iacr/iacr2002.html#MicciancioP02

Tzafrir Cohen Joe Kilian Erez Petrank Responsive Round Complexity and Concurrent Zero-Knowledge. 422-441 2001 conf/asiacrypt/2001 ASIACRYPT https://doi.org/10.1007/3-540-45682-1_25 db/conf/asiacrypt/asiacrypt2001.html#CohenKP01 Yossi Levanoni Erez Petrank An On-the-Fly Reference Counting Garbage Collector for Java. 367-380 2001 conf/oopsla/2001 OOPSLA db/conf/oopsla/oopsla2001.html#LevanoniP01 https://doi.org/10.1145/504282.504309 https://doi.org/10.1145/504311.504309 https://www.wikidata.org/entity/Q56060787 Joe Kilian Erez Petrank Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. 560-569 2001 conf/stoc/2001 STOC https://doi.org/10.1145/380752.380851 db/conf/stoc/stoc2001.html#KilianP01 Ran Canetti Joe Kilian Erez Petrank Alon Rosen Black-box concurrent zero-knowledge requires Omega~(log n) rounds. 570-579 2001 conf/stoc/2001 STOC https://doi.org/10.1145/380752.380852 db/conf/stoc/stoc2001.html#CanettiKPR01

Joe Kilian Erez Petrank Charles Rackoff Lower Bounds for Zero-knowledge on the Internet https://arxiv.org/abs/cs/0107003 2001 CoRR cs.CR/0107003 db/journals/corr/corr0107.html#cs-CR-0107003

Joe Kilian Erez Petrank Ransom Richardson On Concurrent and Resettable Zero-Knowledge Proofs for NP https://arxiv.org/abs/cs/0107004 2001 CoRR cs.CR/0107004 db/journals/corr/corr0107.html#cs-CR-0107004

Ran Canetti Joe Kilian Erez Petrank Alon Rosen Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds Electron. Colloquium Comput. Complex. 2001 TR01 TR01-050 db/journals/eccc/eccc8.html#ECCC-TR01-050 https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-050/index.html

Ran Canetti Joe Kilian Erez Petrank Alon Rosen Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. 51 2001 2001 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2001/051 db/journals/iacr/iacr2001.html#CanettiKPR01

Mihir Bellare Oded Goldreich 0001 Erez Petrank Uniform Generation of NP-Witnesses Using an NP-Oracle. 510-526 2000 163 Inf. Comput. 2 db/journals/iandc/iandc163.html#BellareGP00

Erez Petrank Charles Rackoff CBC MAC for Real-Time Data Sources. 315-338 2000 13 J. Cryptol. 3 https://doi.org/10.1007/s001450010009 https://www.wikidata.org/entity/Q127125064 db/journals/joc/joc13.html#PetrankR00

Tamar Domani Elliot K. Kolodner Ethan Lewis Eliot E. Salant Katherine Barabash Itai Lahan Yossi Levanoni Erez Petrank Igor Yanover Implementing an On-the-Fly Garbage Collector for Java. 155-166 2000 conf/iwmm/2000 ISMM db/conf/iwmm/ismm2000.html#DomaniKLSBLLPY00 https://doi.org/10.1145/362422.362484 https://doi.org/10.1145/362426.362484 Tamar Domani Elliot K. Kolodner Erez Petrank A generational on-the-fly garbage collector for Java. 274-284 2000 conf/pldi/2000 PLDI https://doi.org/10.1145/349299.349336 https://doi.org/10.1145/358438.349336 db/conf/pldi/pldi2000.html#DomaniKP00

Joe Kilian Erez Petrank Concurrent Zero-Knowledge in Poly-logarithmic Rounds. 13 2000 2000 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2000/013 db/journals/iacr/iacr2000.html#KilianP00

Oded Goldreich 0001 Erez Petrank Quantifying Knowledge Complexity. 50-98 1999 8 Comput. Complex. 1 https://doi.org/10.1007/s000370050019 db/journals/cc/cc8.html#GoldreichP99

Noga Alon Martin Dietzfelbinger Peter Bro Miltersen Erez Petrank Gábor Tardos Linear Hash Functions. 667-683 1999 46 J. ACM 5 https://doi.org/10.1145/324133.324179 db/journals/jacm/jacm46.html#AlonDMPT99

Alain Azagury Elliot K. Kolodner Erez Petrank A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments. 391-399 1999 9 Parallel Process. Lett. 3 https://doi.org/10.1142/S0129626499000360 db/journals/ppl/ppl9.html#AzaguryKP99

Anna Gál Shai Halevi Richard J. Lipton Erez Petrank Computing from Partial Solutions. 34-45 1999 conf/coco/1999 CCC https://doi.org/10.1109/CCC.1999.766260 https://doi.ieeecomputersociety.org/10.1109/CCC.1999.766260 db/conf/coco/coco1999.html#GalHLP99

Joe Kilian Erez Petrank An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. 1-27 1998 11 J. Cryptol. 1 https://doi.org/10.1007/s001459900032 https://www.wikidata.org/entity/Q127011559 db/journals/joc/joc11.html#KilianP98

Oded Goldreich 0001 Rafail Ostrovsky Erez Petrank Computational Complexity and Knowledge Complexity. 1116-1141 1998 27 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp27.html#GoldreichOP98 https://doi.org/10.1137/S0097539795280524

Joe Kilian Erez Petrank Identity Escrow. 169-185 https://doi.org/10.1007/BFb0055727 1998 conf/crypto/1998 CRYPTO db/conf/crypto/crypto98.html#KilianP98 Joe Kilian Erez Petrank Charles Rackoff Lower Bounds for Zero Knowledge on the Internet. 484-492 1998 conf/focs/1998 FOCS https://doi.org/10.1109/SFCS.1998.743499 https://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743499 db/conf/focs/focs98.html#KilianPR98 Alain Azagury Elliot K. Kolodner Erez Petrank Zvi Yehudai Combining Card Marking with Remembered Sets: How to Save Scanning Time. 10-19 1998 conf/iwmm/1998 ISMM https://doi.org/10.1145/286860.286862 https://doi.org/10.1145/301589.286862 db/conf/iwmm/ismm98.html#AzaguryKPY98

Mihir Bellare Oded Goldreich 0001 Erez Petrank Uniform Generation of NP-witnesses using an NP-oracle. Electron. Colloquium Comput. Complex. 1998 TR98-032 TR98 db/journals/eccc/eccc5.html#ECCC-TR98-032 https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-032/index.html

Erez Petrank Ron M. Roth Is code equivalence easy to decide? 1602-1604 1997 43 IEEE Trans. Inf. Theory 5 db/journals/tit/tit43.html#PetrankR97 https://doi.org/10.1109/18.623157

Noga Alon Martin Dietzfelbinger Peter Bro Miltersen Erez Petrank Gábor Tardos Is Linear Hashing Good? 465-474 1997 conf/stoc/1997 STOC https://doi.org/10.1145/258533.258639 db/conf/stoc/stoc1997.html#AlonDMPT97 Joe Kilian Erez Petrank Gábor Tardos Probabilistically Checkable Proofs with Zero Knowledge. 496-505 1997 conf/stoc/1997 STOC https://doi.org/10.1145/258533.258643 db/conf/stoc/stoc1997.html#KilianPT97

Erez Petrank Charles Rackoff CBC MAC for Real-Time Data Sources. 10 1997 1997 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/1997/010 db/journals/iacr/iacr1997.html#PetrankR97

Joe Kilian Erez Petrank Identity Escrow. 11 1997 1997 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/1997/011 db/journals/iacr/iacr1997.html#KilianP97

Erez Petrank Gábor Tardos On the Knowledge Complexity of NP. 494-503 1996 conf/focs/1996 FOCS db/conf/focs/focs96.html#PetrankT96 https://doi.org/10.1109/SFCS.1996.548508 https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548508 Erez Petrank Knowledge complexity versus computational complexity and the hardness of approximations. Technion - Israel Institute of Technology, Israel 1995 https://technion.primo.exlibrisgroup.com/permalink/972TEC_INST/q1jq5o/alma990021643110203971

Joe Kilian Erez Petrank An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions Electron. Colloquium Comput. Complex. 1995 TR95-038 TR95 db/journals/eccc/eccc2.html#ECCC-TR95-038 https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-038/index.html

Erez Petrank The Hardness of Approximation: Gap Location. 133-157 1994 4 Comput. Complex. db/journals/cc/cc4.html#Patrank94 https://doi.org/10.1007/BF01202286

Oded Goldreich 0001 Rafail Ostrovsky Erez Petrank Computational complexity and knowledge complexity (extended abstract). 534-543 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195406 db/conf/stoc/stoc1994.html#GoldreichOP94

Oded Goldreich 0001 Rafail Ostrovsky Erez Petrank Computational Complexity and Knowledge Complexity Electron. Colloquium Comput. Complex. 1994 TR94 TR94-007 db/journals/eccc/eccc1.html#ECCC-TR94-007 https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-007/index.html

Erez Petrank The Hardness of Approximation: Gap Location. 275-284 1993 conf/istcs/1993 ISTCS db/conf/istcs/istcs1993.html#Petrank93 https://doi.org/10.1109/ISTCS.1993.253461 https://doi.ieeecomputersociety.org/10.1109/ISTCS.1993.253461 Making Zero-Knowledge Provers Efficient Mihir Bellare Erez Petrank 711-722 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#BellareP92 https://doi.org/10.1145/129712.129781 Quantifying Knowledge Complexity Oded Goldreich 0001 Erez Petrank 59-68 conf/focs/FOCS32 1991 FOCS db/conf/focs/focs91.html#GoldreichP91 https://doi.org/10.1109/SFCS.1991.185349 https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185349

Oded Goldreich 0001 Erez Petrank The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. 45-49 1990 36 Inf. Process. Lett. 1 db/journals/ipl/ipl36.html#GoldreichP90 https://doi.org/10.1016/0020-0190(90)90185-Z

Diab Abuaiadh Kunal Agrawal 0001 Marcos K. Aguilera Noga Alon Alain Azagury Hezi Azatchi David F. Bacon R. Iris Bahar Katherine Barabash Mihir Bellare Naama Ben-David Ori Ben-Yitzhak Anna Bendersky Annette Bieniusa Steve BlackburnStephen M. Blackburn Guy E. Blelloch Hans-Juergen Boehm Anastasia Braginsky Niv Buchbinder Irina Calciu Ran Canetti Keren Censor-Hillel Perry Cheng Jiwon Choe Nachshon Cohen Tzafrir Cohen Tomer Cory Benoit Daloze Martin Dietzfelbinger Tamar Domani Dana Drachsler-Cohen Avner Elizarov Haggai Eran Liza Fireman Daniel Frampton Michal Friedman 0001 Anna Gál Irit Goft Guy Golan-Gueta Oded Goldreich 0001 Gal Goldshtein Ofir Gordon Rachid Guerraoui Iftach Haitner Shai Halevi Chris Hawblitzel Maurice Herlihy Martin Hirzel Yuval Ishai Hen Kas-Sharir Jonathan Katz Haim Kermany Joe Kilian Gabriel Kliot Alex Kogan Elliot K. Kolodner Eyal Kushilevitz Itai Lahan James R. Larus Doug Lea Jaejin Lee Victor Leikehman Yossi Lev Yossi Levanoni Ethan Lewis Yehuda Lindell Richard J. Lipton Victor Luchangco Virendra J. Marathe Stefan Marr Chiara Meiohas Daniele Micciancio Peter Bro Miltersen Tali Moreshet Nurit Moscovici J. Eliot B. Moss Hanspeter Mössenböck Madan MusuvathiMadanlal Musuvathi Kobbi Nissim Yoav Ossia Rafail Ostrovsky Avi Owshanko Harel Paz Filip Pizlo Shaz Qadeer Charles Rackoff V. T. Rajan Pedro Ramalhete Dror Rawitz Ransom Richardson Alon Rosen Ron M. Roth Guy N. Rothblum Eliot E. Salant Gal Sela 0001Gal MilmanGal Milman-Sela Gali Sheffi Dafna Sheinwald Uri Silbershtein Bjarne Steensgaard Arie Tal Gábor Tardos Serdar Tasiran Samuel Thomas Shahar Timnat Sam Toueg Dan Tsafrir Elias Wald Yuanhao Wei Igor Yanover Zvi Yehudai Ayal Zaks Benjamin G. ZornBenjamin Zorn 0001 Almog Zur Yoav Zuriel