Lisa Higham - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

2016

Pitfalls in Memory Consistency ModellingLisa Higham, Jalal Kawash. ppl, 26(2):1-18, 2016. [doi]

2015

Test-and-Set in Optimal SpaceGeorge Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel. stoc 2015: 615-623 [doi]

2014

Partition consistency - A case study in modeling systems with weak memory consistency and proving correctness of their implementationsSteven Cheng, Lisa Higham, Jalal Kawash. dc, 27(5):363-389, 2014. [doi]

The Space Complexity of Long-Lived and One-Shot Timestamp ImplementationsMaryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel. JACM, 61(1):7, 2014. [doi]

Space Bounds for Adaptive RenamingMaryam Helmi, Lisa Higham, Philipp Woelfel. wdag 2014: 303-317 [doi]

2013

An Space Bound for Obstruction-Free Leader ElectionGeorge Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel. wdag 2013: 46-60 [doi]

2012

Strongly linearizable implementations: possibilities and impossibilitiesMaryam Helmi, Lisa Higham, Philipp Woelfel. podc 2012: 385-394 [doi]

2011

Linearizable implementations do not suffice for randomized distributed computationWojciech M. Golab, Lisa Higham, Philipp Woelfel. stoc 2011: 373-382 [doi]

The space complexity of long-lived and one-shot timestamp implementationsMaryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel. podc 2011: 139-148 [doi]

Programmer-Centric Memory Consistency ModelingLisa Higham, Jalal Kawash, Abhijeet Pareek Pareek. eatcs, 105:118-140, 2011. [doi]

2009

Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to NetworksColette Johnen, Lisa Higham. icdcn 2009: 337-348 [doi]

Answering Multiple-Item Queries in Data Broadcast SystemsAdesola Omotayo, Ken Barker, Moustafa A. Hammad, Lisa Higham, Jalal Kawash. bncod 2009: 120-132 [doi]

Shadow Prices vs. Vickrey Prices in Multipath RoutingParthasarathy Ramanujam, Zongpeng Li, Lisa Higham. infocom 2009: 2956-2960 [doi]

2008

Implementing sequentially consistent programs on processor consistent platformsLisa Higham, Jalal Kawash. jpdc, 68(4):488-500, 2008. [doi]

Fault-tolerant implementations of atomic registers by safe registers in networksColette Johnen, Lisa Higham. podc 2008: 449 [doi]

2007

Specifying memory consistency of write buffer multiprocessorsLisa Higham, LillAnne Jackson, Jalal Kawash. tocs, 25(1):1, 2007. [doi]

What is Itanium Memory Consistency from the Programmer s Point of View?Lisa Higham, LillAnne Jackson, Jalal Kawash. ENTCS, 174(9):63-84, 2007. [doi]

Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker NetworksColette Johnen, Lisa Higham. wdag 2007: 485-487 [doi]

2006

2005

Impact of Instruction Re-Ordering on the Correctness of Shared-Memory ProgramsLisa Higham, Jalal Kawash. ispan 2005: 25-32 [doi]

Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?Lisa Higham, Jalal Kawash. canpc 2005: 261-265 [doi]

2004

Brief announcement: self-stabilizing distance-d distinct labels via enriched fair compositionLisa Higham, Lixiao Wang. podc 2004: 377 [doi]

Implementing Sequentially Consistent Programs on Processor Consistent PlatformsLisa Higham, Jalal Kawash. ispan 2004: 326-331 [doi]

2002

Dynamic and self-stabilizing distributed matchingSubhendu Chattopadhyay, Lisa Higham, Karen Seyffarth. podc 2002: 290-297 [doi]

2001

Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing NetworksLisa Higham, Zhiying Liang. wdag 2001: 194-208 [doi]

Report on DISC 00Lisa Higham. sigact, 32(1):32-36, 2001. [doi]

2000

Bounds for Mutual Exclusion with only Processor ConsistencyLisa Higham, Jalal Kawash. wdag 2000: 44-58 [doi]

Memory Consistency and Process Coordination for SPARC MultiprocessorsLisa Higham, Jalal Kawash. hipc 2000: 355-366 [doi]

Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement)Jalal Kawash, Lisa Higham. podc 2000: 335 [doi]

1999

Meeting Times of Random Walks on GraphsNader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca. ipl, 69(5):259-265, 1999. [doi]

1998

Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High ThroughputWayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca. wdag 1998: 149-160 [doi]

SelfStabilizing Token Circulation on Anonymous Message PassingLisa Higham, S. Myers. opodis 1999: 115-128

Java: Memory Consistency and Process CoordinationLisa Higham, Jalal Kawash. wdag 1998: 201-215 [doi]

Asymptotically Optimal Election on Weighted RingsLisa Higham, Teresa M. Przytycka. SICOMP, 28(2):720-732, 1998.

1997

Critical Sections and Producer/Consumer Queues in Weak Memory SystemsLisa Higham, Jalal Kawash. ispan 1997: 56-63 [doi]

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous RingsLisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler. jal, 23(2):291-328, 1997.

1996

A Simple, Efficient Algorithm for Maximum Finding on RingsLisa Higham, Teresa M. Przytycka. ipl, 58(6):319-324, 1996. [doi]

Optimal Cost-Sensitive Distributed Minimum Spanning Tree AlgorithmTeresa M. Przytycka, Lisa Higham. swat 1996: 246-258

1994

Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous RingsKarl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. JACM, 41(2):277-310, 1994. [doi]

Maintaining B-Trees on an EREW PRAMLisa Higham, Eric Schenk. jpdc, 22(2):329-335, 1994.

Asymptotically Optimal Election on Weighted RingsLisa Higham, Teresa M. Przytycka. swat 1994: 207-218

1993

Pram Memory Allocation and InitializationLisa Higham, Eric Schenk. ppl, 3:291-299, 1993.

A Simple, Efficient Algorithm for Maximum Finding on RingsLisa Higham, Teresa M. Przytycka. wdag 1993: 249-263

1992

The Parallel Asynchronous Recursion ModelLisa Higham, Eric Schenk. spdp 1992: 310-316

1991

Probabilistic Leader Election on Rings of Known SizeKarl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. wads 1991: 481-495

1989

The Bit Complexity of Randomized Leader Election on a RingKarl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick. SICOMP, 18(1):12-29, 1989.

Randomized Function Evaluation on a RingKarl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. dc, 3(3):107-117, 1989.

1987

Randomized Function on a Ring (Preliminary Version)Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. wdag 1988: 324-331

1986

Probabilistic Solitude Verification on a RingKarl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. podc 1986: 161-173

Sign in or sign up to see more results.

runs on WebDSL