Publications
Publications
Referenzen
30.
Stephan Held, Jochen Könemann und Jens Vygen
Vehicle routing with subtours
Discrete Optim., 33:87--100
2019
29.
Stephan Held und Sophie Theresa Spirkl
Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
ACM Trans. Algorithms, 14(1):Art. 4, 18
2018
28.
S. Held und S.~T. Spirkl
Binary Adder Circuits of Asymptotically MinimumDepth, Linear Size, and Fan-Out Two
ACM Transactions on Algorithms, to appear,
2017
27.
Stephan Held und Sophie Spirkl
Fast Prefix Adders for Non-uniform Input Arrival Times
Algorithmica, 77(1):287--308
2017
26.
Stephan Held und Sophie Spirkl
Fast prefix adders for non-uniform input arrival times
Algorithmica, 77(1):287--308
2017
25.
Stephan Held, Dirk Muller, Daniel andScheifele, Rudolf Rotter, Vera Traub und Jens Vygen
Global Routing with Timing Constraints
IEEE Transactions on Computer-Aided Design ofIntegrated Circuits and Systems,
2017
24.
Stephan Held und Nicolas Kämmerling
Two-level rectilinear Steiner trees
Computational Geometry, 61:48--59
2017
23.
Stephan Held und Nicolas Kämmerling
Two-level rectilinear Steiner trees
Comput. Geom., 61:48--59
2017
22.
Stephan Held und Jiang Hu
Gate Sizing
Electronic Design Automation for IC Implementation,Circuit Design, and Process Technology: Circuit Design,and Process Technology, :245
2016
21.
Stephan Held, Dirk Müller, Danieland Traub, Vera Rotter und Jens Vygen
Global routing with inherent static timing constraints
Proceedings of the IEEE/ACM International Conferenceon Computer-Aided Design , Seite 102--109.
IEEE Press
2015
20.
Adrian Bock, Stephan Held, Nicolas Kämmerling und Ulrike Schorr
Local search algorithms for timing-driven placementunder arbitrary delay models
Proceedings of the 52nd Annual Design AutomationConference , Seite 29.
ACM
2015
19.
Stephan Held und Sophie Theresa Spirkl
A fast algorithm for rectilinear steiner trees withlength restrictions on obstacles
Proceedings of the 2014 on International symposium onphysical design , Seite 37--44.
ACM
2014
Seite:  
Previous | 0, 1 | Next
Export als:
BibTeX, XML