Victor Luchangco

Orcid: 0000-0002-1900-5755

According to our database1, Victor Luchangco authored at least 57 papers between 1994 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
BQ: A Lock-Free Queue with Batching.
ACM Trans. Parallel Comput., 2022

Theory Meets Practice in the Algorand Blockchain (Invited Talk).
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

2019
Towards a Verified Model of the Algorand Consensus Protocol in Coq.
Proceedings of the Formal Methods. FM 2019 International Workshops, 2019

2018
Saying What You Mean.
Proceedings of the 2018 Workshop on Advanced Tools, 2018

2017
Brief Announcement: Extending Transactional Memory with Atomic Deferral.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Hand-Over-Hand Transactions with Precise Memory Reclamation.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Extending Transactional Memory with Atomic Deferral.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
Investigating the Performance of Hardware Transactions on a Multi-Socket Machine.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

2014
Foreword: Parallelism in Algorithms and Architectures.
Theory Comput. Syst., 2014

Towards Transactional Memory for OpenMP.
Proceedings of the Using and Improving OpenMP for Devices, Tasks, and More, 2014

2013
Towards formally specifying and verifying transactional memory.
Formal Aspects Comput., 2013

Using hardware transactional memory to correct and simplify and readers-writer lock algorithm.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

NUMA-aware reader-writer locks.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Mindicators: A Scalable Approach to Quiescence.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

Constrained Data-Driven Parallelism.
Proceedings of the 5th USENIX Workshop on Hot Topics in Parallelism, 2013

Fine-Grained Function Visibility for Multiple Dispatch with Multiple Inheritance.
Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012
A Framework for Formally Verifying Software Transactional Memory Algorithms.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Fortress (Sun HPCS Language).
Proceedings of the Encyclopedia of Parallel Computing, 2011

Transaction communicators: enabling cooperation among concurrent transactions.
Proceedings of the 16th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2011

Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance.
Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

2010
Transactional memory, linking theory and practice.
SIGACT News, 2010

Integrating coercion with subtyping and multiple dispatch.
Sci. Comput. Program., 2010

You are not alone: breaking transaction isolation.
Proceedings of the 3rd International Workshop on Multicore Software Engineering, 2010

2009
Nonblocking <i>k</i> -Compare-Single-Swap.
Theory Comput. Syst., 2009

Scalable reader-writer locks.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
Distributed computing and the multicore revolution.
SIGACT News, 2008

Against lock-based semantics for transactional memory.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007
A Lazy Concurrent List-Based Set Algorithm.
Parallel Process. Lett., 2007

A Simple Optimistic Skiplist Algorithm.
Proceedings of the Structural Information and Communication Complexity, 2007

Modular multiple dispatch with multiple inheritance.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

SNZI: scalable NonZero indicators.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
A flexible framework for implementing software transactional memory.
Proceedings of the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

A Hierarchical CLH Queue Lock.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Formal Verification of a Lazy Concurrent List-Based Set Algorithm.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

Hybrid transactional memory.
Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems, 2006

2005
Nonblocking memory management support for dynamic-sized data structures.
ACM Trans. Comput. Syst., 2005

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Obstruction-Free Algorithms Can Be Practically Wait-Free.
Proceedings of the Distributed Computing, 19th International Conference, 2005

2004
DCAS is not a silver bullet for nonblocking algorithm design.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Bringing practical lock-free synchronization to 64-bit applications.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

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

Formal Verification of a Practical Lock-Free Queue Algorithm.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

2003
Space and Time Adaptive Non-blocking Algorithms.
Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

On the Uncontended Complexity of Consensus.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Nonblocking k-compare-single-swap.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Software transactional memory for dynamic-sized data structures.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Obstruction-Free Synchronization: Double-Ended Queues as an Example.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Dynamic-sized lock-free data structures.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Modeling weakly consistent memories with locks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000
On Formal Modeling of Agent Computations.
Proceedings of the Formal Approaches to Agent-Based Systems, First International Workshop, 2000

1999
Eventually-Serializable Data Services.
Theor. Comput. Sci., 1999

1998
Computation-Centric Memory Models.
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997
Precedence-Based Memory Models.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

1996
Computer-Assisted Verification of an Algorithm for Concurrent Timestamps.
Proceedings of the Formal Description Techniques IX: Theory, 1996

1994
Verifying timing properties of concurrent algorithms.
Proceedings of the Formal Description Techniques VII, 1994


  Loading...