This survey presents some of the recent developments in the field of structural complexity. The survey does not intend to give an exhaustive look in each one of the areas of structural complexity which have been developed ...

Embedding graphs in a geographical or latent space, i.e. inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph ...

It is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate the query complexity of learning deterministic finite automata, i.e., ...

In this paper we look at several well known layout problems. We show that MINCUT layout and Topological bandwidth cannot be approximated unless P=NP, whereas the Maximum linear arrangement problem can be approximated within ...

In this paper we give a survey of the symbolic operator methods to do statistics on random trees. We present some examples and apply the techniques to find their asymptotic behaviour.

We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely ...

In this paper we first present a sequential linear algorithm for an linear arrangement problem on trees, the MINSUMCUT, and then a 0(log n) time parallel algorithm for the MINSUMCUT on trees, which uses n [super 2]/(log ...

In this study, we describe a new coordination mechanism for non-atomic congestion games that leads to a (selfish) social cost which is arbitrarily close to the non-selfish optimal. This mechanism incurs no additional cost, ...

The decidability question, i.e., whether any mathematical statement could be computationally proven true or false, was raised by Hilbert and remained open until Turing answered it in the negative. Then, most efforts in ...