HN Malik Mir Hamza Nayab

Malik Mir Hamza Nayab


Computer science researcher investigating comparison-based adaptive sorting, low-resource multilingual NLP architectures, and scalable full-stack web platforms.

View Research Explore Projects Download CV (PDF)

3.72 / 4.0 BS Computer Science COMSATS University Islamabad
1.45× LadderSort Speedup Over std::sort on real workloads
54,263 Roman Urdu Corpus Zenodo DOI Repository
GDGoC Interim & Co-Lead Google Developer Groups

About Me


Malik Mir Hamza Nayab is a computer science researcher and software engineer who graduated with a Bachelor of Science in Computer Science from COMSATS University Islamabad, Abbottabad Campus (CGPA 3.72/4.0), and was recognized as Salutatorian at Edwardes College Peshawar. His academic background is grounded in core computing fundamentals, spanning advanced Data Structures & Algorithms, Operating Systems, Parallel & Distributed Computing, and Compiler Construction.

Hamza’s research focuses on algorithmic optimization and low-resource multilingual machine learning. As first author, he developed LadderSort, a novel deterministic adaptive sorting algorithm in C++ that dynamically adapts to the minimum number of nondecreasing subsequences, proving algorithmic optimality and achieving up to 1.45× wall-clock speedups over std::sort and TimSort on 100M-element workloads. In NLP, he formulated the Dialect Robustness Index (DRI) to benchmark Arabic Pre-trained Language Models and published the largest open-access Roman Urdu GoEmotions dataset (54,263 samples) on Zenodo.

In parallel, Hamza engineers production software. As sole developer, he built and launched MiddelMen (TrustThread), a social-commerce platform leveraging React/Vite, Node.js/Express, and Serverless PostgreSQL. As Interim Lead and Co-Lead for Google Developer Groups on Campus (GDGoC) at COMSATS Abbottabad, he directed multi-track technical bootcamps and spearheaded regional industry collaborations.


Featured Highlights


LadderSort: Adaptive Stable Sorting for Partially Ordered Data

Under Review
First Author, Advised by Dr. Osman Khalid — Manuscript Submitted
  • Engineered a novel deterministic, comparison-based sorting algorithm in C++ that dynamically adapts to input order, formally proving algorithmic optimality.
  • Achieved up to 1.45× wall-clock speedups over std::sort and TimSort on Apple M1 architectures handling datasets up to 100M elements.
C++ Algorithms Data Structures Benchmarking

MiddelMen Logo MiddelMen (TrustThread)

Live Production
Full-Stack Sole Developer — Scalable Social-Commerce Trust Platform
  • Architected and deployed a decoupled React/Vite SPA on Vercel Edge and a Node.js/Express REST API on Heroku with GitHub Actions CI/CD.
  • Designed normalized relational schemas using Neon Serverless PostgreSQL and Drizzle ORM to enforce multi-role RBAC, verified seller reviews, and dispute logging.
React Node.js TypeScript PostgreSQL Cloudflare R2
Direct Email GitHub Profile