![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators
While FPGAs have been used extensively as hardware accelerators in industrial computation [20], no theoretical model of computation has been devised for the study of FPGA-based accelerators. In this paper, we pre...
-
Chapter and Conference Paper
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts
Compact and I/O-efficient data representations play an important role in efficient algorithm design, as memory bandwidth and latency can present a significant performance bottleneck, slowing the computation by...
-
Chapter and Conference Paper
On the Simultaneous Minimum Spanning Trees Problem
Simultaneous Embedding with Fixed Edges (SEFE) [1] is a problem where given k planar graphs we ask whether they can be simultaneously embedded so that the embedding of each graph is planar and common edges are dr...