The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Karl R. Abrahamson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  24. Constructive complexity. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002