Erez Petrank

According to our database1, Erez Petrank authored at least 96 papers between 1990 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Efficient lock-free durable sets.
PACMPL, 2019

LOFT: lock-free transactional data structures.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

2018
Parallelization of dynamic languages: synchronizing built-in collections.
PACMPL, 2018

BQ: A Lock-Free Queue with Batching.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

A persistent lock-free queue for non-volatile memory.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Reducing transaction aborts by looking to the future.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Passing Messages while Sharing Memory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

A Scalable Linearizable Multi-Index Table.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

2017
Limitations of Partial Compaction: Towards Practical Bounds.
ACM Trans. Program. Lang. Syst., 2017

New Challenges in Parallelism (Dagstuhl Seminar 17451).
Dagstuhl Reports, 2017

Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

POSTER: A GPU-Friendly Skiplist Algorithm.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

Layout Lock: A Scalable Locking Paradigm for Concurrent Data Layout Modifications.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

POSTER: State Teleportation via Hardware Transactional Memory.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

The Teleportation Design Pattern for Hardware Transactional Memory.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

A GPU-Friendly Skiplist Algorithm.
Proceedings of the 26th International Conference on Parallel Architectures and Compilation Techniques, 2017

2016
CBPQ: High Performance Lock-Free Priority Queue.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Efficient Memory Management for Lock-Free Data Structures with Optimistic Access.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Help!
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Automatic memory reclamation for lock-free data structures.
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

Data structure aware garbage collector.
Proceedings of the 2015 ACM SIGPLAN International Symposium on Memory Management, 2015

A Practical Transactional Memory Interface.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

Automated and Modular Refinement Reasoning for Concurrent Programs.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
A practical wait-free simulation for lock-free data structures.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2014

LCD: Local Combining on Demand.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
Lock-Free Data-Structure Iterators.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Drop the anchor: lightweight memory management for non-blocking data structures.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

A study of data structures with a deep heap shape.
Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, 2013

2012
Space overhead bounds for dynamic memory management with partial compaction.
ACM Trans. Program. Lang. Syst., 2012

A lock-free B+tree.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

A methodology for creating fast wait-free data structures.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

Can parallel data structures rely on automatic memory managers?
Proceedings of the 2012 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '12, 2012

Wait-Free Linked-Lists.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Wait-free queues with multiple enqueuers and dequeuers.
Proceedings of the 16th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2011

Locality-Conscious Lock-Free Linked Lists.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2010

Black-Box Constructions of Protocols for Secure Computation.
IACR Cryptology ePrint Archive, 2010

Automated Verification of Practical Garbage Collectors
Logical Methods in Computer Science, 2010

Tracing garbage collection on highly parallel platforms.
Proceedings of the 9th International Symposium on Memory Management, 2010

2009
A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors.
Operating Systems Review, 2009

A lock-free, concurrent, and incremental stack scanning for garbage collectors.
Proceedings of the 5th International Conference on Virtual Execution Environments, 2009

Progress guarantee for parallel programs via bounded lock-freedom.
Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009

2008
A study of concurrent real-time garbage collectors.
Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, 2008

Path specialization: reducing phased execution overheads.
Proceedings of the 7th International Symposium on Memory Management, 2008

2007
An efficient on-the-fly cycle collection.
ACM Trans. Program. Lang. Syst., 2007

Stopless: a real-time garbage collector for multiprocessors.
Proceedings of the 6th International Symposium on Memory Management, 2007

Using Prefetching to Improve Reference-Counting Garbage Collectors.
Proceedings of the Compiler Construction, 16th International Conference, 2007

New Algorithms for SIMD Alignment.
Proceedings of the Compiler Construction, 16th International Conference, 2007

2006
An on-the-fly reference-counting garbage collector for java.
ACM Trans. Program. Lang. Syst., 2006

Lower and upper bounds on obtaining history independence.
Inf. Comput., 2006

Integrating generations with advanced reference counting garbage collectors.
Concurrency and Computation: Practice and Experience, 2006

Black-box constructions for secure computation.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

The Compressor: concurrent, incremental, and parallel compaction.
Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, 2006

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.
Proceedings of the Advances in Cryptology, 2006

2005
A parallel, incremental, mostly concurrent garbage collector for servers.
ACM Trans. Program. Lang. Syst., 2005

The Hardness of Cache Conscious Data Placement.
Nord. J. Comput., 2005

Lower Bounds For Concurrent Zero Knowledge*.
Combinatorica, 2005

Age-Oriented Concurrent Garbage Collection.
Proceedings of the Compiler Construction, 14th International Conference, 2005

2004
Parallel Copying Garbage Collection Using Delayed Allocation.
Parallel Processing Letters, 2004

Selection from Structured Data Sets
Electronic Colloquium on Computational Complexity (ECCC), 2004

An efficient parallel heap compaction algorithm.
Proceedings of the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2004

2003
Mostly concurrent garbage collection revisited.
Proceedings of the 2003 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 2003

An on-the-fly mark and sweep garbage collector based on sliding views.
Proceedings of the 2003 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 2003

Simulatable Commitments and Efficient Concurrent Zero-Knowledge.
Proceedings of the Advances in Cryptology, 2003

Extending Oblivious Transfers Efficiently.
Proceedings of the Advances in Cryptology, 2003

2002
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.
SIAM J. Comput., 2002

Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol
Electronic Colloquium on Computational Complexity (ECCC), 2002

On the Knowledge Complexity of NP.
Combinatorica, 2002

Thread-local heaps for Java.
Proceedings of The Workshop on Memory Systems Performance (MSP 2002), 2002

2001
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds
Electronic Colloquium on Computational Complexity (ECCC), 2001

On Concurrent and Resettable Zero-Knowledge Proofs for NP
CoRR, 2001

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Responsive Round Complexity and Concurrent Zero-Knowledge.
Proceedings of the Advances in Cryptology, 2001

2000
CBC MAC for Real-Time Data Sources.
J. Cryptology, 2000

Concurrent Zero-Knowledge in Poly-logarithmic Rounds.
IACR Cryptology ePrint Archive, 2000

A generational on-the-fly garbage collector for Java.
Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2000

Implementing an On-the-Fly Garbage Collector for Java.
Proceedings of the ISMM 2000, 2000

1999
A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments.
Parallel Processing Letters, 1999

Linear Hash Functions.
J. ACM, 1999

Quantifying Knowledge Complexity.
Computational Complexity, 1999

Computing from Partial Solutions.
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions.
J. Cryptology, 1998

Uniform Generation of NP-witnesses using an NP-oracle.
Electronic Colloquium on Computational Complexity (ECCC), 1998

Combining Card Marking with Remembered Sets: How to Save Scanning Time.
Proceedings of the International Symposium on Memory Management, 1998

Lower Bounds for Zero Knowledge on the Internet.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Is code equivalence easy to decide?
IEEE Trans. Information Theory, 1997

Identity Escrow.
IACR Cryptology ePrint Archive, 1997

Probabilistically Checkable Proofs with Zero Knowledge.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Is Linear Hashing Good?
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
On the Knowledge Complexity of NP.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions
Electronic Colloquium on Computational Complexity (ECCC), 1995

1994
Computational Complexity and Knowledge Complexity
Electronic Colloquium on Computational Complexity (ECCC), 1994

The Hardness of Approximation: Gap Location.
Computational Complexity, 1994

Computational complexity and knowledge complexity (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1992
Making Zero-Knowledge Provers Efficient
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1990
The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols.
Inf. Process. Lett., 1990


  Loading...