![]() | ![]() |
2008 | ||
---|---|---|
4 | EE | Dieter Rautenbach, Christian Szegedy, Jürgen Werber: On the cost of optimal alphabetic code trees with unequal letter costs. Eur. J. Comb. 29(2): 386-394 (2008) |
2007 | ||
3 | EE | Jürgen Werber, Dieter Rautenbach, Christian Szegedy: Timing optimization by restructuring long combinatorial paths. ICCAD 2007: 536-543 |
2 | EE | Dieter Rautenbach, Christian Szegedy, Jürgen Werber: The delay of circuits whose inputs have specified arrival times. Discrete Applied Mathematics 155(10): 1233-1243 (2007) |
2006 | ||
1 | EE | Dieter Rautenbach, Christian Szegedy, Jürgen Werber: Delay optimization of linear depth boolean circuits with prescribed input arrival times. J. Discrete Algorithms 4(4): 526-537 (2006) |
1 | Dieter Rautenbach | [1] [2] [3] [4] |
2 | Christian Szegedy | [1] [2] [3] [4] |