The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. - Oded Goldreich 001; Erez Petrank (Inf. Process. Lett., 1990)

Making Zero-Knowledge Provers Efficient - Mihir Bellare; Erez Petrank (STOC, 1992)

Computational complexity and knowledge complexity (extended abstract). - Oded Goldreich 001; Rafail Ostrovsky; Erez Petrank (STOC, 1994)

The Hardness of Approximation: Gap Location. - Erez Petrank (Comput. Complex., 1994)

An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions - Joe Kilian; Erez Petrank (Electron. Colloquium Comput. Complex., 1995)

Knowledge complexity versus computational complexity and the hardness of approximations. - Erez Petrank (1995)

On the Knowledge Complexity of NP. - Erez Petrank; Gábor Tardos (FOCS, 1996)

Is Linear Hashing Good? - Noga Alon; Martin Dietzfelbinger; Peter Bro Miltersen; Erez Petrank; Gábor Tardos (STOC, 1997)

Probabilistically Checkable Proofs with Zero Knowledge. - Joe Kilian; Erez Petrank; Gábor Tardos (STOC, 1997)

Identity Escrow. - Joe Kilian; Erez Petrank (IACR Cryptol. ePrint Arch., 1997)

Is code equivalence easy to decide? - Erez Petrank; Ron M. Roth (IEEE Trans. Inf. Theory, 1997)

Lower Bounds for Zero Knowledge on the Internet. - Joe Kilian; Erez Petrank; Charles Rackoff (FOCS, 1998)

Combining Card Marking with Remembered Sets: How to Save Scanning Time. - Alain Azagury; Elliot K. Kolodner; Erez Petrank; Zvi Yehudai (ISMM, 1998)

Uniform Generation of NP-witnesses using an NP-oracle. - Mihir Bellare; Oded Goldreich 001; Erez Petrank (Electron. Colloquium Comput. Complex., 1998)

An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. - Joe Kilian; Erez Petrank (J. Cryptol., 1998)

Computational Complexity and Knowledge Complexity. - Oded Goldreich 001; Rafail Ostrovsky; Erez Petrank (SIAM J. Comput., 1998)

Computing from Partial Solutions. - Anna Gál; Shai Halevi; Richard J. Lipton; Erez Petrank (CCC, 1999)

Quantifying Knowledge Complexity. - Oded Goldreich 001; Erez Petrank (Comput. Complex., 1999)

Linear Hash Functions. - Noga Alon; Martin Dietzfelbinger; Peter Bro Miltersen; Erez Petrank; Gábor Tardos (J. ACM, 1999)

A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments. - Alain Azagury; Elliot K. Kolodner; Erez Petrank (Parallel Process. Lett., 1999)

Implementing an On-the-Fly Garbage Collector for Java. - Tamar Domani; Elliot K. Kolodner; Ethan Lewis; Eliot E. Salant; Katherine Barabash; Itai Lahan; Yossi Levanoni; Erez Petrank; Igor Yanover (ISMM, 2000)

A generational on-the-fly garbage collector for Java. - Tamar Domani; Elliot K. Kolodner; Erez Petrank (PLDI, 2000)

Concurrent Zero-Knowledge in Poly-logarithmic Rounds. - Joe Kilian; Erez Petrank (IACR Cryptol. ePrint Arch., 2000)

CBC MAC for Real-Time Data Sources. - Erez Petrank; Charles Rackoff (J. Cryptol., 2000)

Responsive Round Complexity and Concurrent Zero-Knowledge. - Tzafrir Cohen; Joe Kilian; Erez Petrank (ASIACRYPT, 2001)

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. - Joe Kilian; Erez Petrank (STOC, 2001)

On Concurrent and Resettable Zero-Knowledge Proofs for NP - Joe Kilian; Erez Petrank; Ransom Richardson (CoRR, 2001)

Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds - Ran Canetti; Joe Kilian; Erez Petrank; Alon Rosen (Electron. Colloquium Comput. Complex., 2001)

Thread-local heaps for Java. - Tamar Domani; Gal Goldshtein; Elliot K. Kolodner; Ethan Lewis; Erez Petrank; Dafna Sheinwald (MSP/ISMM, 2002)

