Reuven Bar-Yehuda

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 Michael Beder

> Home > Persons > Reuven Bar-Yehuda

Publications

2017
[j45]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Bar-YehudaBR17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Bar-YehudaBR17
Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A Constant Factor Approximation Algorithm for the Storage Allocation Problem. Algorithmica 77(4): 1105-1127 (2017)
2013
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/spaa/Bar-YehudaBR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/Bar-YehudaBR13
Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A constant factor approximation algorithm for the storage allocation problem: extended abstract. SPAA 2013: 204-213
2009
[j37]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Bar-YehudaBCR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Bar-YehudaBCR09
Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
Resource Allocation in Bounded Degree Trees. Algorithmica 54(1): 89-106 (2009)
2006
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/esa/Bar-YehudaBCR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/Bar-YehudaBCR06
Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
Resource Allocation in Bounded Degree Trees. ESA 2006: 64-75

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.