Lisa Higham

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Optimal cost-sensitive distributed minimum spanning tree algorithm	2022-12-09	Paper
Asymptotically optimal election on weighted rings	2022-12-09	Paper
Pitfalls in Memory Consistency Modelling	2017-12-15	Paper
Meeting times of random walks on graphs	2016-06-16	Paper
The space complexity of long-lived and one-shot timestamp implementations	2015-09-11	Paper
Test-and-Set in Optimal Space	2015-08-21	Paper
Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations	2015-02-23	Paper
Strongly linearizable implementations	2014-12-05	Paper
The space complexity of long-lived and one-shot timestamp implementations	2014-09-12	Paper
Dynamic and self-stabilizing distributed matching	2014-07-25	Paper
Linearizable implementations do not suffice for randomized distributed computation	2014-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4904148	2013-01-28	Paper
Implementing sequentially consistent programs on processor consistent platforms	2012-07-26	Paper
Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture	2008-09-09	Paper
Dynamics of a piecewise linear map with a gap	2008-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4436052	2003-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q2766860	2002-01-28	Paper
Maintaining \(B\)-trees on an EREW PRAM	2000-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q4250793	1999-06-17	Paper
Asymptotically Optimal Election on Weighted Rings	1998-09-21	Paper
A simple, efficient algorithm for maximum finding on rings	1997-02-27	Paper

Research outcomes over time

This page was built for person: Lisa Higham