Erez Petrank

	2009
68		Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard: Progress guarantee for parallel programs via bounded lock-freedom. PLDI 2009: 144-154
67		Chris Hawblitzel, Erez Petrank: Automated verification of practical garbage collectors. POPL 2009: 441-453
66		Gabriel Kliot, Erez Petrank, Bjarne Steensgaard: A lock-free, concurrent, and incremental stack scanning for garbage collectors. VEE 2009: 11-20
	2008
65		Filip Pizlo, Erez Petrank, Bjarne Steensgaard: Path specialization: reducing phased execution overheads. ISMM 2008: 81-90
64		Filip Pizlo, Erez Petrank, Bjarne Steensgaard: A study of concurrent real-time garbage collectors. PLDI 2008: 33-44
	2007
63		Liza Fireman, Erez Petrank, Ayal Zaks: New Algorithms for SIMD Alignment. CC 2007: 1-15
62		Harel Paz, Erez Petrank: Using Prefetching to Improve Reference-Counting Garbage Collectors. CC 2007: 48-63
61		Filip Pizlo, Daniel Frampton, Erez Petrank, Bjarne Steensgaard: Stopless: a real-time garbage collector for multiprocessors. ISMM 2007: 159-172
60		Harel Paz, David F. Bacon, Elliot K. Kolodner, Erez Petrank, V. T. Rajan: An efficient on-the-fly cycle collection. ACM Trans. Program. Lang. Syst. 29(4): (2007)
	2006
59		Erez Petrank, J. Eliot B. Moss: Proceedings of the 5th International Symposium on Memory Management, ISMM 2006, Ottawa, Ontario, Canada, June 10-11, 2006 ACM 2006
58		Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO 2006: 483-500
57		Haim Kermany, Erez Petrank: The Compressor: concurrent, incremental, and parallel compaction. PLDI 2006: 354-363
56		Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-box constructions for secure computation. STOC 2006: 99-108
55		Yossi Levanoni, Erez Petrank: An on-the-fly reference-counting garbage collector for java. ACM Trans. Program. Lang. Syst. 28(1): 1-69 (2006)
54		Hezi Azatchi, Erez Petrank: Integrating generations with advanced reference counting garbage collectors. Concurrency and Computation: Practice and Experience 18(9): 959-995 (2006)
53		Niv Buchbinder, Erez Petrank: Lower and upper bounds on obtaining history independence. Inf. Comput. 204(2): 291-337 (2006)
	2005
52		Harel Paz, Erez Petrank, Stephen M. Blackburn: Age-Oriented Concurrent Garbage Collection. CC 2005: 121-136
51		Harel Paz, Erez Petrank, David F. Bacon, Elliot K. Kolodner, V. T. Rajan: An Efficient On-the-Fly Cycle Collection. CC 2005: 156-171
50		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. ACM Trans. Program. Lang. Syst. 27(6): 1097-1146 (2005)
49		Joe Kilian, Charles Rackoff, Erez Petrank: Lower Bounds For Concurrent Zero Knowledge*. Combinatorica 25(2): 217-249 (2005)
48		Erez Petrank, Dror Rawitz: The Hardness of Cache Conscious Data Placement. Nord. J. Comput. 12(3): 275-307 (2005)
	2004
47		Diab Abuaiadh, Yoav Ossia, Erez Petrank, Uri Silbershtein: An efficient parallel heap compaction algorithm. OOPSLA 2004: 224-236
46		Erez Petrank, Guy N. Rothblum: Selection from Structured Data Sets Electronic Colloquium on Computational Complexity (ECCC)(085): (2004)
45		Erez Petrank, Elliot K. Kolodner: Parallel Copying Garbage Collection Using Delayed Allocation. Parallel Processing Letters 14(2): 271-286 (2004)
	2003
44		Hezi Azatchi, Erez Petrank: Integrating Generations with Advanced Reference Counting Garbage Collectors. CC 2003: 185-199
43		Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank: Extending Oblivious Transfers Efficiently. CRYPTO 2003: 145-161
42		Niv Buchbinder, Erez Petrank: Lower and Upper Bounds on Obtaining History Independence. CRYPTO 2003: 445-462
41		Daniele Micciancio, Erez Petrank: Simulatable Commitments and Efficient Concurrent Zero-Knowledge. EUROCRYPT 2003: 140-159
40		Katherine Barabash, Yoav Ossia, Erez Petrank: Mostly concurrent garbage collection revisited. OOPSLA 2003: 255-268
39		Hezi Azatchi, Yossi Levanoni, Harel Paz, Erez Petrank: An on-the-fly mark and sweep garbage collector based on sliding views. OOPSLA 2003: 269-281
	2002
