Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Higham, Lisa - Department of Computer Science, University of Calgary
An Overview of the Parallel Asynchronous Recursion Model Lisa Higham \Lambda
Atomic Broadcast and Its Use to Achieve Sequential Consistency Lisa Higham and Jolanta WarpechowskaGruca
Programmer-Centric Conditions for Itanium Memory Consistency
Specifying Memory Consistency of Write Buffer Multiprocessors
SelfStabilizing Token Circulation on Anonymous Message Passing (Extended Abstract)
Java: Memory Consistency and Process Coordination \Lambda Lisa Higham + and Jalal Kawash #
Optimal Algorithms for Probabilistic Solitude Detection On Anonymous Rings **
Asymptotically Optimal Election on Weighted Rings Lisa Higham 1
A Simple, Efficient Algorithm for Maximum Finding on Rings Lisa Higham
Capturing Register and Control Dependence in Memory Consistency Models with Applications
Tight Bounds for Critical Sections in Processor Consistent Platforms
Critical Sections and Producer/Consumer Queues in Weak Memory Systems \Lambda y
Longlived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput
Defining and Comparing Memory Consistency Models \Lambda y Lisa Higham, Jalal Kawash, and Nathaly Verwaal
Optimal CostSensitive Distributed Minimum Spanning Tree Algorithm Teresa Przytycka 1
The Parallel Asynchronous Recursion Model Lisa Higham \Lambda Eric Schenk y
Probabilistic Leader Election on Rings of Known Size \Lambda
