Karl Winklmann

Publication Activity (10 Years)

Years Active: 1978-1991
Publications (10 Years): 0

Publications

William Slough, Karl Winklmann
On Limitations of Transformations Between Combinatorial Problems. Math. Syst. Theory 24 (3) (1991)
N. Lakshmipathy, Karl Winklmann
"Global" Graph Problems Tend to Be Intractable. J. Comput. Syst. Sci. 32 (3) (1986)
William F. Ogden, Rockford J. Ross, Karl Winklmann
An "Interchange Lemma" for Context-Free Languages. SIAM J. Comput. 14 (2) (1985)
Paliath Narendran, Friedrich Otto, Karl Winklmann
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete Inf. Control. 63 (1/2) (1984)
Karl Winklmann
On the Complexity of some Problems Concerning the Use of Procedures II. Acta Informatica 18 (1982)
Albert R. Meyer, Karl Winklmann
Expressing Program Looping in Regular Dynamic Logic. Theor. Comput. Sci. 18 (1982)
Karl Winklmann
On the Complexity of Some Problems Concerning the Use of Procedures I. Acta Informatica 18 (1982)
Rockford J. Ross, Karl Winklmann
Repetitive Strings are not Context-Free. RAIRO Theor. Informatics Appl. 16 (3) (1982)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. 20 (3) (1980)
Albert R. Meyer, Karl Winklmann
On the Expressive Power of Dynamic Logic (Preliminary Report) STOC (1979)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
Coping with Errors in Binary Search Procedures (Preliminary Report) STOC (1978)
Michael Machtey, Karl Winklmann, Paul Young
Simple Gödel Numberings, Isomorphisms, and Programming Properties. SIAM J. Comput. 7 (1) (1978)