38		Tamar Domani, Gal Goldshtein, Elliot K. Kolodner, Ethan Lewis, Erez Petrank, Dafna Sheinwald: Thread-local heaps for Java. MSP/ISMM 2002: 183-194
37		Erez Petrank, Dror Rawitz: The hardness of cache conscious data placement. POPL 2002: 101-112
36		Erez Petrank, Gábor Tardos: On the Knowledge Complexity of NP. Combinatorica 22(1): 83-121 (2002)
35		Daniele Micciancio, Erez Petrank: Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol Electronic Colloquium on Computational Complexity (ECCC)(045): (2002)
34		Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. SIAM J. Comput. 32(1): 1-47 (2002)
	2001
33		Tzafrir Cohen, Joe Kilian, Erez Petrank: Responsive Round Complexity and Concurrent Zero-Knowledge. ASIACRYPT 2001: 422-441
32		Yossi Levanoni, Erez Petrank: An On-the-Fly Reference Counting Garbage Collector for Java. OOPSLA 2001: 367-380
31		Joe Kilian, Erez Petrank: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. STOC 2001: 560-569
30		Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579
29		Joe Kilian, Erez Petrank, Charles Rackoff: Lower Bounds for Zero-knowledge on the Internet CoRR cs.CR/0107003: (2001)
28		Joe Kilian, Erez Petrank, Ransom Richardson: On Concurrent and Resettable Zero-Knowledge Proofs for NP CoRR cs.CR/0107004: (2001)
27		Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds Electronic Colloquium on Computational Complexity (ECCC) 8(50): (2001)
	2000
26		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. ISMM 2000: 155-166
25		Tamar Domani, Elliot K. Kolodner, Erez Petrank: A generational on-the-fly garbage collector for Java. PLDI 2000: 274-284
24		Mihir Bellare, Oded Goldreich, Erez Petrank: Uniform Generation of NP-Witnesses Using an NP-Oracle. Inf. Comput. 163(2): 510-526 (2000)
23		Erez Petrank, Charles Rackoff: CBC MAC for Real-Time Data Sources. J. Cryptology 13(3): 315-338 (2000)
	1999
22		Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank: Computing from Partial Solutions. IEEE Conference on Computational Complexity 1999: 34-45
21		Oded Goldreich, Erez Petrank: Quantifying Knowledge Complexity. Computational Complexity 8(1): 50-98 (1999)
20		Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Linear Hash Functions. J. ACM 46(5): 667-683 (1999)
19		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 9(3): 391-399 (1999)
	1998
18		Joe Kilian, Erez Petrank: Identity Escrow. CRYPTO 1998: 169-185
17		Joe Kilian, Erez Petrank, Charles Rackoff: Lower Bounds for Zero Knowledge on the Internet. FOCS 1998: 484-492
16		Alain Azagury, Elliot K. Kolodner, Erez Petrank, Zvi Yehudai: Combining Card Marking with Remembered Sets: How to Save Scanning Time. ISMM 1998: 10-19
15		Mihir Bellare, Oded Goldreich, Erez Petrank: Uniform Generation of NP-witnesses using an NP-oracle. Electronic Colloquium on Computational Complexity (ECCC) 5(32): (1998)
14		Joe Kilian, Erez Petrank: An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. J. Cryptology 11(1): 1-27 (1998)
13		Oded Goldreich, Rafail Ostrovsky, Erez Petrank: Computational Complexity and Knowledge Complexity. SIAM J. Comput. 27(4): 1116-1141 (1998)
	1997
12		Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Is Linear Hashing Good? STOC 1997: 465-474
11		Joe Kilian, Erez Petrank, Gábor Tardos: Probabilistically Checkable Proofs with Zero Knowledge. STOC 1997: 496-505
10		Erez Petrank, Ron M. Roth: Is code equivalence easy to decide? IEEE Transactions on Information Theory 43(5): 1602-1604 (1997)
	1996
