Dieter Rautenbach

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Stephan Held

> Home > Persons > Dieter Rautenbach

Publications

2011
[p1]
- view
  authority control:
- export record
  dblp key:
  - series/natosec/HeldKRV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/natosec/HeldKRV11
Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen:
Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications 2011: 33-96
2010
[j96]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/BartoschekHMRV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BartoschekHMRV10
Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen:
The repeater tree construction problem. Inf. Process. Lett. 110(24): 1079-1083 (2010)
2009
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/ispd/BartoschekHRV09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ispd/BartoschekHRV09
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD 2009: 43-50
2006
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/ispd/BartoschekHRV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ispd/BartoschekHRV06
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Efficient generation of short and fast repeater tree topologies. ISPD 2006: 120-127

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.