Lisa Higham

Publication Activity (10 Years)

Years Active: 1986-2016
Publications (10 Years): 4

Top Topics

Nested Transactions

Path Consistency

Top Venues

Publications

Maryam Helmi, Lisa Higham, Philipp Woelfel
Space Bounds for Adaptive Renaming. CoRR (2016)
Lisa Higham, Jalal Kawash
Pitfalls in Memory Consistency Modelling. Parallel Process. Lett. 26 (2) (2016)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
Deterministic and Fast Randomized Test-and-Set in Optimal Space. CoRR (2016)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
Test-and-Set in Optimal Space. STOC (2015)
Maryam Helmi, Lisa Higham, Philipp Woelfel
Space Bounds for Adaptive Renaming. DISC (2014)
Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations. J. ACM 61 (1) (2014)
Steven Cheng, Lisa Higham, Jalal Kawash
Partition consistency - A case study in modeling systems with weak memory consistency and proving correctness of their implementations. Distributed Comput. 27 (5) (2014)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
An O(sqrt n) Space Bound for Obstruction-Free Leader Election. DISC (2013)
Steven Cheng, Lisa Higham, Jalal Kawash
Partition Consistency: A Case Study in Modeling Systems with Weak Memory Consistency and Proving Correctness of their Implementations. CoRR (2013)
Maryam Helmi, Lisa Higham, Philipp Woelfel
Strongly linearizable implementations: possibilities and impossibilities. PODC (2012)
Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel
The space complexity of long-lived and one-shot timestamp implementations. PODC (2011)
Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel
The Space Complexity of Long-lived and One-Shot Timestamp Implementations CoRR (2011)
Wojciech M. Golab, Lisa Higham, Philipp Woelfel
Linearizable implementations do not suffice for randomized distributed computation. STOC (2011)
Wojciech M. Golab, Lisa Higham, Philipp Woelfel
Linearizable Implementations Do Not Suffice for Randomized Distributed Computation CoRR (2011)
Lisa Higham, Jalal Kawash, Abhijeet Pareek Pareek
Programmer-Centric Memory Consistency Modeling. Bull. EATCS 105 (2011)
Parthasarathy Ramanujam, Zongpeng Li, Lisa Higham
Shadow Prices vs. Vickrey Prices in Multipath Routing. INFOCOM (2009)
Colette Johnen, Lisa Higham
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. ICDCN (2009)
Adesola Omotayo, Ken Barker, Moustafa A. Hammad, Lisa Higham, Jalal Kawash
Answering Multiple-Item Queries in Data Broadcast Systems. BNCOD (2009)
Colette Johnen, Lisa Higham
Fault-tolerant implementations of atomic registers by safe registers in networks. PODC (2008)
Lisa Higham, Jalal Kawash
Implementing sequentially consistent programs on processor consistent platforms. J. Parallel Distributed Comput. 68 (4) (2008)
Colette Johnen, Lisa Higham
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. DISC (2007)
Lisa Higham, LillAnne Jackson, Jalal Kawash
Specifying memory consistency of write buffer multiprocessors. ACM Trans. Comput. Syst. 25 (1) (2007)
Lisa Higham, LillAnne Jackson, Jalal Kawash
What is Itanium Memory Consistency from the Programmer's Point of View? Electron. Notes Theor. Comput. Sci. 174 (9) (2007)
Lisa Higham, LillAnne Jackson, Jalal Kawash
Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture. DISC (2006)
Lisa Higham, LillAnne Jackson
Translating between itanium and sparc memory consistency models. SPAA (2006)
Lisa Higham, Jalal Kawash
Tight Bounds for Critical Sections in Processor Consistent Platforms. IEEE Trans. Parallel Distributed Syst. 17 (10) (2006)
Lisa Higham, LillAnne Jackson, Jalal Kawash
Programmer-Centric Conditions for Itanium Memory Consistency. ICDCN (2006)
Lisa Higham, Colette Johnen
Relationships between communication models in networks using atomic registers. IPDPS (2006)
Lisa Higham, Jalal Kawash
Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?. NPC (2005)
Lisa Higham, Jalal Kawash
Impact of Instruction Re-Ordering on the Correctness of Shared-Memory Programs. ISPAN (2005)
Lisa Higham, Lixiao Wang
Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition. PODC (2004)
Lisa Higham, Jalal Kawash
Implementing Sequentially Consistent Programs on Processor Consistent Platforms. ISPAN (2004)
Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth
Dynamic and self-stabilizing distributed matching. PODC (2002)
Lisa Higham
Report on DISC'00. SIGACT News 32 (1) (2001)
Lisa Higham, Zhiying Liang
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. DISC (2001)
Lisa Higham, Jalal Kawash
Bounds for Mutual Exclusion with only Processor Consistency. DISC (2000)
Jalal Kawash, Lisa Higham
Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement). PODC (2000)
Lisa Higham, Jalal Kawash
Memory Consistency and Process Coordination for SPARC Multiprocessors. HiPC (2000)
Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca
Meeting Times of Random Walks on Graphs. Inf. Process. Lett. 69 (5) (1999)
Lisa Higham, Teresa M. Przytycka
Asymptotically Optimal Election on Weighted Rings. SIAM J. Comput. 28 (2) (1998)
Lisa Higham, S. Myers
SelfStabilizing Token Circulation on Anonymous Message Passing. OPODIS (1998)
Lisa Higham, Jalal Kawash
Java: Memory Consistency and Process Coordination. DISC (1998)
Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC (1998)
Lisa Higham, Jalal Kawash
Critical Sections and Producer/Consumer Queues in Weak Memory Systems. ISPAN (1997)
Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. J. Algorithms 23 (2) (1997)
Lisa Higham, Teresa M. Przytycka
A Simple, Efficient Algorithm for Maximum Finding on Rings. Inf. Process. Lett. 58 (6) (1996)
Teresa M. Przytycka, Lisa Higham
Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. SWAT (1996)
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. J. ACM 41 (2) (1994)
Lisa Higham, Eric Schenk
Maintaining B-Trees on an EREW PRAM. J. Parallel Distributed Comput. 22 (2) (1994)
Lisa Higham, Teresa M. Przytycka
Asymptotically Optimal Election on Weighted Rings. SWAT (1994)
Lisa Higham, Eric Schenk
Pram Memory Allocation and Initialization. Parallel Process. Lett. 3 (1993)
Lisa Higham, Teresa M. Przytycka
A Simple, Efficient Algorithm for Maximum Finding on Rings. WDAG (1993)
Lisa Higham, Eric Schenk
The Parallel Asynchronous Recursion Model. SPDP (1992)
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
Probabilistic Leader Election on Rings of Known Size. WADS (1991)
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) (1989)
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
Randomized Function Evaluation on a Ring. Distributed Comput. 3 (3) (1989)
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
Randomized Function on a Ring (Preliminary Version). WDAG (1987)
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
Probabilistic Solitude Verification on a Ring. PODC (1986)