Erez Petrank

CoRR, 2024

Brief Announcement: Concurrent Aggregate Queries.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Distributed Computing, 2024

POSTER: RELAX: Durable Data Structures with Swift Recovery.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

The One Pass (OP) Compactor: An Intellectual Abstract.

[BibT_eX]

[DOI]

Tomer Cory

Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management, 2024

Concurrent Size (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

2023

The ERA Theorem for Safe Memory Reclamation.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Linear-Mark: Locality vs. Accuracy in Mark-Sweep Garbage Collection.

[BibT_eX]

[DOI]

Chiara Meiohas

Stephen M. Blackburn

Proceedings of the International Symposium on Memory Systems, 2023

2022

BQ: A Lock-Free Queue with Batching.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2022

Concurrent size.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

FliT: a library for simple and efficient persistent algorithms.

[BibT_eX]

[DOI]

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation.

[BibT_eX]

[DOI]

Pedro Ramalhete

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Towards Hardware Accelerated Garbage Collection with Near-Memory Processing.

[BibT_eX]

[DOI]

Proceedings of the IEEE High Performance Extreme Computing Conference, 2022

2021

Linearizability: a Typo.

[BibT_eX]

[DOI]

CoRR, 2021

VBR: Version Based Reclamation.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Durable Queues: The Second Amendment.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Brief Announcement: Linearizability: A Typo.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Mirror: making lock-free data structures persistent.

[BibT_eX]

[DOI]

Michal Friedman

Pedro Ramalhete

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

2020

Functional Faults.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

NVTraverse: in NVRAM data structures, the destination is more important than the journey.

[BibT_eX]

[DOI]

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019

Efficient lock-free durable sets.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2019

LOFT: lock-free transactional data structures.

[BibT_eX]

[DOI]

Avner Elizarov

Guy Golan-Gueta

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

2018

Parallelization of dynamic languages: synchronizing built-in collections.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2018

A persistent lock-free queue for non-volatile memory.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Reducing transaction aborts by looking to the future.

[BibT_eX]

[DOI]

James R. Larus

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Passing Messages while Sharing Memory.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

A Scalable Linearizable Multi-Index Table.

[BibT_eX]

[DOI]

Guy Golan-Gueta

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

2017

Limitations of Partial Compaction: Towards Practical Bounds.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2017

New Challenges in Parallelism (Dagstuhl Seminar 17451).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

POSTER: A GPU-Friendly Skiplist Algorithm.

[BibT_eX]

[DOI]

Nurit Moscovici

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.

[BibT_eX]

[DOI]

Arie Tal

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

POSTER: State Teleportation via Hardware Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

The Teleportation Design Pattern for Hardware Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

A GPU-Friendly Skiplist Algorithm.

[BibT_eX]

[DOI]

Nurit Moscovici

Proceedings of the 26th International Conference on Parallel Architectures and Compilation Techniques, 2017

2016

CBPQ: High Performance Lock-Free Priority Queue.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Help!

[BibT_eX]

[DOI]

Keren Censor-Hillel

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

Automatic memory reclamation for lock-free data structures.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

Data structure aware garbage collector.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGPLAN International Symposium on Memory Management, 2015

Automated and Modular Refinement Reasoning for Concurrent Programs.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014

A Practical Transactional Memory Interface.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

A practical wait-free simulation for lock-free data structures.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2014

LCD: Local Combining on Demand.

[BibT_eX]

[DOI]

Dana Drachsler-Cohen

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

Lock-Free Data-Structure Iterators.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Drop the anchor: lightweight memory management for non-blocking data structures.

[BibT_eX]

[DOI]

Alex Kogan

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

A study of data structures with a deep heap shape.

[BibT_eX]

[DOI]

Haggai Eran

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, 2013

2012

Space overhead bounds for dynamic memory management with partial compaction.

[BibT_eX]

[DOI]

Anna Bendersky

ACM Trans. Program. Lang. Syst., 2012

SIGPLAN professional activities committee report.

[BibT_eX]

[DOI]

Benjamin Zorn

ACM SIGPLAN Notices, 2012

A lock-free B+tree.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

A methodology for creating fast wait-free data structures.

[BibT_eX]

[DOI]

Alex Kogan

Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

Can parallel data structures rely on automatic memory managers?

[BibT_eX]

[DOI]

Proceedings of the 2012 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '12, 2012

Wait-Free Linked-Lists.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Black-Box Constructions of Protocols for Secure Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Wait-free queues with multiple enqueuers and dequeuers.

[BibT_eX]

[DOI]

Alex Kogan

Proceedings of the 16th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2011

Locality-Conscious Lock-Free Linked Lists.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

Automated Verification of Practical Garbage Collectors

[BibT_eX]

[DOI]

Chris Hawblitzel

Log. Methods Comput. Sci., 2010

Tracing garbage collection on highly parallel platforms.

[BibT_eX]

[DOI]

Katherine Barabash

Proceedings of the 9th International Symposium on Memory Management, 2010

2009

A lock-free, concurrent, and incremental stack scanning mechanism for garbage collectors.

[BibT_eX]

[DOI]

Gabriel Kliot

ACM SIGOPS Oper. Syst. Rev., 2009

A lock-free, concurrent, and incremental stack scanning for garbage collectors.

[BibT_eX]

[DOI]

Gabriel Kliot

Proceedings of the 5th International Conference on Virtual Execution Environments, 2009

Progress guarantee for parallel programs via bounded lock-freedom.

[BibT_eX]

[DOI]

Madanlal Musuvathi

Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009

2008

A study of concurrent real-time garbage collectors.

[BibT_eX]

[DOI]

Filip Pizlo

Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, 2008

Path specialization: reducing phased execution overheads.

[BibT_eX]

[DOI]

Filip Pizlo

Proceedings of the 7th International Symposium on Memory Management, 2008

2007

An efficient on-the-fly cycle collection.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2007

Stopless: a real-time garbage collector for multiprocessors.

[BibT_eX]

[DOI]

Proceedings of the 6th International Symposium on Memory Management, 2007

Using Prefetching to Improve Reference-Counting Garbage Collectors.

[BibT_eX]

[DOI]

Harel Paz

Proceedings of the Compiler Construction, 16th International Conference, 2007

New Algorithms for SIMD Alignment.

[BibT_eX]

[DOI]

Liza Fireman

Ayal Zaks

Proceedings of the Compiler Construction, 16th International Conference, 2007

2006

An on-the-fly reference-counting garbage collector for java.

[BibT_eX]

[DOI]

Yossi Levanoni

ACM Trans. Program. Lang. Syst., 2006

Lower and upper bounds on obtaining history independence.

[BibT_eX]

[DOI]

Niv Buchbinder

Inf. Comput., 2006

Integrating generations with advanced reference counting garbage collectors.

[BibT_eX]

[DOI]

Hezi Azatchi

Concurr. Comput. Pract. Exp., 2006

Black-box constructions for secure computation.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

The Compressor: concurrent, incremental, and parallel compaction.

[BibT_eX]

[DOI]

Haim Kermany

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

A parallel, incremental, mostly concurrent garbage collector for servers.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2005

The Hardness of Cache Conscious Data Placement.

[BibT_eX]

Dror Rawitz

Nord. J. Comput., 2005

Lower Bounds For Concurrent Zero Knowledge*.

[BibT_eX]

[DOI]

Charles Rackoff

Comb., 2005

Age-Oriented Concurrent Garbage Collection.

[BibT_eX]

[DOI]

Harel Paz

Stephen M. Blackburn

Proceedings of the Compiler Construction, 14th International Conference, 2005

2004

Parallel Copying Garbage Collection Using Delayed Allocation.

[BibT_eX]

[DOI]

Elliot K. Kolodner

Parallel Process. Lett., 2004

Selection from Structured Data Sets

[BibT_eX]

[DOI]

Guy N. Rothblum

Electron. Colloquium Comput. Complex., 2004

An efficient parallel heap compaction algorithm.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2004

2003

Mostly concurrent garbage collection revisited.

[BibT_eX]

[DOI]

Katherine Barabash

Yoav Ossia

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.

[BibT_eX]

[DOI]

Proceedings of the 2003 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 2003

Simulatable Commitments and Efficient Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]

