Petrank, Erez - Department of Computer Science, Technion, Israel Institute of Technology

• A Parallel, Incremental, Mostly Concurrent Garbage Collector for Servers
• Responsive Round Complexity and Concurrent Zero-Knowledge
• Lower and Upper Bounds on Obtaining History Independence
• The Compressor: Concurrent, Incremental, and Parallel Compaction
• Parallel Copying Garbage Collection using Delayed Allocation
• Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds
• ISMM sessions will take place in Cartler I ISMM 2006 Program
• A Generational On-the-y Garbage Collector for Java Tamar Domani Elliot K. Kolodner y Erez Petrank z
• THE HARDNESS OF APPROXIMATION : GAP LOCATION
• Making ZeroKnowledge Provers Efficient Mihir Bellare \Lambda Erez Petrank y
• CALL FOR PAPERS 2006 International Symposium on
• An on-the-y Reference Counting Garbage Collector for Java Yossi Levanoni Erez Petrank y
• On the Knowledge Complexity of NP Erez Petrank \Lambda G'abor Tardos y
• Linear Hashing Noga Alon \Lambda Martin Dietzfelbinger y Peter Bro Miltersen z Erez Petrank x
• The Hardness of Cache Conscious Data Placement Erez Petrank and Dror Rawitz
• Age-Oriented Concurrent Garbage Collection Harel Paz 1
• Mostly Concurrent Garbage Collection Revisited Katherine Barabash # Yoav Ossia + Erez Petrank #
• An OntheFly Mark and Sweep Garbage Collector Based on Sliding Views Hezi Azatchi + Yossi Levanoni # Harel Paz Erez Petrank
• ISMM 06ISMM 06 CALL FOR PAPERS
• Concurrent Zero-Knowledge Proofs for NP Joe Kilian y Erez Petrank z Ransom Richardson x
• A Note on the Implementation of ReplicationBased Garbage Collection for Multithreaded Applications
• An Efficient NonInteractive ZeroKnowledge Proof System for NP with General Assumptions
• Efficient OntheFly Cycle Collection Harel Paz # David F. Bacon + Elliot K. Kolodner # Erez Petrank V. T. Rajan
• Identity Escrow Joe Kilian \Lambda Erez Petrank y
• An Efficient Parallel Heap Compaction Algorithm Diab Abuaiadh Yoav Ossia Erez Petrank # Uri Silbershtein
• A Lock-Free, Concurrent, and Incremental Stack Scanning for Garbage Collectors
• LOWER AND UPPER BOUNDS ON OBTAINING HISTORY INDEPENDENCE \Lambda
• Lower Bounds for Concurrent Zero Knowledge Joe Kilian y Erez Petrank z Charles Rackoff x
• Using Prefetching to Improve Reference-Counting Garbage Collectors
• An On-the-Fly Reference-Counting Garbage Collector YOSSI LEVANONI, Microsoft Corporation
• Path Specialization: Reducing Phased Execution Overheads Filip Pizlo
• Quantifying Knowledge Complexity \Lambda Oded Goldreich y Erez Petrank z
• Computational Complexity and Knowledge Complexity \Lambda Oded Goldreich y Rafail Ostrovsky z Erez Petrank x
• A Generational On-the-y Garbage Collector for Java Tamar Domani Elliot K. Kolodner y Erez Petrank z
• STOPLESS: A Real-Time Garbage Collector for Multiprocessors Filip Pizlo
• A Study of Concurrent Real-Time Garbage Collectors Filip Pizlo
• Implementing an On-the-fly Garbage Collector for Java Tamar Domani Elliot K. Kolodner
• On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
• Black-Box Constructions for Secure Computation (extended abstract)
• Wait-Free Queues With Multiple Enqueuers and Dequeuers Department of Computer Science