AWAN

Open to internships & collaborations

CS STUDENT building intelligent solutions.

Computer Science student at University of Saarland, specializing in System Programming, Theoretical Computer Science, Software Engineering and Compiler Construction. Driven by curiosity to solve complex problems through innovative technology.

View My Work ↗ Learn More

Saarbrücken, Germany

49.2433° N, 6.9513° E

10+

Projects

Years at University

25+

Technical Skills

Scroll to explore

C++

Java

Python

Kotlin

HTML

Scala

SQL

Django

Git

Docker

GitHub

CSS3

JavaScript

LLVM

PowerPoint

Excel

Word

Overleaf

Lazarus

OCaml

C++

Java

Python

Kotlin

HTML

Scala

SQL

Django

Git

Docker

GitHub

CSS3

JavaScript

LLVM

PowerPoint

Excel

Word

Overleaf

Lazarus

OCaml

Who I Am

Computer Science Student.

I'm Huzaifa Ahmad Awan, a passionate CS student at University of Saarland specializing in System Programming, Complexity Theory, Software Engineering and Compiler Construction.

I don't just learn theory — I build and implement solutions. From low-level RISC-V system programming to advanced AI heuristics, I thrive on solving complex technical problems.

Driven by curiosity, I explore the frontier of what's technically possible. I excel in competitive environments and deliver high-quality solutions under pressure.

Currently based in Saarbrücken, Germany. Looking for internships and collaborations on challenging projects.

System Programming

Low-level systems expertise: RISC-V assembly, interrupt handling, process scheduling, memory management and more.

Compiler Construction

Full compiler pipeline: Lexing, parsing, semantic analysis, code generation and optimization. Deep understanding of language design.

Automatic testing

Experience with writing and maintaining automated tests for software projects. Ensuring code quality and reliability.

Problem Solving

Strong foundation in algorithms, data structures and mathematics. Delivering clean, efficient and scalable code.

Learning Path

Education

Oct. 2023 - Present

B.Sc. Computer Science

University of Saarland

Focus on Theoretical Computer Science, Software Engineering and Compiler Construction. Relevant coursework: Algorithms & Data Structures, Software Engineering, Compiler Construction, System Architecture, Algorithms and Complexity, Just beyond P.

Software Engineering AI Compilers Algorithms Complexity

Aug. 2017 - Jun. 2023

Abitur

Albert-Einstein-Gymnasium

Advanced courses in Mathematics and Physics. Strong STEM foundation with excellent grades in core technical subjects. Foundation for advanced computer science studies.

Mathematics Physics

Professional Journey

Experience

Apr. 2025 – Jun. 2025 and Jul. 2023 – Aug. 2023

Working Student

ZF Friedrichhafen AG

Support in the assembly and production of gearbox units according to technical specifications, with a focus on efficient and precise work processes. Conducting functional and visual inspections to ensure correct assembly.

Manufacturing Quality Control Assembly

Jul. 2022 – Mar. 2023

Retail Sales Assistant

Netto Marken-Discount

Responsibility for goods receipt, presentation, placement and price labeling in the food sector. Performed all cashier activities including cash register reconciliation with high accuracy.

Retail Management Customer Service Cash Handling

Nov. 2019 – Nov. 2019

Sales & Decoration Intern

Anson's Herrenhaus KG

Supported sales operations through customer consultation and product presentation during a student internship. Gained hands-on experience in merchandising and customer-facing responsibilities.

Sales Support Visual Merchandising Teamwork

Academic Work

Research& Publications.

Metric Clustering to Minimize the Sum of Radii

Theorem 1.
There exists a randomized algorithm that, given a set P of n points in a metric space and an integer k, runs in n^{O(log n · log Δ)} time and returns, with probability ≥ 1/2, an optimal k-cover for P.

QPTAS Approximation Algorithms NP-Hard Complexity Theory k-Cover

View Presentation ↗ Visualizer ↓

Just Beyond P · Max-Plack-Institut · 2025/26

Approximation Algorithms for NP-Hard Graph Problems

Presentation:
This presentation explores the role of approximation algorithms in solving NP-hard problems where exact solutions are computationally infeasible.

Approximation NP-Hard Graphs Algorithm and Complexity

View Presentation ↗

Algorithm and Complexity · CISPA · 2025

Graphs Introduction

Presentation:
This presentation introduces different types of graphs and their computer representations, such as adjacency matrices and lists. Demonstrates Dijkstra's algorithm for finding shortest paths efficiently in weighted graphs.

Graphs Algorithm and Complexity