World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
6995
World Ranking
6607
National Ranking
104

Overview

Erez Petrank is affiliated with the Technion - Israel Institute of Technology in Israel. Their research spans the field of Computer Science, with a specific focus on multiple subfields including Computer Networks and Communications, Hardware and Architecture, Artificial Intelligence, Information Systems, and Signal Processing.

Their main research topics cover areas such as Distributed Systems and Fault Tolerance, Parallel Computing and Optimization Techniques, Advanced Data Storage Technologies, Security and Verification in Computing, Logic, Programming, and Type Systems, Real-Time Systems Scheduling, as well as Cloud Computing and Resource Management.

Recent papers authored by Erez Petrank include the following:

  • VBR: Version Based Reclamation, 2021, arXiv (Cornell University)
  • BQ: A Lock-Free Queue with Batching, 2022, ACM Transactions on Parallel Computing
  • Concurrent size, 2022, Proceedings of the ACM on Programming Languages
  • EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation, 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • FliT: A Library for Simple and Efficient Persistent Algorithms, 2021, arXiv (Cornell University)

Frequent co-authors collaborating with Erez Petrank include:

  • Gali Sheffi
  • Gal Sela
  • Yuanhao Wei
  • Naama Ben-David
  • Maurice Herlihy

Publication venues where their work appears often include:

  • arXiv (Cornell University)
  • ACM Transactions on Parallel Computing
  • Proceedings of the ACM on Programming Languages
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Proceedings of the International Symposium on Memory Systems

Best Publications

  • Extending Oblivious Transfers Efficiently

    Yuval Ishai;Joe Kilian;Kobbi Nissim;Erez Petrank

  • Identity Escrow

    Joe Kilian;Erez Petrank

  • The hardness of approximation: gap location

    Erez Petrank

  • The hardness of approximation: gap location

    E. Petrank

  • Black-box concurrent zero-knowledge requires ilde {Ω} (logn) rounds

    Ran Canetti;Joe Kilian;Erez Petrank;Alon Rosen

  • CBC MAC for Real-Time Data Sources

    Erez Petrank;Charles Rackoff

  • Is code equivalence easy to decide

    E. Petrank;R.M. Roth

  • Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

    Joe Kilian;Erez Petrank

  • Wait-free queues with multiple enqueuers and dequeuers

    Alex Kogan;Erez Petrank

  • The hardness of cache conscious data placement

    Erez Petrank;Dror Rawitz

  • Thread-local heaps for Java

    Tamar Domani;Gal Goldshtein;Elliot K. Kolodner;Ethan Lewis

  • A methodology for creating fast wait-free data structures

    Alex Kogan;Erez Petrank

  • A lock-free B+tree

    Anastasia Braginsky;Erez Petrank

  • An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions

    Joe Kilian;Erez Petrank

  • Uniform Generation of NP-Witnesses Using an NP-Oracle

    Mihir Bellare;Oded Goldreich;Erez Petrank

  • A persistent lock-free queue for non-volatile memory

    Michal Friedman;Maurice Herlihy;Virendra Marathe;Erez Petrank

  • A generational on-the-fly garbage collector for Java

    Tamar Domani;Elliot K. Kolodner;Erez Petrank

  • Lower bounds for zero knowledge on the Internet

    J. Kilian;E. Petrank;C. Rackoff

  • An on-the-fly reference counting garbage collector for Java

    Yossi Levanoni;Erez Petrank

  • The Compressor: concurrent, incremental, and parallel compaction

    Haim Kermany;Erez Petrank

  • The hardness of cache conscious data placement

    Erez Petrank;Dror Rawitz

Frequent Co-Authors

Elliot K. Kolodner
Elliot K. Kolodner IBM (United States)
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Maurice Herlihy
Maurice Herlihy Brown University
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Yehuda Lindell
Yehuda Lindell Bar-Ilan University
Eyal Kushilevitz
Eyal Kushilevitz Technion – Israel Institute of Technology
Daniele Micciancio
Daniele Micciancio University of California, San Diego
Alon Rosen
Alon Rosen Bocconi University
Ran Canetti
Ran Canetti Boston University
Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing Computer Science in the USA opens doors to a variety of academic and career options, both on-campus and online. If your goal is to align with the top degrees for the future, Computer Science remains in high demand and is highly adaptable to online study.

Many students explore graduate pathways that offer more flexibility and ease of completion. For those seeking an accelerated route, options like the easiest online masters degree may be worth considering. Such programs can reduce the time and financial investment required to advance your credentials.

Affordability and program length are crucial for working professionals. Opportunities such as the cheapest online phd make obtaining a terminal degree more accessible than ever. Meanwhile, educators looking to move into leadership may consider the fastest edd program online for a swift path to advancement.

These online pathways offer tremendous flexibility and can help you tailor your educational journey to your career goals, budget, and lifestyle.

Best Scientists Citing Erez Petrank

Trending Scientists