Lisa Higham

Affiliations:
  • University of Calgary, Canada


According to our database1, Lisa Higham authored at least 50 papers between 1986 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Pitfalls in Memory Consistency Modelling.
Parallel Process. Lett., 2016

Deterministic and Fast Randomized Test-and-Set in Optimal Space.
CoRR, 2016

2015
Test-and-Set in Optimal Space.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations.
J. ACM, 2014

Partition consistency - A case study in modeling systems with weak memory consistency and proving correctness of their implementations.
Distributed Comput., 2014

Space Bounds for Adaptive Renaming.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

2013
An O(sqrt n) Space Bound for Obstruction-Free Leader Election.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

2012
Strongly linearizable implementations: possibilities and impossibilities.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
Programmer-Centric Memory Consistency Modeling.
Bull. EATCS, 2011

Linearizable implementations do not suffice for randomized distributed computation.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2009
Shadow Prices vs. Vickrey Prices in Multipath Routing.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Answering Multiple-Item Queries in Data Broadcast Systems.
Proceedings of the Dataspace: The Final Frontier, 2009

2008
Implementing sequentially consistent programs on processor consistent platforms.
J. Parallel Distributed Comput., 2008

Fault-tolerant implementations of atomic registers by safe registers in networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
Specifying memory consistency of write buffer multiprocessors.
ACM Trans. Comput. Syst., 2007

Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

2006
Tight Bounds for Critical Sections in Processor Consistent Platforms.
IEEE Trans. Parallel Distributed Syst., 2006

What is Itanium Memory Consistency from the Programmer's Point of View?
Proceedings of the Thread Verification Workshop, 2006

Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Translating between itanium and sparc memory consistency models.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Relationships between communication models in networks using atomic registers.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Programmer-Centric Conditions for Itanium Memory Consistency.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?.
Proceedings of the Network and Parallel Computing, IFIP International Conference, 2005

Impact of Instruction Re-Ordering on the Correctness of Shared-Memory Programs.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

2004
Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2002
Dynamic and self-stabilizing distributed matching.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Report on DISC'00.
SIGACT News, 2001

Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks.
Proceedings of the Distributed Computing, 15th International Conference, 2001

2000
Bounds for Mutual Exclusion with only Processor Consistency.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Memory Consistency and Process Coordination for SPARC Multiprocessors.
Proceedings of the High Performance Computing, 2000

1999
Meeting Times of Random Walks on Graphs.
Inf. Process. Lett., 1999

1998
Asymptotically Optimal Election on Weighted Rings.
SIAM J. Comput., 1998

Java: Memory Consistency and Process Coordination.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

SelfStabilizing Token Circulation on Anonymous Message Passing.
Proceedings of the Distributed Computing, 1998

1997
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings.
J. Algorithms, 1997

Critical Sections and Producer/Consumer Queues in Weak Memory Systems.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996
A Simple, Efficient Algorithm for Maximum Finding on Rings.
Inf. Process. Lett., 1996

Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm.
Proceedings of the Algorithm Theory, 1996

1994
Maintaining B-Trees on an EREW PRAM.
J. Parallel Distributed Comput., 1994

Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings.
J. ACM, 1994

1993
Pram Memory Allocation and Initialization.
Parallel Process. Lett., 1993

1992
The Parallel Asynchronous Recursion Model.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

1991
Probabilistic Leader Election on Rings of Known Size.
Proceedings of the Algorithms and Data Structures, 1991

1989
The Bit Complexity of Randomized Leader Election on a Ring.
SIAM J. Comput., 1989

Randomized Function Evaluation on a Ring.
Distributed Comput., 1989

1987
Randomized Function on a Ring (Preliminary Version).
Proceedings of the Distributed Algorithms, 1987

1986
Probabilistic Solitude Verification on a Ring.
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986


  Loading...