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