 | 1991 |
|---|
| 12 |       | William Slough,
Karl Winklmann:
On Limitations of Transformations Between Combinatorial Problems.
Mathematical Systems Theory 24(3): 149-168 (1991) |
| 1986 |
|---|
| 11 | | N. Lakshmipathy,
Karl Winklmann:
"Global" Graph Problems Tend to Be Intractable.
J. Comput. Syst. Sci. 32(3): 407-428 (1986) |
| 1985 |
|---|
| 10 | | William F. Ogden,
Rockford J. Ross,
Karl Winklmann:
An ``Interchange Lemma'' for Context-Free Languages.
SIAM J. Comput. 14(2): 410-415 (1985) |
| 1984 |
|---|
| 9 | | Paliath Narendran,
Friedrich Otto,
Karl Winklmann:
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete
Information and Control 63(1/2): 58-66 (1984) |
| 1982 |
|---|
| 8 | | Karl Winklmann:
On the Complexity of Some Problems Concerning the Use of Procedures I.
Acta Inf. 18: 299-318 (1982) |
| 7 | | Karl Winklmann:
On the Complexity of some Problems Concerning the Use of Procedures II.
Acta Inf. 18: 411-430 (1982) |
| 6 | | Rockford J. Ross,
Karl Winklmann:
Repetitive Strings are not Context-Free.
ITA 16(3): 191-199 (1982) |
| 5 | | Albert R. Meyer,
Karl Winklmann:
Expressing Program Looping in Regular Dynamic Logic.
Theor. Comput. Sci. 18: 301-323 (1982) |
| 1980 |
|---|
| 4 | | 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): 396-404 (1980) |
| 1979 |
|---|
| 3 | | Albert R. Meyer,
Karl Winklmann:
On the Expressive Power of Dynamic Logic (Preliminary Report)
STOC 1979: 167-175 |
| 1978 |
|---|
| 2 | | Ronald L. Rivest,
Albert R. Meyer,
Daniel J. Kleitman,
Karl Winklmann,
Joel Spencer:
Coping with Errors in Binary Search Procedures (Preliminary Report)
STOC 1978: 227-232 |
| 1 | | Michael Machtey,
Karl Winklmann,
Paul Young:
Simple Gödel Numberings, Isomorphisms, and Programming Properties.
SIAM J. Comput. 7(1): 39-60 (1978) |
