Erez Petrank

Citado por

	Total	Desde 2019
Citas	7137	2141
Índice h	48	23
Índice i10	95	49

480

240

120

360

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202424 42 60 79 113 152 176 173 191 298 231 244 253 272 236 280 276 327 349 327 346 367 380 372 379 430 466 114

Acceso público

Ver todo

7 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Hillel KolodnerSenior Technical Staff Member, IBM Research - HaifaDirección de correo verificada de il.ibm.com
Nachshon CohenAmazonDirección de correo verificada de amazon.com
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityDirección de correo verificada de cs.brown.edu
Yuval IshaiTechnionDirección de correo verificada de cs.technion.ac.il
Alex KoganResearcher, Oracle LabsDirección de correo verificada de oracle.com
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceDirección de correo verificada de weizmann.ac.il
Ran CanettiProfessor of Computer Science, Boston UniversityDirección de correo verificada de bu.edu
Alon RosenBocconi UniversityDirección de correo verificada de unibocconi.it
Katherine BarabashIBM Research - Haifa - Cloud NetworkingDirección de correo verificada de il.ibm.com
Eyal KushilevitzComputer Science Department, TechnionDirección de correo verificada de cs.technion.ac.il
Yehuda LindellCryptographer at Coinbase; Professor of Computer Science, Bar-Ilan University (on leaveDirección de correo verificada de biu.ac.il
Kobbi NissimDept. of Computer Science (Georgetown)Dirección de correo verificada de georgetown.edu
Naama Ben-DavidTechnionDirección de correo verificada de technion.ac.il
Dror RawitzProfessor of Computer Engineering, Bar-Ilan UniversityDirección de correo verificada de biu.ac.il
Martin DietzfelbingerProfessor of Computer Science, Technische Universität IlmenauDirección de correo verificada de tu-ilmenau.de
Noga AlonPrinceton University and Tel Aviv UniversityDirección de correo verificada de tau.ac.il
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityDirección de correo verificada de cs.au.dk
V. T. RajanPrincipal Data ScientistDirección de correo verificada de vtrajan.net
Rafail OstrovskyNorman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATHDirección de correo verificada de cs.ucla.edu
Keren Censor-HillelDepartment of Computer Science, TechnionDirección de correo verificada de cs.technion.ac.il

Seguir

Erez Petrank

Viterbi Professor of Computer Science, Technion - Israel Institute of Technology

Dirección de correo verificada de cs.technion.ac.il - Página principal

Concurrency Memory Management Crypto Theory of Computer Science


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Extending oblivious transfers efficiently Y Ishai, J Kilian, K Nissim, E Petrank Annual International Cryptology Conference, 145-161, 2003	930	2003
Identity escrow J Kilian, E Petrank Annual International Cryptology Conference, 169-185, 1998	292	1998
The hardness of approximation: Gap location E Petrank Computational complexity 4, 133-157, 1994	247	1994
CBC MAC for real-time data sources E Petrank, C Rackoff Journal of Cryptology 13, 315-338, 2000	209	2000
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	188	2001
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	179*	2006
Wait-free queues with multiple enqueuers and dequeuers A Kogan, E Petrank ACM SIGPLAN Notices 46 (8), 223-234, 2011	174	2011
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	168	2001
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	157*	2018
Is code equivalence easy to decide? E Petrank, RM Roth IEEE Transactions on Information Theory 43 (5), 1602-1604, 1997	156	1997
A methodology for creating fast wait-free data structures A Kogan, E Petrank ACM SIGPLAN Notices 47 (8), 141-150, 2012	147	2012
The hardness of cache conscious data placement E Petrank, D Rawitz ACM SIGPLAN Notices 37 (1), 101-112, 2002	145	2002
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	138	2002
A lock-free B+ tree A Braginsky, E Petrank Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012	130	2012
An efficient noninteractive zero-knowledge proof system for NP with general assumptions J Kilian, E Petrank Journal of Cryptology 11, 1-27, 1998	129	1998
Uniform generation of NP-witnesses using an NP-oracle M Bellare, O Goldreich, E Petrank Information and Computation 163 (2), 510-526, 2000	126	2000
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	115	2000
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	114	1998
A study of concurrent real-time garbage collectors F Pizlo, E Petrank, B Steensgaard ACM SIGPLAN Notices 43 (6), 33-44, 2008	111	2008
The Compressor: concurrent, incremental, and parallel compaction H Kermany, E Petrank Proceedings of the 27th ACM SIGPLAN Conference on Programming Language …, 2006	107	2006

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores