Karl R. Abrahamson

According to our database, Karl R. Abrahamson authored at least 24 papers between 1979 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

Parameterized objects and inducements to explore functional programming.

Karl R. Abrahamson

Proceedings of the 44st Annual Southeast Regional Conference, 2006

1997

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings.

Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler

J. Algorithms, 1997

A Grammar Characterization of Logarithmic-Space Computation.

Karl R. Abrahamson, Liming Cai, Steve Gordon

Proceedings of the New Trends in Formal Languages, 1997

1995

Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues.

Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows

Ann. Pure Appl. Log., 1995

1994

Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

J. ACM, 1994

1993

Fixed-Parameter Intractability II (Extended Abstract).

Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows

Proceedings of the STACS 93, 1993

1992

Parallel Self-Reducibility.

Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson

Proceedings of the Computing and Information, 1992

1991

Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines.

Karl R. Abrahamson

J. Comput. Syst. Sci., 1991

Constructive complexity.

Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret

Discret. Appl. Math., 1991

Probabilistic Leader Election on Rings of Known Size.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Proceedings of the Algorithms and Data Structures, 1991

Finite automata, bounded treewidth, and well-quasiordering.

Karl R. Abrahamson, Michael R. Fellows

Proceedings of the Graph Structure Theory, 1991

1990

On the Modality of Convex Polygons.

Karl R. Abrahamson

Discret. Comput. Geom., 1990

A Time-Space Tradeoff for Boolean Matrix Multiplication

Karl R. Abrahamson

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

The Bit Complexity of Randomized Leader Election on a Ring.

Karl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick

SIAM J. Comput., 1989

A Simple Parallel Tree Contraction Algorithm.

Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka

J. Algorithms, 1989

Randomized Function Evaluation on a Ring.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Distributed Comput., 1989

On the Complexity of Fixed Parameter Problems (Extended Abstract)

Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

On Achieving Consensus Using a Shared Memory.

Karl R. Abrahamson

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987

Generalized String Matching.

Karl R. Abrahamson

SIAM J. Comput., 1987

Succinct Representation of Regular Sets Using Gotos and Boolean Variables.

Karl R. Abrahamson

J. Comput. Syst. Sci., 1987

Randomized Function on a Ring (Preliminary Version).

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Proceedings of the Distributed Algorithms, 1987

1986

Probabilistic Solitude Verification on a Ring.

Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick

Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs

Karl R. Abrahamson

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1979

Modal Logic of Concurrent Nondeterministic Programs.

Karl R. Abrahamson

Proceedings of the Semantics of Concurrent Computation, 1979