| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Original HTTPS Page] |
Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior. Learn more about reporting abuse.
Report abuseWhere mathematical abstraction meets highly efficient logic.
I am a 4th-year student at Universidad Complutense de Madrid (UCM). My focus bridges the gap between rigorous mathematical analysis and software implementation. I am deeply passionate about Artificial Intelligence, optimization algorithms, and solving complex problems through advanced programming paradigms.
| Area | Technologies |
|---|---|
| Core & Systems | C/C++ (Memory management, ADTs), Python (Simulation, HPC) |
| Logic & Declarative | Haskell (Functional), Prolog, Maude (Logic programming / Algebraic specification) |
| Math & Data | Matlab, R (Numerical Analysis), LaTeX, Zotero |
A critical comparative analysis between shortest-path algorithms and machine learning approaches to solve dynamic environments.
A robust C++ library of Abstract Data Types built from scratch. Categorized implementation of linear structures, BSTs, Heaps, and Hash Tables with formal algebraic specifications and rigorous O(n) complexity analysis.
Python-based GPGPU simulation emulating Streaming Multiprocessors (SMs) and thread-level parallelism for High-Performance Computing (HPC). Features SIMT synchronization and shared memory mapping.
Implementation in Haskell to solve the Traveling Salesperson Problem (TSP). Applies advanced functional programming techniques to optimize colony behavior.
Bio-inspired optimization: A functional approach to solving the TSP using Ant Colony Optimization in Haskell
Haskell 1
Python-based simulation of a GPGPU architecture, emulating Streaming Multiprocessors (SMs) and thread-level parallelism for high-performance computing (HPC)
Python
A robust C++ library of Abstract Data Types (ADTs) built from scratch. Features linear structures, trees, heaps, and hash tables with formal algebraic specifications and rigorous $O(n)$ complexity …
C++ 1
| Back | FazBrowse Home | New Git URL |