Daniele Micciancio

Proceedings of the Advances in Cryptology, 2003

Extending Oblivious Transfers Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol

[BibT_eX]

[DOI]

Daniele Micciancio

Electron. Colloquium Comput. Complex., 2002

On the Knowledge Complexity of <i>NP</i>.

[BibT_eX]

[DOI]

Comb., 2002

Thread-local heaps for Java.

[BibT_eX]

[DOI]

Proceedings of The Workshop on Memory Systems Performance (MSP 2002), 2002

2001

Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

On Concurrent and Resettable Zero-Knowledge Proofs for NP

[BibT_eX]

[DOI]

Ransom Richardson

CoRR, 2001

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Responsive Round Complexity and Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]

Tzafrir Cohen

Proceedings of the Advances in Cryptology, 2001

2000

CBC MAC for Real-Time Data Sources.

[BibT_eX]

[DOI]

Charles Rackoff

J. Cryptol., 2000

Concurrent Zero-Knowledge in Poly-logarithmic Rounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2000

A generational on-the-fly garbage collector for Java.

[BibT_eX]

[DOI]

Tamar Domani

Elliot K. Kolodner

Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2000

Implementing an On-the-Fly Garbage Collector for Java.

[BibT_eX]

[DOI]

Proceedings of the ISMM 2000, 2000

