We give a number of new lower bounds in the cell probe model with logarithmic cell size, which entails the same bounds on the random access computer with logarithmic word size and unit cost operations.

A general class of languages and denotational models for value-passing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete language is given, an instantiation of the general class. An equationally based proof system is defined and shown to be sound and complete with respect to the model.

This thesis is in Theory of Computation. We study quantitative aspects of computational problems that arise in settings where the input instance is subject to changes, i.e., dynamic problems. The results include efficient dynamic algorithms and data structures and strong information-theoretic lower bounds for problems on graphs, strings, and finite functions.

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS