1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CG2015★ 1 cited
Two-Level Rectilinear Steiner Trees
Stephan Held, Nicolas Kämmerling
Given a set of terminals in the plane and a partition of into subsets , a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree …
cs.AR2014
Fast Prefix Adders for Non-Uniform Input Arrival Times
Stephan Held, Sophie Spirkl
We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. This problem arises whenever the adder is embedded into a more co…