1999

A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments.

[BibT_eX]

[DOI]

Alain Azagury

Elliot K. Kolodner

Parallel Process. Lett., 1999

Linear Hash Functions.

[BibT_eX]

[DOI]

Noga Alon

Martin Dietzfelbinger

Peter Bro Miltersen

J. ACM, 1999

Quantifying Knowledge Complexity.

[BibT_eX]

[DOI]

Comput. Complex., 1999

Computing from Partial Solutions.

[BibT_eX]

[DOI]

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Computational Complexity and Knowledge Complexity.

[BibT_eX]

[DOI]

Rafail Ostrovsky

SIAM J. Comput., 1998

An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions.

[BibT_eX]

[DOI]

J. Cryptol., 1998

Uniform Generation of NP-witnesses using an NP-oracle.

[BibT_eX]

[DOI]

Mihir Bellare

Electron. Colloquium Comput. Complex., 1998

Combining Card Marking with Remembered Sets: How to Save Scanning Time.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Memory Management, 1998

Lower Bounds for Zero Knowledge on the Internet.

[BibT_eX]

[DOI]

Charles Rackoff

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Is code equivalence easy to decide?

[BibT_eX]

[DOI]

Ron M. Roth

IEEE Trans. Inf. Theory, 1997

Identity Escrow.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1997

Probabilistically Checkable Proofs with Zero Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Is Linear Hashing Good?

[BibT_eX]

[DOI]

Noga Alon

Martin Dietzfelbinger

Peter Bro Miltersen

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

On the Knowledge Complexity of NP.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Knowledge complexity versus computational complexity and the hardness of approximations.

[BibT_eX]

[DOI]

PhD thesis, 1995

An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

1994

The Hardness of Approximation: Gap Location.

[BibT_eX]

[DOI]

Comput. Complex., 1994

Computational complexity and knowledge complexity (extended abstract).

[BibT_eX]

[DOI]

Rafail Ostrovsky

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1992

Making Zero-Knowledge Provers Efficient

[BibT_eX]

[DOI]

Mihir Bellare

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.

[BibT_eX]

[DOI]