Erez Petrank
Erez Petrank
Professor of Computer Science, Technion - Israel Institute of Technology
Email verificata su cs.technion.ac.il - Home page
Titolo
Citata da
Citata da
Anno
Extending oblivious transfers efficiently
Y Ishai, J Kilian, K Nissim, E Petrank
Annual International Cryptology Conference, 145-161, 2003
5712003
Identity escrow
J Kilian, E Petrank
Annual International Cryptology Conference, 169-185, 1998
2671998
The hardness of approximation: Gap location
E Petrank
Computational Complexity 4 (2), 133-157, 1994
2181994
CBC MAC for real-time data sources
E Petrank, C Rackoff
Journal of Cryptology 13 (3), 315-338, 2000
1852000
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
1762001
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
1522001
Wait-free queues with multiple enqueuers and dequeuers
A Kogan, E Petrank
ACM SIGPLAN Notices 46 (8), 223-234, 2011
1352011
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
1242002
The hardness of cache conscious data placement
E Petrank, D Rawitz
ACM SIGPLAN Notices 37 (1), 101-112, 2002
1212002
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
An efficient noninteractive zero-knowledge proof system for NP with general assumptions
J Kilian, E Petrank
Journal of Cryptology 11 (1), 1-27, 1998
1121998
A methodology for creating fast wait-free data structures
A Kogan, E Petrank
ACM SIGPLAN Notices 47 (8), 141-150, 2012
1092012
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
1091998
Is code equivalence easy to decide?
E Petrank, RM Roth
IEEE Transactions on Information Theory 43 (5), 1602-1604, 1997
1041997
An on-the-fly reference counting garbage collector for Java
Y Levanoni, E Petrank
Proceedings of the 16th ACM SIGPLAN conference on Object-oriented …, 2001
992001
A study of concurrent real-time garbage collectors
F Pizlo, E Petrank, B Steensgaard
ACM SIGPLAN Notices 43 (6), 33-44, 2008
952008
The Compressor: concurrent, incremental, and parallel compaction
H Kermany, E Petrank
Proceedings of the 27th ACM SIGPLAN Conference on Programming Language …, 2006
922006
A lock-free B+ tree
A Braginsky, E Petrank
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
902012
Implementing an on-the-fly garbage collector for Java
T Domani, EK Kolodner, E Lewis, EE Salant, K Barabash, I Lahan, ...
ACM SIGPLAN Notices 36 (1), 155-166, 2000
882000
An on-the-fly mark and sweep garbage collector based on sliding views
H Azatchi, Y Levanoni, H Paz, E Petrank
Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented …, 2003
862003
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20