"Low-cost minimum-time line-broadcasting schemes in complete binary trees."

Amir Averbuch, Iris Gaber, Yehuda Roditty (2001)

> Home

Details and statistics

DOI: 10.1002/NET.1036

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/AverbuchGR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/AverbuchGR01
Amir Averbuch, Iris Gaber, Yehuda Roditty:
Low-cost minimum-time line-broadcasting schemes in complete binary trees. Networks 38(4): 189-193 (2001)

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.