You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Methods in numerical analysis. Includes: Lagrange interpolation, Chebyshev polynomials for optimal node spacing, iterative techniques to solve linear systems (Gauss-Seidel, Jacobi, SOR), SVD, PCA, and more.
Ultra-low latency C++20 Smart Order Router for crypto perpetuals. Features an O(N) K-way merge phase that eliminates std::sort, pure-integer greedy allocation, and regime-aware dynamic latency penalties based on volatility and book imbalance. Zero heap allocations and exception-free.
Ultra low-latency Smart Order Router + institutional OMS for crypto perpetuals. K-way merge, greedy fill, EWMA latency penalty, pre-trade risk engine, zero heap on the critical path. 1–3 µs per decision across 5 exchanges. C++20.
Código de ejemplo para la asignatura de "Sistemas operativos y Redes computacionales", el problemas de concurrencia en procesos llamado "Los fumadores"
Zero-dependency TypeScript parser for OTDR SOR (Standard OTDR Record) files. Supports Bellcore/Telcordia SR-4731 v1.x and v2.x. Works in Node.js and browsers.
Desktop app. Evaluates system of equations. Six different methods. Three Direct methods: Gaussian Elimination, Gauss Jordan, LU Decomposition. Three iterative methods: Jacobi, Gauss Seidal, Successive Over Relaxation (SOR).