Erez Petrank - RankMe

159 papers A* 29A 13B 37C 10Misc 1Journal 58Unranked 10

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	A Study of Synchronization Methods for Concurrent Size. SPAA Hen Kas-Sharir, Gal Sela, Erez Petrank
2025	J	`jnl`	A Study of Synchronization Methods for Concurrent Size. CoRR Hen Kas-Sharir, Gal Sela, Erez Petrank
2024	A	`conf`	Brief Announcement: Concurrent Aggregate Queries. DISC Gal Sela, Erez Petrank
2024	—	`conf`	Concurrent Size (Abstract). HOPC@SPAA Gal Sela, Erez Petrank
2024	J	`jnl`	Concurrent aggregate queries. CoRR Gal Sela, Erez Petrank
2024	B	`conf`	POSTER: RELAX: Durable Data Structures with Swift Recovery. PPoPP Almog Zur, Nachshon Cohen, Michal Friedman, Erez Petrank
2024	B	`ed.`	Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, June 17-21, 2024 SPAA Kunal Agrawal, Erez Petrank
2024	C	`conf`	The One Pass (OP) Compactor: An Intellectual Abstract. ISMM Tomer Cory, Erez Petrank
2023	—	`conf`	Linear-Mark: Locality vs. Accuracy in Mark-Sweep Garbage Collection. MEMSYS Chiara Meiohas, Stephen M. Blackburn, Erez Petrank
2023	C	`ed.`	Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management, ISMM 2023, Orlando, FL, USA, 18 June 2023 ISMM Stephen M. Blackburn, Erez Petrank
2023	A*	`conf`	The ERA Theorem for Safe Memory Reclamation. PODC Gali Sheffi, Erez Petrank
2023	B	`conf`	The ERA Theorem for Safe Memory Reclamation. PPoPP Gali Sheffi, Erez Petrank
2022	J	`jnl`	BQ: A Lock-Free Queue with Batching. ACM Trans. Parallel Comput. Gal Milman-Sela, Alex Kogan, Yossi Lev, Victor Luchangco, Erez Petrank
2022	J	`jnl`	Concurrent Size. CoRR Gal Sela, Erez Petrank
2022	J	`jnl`	Concurrent size. Proc. ACM Program. Lang. Gal Sela, Erez Petrank
2022	B	`conf`	EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. OPODIS Gali Sheffi, Pedro Ramalhete, Erez Petrank
2022	J	`jnl`	EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. CoRR Gali Sheffi, Pedro Ramalhete, Erez Petrank
2022	B	`conf`	FliT: a library for simple and efficient persistent algorithms. PPoPP Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank
2022	J	`jnl`	The ERA Theorem for Safe Memory Reclamation. CoRR Gali Sheffi, Erez Petrank
2022	—	`conf`	Towards Hardware Accelerated Garbage Collection with Near-Memory Processing. HPEC Samuel Thomas, Jiwon Choe, Ofir Gordon, Erez Petrank, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
2021	A*	`conf`	Brief Announcement: Linearizability: A Typo. PODC Gal Sela, Maurice Herlihy, Erez Petrank
2021	B	`conf`	Durable Queues: The Second Amendment. SPAA Gal Sela, Erez Petrank
2021	J	`jnl`	Durable Queues: The Second Amendment. CoRR Gal Sela, Erez Petrank
2021	J	`jnl`	FliT: A Library for Simple and Efficient Persistent Algorithms. CoRR Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank
2021	J	`jnl`	Linearizability: a Typo. CoRR Gal Sela, Maurice Herlihy, Erez Petrank
2021	A*	`conf`	Mirror: making lock-free data structures persistent. PLDI Michal Friedman, Erez Petrank, Pedro Ramalhete
2021	B	`ed.`	PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Virtual Event, Republic of Korea, February 27- March 3, 2021 PPoPP Jaejin Lee, Erez Petrank
2021	B	`conf`	VBR: Version Based Reclamation. SPAA Gali Sheffi, Maurice Herlihy, Erez Petrank
2021	A	`conf`	VBR: Version Based Reclamation. DISC Gali Sheffi, Maurice Herlihy, Erez Petrank
2021	J	`jnl`	VBR: Version Based Reclamation. CoRR Gali Sheffi, Maurice Herlihy, Erez Petrank
2020	B	`conf`	Functional Faults. SPAA Gali Sheffi, Erez Petrank
2020	B	`conf`	Functional faults. PPoPP Gali Sheffi, Erez Petrank
2020	J	`jnl`	NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey. CoRR Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank
2020	A*	`conf`	NVTraverse: in NVRAM data structures, the destination is more important than the journey. PLDI Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank
2019	J	`jnl`	Efficient Lock-Free Durable Sets. CoRR Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank
2019	J	`jnl`	Efficient lock-free durable sets. Proc. ACM Program. Lang. Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, Erez Petrank
2019	B	`conf`	LOFT: lock-free transactional data structures. PPoPP Avner Elizarov, Guy Golan-Gueta, Erez Petrank
2018	A	`conf`	A Scalable Linearizable Multi-Index Table. ICDCS Gali Sheffi, Guy Golan-Gueta, Erez Petrank
2018	B	`conf`	A persistent lock-free queue for non-volatile memory. PPoPP Michal Friedman, Maurice Herlihy, Virendra J. Marathe, Erez Petrank
2018	B	`conf`	BQ: A Lock-Free Queue with Batching. SPAA Gal Milman, Alex Kogan, Yossi Lev, Victor Luchangco, Erez Petrank
2018	J	`jnl`	Parallelization of dynamic languages: synchronizing built-in collections. Proc. ACM Program. Lang. Benoit Daloze, Arie Tal, Stefan Marr, Hanspeter Mössenböck, Erez Petrank
2018	A*	`conf`	Passing Messages while Sharing Memory. PODC Marcos K. Aguilera, Naama Ben-David, Irina Calciu, Rachid Guerraoui, Erez Petrank, Sam Toueg
2018	B	`conf`	Reducing transaction aborts by looking to the future. PPoPP Nachshon Cohen, Erez Petrank, James R. Larus
2017	B	`conf`	A GPU-Friendly Skiplist Algorithm. PACT Nurit Moscovici, Nachshon Cohen, Erez Petrank
2017	A	`conf`	Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory. DISC Michal Friedman, Maurice Herlihy, Virendra J. Marathe, Erez Petrank
2017	B	`conf`	Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications. PPoPP Nachshon Cohen, Arie Tal, Erez Petrank
2017	J	`jnl`	Limitations of Partial Compaction: Towards Practical Bounds. ACM Trans. Program. Lang. Syst. Nachshon Cohen, Erez Petrank
2017	J	`jnl`	New Challenges in Parallelism (Dagstuhl Seminar 17451). Dagstuhl Reports Annette Bieniusa, Hans-Juergen Boehm, Maurice Herlihy, Erez Petrank
2017	B	`conf`	POSTER: A GPU-Friendly Skiplist Algorithm. PPoPP Nurit Moscovici, Nachshon Cohen, Erez Petrank
2017	B	`conf`	POSTER: State Teleportation via Hardware Transactional Memory. PPoPP Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald
2017	B	`conf`	The Teleportation Design Pattern for Hardware Transactional Memory. OPODIS Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald
2016	—	`conf`	CBPQ: High Performance Lock-Free Priority Queue. Euro-Par Anastasia Braginsky, Nachshon Cohen, Erez Petrank
2015	—	`conf`	A Practical Transactional Memory Interface. Euro-Par Shahar Timnat, Maurice Herlihy, Erez Petrank
2015	—	`conf`	Automated and Modular Refinement Reasoning for Concurrent Programs. CAV (2) Chris Hawblitzel, Erez Petrank, Shaz Qadeer, Serdar Tasiran
2015	A	`conf`	Automatic memory reclamation for lock-free data structures. OOPSLA Nachshon Cohen, Erez Petrank
2015	C	`conf`	Data structure aware garbage collector. ISMM Nachshon Cohen, Erez Petrank
2015	B	`conf`	Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. SPAA Nachshon Cohen, Erez Petrank
2015	A*	`conf`	Help! PODC Keren Censor-Hillel, Erez Petrank, Shahar Timnat
2014	B	`ed.`	10th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, VEE '14, Salt Lake City, UT, USA, March 01 - 02, 2014 VEE Martin Hirzel, Erez Petrank, Dan Tsafrir
2014	A	`conf`	A Practical Transactional Memory Interface. DISC Shahar Timnat, Maurice Herlihy, Erez Petrank
2014	B	`conf`	A practical wait-free simulation for lock-free data structures. PPoPP Shahar Timnat, Erez Petrank
2014	B	`conf`	LCD: Local Combining on Demand. OPODIS Dana Drachsler-Cohen, Erez Petrank
2013	—	`conf`	A study of data structures with a deep heap shape. MSPC@PLDI Haggai Eran, Erez Petrank
2013	B	`conf`	Drop the anchor: lightweight memory management for non-blocking data structures. SPAA Anastasia Braginsky, Alex Kogan, Erez Petrank
2013	C	`ed.`	International Symposium on Memory Management, ISMM 2013, Seattle, WA, USA, June 20, 2013 ISMM Perry Cheng, Erez Petrank
2013	A*	`conf`	Limitations of partial compaction: towards practical bounds. PLDI Nachshon Cohen, Erez Petrank
2013	A	`conf`	Lock-Free Data-Structure Iterators. DISC Erez Petrank, Shahar Timnat
2012	B	`conf`	A lock-free B+tree. SPAA Anastasia Braginsky, Erez Petrank
2012	B	`conf`	A methodology for creating fast wait-free data structures. PPoPP Alex Kogan, Erez Petrank
2012	—	`conf`	Can parallel data structures rely on automatic memory managers? MSPC Erez Petrank
2012	J	`jnl`	SIGPLAN professional activities committee report. ACM SIGPLAN Notices Erez Petrank, Benjamin Zorn
2012	J	`jnl`	Space overhead bounds for dynamic memory management with partial compaction. ACM Trans. Program. Lang. Syst. Anna Bendersky, Erez Petrank
2012	B	`conf`	Wait-Free Linked-Lists. OPODIS Shahar Timnat, Anastasia Braginsky, Alex Kogan, Erez Petrank
2012	B	`conf`	Wait-free linked-lists. PPoPP Shahar Timnat, Anastasia Braginsky, Alex Kogan, Erez Petrank
2011	J	`jnl`	Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2011	Misc	`conf`	Locality-Conscious Lock-Free Linked Lists. ICDCN Anastasia Braginsky, Erez Petrank
2011	J	`jnl`	On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. SIAM J. Comput. Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2011	B	`ed.`	Proceedings of the 7th International Conference on Virtual Execution Environments, VEE 2011, Newport Beach, CA, USA, March 9-11, 2011 (co-located with ASPLOS 2011) VEE Erez Petrank, Doug Lea
2011	A*	`conf`	Space overhead bounds for dynamic memory management with partial compaction. POPL Anna Bendersky, Erez Petrank
2011	B	`conf`	Wait-free queues with multiple enqueuers and dequeuers. PPoPP Alex Kogan, Erez Petrank
2010	J	`jnl`	Automated Verification of Practical Garbage Collectors Log. Methods Comput. Sci. Chris Hawblitzel, Erez Petrank
2010	J	`jnl`	Black-Box Constructions of Protocols for Secure Computation. IACR Cryptol. ePrint Arch. Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2010	J	`jnl`	On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2010	C	`conf`	Tracing garbage collection on highly parallel platforms. ISMM Katherine Barabash, Erez Petrank
2009	B	`conf`	A lock-free, concurrent, and incremental stack scanning for garbage collectors. VEE Gabriel Kliot, Erez Petrank, Bjarne Steensgaard
2009	J	`jnl`	A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors. ACM SIGOPS Oper. Syst. Rev. Gabriel Kliot, Erez Petrank, Bjarne Steensgaard
2009	A*	`conf`	Automated verification of practical garbage collectors. POPL Chris Hawblitzel, Erez Petrank
2009	A*	`conf`	Progress guarantee for parallel programs via bounded lock-freedom. PLDI Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard
2008	A*	`conf`	A study of concurrent real-time garbage collectors. PLDI Filip Pizlo, Erez Petrank, Bjarne Steensgaard
2008	C	`conf`	Path specialization: reducing phased execution overheads. ISMM Filip Pizlo, Erez Petrank, Bjarne Steensgaard
2007	J	`jnl`	An efficient on-the-fly cycle collection. ACM Trans. Program. Lang. Syst. Harel Paz, David F. Bacon, Elliot K. Kolodner, Erez Petrank, V. T. Rajan
2007	B	`conf`	New Algorithms for SIMD Alignment. CC Liza Fireman, Erez Petrank, Ayal Zaks
2007	C	`conf`	Stopless: a real-time garbage collector for multiprocessors. ISMM Filip Pizlo, Daniel Frampton, Erez Petrank, Bjarne Steensgaard
2007	B	`conf`	Using Prefetching to Improve Reference-Counting Garbage Collectors. CC Harel Paz, Erez Petrank
2006	J	`jnl`	An on-the-fly reference-counting garbage collector for java. ACM Trans. Program. Lang. Syst. Yossi Levanoni, Erez Petrank
2006	A*	`conf`	Black-box constructions for secure computation. STOC Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2006	J	`jnl`	Integrating generations with advanced reference counting garbage collectors. Concurr. Comput. Pract. Exp. Hezi Azatchi, Erez Petrank
2006	J	`jnl`	Lower and upper bounds on obtaining history independence. Inf. Comput. Niv Buchbinder, Erez Petrank
2006	A*	`conf`	On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2006	C	`ed.`	Proceedings of the 5th International Symposium on Memory Management, ISMM 2006, Ottawa, Ontario, Canada, June 10-11, 2006 ISMM Erez Petrank, J. Eliot B. Moss
2006	A*	`conf`	The Compressor: concurrent, incremental, and parallel compaction. PLDI Haim Kermany, Erez Petrank
2005	J	`jnl`	A parallel, incremental, mostly concurrent garbage collector for servers. ACM Trans. Program. Lang. Syst. Katherine Barabash, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, Yoav Ossia, Avi Owshanko, Erez Petrank
2005	B	`conf`	Age-Oriented Concurrent Garbage Collection. CC Harel Paz, Erez Petrank, Stephen M. Blackburn
2005	B	`conf`	An Efficient On-the-Fly Cycle Collection. CC Harel Paz, Erez Petrank, David F. Bacon, Elliot K. Kolodner, V. T. Rajan
2005	J	`jnl`	Lower Bounds For Concurrent Zero Knowledge*. Comb. Joe Kilian, Charles Rackoff, Erez Petrank
2005	J	`jnl`	The Hardness of Cache Conscious Data Placement. Nord. J. Comput. Erez Petrank, Dror Rawitz
2004	A	`conf`	An efficient parallel heap compaction algorithm. OOPSLA Diab Abuaiadh, Yoav Ossia, Erez Petrank, Uri Silbershtein
2004	J	`jnl`	Parallel Copying Garbage Collection Using Delayed Allocation. Parallel Process. Lett. Erez Petrank, Elliot K. Kolodner
2004	J	`jnl`	Selection from Structured Data Sets Electron. Colloquium Comput. Complex. Erez Petrank, Guy N. Rothblum
2003	A	`conf`	An on-the-fly mark and sweep garbage collector based on sliding views. OOPSLA Hezi Azatchi, Yossi Levanoni, Harel Paz, Erez Petrank
2003	A*	`conf`	Extending Oblivious Transfers Efficiently. CRYPTO Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank
2003	B	`conf`	Integrating Generations with Advanced Reference Counting Garbage Collectors. CC Hezi Azatchi, Erez Petrank
2003	A*	`conf`	Lower and Upper Bounds on Obtaining History Independence. CRYPTO Niv Buchbinder, Erez Petrank
2003	A	`conf`	Mostly concurrent garbage collection revisited. OOPSLA Katherine Barabash, Yoav Ossia, Erez Petrank
2003	A*	`conf`	Simulatable Commitments and Efficient Concurrent Zero-Knowledge. EUROCRYPT Daniele Micciancio, Erez Petrank
2002	J	`jnl`	Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. SIAM J. Comput. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2002	J	`jnl`	Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol Electron. Colloquium Comput. Complex. Daniele Micciancio, Erez Petrank
2002	J	`jnl`	Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol. IACR Cryptol. ePrint Arch. Daniele Micciancio, Erez Petrank
2002	J	`jnl`	On the Knowledge Complexity of Comb. Erez Petrank, Gábor Tardos
2002	A*	`conf`	The hardness of cache conscious data placement. POPL Erez Petrank, Dror Rawitz
2002	—	`conf`	Thread-local heaps for Java. MSP/ISMM Tamar Domani, Gal Goldshtein, Elliot K. Kolodner, Ethan Lewis, Erez Petrank, Dafna Sheinwald
2001	A	`conf`	An On-the-Fly Reference Counting Garbage Collector for Java. OOPSLA Yossi Levanoni, Erez Petrank
2001	J	`jnl`	Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. IACR Cryptol. ePrint Arch. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2001	J	`jnl`	Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds Electron. Colloquium Comput. Complex. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2001	A*	`conf`	Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2001	A*	`conf`	Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. STOC Joe Kilian, Erez Petrank
2001	J	`jnl`	Lower Bounds for Zero-knowledge on the Internet CoRR Joe Kilian, Erez Petrank, Charles Rackoff
2001	J	`jnl`	On Concurrent and Resettable Zero-Knowledge Proofs for NP CoRR Joe Kilian, Erez Petrank, Ransom Richardson
2001	A	`conf`	Responsive Round Complexity and Concurrent Zero-Knowledge. ASIACRYPT Tzafrir Cohen, Joe Kilian, Erez Petrank
2000	A*	`conf`	A generational on-the-fly garbage collector for Java. PLDI Tamar Domani, Elliot K. Kolodner, Erez Petrank
2000	J	`jnl`	CBC MAC for Real-Time Data Sources. J. Cryptol. Erez Petrank, Charles Rackoff
2000	J	`jnl`	Concurrent Zero-Knowledge in Poly-logarithmic Rounds. IACR Cryptol. ePrint Arch. Joe Kilian, Erez Petrank
2000	C	`conf`	Implementing an On-the-Fly Garbage Collector for Java. ISMM Tamar Domani, Elliot K. Kolodner, Ethan Lewis, Eliot E. Salant, Katherine Barabash, Itai Lahan, Yossi Levanoni, Erez Petrank, Igor Yanover
2000	J	`jnl`	Uniform Generation of NP-Witnesses Using an NP-Oracle. Inf. Comput. Mihir Bellare, Oded Goldreich, Erez Petrank
1999	J	`jnl`	A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments. Parallel Process. Lett. Alain Azagury, Elliot K. Kolodner, Erez Petrank
1999	A	`conf`	Computing from Partial Solutions. CCC Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank
1999	J	`jnl`	Linear Hash Functions. J. ACM Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
1999	J	`jnl`	Quantifying Knowledge Complexity. Comput. Complex. Oded Goldreich, Erez Petrank
1998	J	`jnl`	An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. J. Cryptol. Joe Kilian, Erez Petrank
1998	C	`conf`	Combining Card Marking with Remembered Sets: How to Save Scanning Time. ISMM Alain Azagury, Elliot K. Kolodner, Erez Petrank, Zvi Yehudai
1998	J	`jnl`	Computational Complexity and Knowledge Complexity. SIAM J. Comput. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
1998	A*	`conf`	Identity Escrow. CRYPTO Joe Kilian, Erez Petrank
1998	A*	`conf`	Lower Bounds for Zero Knowledge on the Internet. FOCS Joe Kilian, Erez Petrank, Charles Rackoff
1998	J	`jnl`	Uniform Generation of NP-witnesses using an NP-oracle. Electron. Colloquium Comput. Complex. Mihir Bellare, Oded Goldreich, Erez Petrank
1997	J	`jnl`	CBC MAC for Real-Time Data Sources. IACR Cryptol. ePrint Arch. Erez Petrank, Charles Rackoff
1997	J	`jnl`	Identity Escrow. IACR Cryptol. ePrint Arch. Joe Kilian, Erez Petrank
1997	A*	`conf`	Is Linear Hashing Good? STOC Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
1997	J	`jnl`	Is code equivalence easy to decide? IEEE Trans. Inf. Theory Erez Petrank, Ron M. Roth
1997	A*	`conf`	Probabilistically Checkable Proofs with Zero Knowledge. STOC Joe Kilian, Erez Petrank, Gábor Tardos
1996	A*	`conf`	On the Knowledge Complexity of NP. FOCS Erez Petrank, Gábor Tardos
1995	J	`jnl`	An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions Electron. Colloquium Comput. Complex. Joe Kilian, Erez Petrank
1995	—	`—`	Knowledge complexity versus computational complexity and the hardness of approximations. Erez Petrank
1994	J	`jnl`	Computational Complexity and Knowledge Complexity Electron. Colloquium Comput. Complex. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
1994	A*	`conf`	Computational complexity and knowledge complexity (extended abstract). STOC Oded Goldreich, Rafail Ostrovsky, Erez Petrank
1994	J	`jnl`	The Hardness of Approximation: Gap Location. Comput. Complex. Erez Petrank
1993	—	`conf`	The Hardness of Approximation: Gap Location. ISTCS Erez Petrank
1992	A*	`conf`	Making Zero-Knowledge Provers Efficient STOC Mihir Bellare, Erez Petrank
1991	A*	`conf`	Quantifying Knowledge Complexity FOCS Oded Goldreich, Erez Petrank
1990	J	`jnl`	The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. Inf. Process. Lett. Oded Goldreich, Erez Petrank