2009 |
40 | EE | Colette Johnen,
Lisa Higham:
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks.
ICDCN 2009: 337-348 |
2008 |
39 | EE | Colette Johnen,
Lisa Higham:
Fault-tolerant implementations of atomic registers by safe registers in networks.
PODC 2008: 449 |
38 | EE | Lisa Higham,
Jalal Kawash:
Implementing sequentially consistent programs on processor consistent platforms.
J. Parallel Distrib. Comput. 68(4): 488-500 (2008) |
2007 |
37 | EE | Colette Johnen,
Lisa Higham:
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks.
DISC 2007: 485-487 |
36 | EE | Lisa Higham,
LillAnne Jackson,
Jalal Kawash:
Specifying memory consistency of write buffer multiprocessors.
ACM Trans. Comput. Syst. 25(1): (2007) |
35 | EE | Lisa Higham,
LillAnne Jackson,
Jalal Kawash:
What is Itanium Memory Consistency from the Programmer's Point of View?
Electr. Notes Theor. Comput. Sci. 174(9): 63-84 (2007) |
2006 |
34 | EE | Lisa Higham,
LillAnne Jackson,
Jalal Kawash:
Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture.
DISC 2006: 164-178 |
33 | EE | Lisa Higham,
LillAnne Jackson,
Jalal Kawash:
Programmer-Centric Conditions for Itanium Memory Consistency.
ICDCN 2006: 58-69 |
32 | EE | Lisa Higham,
Colette Johnen:
Relationships between communication models in networks using atomic registers.
IPDPS 2006 |
31 | EE | Lisa Higham,
LillAnne Jackson:
Translating between itanium and sparc memory consistency models.
SPAA 2006: 170-179 |
30 | EE | Lisa Higham,
Jalal Kawash:
Tight Bounds for Critical Sections in Processor Consistent Platforms.
IEEE Trans. Parallel Distrib. Syst. 17(10): 1072-1083 (2006) |
2005 |
29 | EE | Lisa Higham,
Jalal Kawash:
Impact of Instruction Re-Ordering on the Correctness of Shared-Memory Programs.
ISPAN 2005: 25-32 |
28 | EE | Lisa Higham,
Jalal Kawash:
Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?.
NPC 2005: 261-265 |
2004 |
27 | EE | Lisa Higham,
Jalal Kawash:
Implementing Sequentially Consistent Programs on Processor Consistent Platforms.
ISPAN 2004: 326-331 |
26 | EE | Lisa Higham,
Lixiao Wang:
Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition.
PODC 2004: 377 |
2002 |
25 | EE | Subhendu Chattopadhyay,
Lisa Higham,
Karen Seyffarth:
Dynamic and self-stabilizing distributed matching.
PODC 2002: 290-297 |
2001 |
24 | EE | Lisa Higham,
Zhiying Liang:
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks.
DISC 2001: 194-208 |
2000 |
23 | EE | Lisa Higham,
Jalal Kawash:
Bounds for Mutual Exclusion with only Processor Consistency.
DISC 2000: 44-58 |
22 | EE | Lisa Higham,
Jalal Kawash:
Memory Consistency and Process Coordination for SPARC Multiprocessors.
HiPC 2000: 355-366 |
21 | EE | Jalal Kawash,
Lisa Higham:
Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement).
PODC 2000: 335 |
1999 |
20 | EE | Nader H. Bshouty,
Lisa Higham,
Jolanta Warpechowska-Gruca:
Meeting Times of Random Walks on Graphs.
Inf. Process. Lett. 69(5): 259-265 (1999) |
1998 |
19 | EE | Wayne Eberly,
Lisa Higham,
Jolanta Warpechowska-Gruca:
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput.
DISC 1998: 149-160 |
18 | EE | Lisa Higham,
Jalal Kawash:
Java: Memory Consistency and Process Coordination.
DISC 1998: 201-215 |
17 | | Lisa Higham,
S. Myers:
SelfStabilizing Token Circulation on Anonymous Message Passing.
OPODIS 1998: 115-128 |
16 | | Lisa Higham,
Teresa M. Przytycka:
Asymptotically Optimal Election on Weighted Rings.
SIAM J. Comput. 28(2): 720-732 (1998) |
1997 |
15 | EE | Lisa Higham,
Jalal Kawash:
Critical Sections and Producer/Consumer Queues in Weak Memory Systems.
ISPAN 1997: 56-63 |
14 | | Lisa Higham,
David G. Kirkpatrick,
Karl R. Abrahamson,
Andrew Adler:
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings.
J. Algorithms 23(2): 291-328 (1997) |
1996 |
13 | | Teresa M. Przytycka,
Lisa Higham:
Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm.
SWAT 1996: 246-258 |
12 | EE | Lisa Higham,
Teresa M. Przytycka:
A Simple, Efficient Algorithm for Maximum Finding on Rings.
Inf. Process. Lett. 58(6): 319-324 (1996) |
1994 |
11 | | Lisa Higham,
Teresa M. Przytycka:
Asymptotically Optimal Election on Weighted Rings.
SWAT 1994: 207-218 |
10 | EE | Karl R. Abrahamson,
Andrew Adler,
Lisa Higham,
David G. Kirkpatrick:
Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings.
J. ACM 41(2): 277-310 (1994) |
9 | | Lisa Higham,
Eric Schenk:
Maintaining B-Trees on an EREW PRAM.
J. Parallel Distrib. Comput. 22(2): 329-335 (1994) |
1993 |
8 | | Lisa Higham,
Teresa M. Przytycka:
A Simple, Efficient Algorithm for Maximum Finding on Rings.
WDAG 1993: 249-263 |
7 | | Lisa Higham,
Eric Schenk:
Pram Memory Allocation and Initialization.
Parallel Processing Letters 3: 291-299 (1993) |
1992 |
6 | | Lisa Higham,
Eric Schenk:
The Parallel Asynchronous Recursion Model.
SPDP 1992: 310-316 |
1991 |
5 | | Karl R. Abrahamson,
Andrew Adler,
Lisa Higham,
David G. Kirkpatrick:
Probabilistic Leader Election on Rings of Known Size.
WADS 1991: 481-495 |
1989 |
4 | | Karl R. Abrahamson,
Andrew Adler,
Lisa Higham,
David G. Kirkpatrick:
Randomized Function Evaluation on a Ring.
Distributed Computing 3(3): 107-117 (1989) |
3 | | Karl R. Abrahamson,
Andrew Adler,
Rachel Gelbart,
Lisa Higham,
David G. Kirkpatrick:
The Bit Complexity of Randomized Leader Election on a Ring.
SIAM J. Comput. 18(1): 12-29 (1989) |
1987 |
2 | | Karl R. Abrahamson,
Andrew Adler,
Lisa Higham,
David G. Kirkpatrick:
Randomized Function on a Ring (Preliminary Version).
WDAG 1987: 324-331 |
1986 |
1 | | Karl R. Abrahamson,
Andrew Adler,
Lisa Higham,
David G. Kirkpatrick:
Probabilistic Solitude Verification on a Ring.
PODC 1986: 161-173 |