This article surveys the many facets of the Minimum Spanning Tree problem. We follow the
history of the problem since the first polynomial-time solution by Bor˚ uvka to the modern …

The theory of Turing machines, which is basic to proving the various limitations of
computers, is quite well known. The theory of finite state automata, the basic hardware …

The Academic Pathways of People Learning Engineering Survey (APPLES) was deployed
for a second time in Spring 2008 to undergraduate engineering students at 21 American …

The class is a parameterized analogue of. Chen et al.[4] have given a machine
characterization of. The corresponding machine model gives rise to a parameterized …

This thesis defines and designs succinct indexes for several abstract data types (ADTs). The
concept is to design auxiliary data structures that ideally occupy asymptotically less space …

Las Máquinas de Soporte Vectorial son una clase muy específica de algoritmos, que se
caracterizan por la utilización de kernels, la ausencia de los mínimos locales, la poca …

We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a
recursive padding argument. It is shown that, if t 2 (n) is a time-constructible function and t 2 …

H-Lib pro is a software library implementing hierarchical matrices or H-matrices for short.
This type of matrices, first introduced in [Hac99], provides a technique to represent various …