Communication networks have become ubiquitous today. The Internet, the global computer communication network that interconnects millions of computers, has become an indispensable part of our everyday life. This chapter discusses theoretical and algorithmic underpinnings of distributed communication networks, focusing mainly on themes motivated by the Internet. The Internet is a distributed wide...

We describe an application of using a change of sampling density to get easier access to rare events during numeric simulations (this is called importance sampling). Our emphasis is on the derivation of the change of density instead of the algorithmic details. We work a small example to make the technique concrete.

We develop several algorithms for computations in Galois extensions of p-adic fields. Our algorithms are based on existing algorithms for number fields and are exact in the sense that we do not need to consider approximations to p-adic numbers. As an application we describe an algorithmic approach to prove or disprove various conjectures for local and global epsilon constants.

Several algorithmic problems for pseudovarieties and their relationships are studied. This includes the usual membership problem and the computability of pointlike subsets of nite semi-groups. Some of these problems aaord equivalent formulations involving topological separation properties in free proonite semigroups. Several examples are considered and, as an application, a decidability result ...

In this paper we introduce natural time analysis in financial markets. Due to the remarkable results of this analysis on earthquake prediction and the similarities of earthquake data to financial time series, its application in price prediction and algorithmic trading seems to be a natural choice. This is tested through a trading strategy with very encouraging results.

These lecture notes report on the use of automata theory in the study of infinite transition systems. This application of automata is an important ingredient of the current development of “infinite-state system verification”, and it provides an introduction into the field of “algorithmic model theory”, a study of infinite models with an emphasis on computability results.

This paper investigates the application of a nested logit model to urban transit networks where every set of competitive transit lines is described by a particular graph structure called hyperpath. It shows that the nested logit model transcends the inherent limitations of the simple logit model while retaining the algorithmic advantages similar to that obtained with the ordinary logit model fo...

A notion of asymptotic Hamming distance suitable for the study of algorithmic randomness is developed. As an application of this notion, it is shown that there is no fixed procedure that computes a Mises-WaldChurch stochastic set from a complex set. Here a set is complex if its prefixes have Kolmogorov complexity bounded below by an unbounded, nondecreasing computable function.

We aim to present current trends in the theoretical computer science research on topics which have applications in data mining. We briefly describe data mining tasks in various application contexts. We give an overview of some of the questions and algorithmic issues that are of concern when mining huge amounts of data that do not fit in main memory.