"Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out."

Michael Kaufmann (1984)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2023-08-09

- no documents available
- export record
  dblp key:
  - conf/caap/Kaufmann84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/caap/Kaufmann84
Michael Kaufmann:
Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. CAAP 1984: 169-180

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.