Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Abrahamson, Karl"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A grammar characterization of logarithmic-space computation
Karl Abrahamson
,
Liming Cai
,
Steve Gordon
Lecture Notes in Computer Science
1218
, 1997, pp. 247-255
Optimal algorithms for probabilistic solitude detection on anonymous rings
Lisa Higham
,
David Kirkpatrick
,
Karl Abrahamson
,
Andrew Adler
Journal of Algorithms
23
(2), 1997, pp. 291-328
Tight lower bounds for probabilistic solitude verification on anonymous rings
Karl Abrahamson
,
Andrew Adler
,
David Kirkpatrick
Journal of the ACM
41
(2), 1994, March, pp. 277-310
Fixed-parameter intractability II (extended abstract)
Karl A. Abrahamson
,
Rodney G. Downey
,
Michael R. Fellows
Lecture Notes in Computer Science
665
, 1993, pp. 374-385
Probabilistic leader election on rings of known size
Karl Abrahamson
,
Andrew Adler
,
Lisa Higham
,
David Kirkpatrick
Lecture Notes in Computer Science
519
, 1991, pp. 481-495
Constructive complexity
Karl Abrahamson
,
Michael R. Fellows
,
Michael A. Langston
,
Bernard M.E. Moret
Discrete Applied Mathematics
34
, 1991, pp. 3-16
Time-space tradeoffs for algebraic problems on general sequential machines
Karl Abrahamson
Journal of Computer and System Sciences
43
, 1991, pp. 269-289
The bit complexity of randomized leader election on a ring
Karl Abrahamson
,
Andrew Adler
,
Rachel Gelbart
,
Lisa Higham
,
David Kirkpatrick
SIAM Journal on Computing
18
(1), 1989, February, pp. 12-29