# Karl Winklmann

According to our database

^{1}, Karl Winklmann## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1991

On Limitations of Transformations Between Combinatorial Problems.

Mathematical Systems Theory, 1991

1986

"Global" Graph Problems Tend to Be Intractable.

J. Comput. Syst. Sci., 1986

1985

An "Interchange Lemma" for Context-Free Languages.

SIAM J. Comput., 1985

1984

The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete

Information and Control, 1984

1982

Expressing Program Looping in Regular Dynamic Logic.

Theor. Comput. Sci., 1982

Repetitive Strings are not Context-Free.

ITA, 1982

On the Complexity of some Problems Concerning the Use of Procedures II.

Acta Inf., 1982

On the Complexity of Some Problems Concerning the Use of Procedures I.

Acta Inf., 1982

1980

Coping with Errors in Binary Search Procedures.

J. Comput. Syst. Sci., 1980

1979

On the Expressive Power of Dynamic Logic (Preliminary Report)

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978

Simple Gödel Numberings, Isomorphisms, and Programming Properties.

SIAM J. Comput., 1978

Coping with Errors in Binary Search Procedures (Preliminary Report)

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978