A serious limitation of the theory of P-completeness is that it fails to distinguish between
those P-complete problems that do have polynomial speedup on parallel machines from …

An operation on integers is LTTC if it is computable in linear time on a Turing machine
(using the dyadic or binary representation of integers). An LTTC-RAM (respectively I-RAM) is …

Let S be a closed surface with boundary∂ S and let G be a graph. Let K⊆ G be a subgraph
embedded in S such that∂ S⊆ K. An embedding extension of K to G is an embedding of G …

This paper furthers the study of quasi-linear time complexity initiated by Schnorr [Sch76] and
Gurevich and Shelah [GS89]. We show that the fundamental properties of the polynomial …

Connections are shown between two properties of a machine model: linear speed-up and
polynomial vicinity. In the context of the author's Block Move (BM) model, these relate …

A realistic model of computation called the Block Move (BM) model is developed. The BM
regards computation as a sequence of nite transductions in memory, and operations are …

We demonstrate that parallel machines are always faster than sequential machines for a
wide range of machine models, including tree Turing machine (TM), multidimensional TM …

Consider the problem of determining the pivot sequence used by the Gaussian Elimination
algorithm with Partial Pivoting (GEPP). Let N stand for the order of the input matrix and let ε …

This report describes the Finite Automaton Learning System (FALS), an evolutionary system
that is designed to nd small digital circuits that duplicate the behavior of a given nite …

This paper studies linear-time algorithms on a hierarchical memory model called Block
Move (BM), which extends the Block Transfer (BT) model of Aggarwal, Chandra, and Snir …