On the Knowledge Complexity of NP. - Erez Petrank; Gábor Tardos (Comb., 2002)

Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol - Daniele Micciancio; Erez Petrank (Electron. Colloquium Comput. Complex., 2002)

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. - Ran Canetti; Joe Kilian; Erez Petrank; Alon Rosen (SIAM J. Comput., 2002)

Extending Oblivious Transfers Efficiently. - Yuval Ishai; Joe Kilian; Kobbi Nissim; Erez Petrank (CRYPTO, 2003)

Simulatable Commitments and Efficient Concurrent Zero-Knowledge. - Daniele Micciancio; Erez Petrank (EUROCRYPT, 2003)

An on-the-fly mark and sweep garbage collector based on sliding views. - Hezi Azatchi; Yossi Levanoni; Harel Paz; Erez Petrank (OOPSLA, 2003)

Mostly concurrent garbage collection revisited. - Katherine Barabash; Yoav Ossia; Erez Petrank (OOPSLA, 2003)

An efficient parallel heap compaction algorithm. - Diab Abuaiadh; Yoav Ossia; Erez Petrank; Uri Silbershtein (OOPSLA, 2004)

Selection from Structured Data Sets - Erez Petrank; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2004)

Parallel Copying Garbage Collection Using Delayed Allocation. - Erez Petrank; Elliot K. Kolodner (Parallel Process. Lett., 2004)

Age-Oriented Concurrent Garbage Collection. - Harel Paz; Erez Petrank; Stephen M. Blackburn (CC, 2005)

Lower Bounds For Concurrent Zero Knowledge*. - Joe Kilian; Charles Rackoff; Erez Petrank (Comb., 2005)

The Hardness of Cache Conscious Data Placement. - Erez Petrank; Dror Rawitz (Nord. J. Comput., 2005)

A parallel, incremental, mostly concurrent garbage collector for servers. - Katherine Barabash; Ori Ben-Yitzhak; Irit Goft; Elliot K. Kolodner; Victor Leikehman; Yoav Ossia; Avi Owshanko; Erez Petrank (ACM Trans. Program. Lang. Syst., 2005)

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. - Yuval Ishai; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (CRYPTO, 2006)

The Compressor: concurrent, incremental, and parallel compaction. - Haim Kermany; Erez Petrank (PLDI, 2006)

Black-box constructions for secure computation. - Yuval Ishai; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (STOC, 2006)

Integrating generations with advanced reference counting garbage collectors. - Hezi Azatchi; Erez Petrank (Concurr. Comput. Pract. Exp., 2006)

Lower and upper bounds on obtaining history independence. - Niv Buchbinder; Erez Petrank (Inf. Comput., 2006)

An on-the-fly reference-counting garbage collector for java. - Yossi Levanoni; Erez Petrank (ACM Trans. Program. Lang. Syst., 2006)

New Algorithms for SIMD Alignment. - Liza Fireman; Erez Petrank; Ayal Zaks (CC, 2007)

Using Prefetching to Improve Reference-Counting Garbage Collectors. - Harel Paz; Erez Petrank (CC, 2007)

Stopless: a real-time garbage collector for multiprocessors. - Filip Pizlo; Daniel Frampton; Erez Petrank; Bjarne Steensgaard (ISMM, 2007)

An efficient on-the-fly cycle collection. - Harel Paz; David F. Bacon; Elliot K. Kolodner; Erez Petrank; V. T. Rajan (ACM Trans. Program. Lang. Syst., 2007)

Path specialization: reducing phased execution overheads. - Filip Pizlo; Erez Petrank; Bjarne Steensgaard (ISMM, 2008)

A study of concurrent real-time garbage collectors. - Filip Pizlo; Erez Petrank; Bjarne Steensgaard (PLDI, 2008)

Progress guarantee for parallel programs via bounded lock-freedom. - Erez Petrank; Madanlal Musuvathi; Bjarne Steensgaard (PLDI, 2009)

A lock-free, concurrent, and incremental stack scanning for garbage collectors. - Gabriel Kliot; Erez Petrank; Bjarne Steensgaard (VEE, 2009)

A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors. - Gabriel Kliot; Erez Petrank; Bjarne Steensgaard (ACM SIGOPS Oper. Syst. Rev., 2009)

