Karl R. Abrahamson

24 papers A* 5A 1B 1C 1Journal 11Unranked 5
YearRankTypeTitle / Venue / Authors
2006 — conf
Parameterized objects and inducements to explore functional programming.
ACM Southeast Regional Conference
Karl R. Abrahamson
1997 — conf
A Grammar Characterization of Logarithmic-Space Computation.
New Trends in Formal Languages
Karl R. Abrahamson, Liming Cai, Steve Gordon
1997 J jnl
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings.
J. Algorithms
Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler
1995 J jnl
Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues.
Ann. Pure Appl. Log.
Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
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 A conf
Fixed-Parameter Intractability II (Extended Abstract).
STACS
Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
1992 C conf
Parallel Self-Reducibility.
ICCI
Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson
1991 J jnl
Constructive complexity.
Discret. Appl. Math.
Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret
1991 — conf
Finite automata, bounded treewidth, and well-quasiordering.
Graph Structure Theory
Karl R. Abrahamson, Michael R. Fellows
1991 B conf
Probabilistic Leader Election on Rings of Known Size.
WADS
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1991 J jnl
Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines.
J. Comput. Syst. Sci.
Karl R. Abrahamson
1990 A* conf
A Time-Space Tradeoff for Boolean Matrix Multiplication
FOCS
Karl R. Abrahamson
1990 J jnl
On the Modality of Convex Polygons.
Discret. Comput. Geom.
Karl R. Abrahamson
1989 J jnl
A Simple Parallel Tree Contraction Algorithm.
J. Algorithms
Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka
1989 A* conf
On the Complexity of Fixed Parameter Problems (Extended Abstract)
FOCS
Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata
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
1988 A* conf
On Achieving Consensus Using a Shared Memory.
PODC
Karl R. Abrahamson
1987 J jnl
Generalized String Matching.
SIAM J. Comput.
Karl R. Abrahamson
1987 — conf
Randomized Function on a Ring (Preliminary Version).
WDAG
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1987 J jnl
Succinct Representation of Regular Sets Using Gotos and Boolean Variables.
J. Comput. Syst. Sci.
Karl R. Abrahamson
1986 A* conf
Probabilistic Solitude Verification on a Ring.
PODC
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1986 A* conf
Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs
FOCS
Karl R. Abrahamson
1979 — conf
Modal Logic of Concurrent Nondeterministic Programs.
Semantics of Concurrent Computation
Karl R. Abrahamson