Spremljaj
Erez Petrank
Erez Petrank
Viterbi Professor of Computer Science, Technion - Israel Institute of Technology
Preverjeni e-poštni naslov na cs.technion.ac.il - Domača stran
Naslov
Navedeno
Navedeno
Leto
Extending oblivious transfers efficiently
Y Ishai, J Kilian, K Nissim, E Petrank
Annual International Cryptology Conference, 145-161, 2003
10222003
Identity escrow
J Kilian, E Petrank
Annual International Cryptology Conference, 169-185, 1998
2851998
The hardness of approximation: Gap location
E Petrank
Computational complexity 4, 133-157, 1994
2541994
CBC MAC for real-time data sources
E Petrank, C Rackoff
Journal of Cryptology 13, 315-338, 2000
2112000
Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds
R Canetti, J Kilian, E Petrank, A Rosen
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
1942001
An on-the-fly reference-counting garbage collector for java
Y Levanoni, E Petrank
ACM Transactions on Programming Languages and Systems (TOPLAS) 28 (1), 1-69, 2006
184*2006
Wait-free queues with multiple enqueuers and dequeuers
A Kogan, E Petrank
ACM SIGPLAN Notices 46 (8), 223-234, 2011
1812011
A persistent lock-free queue for non-volatile memory
M Friedman, M Herlihy, V Marathe, E Petrank
ACM SIGPLAN Notices 53 (1), 28-40, 2018
172*2018
Is code equivalence easy to decide?
E Petrank, RM Roth
IEEE Transactions on Information Theory 43 (5), 1602-1604, 1997
1721997
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
J Kilian, E Petrank
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
1702001
The hardness of cache conscious data placement
E Petrank, D Rawitz
ACM SIGPLAN Notices 37 (1), 101-112, 2002
1662002
A methodology for creating fast wait-free data structures
A Kogan, E Petrank
ACM SIGPLAN Notices 47 (8), 141-150, 2012
1612012
A lock-free B+ tree
A Braginsky, E Petrank
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
1472012
Thread-local heaps for Java
T Domani, G Goldshtein, EK Kolodner, E Lewis, E Petrank, D Sheinwald
ACM SIGPLAN Notices 38 (2 supplement), 76-87, 2002
1392002
An efficient noninteractive zero-knowledge proof system for NP with general assumptions
J Kilian, E Petrank
Journal of Cryptology 11, 1-27, 1998
1341998
Uniform generation of NP-witnesses using an NP-oracle
M Bellare, O Goldreich, E Petrank
Information and Computation 163 (2), 510-526, 2000
1322000
Lower bounds for zero knowledge on the internet
J Kilian, E Petrank, C Rackoff
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
1161998
A study of concurrent real-time garbage collectors
F Pizlo, E Petrank, B Steensgaard
ACM SIGPLAN Notices 43 (6), 33-44, 2008
1152008
The Compressor: concurrent, incremental, and parallel compaction
H Kermany, E Petrank
Proceedings of the 27th ACM SIGPLAN Conference on Programming Language …, 2006
1132006
A generational on-the-fly garbage collector for Java
T Domani, EK Kolodner, E Petrank
Proceedings of the ACM SIGPLAN 2000 conference on Programming language …, 2000
1122000
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20