default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarl R. Abrahamson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c13]Karl R. Abrahamson:
Parameterized objects and inducements to explore functional programming. ACM Southeast Regional Conference 2006: 770-771
1990 – 1999
- 1997
- [j11]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) - [c12]Karl R. Abrahamson, Liming Cai, Steve Gordon:
A Grammar Characterization of Logarithmic-Space Computation. New Trends in Formal Languages 1997: 247-255 - 1995
- [j10]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. Log. 73(3): 235-276 (1995) - 1994
- [j9]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
- [c11]Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows:
Fixed-Parameter Intractability II (Extended Abstract). STACS 1993: 374-385 - 1992
- [c10]Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson:
Parallel Self-Reducibility. ICCI 1992: 67-70 - 1991
- [j8]Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret:
Constructive complexity. Discret. Appl. Math. 34(1-3): 3-16 (1991) - [j7]Karl R. Abrahamson:
Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines. J. Comput. Syst. Sci. 43(2): 269-289 (1991) - [c9]Karl R. Abrahamson, Michael R. Fellows:
Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-563 - [c8]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Probabilistic Leader Election on Rings of Known Size. WADS 1991: 481-495 - 1990
- [j6]Karl R. Abrahamson:
On the Modality of Convex Polygons. Discret. Comput. Geom. 5: 409-419 (1990) - [c7]Karl R. Abrahamson:
A Time-Space Tradeoff for Boolean Matrix Multiplication. FOCS 1990: 412-419
1980 – 1989
- 1989
- [j5]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Randomized Function Evaluation on a Ring. Distributed Comput. 3(3): 107-117 (1989) - [j4]Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka:
A Simple Parallel Tree Contraction Algorithm. J. Algorithms 10(2): 287-302 (1989) - [j3]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) - [c6]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 - 1988
- [c5]Karl R. Abrahamson:
On Achieving Consensus Using a Shared Memory. PODC 1988: 291-302 - 1987
- [j2]Karl R. Abrahamson:
Succinct Representation of Regular Sets Using Gotos and Boolean Variables. J. Comput. Syst. Sci. 34(1): 129-148 (1987) - [j1]Karl R. Abrahamson:
Generalized String Matching. SIAM J. Comput. 16(6): 1039-1051 (1987) - [c4]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Randomized Function on a Ring (Preliminary Version). WDAG 1987: 324-331 - 1986
- [c3]Karl R. Abrahamson:
Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs. FOCS 1986: 402-409 - [c2]Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Probabilistic Solitude Verification on a Ring. PODC 1986: 161-173
1970 – 1979
- 1979
- [c1]Karl R. Abrahamson:
Modal Logic of Concurrent Nondeterministic Programs. Semantics of Concurrent Computation 1979: 21-33
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
