The aim of Information Processing Letters is to allow rapid dissemination of interesting results in the field of information processing in the form of short, concise papers. To this end, submissions should not exceed the equivalent of nine A4 or 81/2–by–11 double–spaced typed pages. The scope of the journal is indicated by the list of keywords found below. This list is periodically updated by inserting items most frequently proposed by the contributors and removing the least popular entries, under the advisement of the Board of Editors. Submissions are encouraged both on theoretical work and on experimental work.

The scope of IPL is suggested by the following alphabetical list of keywords:

Algorithms – analysis of algorithms – approximation algorithms – automatic theorem proving – combinatorial problems – compilers – computational complexity – computational geometry – concurrency – cryptography – databases – data structures – design of algorithms – distributed computing – distributed systems – fault tolerance – formal languages – formal methods – formal semantics – functional programming – graph algorithms – information retrieval – interconnection networks – on-line algorithms – operating systems – parallel algorithms – parallel processing – performance evaluation – program correctness – program derivation – programming calculi – programming languages – program specification – randomized algorithms – real–time systems – safety/security in digital systems – scheduling – software design and implementation – software engineering – specification languages – theory of computation.