Search Results - Firoz, Jesun Sahariar

  • Showing 1 - 10 results of 10
Refine Results
  1. 1
    New Sufficient Conditions for Hamiltonian Paths

    New Sufficient Conditions for Hamiltonian Paths by Rahman, M. Sohel, Firoz, Jesun Sahariar, Kaykobad, M.

    Published in TheScientificWorld
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Synchronization-Avoiding Graph Algorithms

    Synchronization-Avoiding Graph Algorithms by Firoz, Jesun Sahariar, Zalewski, Marcin, Kanewala, Thejaka, Lumsdaine, Andrew

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  3. 3
    Adaptive Runtime Features for Distributed Graph Algorithms

    Adaptive Runtime Features for Distributed Graph Algorithms by Firoz, Jesun Sahariar, Zalewski, Marcin, Suetterlein, Joshua, Lumsdaine, Andrew

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  4. 4
    Comparison of Single Source Shortest Path Algorithms on Two Recent Asynchronous Many-task Runtime Systems

    Comparison of Single Source Shortest Path Algorithms on Two Recent Asynchronous Many-task Runtime Systems by Firoz, Jesun Sahariar, Barnas, Martina, Zalewski, Marcin, Lumsdaine, Andrew

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  5. 5
    Runtime Scheduling Policies for Distributed Graph Algorithms

    Runtime Scheduling Policies for Distributed Graph Algorithms by Firoz, Jesun Sahariar, Zalewski, Marcin, Lumsdaine, Andrew, Barnas, Martina

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  6. 6
    Distributed Control: Priority Scheduling for Single Source Shortest Paths Without Synchronization

    Distributed Control: Priority Scheduling for Single Source Shortest Paths Without Synchronization by Zalewski, Marcin, Kanewala, Thejaka Amila, Firoz, Jesun Sahariar, Lumsdaine, Andrew

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  7. 7
    New sufficient conditions for Hamiltonian paths

    New sufficient conditions for Hamiltonian paths by Rahman, M. S., Kaykobad, M., Firoz, J. S.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  8. 8
    Hybrid meta-heuristics for DNA fragment assembly problem for noiseless data

    Hybrid meta-heuristics for DNA fragment assembly problem for noiseless data by Firoz, J. S., Rahman, M. S., Saha, T. K.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  9. 9
    The Anatomy of Large-Scale Distributed Graph Algorithms

    The Anatomy of Large-Scale Distributed Graph Algorithms by Firoz, Jesun Sahariar, Thejaka, Amila Kanewala, Zalewski, Marcin, Barnas, Martina, Lumsdaine, Andrew

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in \(O(n\log n)\) Time

    The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in \(O(n\log n)\) Time by Firoz, Jesun Sahariar, Hasan, Masud, Khan, Ashik Zinnat, Rahman, M Sohel

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: