Lisa Higham - RankMe

58 papers A* 10A 9B 3C 1Misc 3Journal 22Unranked 10

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