The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Victor Luchangco: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum
    Hybrid transactional memory. [Citation Graph (0, 0)][DBLP]
    ASPLOS, 2006, pp:336-346 [Conf]
  2. Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir
    Formal Verification of a Lazy Concurrent List-Based Set Algorithm. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:475-488 [Conf]
  3. Victor Luchangco, Daniel Nussbaum, Nir Shavit
    A Hierarchical CLH Queue Lock. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:801-810 [Conf]
  4. Tadashi Araragi, Paul C. Attie, Idit Keidar, Kiyoshi Kogure, Victor Luchangco, Nancy A. Lynch, Ken Mano
    On Formal Modeling of Agent Computations. [Citation Graph (0, 0)][DBLP]
    FAABS, 2000, pp:48-62 [Conf]
  5. Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir
    Formal Verification of a Practical Lock-Free Queue Algorithm. [Citation Graph (0, 0)][DBLP]
    FORTE, 2004, pp:97-114 [Conf]
  6. Victor Luchangco, Ekrem Söylemez, Stephen J. Garland, Nancy A. Lynch
    Verifying timing properties of concurrent algorithms. [Citation Graph (0, 0)][DBLP]
    FORTE, 1994, pp:259-273 [Conf]
  7. Tsvetomir P. Petrov, Anna Pogosyants, Stephen J. Garland, Victor Luchangco, Nancy A. Lynch
    Computer-Assisted Verification of an Algorithm for Concurrent Timestamps. [Citation Graph (0, 0)][DBLP]
    FORTE, 1996, pp:29-44 [Conf]
  8. Maurice Herlihy, Victor Luchangco, Mark Moir
    Obstruction-Free Synchronization: Double-Ended Queues as an Example. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2003, pp:522-529 [Conf]
  9. Eric E. Allen, David Chase, Victor Luchangco, Jan-Willem Maessen, Guy L. Steele Jr.
    Object-oriented units of measurement. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2004, pp:384-403 [Conf]
  10. Maurice Herlihy, Victor Luchangco, Mark Moir
    A flexible framework for implementing software transactional memory. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2006, pp:253-262 [Conf]
  11. Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer, Nir Shavit
    A Lazy Concurrent List-Based Set Algorithm. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:3-16 [Conf]
  12. Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir
    Bringing practical lock-free synchronization to 64-bit applications. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:31-39 [Conf]
  13. Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman
    Eventually-Serializable Data Services. [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:300-309 [Conf]
  14. Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
    Dynamic-sized lock-free data structures. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:131- [Conf]
  15. Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III
    Software transactional memory for dynamic-sized data structures. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:92-101 [Conf]
  16. Eric E. Allen, J. J. Hallett, Victor Luchangco, Sukyoung Ryu, Guy L. Steele Jr.
    Modular multiple dispatch with multiple inheritance. [Citation Graph (0, 0)][DBLP]
    SAC, 2007, pp:1117-1121 [Conf]
  17. Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.
    DCAS is not a silver bullet for nonblocking algorithm design. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:216-224 [Conf]
  18. Matteo Frigo, Victor Luchangco
    Computation-Centric Memory Models. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:240-249 [Conf]
  19. Victor Luchangco
    Modeling weakly consistent memories with locks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:332-333 [Conf]
  20. Victor Luchangco, Mark Moir, Nir Shavit
    Nonblocking k-compare-single-swap. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:314-323 [Conf]
  21. Maurice Herlihy, Victor Luchangco, Mark Moir
    The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:339-353 [Conf]
  22. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Algorithms Can Be Practically Wait-Free. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:78-92 [Conf]
  23. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:493-494 [Conf]
  24. Victor Luchangco
    Precedence-Based Memory Models. [Citation Graph (0, 0)][DBLP]
    WDAG, 1997, pp:215-229 [Conf]
  25. Victor Luchangco, Mark Moir, Nir Shavit
    On the Uncontended Complexity of Consensus. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:45-59 [Conf]
  26. Maurice Herlihy, Victor Luchangco, Mark Moir
    Space and Time Adaptive Non-blocking Algorithms. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  27. Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman
    Eventually-Serializable Data Services. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:113-156 [Journal]
  28. Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
    Nonblocking memory management support for dynamic-sized data structures. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 2005, v:23, n:2, pp:146-196 [Journal]
  29. Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir
    SNZI: scalable NonZero indicators. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:13-22 [Conf]
  30. Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit
    A Simple Optimistic Skiplist Algorithm. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:124-138 [Conf]

  31. Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers. [Citation Graph (, )][DBLP]


  32. Integrating coercion with subtyping and multiple dispatch. [Citation Graph (, )][DBLP]


  33. Against lock-based semantics for transactional memory. [Citation Graph (, )][DBLP]


  34. Scalable reader-writer locks. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002