Hamed M. K. Alazemi

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 Anton Cerný

> Home > Persons > Hamed M. K. Alazemi

Publications

2013
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/AlazemiC13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/AlazemiC13
Hamed M. K. Alazemi, Anton Cerný:
Several extensions of the Parikh matrix L-morphism. J. Comput. Syst. Sci. 79(5): 658-668 (2013)
2011
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/ijfcs/AlazemiC11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/AlazemiC11
Hamed M. K. Alazemi, Anton Cerný:
Counting subwords Using a Trie Automaton. Int. J. Found. Comput. Sci. 22(6): 1457-1469 (2011)
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/tcom/KiaeiSCAA11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcom/KiaeiSCAA11
Mohammad S. Kiaei, Samir Sebbah, Anton Cerný, Hamed M. K. Alazemi, Chadi Assi:
Efficient Network Protection Design Models using Pre-Cross-Connected Trails. IEEE Trans. Commun. 59(11): 3102-3110 (2011)
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/icccn/KiaeiSCAA11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icccn/KiaeiSCAA11
Mohammad S. Kiaei, Samir Sebbah, Anton Cerný, Hamed M. K. Alazemi, Chadi Assi:
Survivable Network Design Models Based on Pre-Cross-Connected Trails. ICCCN 2011: 1-7

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.