Karl R. Abrahamson

	2006
24		Karl R. Abrahamson: Parameterized objects and inducements to explore functional programming. ACM Southeast Regional Conference 2006: 770-771
	1997
23		Karl R. Abrahamson, Liming Cai, Steve Gordon: A Grammar Characterization of Logarithmic-Space Computation. New Trends in Formal Languages 1997: 247-255
22		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)
	1995
21		Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Ann. Pure Appl. Logic 73(3): 235-276 (1995)
	1994
20		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)
	1993
19		Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability II (Extended Abstract). STACS 1993: 374-385
	1992
18		Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson: Parallel Self-Reducibility. ICCI 1992: 67-70
	1991
17		Karl R. Abrahamson, Michael R. Fellows: Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-564
16		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Probabilistic Leader Election on Rings of Known Size. WADS 1991: 481-495
15		Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret: Constructive complexity. Discrete Applied Mathematics 34(1-3): 3-16 (1991)
14		Karl R. Abrahamson: Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines. J. Comput. Syst. Sci. 43(2): 269-289 (1991)
	1990
13		Karl R. Abrahamson: A Time-Space Tradeoff for Boolean Matrix Multiplication FOCS 1990: 412-419
12		Karl R. Abrahamson: On the Modality of Convex Polygons. Discrete & Computational Geometry 5: 409-419 (1990)
	1989
11		Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata: On the Complexity of Fixed Parameter Problems (Extended Abstract) FOCS 1989: 210-215
10		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Randomized Function Evaluation on a Ring. Distributed Computing 3(3): 107-117 (1989)
9		Karl R. Abrahamson, N. Dadoun, David G. Kirkpatrick, Teresa M. Przytycka: A Simple Parallel Tree Contraction Algorithm. J. Algorithms 10(2): 287-302 (1989)
8		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)
	1988
7		Karl R. Abrahamson: On Achieving Consensus Using a Shared Memory. PODC 1988: 291-302
	1987
6		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Randomized Function on a Ring (Preliminary Version). WDAG 1987: 324-331
5		Karl R. Abrahamson: Succinct Representation of Regular Sets Using Gotos and Boolean Variables. J. Comput. Syst. Sci. 34(1): 129-148 (1987)
4		Karl R. Abrahamson: Generalized String Matching. SIAM J. Comput. 16(6): 1039-1051 (1987)
	1986
3		Karl R. Abrahamson: Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs FOCS 1986: 402-409
2		Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Probabilistic Solitude Verification on a Ring. PODC 1986: 161-173
	1979
1		Karl R. Abrahamson: Modal Logic of Concurrent Nondeterministic Programs. Semantics of Concurrent Computation 1979: 21-33

Coauthor Index

1	Andrew Adler	[2] [6] [8] [10] [16] [20] [22]
2	Liming Cai	[23]
3	N. Dadoun	[9]
4	Rodney G. Downey (Rod Downey)	[19] [21]
5	John A. Ellis	[11]
6	Michael R. Fellows (Mike Fellows)	[11] [15] [17] [18] [19] [21]
7	Rachel Gelbart	[8]
8	Steve Gordon	[23]
9	Lisa Higham	[2] [6] [8] [10] [16] [20] [22]
10	David G. Kirkpatrick	[2] [6] [8] [9] [10] [16] [20] [22]
11	Michael A. Langston	[15]
12	Manuel E. Mata	[11]
13	Bernard M. E. Moret	[15]
14	Teresa M. Przytycka	[9]
15	Christopher B. Wilson	[18]

Colors in the list of coauthors