Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Dataflow process networks (DPNs) provide a convenient model of computation that is often
used to model system behavior in model-based designs. With fixed sets of nodes, they are …

In this paper we hypothesize that reconfigurable computing is not more widely used
because of the logistical difficulties caused by the close coupling of applications and …

Abstract We study Hanani-Tutte style theorems for various notions of planarity, including
partially embedded planarity, and simultaneous planarity. This approach brings together the …

A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) of a
sequence of simple closed curves. We describe an algorithm to determine whether a closed …

Hybrid dataflow/von Neumann processors expose their processing units and datapaths to
the compiler to exploit the instruction-level parallelism of sequential programs. Generating …

Many novel processor architectures expose their processing units (PUs) and internal
datapaths to the compiler. To avoid an unnecessary synchronization of PUs, the datapaths …

Abstract Let G=(V, E) be a directed graph and ℓ: V→[k]:={1,…, k} a level assignment such
that ℓ (u)< ℓ (v) for all directed edges (u, v)∊ E. A level planar drawing of G is a drawing of G …

A drawing of a graph is x-monotone if every edge intersects every vertical line at most once
and every vertical line contains at most one vertex. Pach and Tóth showed that if a graph …

In a level directed acyclic graph G=(V; E) the vertex set V is partitioned into k≤| V| levels V 1;
V 2... V k such that for each edge (u, v)∈ E with u∈ V i and v∈; V j we have i< j. The level …