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="Winklmann, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
'Global' graph problems tend to be intractable
N. Lakshmipathy
,
K. Winklmann
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 407-428
An ``interchange lemma'' for context-free languages
W. Ogden
,
R.J. Ross
,
K. Winklmann
SIAM Journal on Computing
14
(2), 1985, May, pp. 410-415
The uniform conjugacy problem for finite Church-Rosser Thue systems is
NP
-complete
P. Narendran
,
F. Otto
,
K. Winklmann
Information and Control
63
(1/2), 1984, pp. 58-66
Expressing program looping in regular dynamic logic
A.R. Meyer
,
K. Winklmann
Theoretical Computer Science
18
, 1982, pp. 301-323
On the complexity of some problems concerning the use of procedures. I
K. Winklmann
Acta Informatica
18
(3), 1982, pp. 299-318
Coping with errors in binary search procedures
R.L. Rivest
,
A.R. Meyer
,
D.J. Kleitman
,
K. Winklmann
,
J. Spencer
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 396-404
On the expressive power of dynamic logic
A. Meyer
,
K. Winklmann
Proceedings of the 11th Annual ACM Symposium on Theory of Computing, STOC'79 (Atlanta, GA, April 30 - May 2, 1979)
, 1979, pp. 167-175
Coping with errors in binary search procedures
D.J. Kleitman
,
A.R. Meyer
,
R.L. Rivest
,
J. Spencer
,
K. Winklmann
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78 (San Diego, CA, May 1-3, 1978)
, 1978, pp. 227-232
Simple Gödel numberings, isomorphisms, and programming properties
M. Machtey
,
K. Winklmann
,
P. Young
SIAM Journal on Computing
7
(1), 1978, February, pp. 39-60