Sophie Spirkl
Princeton University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Sophie Spirkl.
international symposium on physical design | 2014
Stephan Held; Sophie Spirkl
We study the minimum rectilinear Steiner tree problem in the presence of obstacles. Traversing obstacles is not strictly forbidden, but the total length of each connected component in the intersection of the tree with the interior of the blocked area is bounded by a constant. This problem is motivated by the layout of repeater tree topologies, a central task in chip design. Large blockages might be crossed by wires on higher layers, but repeaters may not be placed within the blocked area. A too long unbuffered piece of interconnect would lead to timing violations. We present a 2-approximation algorithm with a worst case running time of O(k log k)^2, where k is the number of terminals plus the number of obstacle corner points. Under mild assumptions on the obstacle structure, as they are prevalent in chip design, the running time is O(k log k)^2. Compared to strictly obstacle-avoiding trees, the algorithm provides significantly shorter solutions. It solves real world instances with 783\,352 terminals within 126 seconds, proving its practical applicability.
Algorithmica | 2017
Stephan Held; Sophie Spirkl
We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. In modern computer chips, adders with up to hundreds of inputs occur frequently, and they are often embedded into more complex circuits, e.g. multipliers, leading to instance-specific non-uniform input arrival times. Most previous results are based on representing binary carry-propagate adders as parallel prefix graphs, in which pairs of generate and propagate signals are combined using complex gates called prefix gates. Examples of commonly-used adders are constructed based on the Kogge–Stone or Ladner–Fischer prefix graphs. Adders constructed in this model usually minimize the delay in terms of these prefix gates. However, the delay in terms of logic gates can be worse by a factor of two. In contrast, we aim to minimize the delay of the underlying logic circuit directly. We prove a lower bound on the delay of a carry bit computation achievable by any prefix carry bit circuit and develop an algorithm that computes a prefix carry bit circuit with optimum delay up to a small additive constant. Our algorithm improves the running time of a previous dynamic program for constructing a prefix carry bit from
Journal of Combinatorial Theory | 2018
Anita Liebenau; Marcin Pilipczuk; Paul D. Seymour; Sophie Spirkl
Journal of Combinatorial Theory | 2018
Maria Chudnovsky; Frédéric Maffray; Paul D. Seymour; Sophie Spirkl
\mathcal {O}(n^3)
Discrete Mathematics | 2018
Maria Chudnovsky; Paul D. Seymour; Sophie Spirkl; Mingxian Zhong
Discrete Applied Mathematics | 2018
Celina M. Herrera de Figueiredo; Sophie Spirkl
O(n3) to
Algorithmica | 2018
Maria Chudnovsky; Celina M. Herrera de Figueiredo; Sophie Spirkl
workshop on graph theoretic concepts in computer science | 2017
Maria Chudnovsky; Oliver Schaudt; Sophie Spirkl; Maya Stein; Mingxian Zhong
\mathcal {O}(n \log ^2 n)
ACM Transactions on Algorithms | 2017
Stephan Held; Sophie Spirkl
arXiv: Combinatorics | 2018
Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong
O(nlog2n) while simultaneously improving the delay and size guarantee, where n is the number of bits in the summands. Furthermore, we use this algorithm as a subroutine to compute a full adder in near-linear time, reducing the delay approximation factor of 2 from previous approaches to 1.441 for our algorithm.