Centrum Wiskunde & Informatica: Information Processing Letters

The membership question for ETOL-languages is polynomially complete Article

Information Processing Letters, 3(5), 138-143.

J. van Leeuwen (Jan)

May 1975

A space-saving technique for assigning algol 68 multiple values Article

Information Processing Letters, 5(4), 97-99.

L.G.L.T. Meertens (Lambert)

October 1976

Achievable high scores of -moves and running times in DPDA computations Article

Information Processing Letters, 10(2), 83-86.

P.M.B. Vitányi (Paul)

March 1980

On the power of real-time two-way multihead finite automata with jumps Article

Information Processing Letters, 31-35.

W.J. Savitch and P.M.B. Vitányi (Paul)

January 1984

Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit Article

Information Processing Letters, 21(2), 87-91.

P.M.B. Vitányi (Paul)

January 1985

An $nsp {1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape. Article

Information Processing Letters, 147-152.

P.M.B. Vitányi (Paul)

January 1985

Limits for automatic verification of finite state concurrent systems Article

Information Processing Letters, 307-309.

K.R. Apt (Krzysztof) and D. Kozen

January 1986

Two normal form theorems for CSP programs Article

Information Processing Letters, 165-171.

K.R. Apt (Krzysztof), L. Bougé and P. Clermont

January 1987

Information Processing Letters

Collection

Collection

Published by Elsevier B.V.

The membership question for ETOL-languages is polynomially complete Article

A space-saving technique for assigning algol 68 multiple values Article

Achievable high scores of -moves and running times in DPDA computations Article

On the power of real-time two-way multihead finite automata with jumps Article

Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit Article

An $nsp {1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape. Article

Limits for automatic verification of finite state concurrent systems Article

Two normal form theorems for CSP programs Article

Address

CWI researchers

Questions or comments?

Information Processing Letters

Collection

Collection

Published by Elsevier B.V.

The membership question for ETOL-languages is polynomially complete Article

A space-saving technique for assigning algol 68 multiple values Article

Achievable high scores of -moves and running times in DPDA computations Article

On the power of real-time two-way multihead finite automata with jumps Article

Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit Article

An $nsp {1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape. Article

Limits for automatic verification of finite state concurrent systems Article

Two normal form theorems for CSP programs Article

Workflow

Workflow

Add Content