Referenzen
30. |
Vehicle routing with subtours
Discrete Optim.,
33:87--100
2019
|
29. |
Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
ACM Trans. Algorithms,
14(1):Art. 4, 18
2018
DOI: 10.1145/3147215
|
28. |
Binary Adder Circuits of Asymptotically MinimumDepth, Linear Size, and Fan-Out Two
ACM Transactions on Algorithms, to appear,
2017
|
27. |
Fast Prefix Adders for Non-uniform Input Arrival Times
Algorithmica,
77(1):287--308
2017
|
26. |
Fast prefix adders for non-uniform input arrival times
Algorithmica,
77(1):287--308
2017
|
25. |
Global Routing with Timing Constraints
IEEE Transactions on Computer-Aided Design ofIntegrated Circuits and Systems,
2017
|
24. |
Two-level rectilinear Steiner trees
Computational Geometry,
61:48--59
2017
|
23. |
Two-level rectilinear Steiner trees
Comput. Geom.,
61:48--59
2017
|
22. |
Gate Sizing
Electronic Design Automation for IC Implementation,Circuit Design, and Process Technology: Circuit Design,and Process Technology,
:245
2016
|
21. |
Global routing with inherent static timing constraints
Proceedings of the IEEE/ACM International Conferenceon Computer-Aided Design
, Seite 102--109.
IEEE Press
2015
|
20. |
Local search algorithms for timing-driven placementunder arbitrary delay models
Proceedings of the 52nd Annual Design AutomationConference
, Seite 29.
ACM
2015
|
19. |
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
|