Dr. Muhammad Aasim Qureshi
My Social Links

Dr. Muhammad Aasim Qureshi

Senior Assistant Professor
Bahria University Lahore, Pakistan


Highest Degree
Ph.D. in Algorithm Design from Universiti Teknologi PETRONAS, Malaysia

Share this Profile

Area of Interest:

Computer Sciences
100%
Information Technology
62%
Information Security
90%
Artificial Intelligence
75%
Data Structures
55%

Research Publications in Numbers

Books
0
Chapters
0
Articles
27
Abstracts
0

Selected Publications

  1. Ali, A. and M.A. Qureshi, 2015. Using morpho-syntactic tagging in English-to-Urdu statistical machine translation. Sci. Int., 27: 4433-4436.
    Direct Link  |  
  2. Safdar, S., M.F. Hassan, M.A. Qureshi and R. Akbar, 2011. Effective methods for secure authentication in vulnerable workflows using nxn passwords. Inform. Technol. J., 10: 1161-1169.
    CrossRef  |  Direct Link  |  
  3. Qureshi, M.A., M.F. Hassan, S. Safdar and R. Akbar, 2011. A framework to recover single link failure on shortest path in shortest path tree. J. Applied Sci., 11: 2916-2923.
    Direct Link  |  
  4. Qureshi, M.A., M.F. Hassan, R. Sammi, S. Safdar and R. Akbar, 2011. Shortest path tree with embedded backups-an exhaustive link failure recovery algorithm. J. Artif. Intell., 4: 143-155.
    CrossRef  |  Direct Link  |  
  5. Akbar, R., M.F. Hassan, M.A. Qureshi and S. Safdar, 2011. Structured role based interaction model for agile based outsourced IT projects: Client's composite structure. Inform. Technol. J., 10: 1009-1016.
    CrossRef  |  Direct Link  |  
  6. Akbar, R., M.F. Hassan, A. Abdullah, S. Safdar and M.A. Qureshi, 2011. Directions and advancements in global software development: a summarized review of GSD and agile methods. Res. J. Inform. Technol., 3: 69-80.
    CrossRef  |  Direct Link  |  
  7. Safdar, S., M.F. Hassan, M.A. Qureshi and R. Akbar, 2009. Biologically inspired execution framework for vulnerable workflow systems. Int. J. Comput. Sci. Inform. Secur., 6: 47-51.
  8. Qureshi, M.A., F.B. Hassan, S. Safdar and R. Akbar, 2009. A O(|E|) time shortest path algorithm for nonnegative weighted undirected graphs. Int. J. Comput. Sci. Inform. Secur., 6: 40-46.
    Direct Link  |