Tracing garbage collection on highly parallel platforms. - Katherine Barabash; Erez Petrank (ISMM, 2010)

Automated Verification of Practical Garbage Collectors - Chris Hawblitzel; Erez Petrank (Log. Methods Comput. Sci., 2010)

Locality-Conscious Lock-Free Linked Lists. - Anastasia Braginsky; Erez Petrank (ICDCN, 2011)

Wait-free queues with multiple enqueuers and dequeuers. - Alex Kogan; Erez Petrank (PPoPP, 2011)

Black-Box Constructions of Protocols for Secure Computation. - Iftach Haitner; Yuval Ishai; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (SIAM J. Comput., 2011)

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. - Yuval Ishai; Jonathan Katz; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (SIAM J. Comput., 2011)

Wait-Free Linked-Lists. - Shahar Timnat; Anastasia Braginsky; Alex Kogan; Erez Petrank (OPODIS, 2012)

Can parallel data structures rely on automatic memory managers? - Erez Petrank (MSPC, 2012)

A methodology for creating fast wait-free data structures. - Alex Kogan; Erez Petrank (PPoPP, 2012)

A lock-free B+tree. - Anastasia Braginsky; Erez Petrank (SPAA, 2012)

SIGPLAN professional activities committee report. - Erez Petrank; Benjamin Zorn 001 (ACM SIGPLAN Notices, 2012)

Space overhead bounds for dynamic memory management with partial compaction. - Anna Bendersky; Erez Petrank (ACM Trans. Program. Lang. Syst., 2012)

A study of data structures with a deep heap shape. - Haggai Eran; Erez Petrank (MSPC@PLDI, 2013)

Drop the anchor: lightweight memory management for non-blocking data structures. - Anastasia Braginsky; Alex Kogan; Erez Petrank (SPAA, 2013)

Lock-Free Data-Structure Iterators. - Erez Petrank; Shahar Timnat (DISC, 2013)

LCD: Local Combining on Demand. - Dana Drachsler-Cohen; Erez Petrank (OPODIS, 2014)

A practical wait-free simulation for lock-free data structures. - Shahar Timnat; Erez Petrank (PPoPP, 2014)

A Practical Transactional Memory Interface. - Shahar Timnat; Maurice Herlihy; Erez Petrank (DISC, 2014)

Automated and Modular Refinement Reasoning for Concurrent Programs. - Chris Hawblitzel; Erez Petrank; Shaz Qadeer; Serdar Tasiran (CAV (2), 2015)

Data structure aware garbage collector. - Nachshon Cohen; Erez Petrank (ISMM, 2015)

Automatic memory reclamation for lock-free data structures. - Nachshon Cohen; Erez Petrank (OOPSLA, 2015)

Help! - Keren Censor-Hillel; Erez Petrank; Shahar Timnat (PODC, 2015)

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. - Nachshon Cohen; Erez Petrank (SPAA, 2015)

CBPQ: High Performance Lock-Free Priority Queue. - Anastasia Braginsky; Nachshon Cohen; Erez Petrank (Euro-Par, 2016)

A GPU-Friendly Skiplist Algorithm. - Nurit Moscovici; Nachshon Cohen; Erez Petrank (PACT, 2017)

The Teleportation Design Pattern for Hardware Transactional Memory. - Nachshon Cohen; Maurice Herlihy; Erez Petrank; Elias Wald (OPODIS, 2017)

POSTER: State Teleportation via Hardware Transactional Memory. - Nachshon Cohen; Maurice Herlihy; Erez Petrank; Elias Wald (PPoPP, 2017)

Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications. - Nachshon Cohen; Arie Tal; Erez Petrank (PPoPP, 2017)

POSTER: A GPU-Friendly Skiplist Algorithm. - Nurit Moscovici; Nachshon Cohen; Erez Petrank (PPoPP, 2017)

Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory. - Michal Friedman 001; Maurice Herlihy; Virendra J. Marathe; Erez Petrank (DISC, 2017)

New Challenges in Parallelism (Dagstuhl Seminar 17451). - Annette Bieniusa; Hans-Juergen Boehm; Maurice Herlihy; Erez Petrank (Dagstuhl Reports, 2017)

Limitations of Partial Compaction: Towards Practical Bounds. - Nachshon Cohen; Erez Petrank (ACM Trans. Program. Lang. Syst., 2017)

