World's Best Scientists 2026 revealed!
Victor Luchangco

Victor Luchangco

D-Index & Metrics

Computer Science

D-Index
39
Citations
8179
World Ranking
9620
National Ranking
124

Overview

Victor Luchangco is affiliated with the Algorand Foundation in Singapore and has contributed extensively to the field of computer science. Their research spans multiple areas, with a strong emphasis on distributed systems, parallel computing, and related optimization techniques.

Their publication record includes work in highly specialized venues, notably publishing in the ACM Transactions on Parallel Computing. One recent paper is "BQ: A Lock-Free Queue with Batching," published in 2022 within this venue.

Frequent coauthors in their research include Maurice Herlihy, Nir Shavit, Michael Spear, Musab A. Alturki, and Jing Chen. Among these, collaborations with Maurice Herlihy, Nir Shavit, and Michael Spear are the most substantial, each with approximately 19 to 20 joint works.

Their research output covers a range of fields within computer science and intersects with business and management to a smaller extent. The primary fields of study are:

  • Computer Science
  • Business, Management and Accounting

Within computer science, their work delves deeper into subfields such as:

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Computational Theory and Mathematics
  • Artificial Intelligence

The main topics addressed in their research include:

  • Distributed systems and fault tolerance
  • Parallel Computing and Optimization Techniques
  • Real-Time Systems Scheduling
  • Optimization and Search Problems
  • Distributed and Parallel Computing Systems
  • Cloud Computing and Resource Management
  • Petri Nets in System Modeling

Victor Luchangco's contributions place them in areas that integrate systems architecture with theoretical and applied aspects of computing. Their work on fault tolerance and scheduling reflects core interests in the reliability and efficiency of complex computing systems under real-world constraints.

Best Publications

  • Software transactional memory for dynamic-sized data structures

    Maurice Herlihy;Victor Luchangco;Mark Moir;William N. Scherer

  • Obstruction-free synchronization: double-ended queues as an example

    M. Herlihy;V. Luchangco;M. Moir

  • Hybrid transactional memory

    Peter Damron;Alexandra Fedorova;Yossi Lev;Victor Luchangco

  • A flexible framework for implementing software transactional memory

    Maurice Herlihy;Victor Luchangco;Mark Moir

  • The Fortress Language Specification

    Eric Allen;David Chase;Joe Hallett;Victor Luchangco

  • A lazy concurrent list-based set algorithm

    Steve Heller;Maurice Herlihy;Victor Luchangco;Mark Moir

  • Space-and time-adaptive nonblocking algorithms

    Mark S. Moir;Victor M. Luchangco;Maurice Herlihy

  • The repeat offender problem: a mechanism for supporting dynamic-sized lock-free data structures

    Maurice Herlihy;Victor Luchangco;Mark Moir

  • The Fortress Language Specification Version 1.0

    Eric Allen;David Chase;Joe Hallett;Victor Luchangco

  • Nonblocking memory management support for dynamic-sized data structures

    Maurice Herlihy;Victor Luchangco;Paul Martin;Mark Moir

  • Formal verification of a practical lock-free queue algorithm

    Simon Doherty;Lindsay Groves;Victor Luchangco;Mark Moir

  • Eventually-serializable data services

    Alan Fekete;David Gupta;Victor Luchangco;Nancy Lynch

  • A simple optimistic skiplist algorithm

    Maurice Herlihy;Yossi Lev;Victor Luchangco;Nir Shavit

  • SNZI: scalable NonZero indicators

    Faith Ellen;Yossi Lev;Victor Luchangco;Mark Moir

  • Non-blocking memory management mechanism for supporting dynamic-sized data structures

    Mark S. Moir;Victor Luchangco;Maurice Herlihy

  • NUMA-aware reader-writer locks

    Irina Calciu;Dave Dice;Yossi Lev;Victor Luchangco

  • Anatomy of a Scalable Software Transactional Memory

    Yossi Lev;Victor Luchangco;Virendra J. Marathe;Marek Olszewski

  • Towards formally specifying and verifying transactional memory

    Simon Doherty;Lindsay Groves;Victor Luchangco;Mark Moir

  • DCAS is not a silver bullet for nonblocking algorithm design

    Simon Doherty;David L. Detlefs;Lindsay Groves;Christine H. Flood

  • Formal verification of a lazy concurrent list-based set algorithm

    Robert Colvin;Lindsay Groves;Victor Luchangco;Mark Moir

  • A Lazy Concurrent List-Based Set Algorithm

    Steve Heller;Maurice Herlihy;Victor Luchangco;Mark Moir

Frequent Co-Authors

Mark Moir
Mark Moir Oracle (US)
Maurice Herlihy
Maurice Herlihy Brown University
Guy L. Steele
Guy L. Steele Oracle (United States)
Alan Fekete
Alan Fekete University of Sydney
Tim Harris
Tim Harris Oracle (United States)
Bronis R. de Supinski
Bronis R. de Supinski Lawrence Livermore National Laboratory
Erez Petrank
Erez Petrank Technion – Israel Institute of Technology
Rajmohan Rajaraman
Rajmohan Rajaraman Northeastern University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a computer science degree in the USA opens doors to a variety of educational and career options. Many students may benefit from considering 2 year online degrees as a fast-track into the tech industry. These programs offer an efficient path to entry-level tech roles, allowing graduates to quickly join the workforce.

For those seeking advanced credentials, there are shortest master degree programs designed for swift completion, letting you upskill without years of study. Choosing one of the which master's degree is most in demand in usa options can significantly enhance your job prospects, especially in areas like data science, cybersecurity, or artificial intelligence.

If you're looking for immediate employability, you may also want to consider easy licenses and certifications to get. These certifications can supplement your degree, helping you quickly gain practical skills and boost your earning potential.

Ultimately, whether you are starting with an associate degree, pursuing a master's, or stacking quick certifications, the U.S. offers flexible online pathways to fit your career goals in computer science.

Best Scientists Citing Victor Luchangco

Trending Scientists