default search action
Lisa Higham
Person information
- affiliation: University of Calgary, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j17]Lisa Higham, Jalal Kawash:
Pitfalls in Memory Consistency Modelling. Parallel Process. Lett. 26(2): 1650008:1-1650008:18 (2016) - [i5]Maryam Helmi, Lisa Higham, Philipp Woelfel:
Space Bounds for Adaptive Renaming. CoRR abs/1603.04067 (2016) - [i4]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
Deterministic and Fast Randomized Test-and-Set in Optimal Space. CoRR abs/1608.06033 (2016) - 2015
- [c36]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
Test-and-Set in Optimal Space. STOC 2015: 615-623 - 2014
- [j16]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): 363-389 (2014) - [j15]Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations. J. ACM 61(1): 7:1-7:25 (2014) - [c35]Maryam Helmi, Lisa Higham, Philipp Woelfel:
Space Bounds for Adaptive Renaming. DISC 2014: 303-317 - 2013
- [c34]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
An O(sqrt n) Space Bound for Obstruction-Free Leader Election. DISC 2013: 46-60 - [i3]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 abs/1306.0077 (2013) - 2012
- [c33]Maryam Helmi, Lisa Higham, Philipp Woelfel:
Strongly linearizable implementations: possibilities and impossibilities. PODC 2012: 385-394 - 2011
- [j14]Lisa Higham, Jalal Kawash, Abhijeet Pareek Pareek:
Programmer-Centric Memory Consistency Modeling. Bull. EATCS 105: 118-140 (2011) - [c32]Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
The space complexity of long-lived and one-shot timestamp implementations. PODC 2011: 139-148 - [c31]Wojciech M. Golab, Lisa Higham, Philipp Woelfel:
Linearizable implementations do not suffice for randomized distributed computation. STOC 2011: 373-382 - [i2]Wojciech M. Golab, Lisa Higham, Philipp Woelfel:
Linearizable Implementations Do Not Suffice for Randomized Distributed Computation. CoRR abs/1103.4690 (2011) - [i1]Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
The Space Complexity of Long-lived and One-Shot Timestamp Implementations. CoRR abs/1103.5794 (2011)
2000 – 2009
- 2009
- [c30]Adesola Omotayo, Ken Barker, Moustafa A. Hammad, Lisa Higham, Jalal Kawash:
Answering Multiple-Item Queries in Data Broadcast Systems. BNCOD 2009: 120-132 - [c29]Colette Johnen, Lisa Higham:
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. ICDCN 2009: 337-348 - [c28]Parthasarathy Ramanujam, Zongpeng Li, Lisa Higham:
Shadow Prices vs. Vickrey Prices in Multipath Routing. INFOCOM 2009: 2956-2960 - 2008
- [j13]Lisa Higham, Jalal Kawash:
Implementing sequentially consistent programs on processor consistent platforms. J. Parallel Distributed Comput. 68(4): 488-500 (2008) - [c27]Colette Johnen, Lisa Higham:
Fault-tolerant implementations of atomic registers by safe registers in networks. PODC 2008: 449 - 2007
- [j12]Lisa Higham, LillAnne Jackson, Jalal Kawash:
Specifying memory consistency of write buffer multiprocessors. ACM Trans. Comput. Syst. 25(1): 1 (2007) - [c26]Colette Johnen, Lisa Higham:
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. DISC 2007: 485-487 - 2006
- [j11]Lisa Higham, Jalal Kawash:
Tight Bounds for Critical Sections in Processor Consistent Platforms. IEEE Trans. Parallel Distributed Syst. 17(10): 1072-1083 (2006) - [c25]Lisa Higham, LillAnne Jackson, Jalal Kawash:
Programmer-Centric Conditions for Itanium Memory Consistency. ICDCN 2006: 58-69 - [c24]Lisa Higham, Colette Johnen:
Relationships between communication models in networks using atomic registers. IPDPS 2006 - [c23]Lisa Higham, LillAnne Jackson:
Translating between itanium and sparc memory consistency models. SPAA 2006: 170-179 - [c22]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 - [c21]Lisa Higham, LillAnne Jackson, Jalal Kawash:
What is Itanium Memory Consistency from the Programmer's Point of View? TV@FLoC 2006: 63-84 - 2005
- [c20]Lisa Higham, Jalal Kawash:
Impact of Instruction Re-Ordering on the Correctness of Shared-Memory Programs. ISPAN 2005: 25-32 - [c19]Lisa Higham, Jalal Kawash:
Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?. NPC 2005: 261-265 - 2004
- [c18]Lisa Higham, Jalal Kawash:
Implementing Sequentially Consistent Programs on Processor Consistent Platforms. ISPAN 2004: 326-331 - [c17]Lisa Higham, Lixiao Wang:
Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition. PODC 2004: 377 - 2002
- [c16]Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth:
Dynamic and self-stabilizing distributed matching. PODC 2002: 290-297 - 2001
- [j10]Lisa Higham:
Report on DISC'00. SIGACT News 32(1): 32-36 (2001) - [c15]Lisa Higham, Zhiying Liang:
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. DISC 2001: 194-208 - 2000
- [c14]Lisa Higham, Jalal Kawash:
Memory Consistency and Process Coordination for SPARC Multiprocessors. HiPC 2000: 355-366 - [c13]Jalal Kawash, Lisa Higham:
Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement). PODC 2000: 335 - [c12]Lisa Higham, Jalal Kawash:
Bounds for Mutual Exclusion with only Processor Consistency. DISC 2000: 44-58
1990 – 1999
- 1999
- [j9]Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca:
Meeting Times of Random Walks on Graphs. Inf. Process. Lett. 69(5): 259-265 (1999) - 1998
- [j8]Lisa Higham, Teresa M. Przytycka:
Asymptotically Optimal Election on Weighted Rings. SIAM J. Comput. 28(2): 720-732 (1998) - [c11]Lisa Higham, S. Myers:
SelfStabilizing Token Circulation on Anonymous Message Passing. OPODIS 1998: 115-128 - [c10]Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca:
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC 1998: 149-160 - [c9]Lisa Higham, Jalal Kawash:
Java: Memory Consistency and Process Coordination. DISC 1998: 201-215 - 1997
- [j7]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) - [c8]Lisa Higham, Jalal Kawash:
Critical Sections and Producer/Consumer Queues in Weak Memory Systems. ISPAN 1997: 56-63 - 1996
- [j6]Lisa Higham, Teresa M. Przytycka:
A Simple, Efficient Algorithm for Maximum Finding on Rings. Inf. Process. Lett. 58(6): 319-324 (1996) - [c7]Teresa M. Przytycka, Lisa Higham:
Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. SWAT 1996: 246-258 - 1994
- [j5]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) - [j4]Lisa Higham, Eric Schenk:
Maintaining B-Trees on an EREW PRAM. J. Parallel Distributed Comput. 22(2): 329-335 (1994) - [c6]Lisa Higham, Teresa M. Przytycka:
Asymptotically Optimal Election on Weighted Rings. SWAT 1994: 207-218 - 1993
- [j3]Lisa Higham, Eric Schenk:
Pram Memory Allocation and Initialization. Parallel Process. Lett. 3: 291-299 (1993) - [c5]Lisa Higham, Teresa M. Przytycka:
A Simple, Efficient Algorithm for Maximum Finding on Rings. WDAG 1993: 249-263 - 1992
- [c4]Lisa Higham, Eric Schenk:
The Parallel Asynchronous Recursion Model. SPDP 1992: 310-316 - 1991
- [c3]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Probabilistic Leader Election on Rings of Known Size. WADS 1991: 481-495
1980 – 1989
- 1989
- [j2]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Randomized Function Evaluation on a Ring. Distributed Comput. 3(3): 107-117 (1989) - [j1]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
- [c2]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Randomized Function on a Ring (Preliminary Version). WDAG 1987: 324-331 - 1986
- [c1]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Probabilistic Solitude Verification on a Ring. PODC 1986: 161-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: