Minimum-complexity pairing functions
Trade-offs between communication and space
Closure of varieties of languages under products with counter
Embedding grids into hypercubes
Foreground automata
Nondiamond theorems for polynomial time reducibility
Models of a K-rational identity system
Design of desirable relational database schemes
Computing with discrete multi-valued neurons
Some investigations on FCFS scheduling in hard real time applications
Author index for volume 45