Masud Hasan

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 Ashik Zinnat Khan

> Home > Persons > Masud Hasan

Publications

2011
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/jcb/FirozHKR11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/FirozHKR11
Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time. J. Comput. Biol. 18(8): 1007-1011 (2011)
2010
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/walcom/FirozHKR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/FirozHKR10
Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. WALCOM 2010: 161-166
2009
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0910-3292
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0910-3292
Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time. CoRR abs/0910.3292 (2009)

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.