Myasnikov (City College of New York) et al. apply the complexity of non-commutative groups
to public key cryptography, assess the generic-case performance of various algorithms, and …

This book is about relations between three di? erent areas of mathematics and
theoreticalcomputer science: combinatorialgroup theory, cryptography, and c-plexity theory …

Given two strings, the longest common subsequence (LCS) problem consists in computing
the length of the longest string that is a subsequence of both input strings. Its generalisation …

Monge matrices play a fundamental role in optimisation theory, graph and string algorithms.
Distance multiplication of two Monge matrices of size n can be performed in time O (n 2) …

We are now witnessing a rapid growth of a new part of group theory which has become
known as" statistical group theory". A typical result in this area would say something like``a …

Algebra, as we know it today, consists of many different ideas, concepts and results. A rea-
sonable estimate of the number of these different “items” would be somewhere between …

The stable profile of the boundary of a plant's leaf fluctuating in the direction transverse to
the leaf's surface is described in the framework of a model called asurface à godets'(SG). It is …

Let G be a free product of a finite family of finite groups, with the set of generators being
formed by the union of the finite groups. We consider a transient nearest‐neighbour random …

We consider a (1+ 1)-dimensional ballistic deposition process with next-nearest-neighbor
interactions, which belongs to the Kardar-Parisi-Zhang (KPZ) universality class. The focus of …

In this paper we prove a Myhill-Nerode theorem for recognizable tree series over
commutative semifields and thereby present a minimization of bottom-up finite state …