Shlomo Moran

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 Tamar Eilam

> Home > Persons > Shlomo Moran

Publications

2002
[j71]
- view
  authority control:
- export record
  dblp key:
  - journals/jsac/EilamMZ02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsac/EilamMZ02
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J. Sel. Areas Commun. 20(1): 172-182 (2002)
[j70]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/EilamMZ02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/EilamMZ02
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289(1): 85-104 (2002)
2000
[j64]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DinitzEMZ00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DinitzEMZ00
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks:
On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000)
[c41]
- view
  authority control:
- export record
  dblp key:
  - conf/wdag/EilamMZ00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/EilamMZ00
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118
1999
[j63]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/EilamMZ99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/EilamMZ99
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999)
1997
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/istcs/DinitzEMZ97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/istcs/DinitzEMZ97
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks:
On the total_k-diameter of connection networks. ISTCS 1997: 96-106
[c36]
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sirocco/EilamMZ97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/EilamMZ97
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/wdag/EilamMZ97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/EilamMZ97
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997: 37-51
1996
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/wdag/EilamMZ96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/EilamMZ96
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
A Lower Bound for Linear Interval Routing. WDAG 1996: 191-205

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.