9		Erez Petrank, Gábor Tardos: On the Knowledge Complexity of NP. FOCS 1996: 494-503
	1995
8		Joe Kilian, Erez Petrank: An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions Electronic Colloquium on Computational Complexity (ECCC) 2(38): (1995)
	1994
7		Oded Goldreich, Rafail Ostrovsky, Erez Petrank: Computational complexity and knowledge complexity (extended abstract). STOC 1994: 534-543
6		Erez Petrank: The Hardness of Approximation: Gap Location. Computational Complexity 4: 133-157 (1994)
5		Oded Goldreich, Rafail Ostrovsky, Erez Petrank: Computational Complexity and Knowledge Complexity Electronic Colloquium on Computational Complexity (ECCC) 1(7): (1994)
	1993
4		Erez Petrank: The Hardness of Approximation: Gap Location. ISTCS 1993: 275-284
	1992
3		Mihir Bellare, Erez Petrank: Making Zero-Knowledge Provers Efficient STOC 1992: 711-722
	1991
2		Oded Goldreich, Erez Petrank: Quantifying Knowledge Complexity FOCS 1991: 59-68
	1990
1		Oded Goldreich, Erez Petrank: The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. Inf. Process. Lett. 36(1): 45-49 (1990)

Coauthor Index

1	Diab Abuaiadh	[47]
2	Noga Alon	[12] [20]
3	Alain Azagury	[16] [19]
4	Hezi Azatchi	[39] [44] [54]
5	David F. Bacon	[51] [60]
6	Katherine Barabash	[26] [40] [50]
7	Mihir Bellare	[3] [15] [24]
8	Ori Ben-Yitzhak	[50]
9	Stephen M. Blackburn (Stephen Blackburn)	[52]
10	Niv Buchbinder	[42] [53]
11	Ran Canetti	[27] [30] [34]
12	Tzafrir Cohen	[33]
13	Martin Dietzfelbinger	[12] [20]
14	Tamar Domani	[25] [26] [38]
15	Liza Fireman	[63]
16	Daniel Frampton	[61]
17	Anna Gál	[22]
18	Irit Goft	[50]
19	Oded Goldreich	[1] [2] [5] [7] [13] [15] [21] [24]
20	Gal Goldshtein	[38]
21	Shai Halevi	[22]
22	Chris Hawblitzel	[67]
23	Yuval Ishai	[43] [56] [58]
24	Haim Kermany	[57]
25	Joe Kilian	[8] [11] [14] [17] [18] [27] [28] [29] [30] [31] [33] [34] [43] [49]
26	Gabriel Kliot	[66]
27	Elliot K. Kolodner	[16] [19] [25] [26] [38] [45] [50] [51] [60]
28	Eyal Kushilevitz	[56] [58]
29	Itai Lahan	[26]
30	Victor Leikehman	[50]
31	Yossi Levanoni	[26] [32] [39] [55]
32	Ethan Lewis	[26] [38]
33	Yehuda Lindell (Andrew Y. Lindell)	[56] [58]
34	Richard J. Lipton	[22]
35	Daniele Micciancio	[35] [41]
36	Peter Bro Miltersen	[12] [20]
37	J. Eliot B. Moss	[59]
38	Madanlal Musuvathi	[68]
39	Kobbi Nissim	[43]
40	Yoav Ossia	[40] [47] [50]
41	Rafail Ostrovsky	[5] [7] [13]
42	Avi Owshanko	[50]
43	Harel Paz	[39] [51] [52] [60] [62]
44	Filip Pizlo	[61] [64] [65]
45	Charles Rackoff	[17] [23] [29] [49]
46	V. T. Rajan	[51] [60]
47	Dror Rawitz	[37] [48]
48	Ransom Richardson	[28]
49	Alon Rosen	[27] [30] [34]
50	Ron M. Roth	[10]
51	Guy N. Rothblum	[46]
52	Eliot E. Salant	[26]
53	Dafna Sheinwald	[38]
54	Uri Silbershtein	[47]
55	Bjarne Steensgaard	[61] [64] [65] [66] [68]
56	Gábor Tardos	[9] [11] [12] [20] [36]
57	Igor Yanover	[26]
58	Zvi Yehudai	[16]
59	Ayal Zaks	[63]

Colors in the list of coauthors