The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Erez Petrank: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  62. Path specialization: reducing phased execution overheads. [Citation Graph (, )][DBLP]


  63. Tracing garbage collection on highly parallel platforms. [Citation Graph (, )][DBLP]


  64. A study of concurrent real-time garbage collectors. [Citation Graph (, )][DBLP]


  65. Progress guarantee for parallel programs via bounded lock-freedom. [Citation Graph (, )][DBLP]


  66. Automated verification of practical garbage collectors. [Citation Graph (, )][DBLP]


  67. A lock-free, concurrent, and incremental stack scanning for garbage collectors. [Citation Graph (, )][DBLP]


  68. Automated Verification of Practical Garbage Collectors [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.460secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002