A Scalable Linearizable Multi-Index Table. - Gali Sheffi; Guy Golan-Gueta; Erez Petrank (ICDCS, 2018)

Passing Messages while Sharing Memory. - Marcos K. Aguilera; Naama Ben-David; Irina Calciu; Rachid Guerraoui; Erez Petrank; Sam Toueg (PODC, 2018)

Reducing transaction aborts by looking to the future. - Nachshon Cohen; Erez Petrank; James R. Larus (PPoPP, 2018)

A persistent lock-free queue for non-volatile memory. - Michal Friedman 001; Maurice Herlihy; Virendra J. Marathe; Erez Petrank (PPoPP, 2018)

Parallelization of dynamic languages: synchronizing built-in collections. - Benoit Daloze; Arie Tal; Stefan Marr; Hanspeter Mössenböck; Erez Petrank (Proc. ACM Program. Lang., 2018)

LOFT: lock-free transactional data structures. - Avner Elizarov; Guy Golan-Gueta; Erez Petrank (PPoPP, 2019)

Efficient lock-free durable sets. - Yoav Zuriel; Michal Friedman 001; Gali Sheffi; Nachshon Cohen; Erez Petrank (Proc. ACM Program. Lang., 2019)

NVTraverse: in NVRAM data structures, the destination is more important than the journey. - Michal Friedman 001; Naama Ben-David; Yuanhao Wei; Guy E. Blelloch; Erez Petrank (PLDI, 2020)

Functional Faults. - Gali Sheffi; Erez Petrank (SPAA, 2020)

Mirror: making lock-free data structures persistent. - Michal Friedman 001; Erez Petrank; Pedro Ramalhete (PLDI, 2021)

Brief Announcement: Linearizability: A Typo. - Gal Sela 001; Maurice Herlihy; Erez Petrank (PODC, 2021)

Durable Queues: The Second Amendment. - Gal Sela 001; Erez Petrank (SPAA, 2021)

VBR: Version Based Reclamation. - Gali Sheffi; Maurice Herlihy; Erez Petrank (DISC, 2021)

Linearizability: a Typo. - Gal Sela 001; Maurice Herlihy; Erez Petrank (CoRR, 2021)

Towards Hardware Accelerated Garbage Collection with Near-Memory Processing. - Samuel Thomas; Jiwon Choe; Ofir Gordon; Erez Petrank; Tali Moreshet; Maurice Herlihy; R. Iris Bahar (HPEC, 2022)

EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. - Gali Sheffi; Pedro Ramalhete; Erez Petrank (OPODIS, 2022)

FliT: a library for simple and efficient persistent algorithms. - Yuanhao Wei; Naama Ben-David; Michal Friedman 001; Guy E. Blelloch; Erez Petrank (PPoPP, 2022)

Concurrent size. - Gal Sela 001; Erez Petrank (Proc. ACM Program. Lang., 2022)

BQ: A Lock-Free Queue with Batching. - Gal Milman-Sela; Alex Kogan; Yossi Lev; Victor Luchangco; Erez Petrank (ACM Trans. Parallel Comput., 2022)

Linear-Mark: Locality vs. Accuracy in Mark-Sweep Garbage Collection. - Chiara Meiohas; Stephen M. Blackburn; Erez Petrank (MEMSYS, 2023)

The ERA Theorem for Safe Memory Reclamation. - Gali Sheffi; Erez Petrank (PODC, 2023)

Concurrent Size (Abstract). - Gal Sela 001; Erez Petrank (HOPC@SPAA, 2024)

The One Pass (OP) Compactor: An Intellectual Abstract. - Tomer Cory; Erez Petrank (ISMM, 2024)

POSTER: RELAX: Durable Data Structures with Swift Recovery. - Almog Zur; Nachshon Cohen; Michal Friedman 001; Erez Petrank (PPoPP, 2024)

Brief Announcement: Concurrent Aggregate Queries. - Gal Sela 001; Erez Petrank (DISC, 2024)

Concurrent aggregate queries. - Gal Sela 001; Erez Petrank (CoRR, 2024)

A Study of Synchronization Methods for Concurrent Size. - Hen Kas-Sharir; Gal Sela 001; Erez Petrank (SPAA, 2025)