Lisa Higham

	2011
48		Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel: The space complexity of long-lived and one-shot timestamp implementations. PODC 2011: 139-148
47		Wojciech M. Golab, Lisa Higham, Philipp Woelfel: Linearizable implementations do not suffice for randomized distributed computation. STOC 2011: 373-382
46		Lisa Higham, Jalal Kawash, Abhijeet Pareek Pareek: Programmer-Centric Memory Consistency Modeling. Bulletin of the EATCS 105: 118-140 (2011)
45		Wojciech M. Golab, Lisa Higham, Philipp Woelfel: Linearizable Implementations Do Not Suffice for Randomized Distributed Computation CoRR abs/1103.4690: (2011)
44		Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel: The Space Complexity of Long-lived and One-Shot Timestamp Implementations CoRR abs/1103.5794: (2011)
	2009
43		Adesola Omotayo, Ken Barker, Moustafa A. Hammad, Lisa Higham, Jalal Kawash: Answering Multiple-Item Queries in Data Broadcast Systems. BNCOD 2009: 120-132
42		Colette Johnen, Lisa Higham: Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. ICDCN 2009: 337-348
41		Parthasarathy Ramanujam, Zongpeng Li, Lisa Higham: Shadow Prices vs. Vickrey Prices in Multipath Routing. INFOCOM 2009: 2956-2960
	2008
40		Colette Johnen, Lisa Higham: Fault-tolerant implementations of atomic registers by safe registers in networks. PODC 2008: 449
39		Lisa Higham, Jalal Kawash: Implementing sequentially consistent programs on processor consistent platforms. J. Parallel Distrib. Comput. 68(4): 488-500 (2008)
	2007
38		Colette Johnen, Lisa Higham: Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. DISC 2007: 485-487
37		Lisa Higham, LillAnne Jackson, Jalal Kawash: Specifying memory consistency of write buffer multiprocessors. ACM Trans. Comput. Syst. 25(1): (2007)
36		Lisa Higham, LillAnne Jackson, Jalal Kawash: What is Itanium Memory Consistency from the Programmer's Point of View? Electr. Notes Theor. Comput. Sci. 174(9): 63-84 (2007)
	2006
35		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
34		Lisa Higham, LillAnne Jackson, Jalal Kawash: Programmer-Centric Conditions for Itanium Memory Consistency. ICDCN 2006: 58-69
33		Lisa Higham, Colette Johnen: Relationships between communication models in networks using atomic registers. IPDPS 2006
32		Lisa Higham, LillAnne Jackson: Translating between itanium and sparc memory consistency models. SPAA 2006: 170-179
31		Lisa Higham, Jalal Kawash: Tight Bounds for Critical Sections in Processor Consistent Platforms. IEEE Trans. Parallel Distrib. Syst. 17(10): 1072-1083 (2006)
	2005
30		Lisa Higham, Jalal Kawash: Impact of Instruction Re-Ordering on the Correctness of Shared-Memory Programs. ISPAN 2005: 25-32
29		Lisa Higham, Jalal Kawash: Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?. NPC 2005: 261-265
	2004
28		Lisa Higham, Jalal Kawash: Implementing Sequentially Consistent Programs on Processor Consistent Platforms. ISPAN 2004: 326-331
27		Lisa Higham, Lixiao Wang: Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition. PODC 2004: 377
	2002
26		Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth: Dynamic and self-stabilizing distributed matching. PODC 2002: 290-297
	2001
25		Lisa Higham, Zhiying Liang: Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. DISC 2001: 194-208
24		Lisa Higham: Report on DISC'00. SIGACT News 32(1): 32-36 (2001)
	2000
23		Lisa Higham, Jalal Kawash: Bounds for Mutual Exclusion with only Processor Consistency. DISC 2000: 44-58
22		Lisa Higham, Jalal Kawash: Memory Consistency and Process Coordination for SPARC Multiprocessors. HiPC 2000: 355-366
21		Jalal Kawash, Lisa Higham: Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement). PODC 2000: 335
	1999
