Karl Winklmann

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