Karl Winklmann

According to our database, Karl Winklmann authored at least 12 papers between 1978 and 1991.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

1991

On Limitations of Transformations Between Combinatorial Problems.

William Slough, Karl Winklmann

Math. Syst. Theory, 1991

1986

"Global" Graph Problems Tend to Be Intractable.

N. Lakshmipathy, Karl Winklmann

J. Comput. Syst. Sci., 1986

1985

An "Interchange Lemma" for Context-Free Languages.

William F. Ogden, Rockford J. Ross, Karl Winklmann

SIAM J. Comput., 1985

1984

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

Paliath Narendran, Friedrich Otto, Karl Winklmann

Inf. Control., 1984

1982

Expressing Program Looping in Regular Dynamic Logic.

Albert R. Meyer, Karl Winklmann

Theor. Comput. Sci., 1982

Repetitive Strings are not Context-Free.

Rockford J. Ross, Karl Winklmann

RAIRO Theor. Informatics Appl., 1982

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

Karl Winklmann

Acta Informatica, 1982

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

Karl Winklmann

Acta Informatica, 1982

1980

Coping with Errors in Binary Search Procedures.

Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer

J. Comput. Syst. Sci., 1980

1979

On the Expressive Power of Dynamic Logic (Preliminary Report)

Albert R. Meyer, Karl Winklmann

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

1978

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

Michael Machtey, Karl Winklmann, Paul Young

SIAM J. Comput., 1978

Coping with Errors in Binary Search Procedures (Preliminary Report)

Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer

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