20		Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca: Meeting Times of Random Walks on Graphs. Inf. Process. Lett. 69(5): 259-265 (1999)
	1998
19		Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca: Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC 1998: 149-160
18		Lisa Higham, Jalal Kawash: Java: Memory Consistency and Process Coordination. DISC 1998: 201-215
17		Lisa Higham, S. Myers: SelfStabilizing Token Circulation on Anonymous Message Passing. OPODIS 1998: 115-128
16		Lisa Higham, Teresa M. Przytycka: Asymptotically Optimal Election on Weighted Rings. SIAM J. Comput. 28(2): 720-732 (1998)
	1997
15		Lisa Higham, Jalal Kawash: Critical Sections and Producer/Consumer Queues in Weak Memory Systems. ISPAN 1997: 56-63
14		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)
	1996
13		Teresa M. Przytycka, Lisa Higham: Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. SWAT 1996: 246-258
12		Lisa Higham, Teresa M. Przytycka: A Simple, Efficient Algorithm for Maximum Finding on Rings. Inf. Process. Lett. 58(6): 319-324 (1996)
	1994
11		Lisa Higham, Teresa M. Przytycka: Asymptotically Optimal Election on Weighted Rings. SWAT 1994: 207-218
10		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)
9		Lisa Higham, Eric Schenk: Maintaining B-Trees on an EREW PRAM. J. Parallel Distrib. Comput. 22(2): 329-335 (1994)
	1993
8		Lisa Higham, Teresa M. Przytycka: A Simple, Efficient Algorithm for Maximum Finding on Rings. WDAG 1993: 249-263
7		Lisa Higham, Eric Schenk: Pram Memory Allocation and Initialization. Parallel Processing Letters 3: 291-299 (1993)
	1992
6		Lisa Higham, Eric Schenk: The Parallel Asynchronous Recursion Model. SPDP 1992: 310-316
	1991
5		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Probabilistic Leader Election on Rings of Known Size. WADS 1991: 481-495
	1989
4		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Randomized Function Evaluation on a Ring. Distributed Computing 3(3): 107-117 (1989)
3		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
2		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Randomized Function on a Ring (Preliminary Version). WDAG 1987: 324-331
	1986
1		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Probabilistic Solitude Verification on a Ring. PODC 1986: 161-173

Coauthor Index

1	Karl R. Abrahamson	[1] [2] [3] [4] [5] [10] [14]
2	Andrew Adler	[1] [2] [3] [4] [5] [10] [14]
3	Ken Barker	[43]
4	Nader H. Bshouty	[20]
5	Subhendu Chattopadhyay	[26]
6	Wayne Eberly (Wayne M. Eberly)	[19]
7	Rachel Gelbart	[3]
8	Wojciech M. Golab	[45] [47]
9	Moustafa A. Hammad	[43]
10	Maryam Helmi	[44] [48]
11	LillAnne Jackson	[32] [34] [35] [36] [37]
12	Colette Johnen	[33] [38] [40] [42]
13	Jalal Kawash	[15] [18] [21] [22] [23] [28] [29] [30] [31] [34] [35] [36] [37] [39] [43] [46]
14	David G. Kirkpatrick	[1] [2] [3] [4] [5] [10] [14]
15	Zongpeng Li	[41]
16	Zhiying Liang	[25]
17	S. Myers	[17]
18	Adesola Omotayo	[43]
19	Eduardo Pacheco	[44] [48]
20	Abhijeet Pareek Pareek	[46]
21	Teresa M. Przytycka	[8] [11] [12] [13] [16]
22	Parthasarathy Ramanujam	[41]
23	Eric Schenk	[6] [7] [9]
24	Karen Seyffarth	[26]
25	Lixiao Wang	[27]
26	Jolanta Warpechowska-Gruca (Jolanta Warpechowska)	[19] [20]
27	Philipp Woelfel	[44] [45] [47] [48]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page