(See also papers ordered by area of research)

1. Katherine Barabash, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, Yoav Ossia, Avi Owshanko, and Erez Petrank. A Parallel, Incremental, Mostly Concurrent Garbage Collection for Servers. To appear in ACM Transactions on Programming Languages and Systems.
   
   
2. Harel Paz, Erez Petrank, and Stephen M. Blackburn.  Age-Oriented Concurrent Garbage Collection.  14th International Conference on Compiler Construction (CC'05), April 2005.
   
   
3. Harel Paz, David F. Bacon, Elliot K. Kolodner, Erez Petrank, and V.T. Rajan.  Complete On-the-Fly Cycle Collection.  14th International Conference on Compiler Construction (CC'05), April 2005.
   
   
4. Diab Abuaiadh, Yoav Ossia, Erez Petrank, and Uri Silbershtein.   An Efficient Parallel Heap Compaction Algorithm.  ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications  (OOPSLA'04), October 2004.
   
   
5. Erez Petrank and Elliot K. Kolodner.  Parallel Copying Garbage Collection using Delayed Allocation.   Parallel Processing Letters  Vol. 14, No. 2, June 2004.
   
   
6. Hezi Azatchi, Yossi Levanoni, Harel Paz, and Erez Petrank  An on-the-fly Mark and Sweep Garbage Collector Based on Sliding Views. Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications  (OOPSLA'03), October 2003.
   
   
7. Katherina Barabash, Yoav Ossia, and Erez Petrank.  Mostly Concurrent Garbage Collection Revisited.   Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications  (OOPSLA'03), October 2003.
   
   
8.  Niv Buchbinder and Erez Petrank.  Lower and Upper Bounds on Obtaining History Independence. An extended abstract appears in the Proceedings of the Advances in Cryptology - Crypto 2003, California, August 2003.
   
   
9. Yuval Ishai, Kobbi Nissim, Joe Kilian, and Erez Petrank. Extending Oblivious Transfers Efficiently.  Proceedings of Advances in Cryptology - Crypto 2003, California, August 2003.
   
   
10. Daniele Micciancio and Erez Petrank. Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol, Proceedings of Advances in Cryptology - EUROCRYPT 2003, Poland, May 2003.
    
    
11. Hezi Azatchi and Erez Petrank. Integrating Generations with Advanced Reference Counting Garbage Collectors.  An abridged version appears at the 12th International Conference on Compiler Construction (CC'03), April 2003.
    
    
12. Tamar Domani, Gal Goldshtein, Elliot K. Kolodner, Ethan Lewis, Erez Petrank, and Dafna Sheinwald. Thread-Local Heaps for Java.  The 2002 International Symposium on Memory Management (ISMM'02), Germany, June, 2002.
    
    
13. Erez Petrank and Dror Rawitz.  The Hardness of Cache Conscious Data Placement.  An extended abstract appears at the Proceedgins of the 29th Annual ACM Symposium on Principles of Programming Languages (POPL'02), Portland, January 16-18, 2002
    
    
14. Tzafrir Cohen, Joe Kilian, Erez Petrank.   Responsive Round Complexity and Concurrent Zero-Knowledge. ASIACRYPT, December, 2001.
    
    
15. Yossi Levanoni and Erez Petrank.  An On-the-fly Reference Counting Garbage Collector for Java. An abbreviated version appears in the proccedings of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications  (OOPSLA'01). October, 2001.   See also the Technical Report CS-0967, Dept. of Computer Science, Technion, Nov. 1999.
    
    
16. Joe Kilian, Erez Petrank, Ransom Richardson.  Concurrent Zero-Knowledge Proofs for NP.  Part of this work has appeared as: J. Kilian and E. Petrank.  Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds.  Thirty-Third Annual ACM Symposium on the Theory of Computing (STOC'01), July 6-8, 2001.
    
    
17. Ran Canetti, Joe Kilian, Erez Petrank and Alon Rosen.  Black Box Concurrent Zero-Knowledge Requires $\tilde{\Omega}(log n)$ Rounds.Thirty-Third Annual ACM Symposium on the Theory of Computing (STOC'01), July 6-8, 2001.
    
    
18. Erez Petrank and Charles Rackoff.  Message Authentication of Unknown Variable Length Data''.  Journal of Cryptology,  Vol. 13, No. 3, pp. 315-338, 2000.
    
    
19. Tamar Domani, Elliot K. Kolodner, Ethan Lewis, Elliot E. Salant, Katherine Barabash, Itai Lahan, Erez Petrank, Igor Yanover and Yossi Levanoni. Implementing an On-the-fly Garbage Collector for Java.  The 2000 International Symposium on Memory Management, October, 2000.
    
    
20. Tamar Domany, Elliot K. Kolodner, Erez Petrank. Generational On-the-fly Garbage Collector for Java. An extended abstract appears in the ACM SIGPLAN 2000 Conference on  Programming Language Design and Implementation (PLDI 2000), June, 2000.
    
    
21. Mihir Bellare, Oded Goldreich, and Erez Petrank.  Uniform Generation of NP-witnesses using an NP Oracle.  Information and Computation, Vol. 163, 2000, pp. 510-526.
    
    
22. Alain Azagury, Elliot K. Kolodner, Erez Petrank.  A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments.  Parallel Processing Letters, Vol. 9,  No. 3 pp. 391-399, 1999.
    
    
23. Anna Gal, Shai Halevi, Richard Lipton, and Erez Petrank.  Computing from Partial Solutions.   Proceedings of the 14th Annual IEEE Conference on Computational Complexity, May 1999.
    
    
24. Joe Kilian, Erez Petrank, and Charles Rackoff.  Lower Bounds for Zero Knowledge on the Internet.   39th IEEE Conference on the Foundations of Computer Science (FOCS'98), November 1998.
    
    
25. Joe Kilian and Erez Petrank.  An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions.   Journal of Cryptography, Vol. 11, Pages 1--27, 1998.
    
    
26. Alain Azagury, Elliot K. Kolodner, Erez Petrank, and Zvi Yehudai. Combining Card Marking with Remembered Sets: How to Save Scanning Time. The 1998 International Symposium on Memory Management,   October 1998.
    
    
27. Joe Kilian and Erez Petrank.  Identity Escrow .   Advances in Cryptology -- CRYPTO '98 Proceedings, Aug 1998 .     See also: Theory of Cryptography Library   -  Item 97-11 .
    
    
28. Erez Petrank and Ronny Roth.  Is Code Equivalence Easy to Decide?   IEEE Transactions on Information Theory, Vol. 43, No. 5, Sep. 1997. pp 1602-1605.
    
    
29. Joe Kilian, Erez Petrank, and Gabor Tardos.  Probabilistic Checkable Proofs with Zero Knowledge.   29th ACM Symp. on Theory of Computation, May 1997.
    
    
30. Noga Alon, Martin Dietzfelbinger, Peter B. Miltersen, Erez Petrank, and Gabor Tardos. Linear Hashing .   Journal of the ACM Vol. 46,  No. 5, September 1999.   A preliminary version has appeared in the 29th ACM Symp. on Theory of Computation, May 1997.
    
    
31. Erez Petrank and Gabor Tardos.   On the Knowledge Complexity of NP.   Combinatorica Vol. 22, No. 1, pp. 83-121, 2002.  An extended abstract appeared in the 37th IEEE Conference on the Foundations of Computer Science, October 1996, pp. 494-503.
    
    
32. Shai Halevi and Erez Petrank.  Storing Classified Files.   Manuscript, October 1995.
    
    
33. Oded Goldreich, Rafi Ostrovsky, and Erez Petrank.  Computational Complexity and Knowledge Complexity.   SIAM Journal on Computing, Volume 27, Number 4, pp.~1116--1141, August 1998. A preliminary version appeared in the Proceedings of the 26th ACM Symp. on Theory of Computation, May 1994. pp. 534-543.
    
    
34. Erez Petrank.  The Hardness of Approximations : Gap Location.   Computational Complexity, Vol. 4, 1994. pp. 133-157.   A preliminary version of this paper appeared in the Second IEEE Israel Symp. on Theory of Computation and Systems, June 1993, pp. 275-284.
    
    
35. Mihir Bellare and Erez Petrank.  Making Zero-Knowledge Provers Efficient.   24th ACM Symp. on Theory of Computation, May 1992. pp. 711-722.
    
    
36. Oded Goldreich and Erez Petrank.  Quantifying Knowledge Complexity.   Computational Complexity, Volume 8, pp.~50--98, 1999. A preliminary version appeared in the 32nd IEEE Conference on the Foundations of Computer Science, October 1991, pp. 59-68.
    
    
37. Oded Goldreich and Erez Petrank.  The Best of Both Worlds: Guaranteeing Termination in Fast Byzantine Agreement Protocols.   Information Processing Letters, Vol. 36, October 1990, pp. 45-49.

Thesis

1. Erez Petrank.  Knowledge Complexity versus Computational Complexity and the Hardness of Approximations.   D.Sc. Thesis, Computer Science Department, Technion - Israel Institute of Technology, Haifa, Israel. May 1995.
2. Erez Petrank.   Quantifying Knowledge Complexity.   M.Sc. Thesis (in Hebrew), Computer Science Department, Technion - Israel Institute of Technology, Haifa, Israel. December 1991.

Back to Erez's home page.