parsonlabs
Here are 226 public repositories matching this topic...
Custom Voxel Engine Procedurally Generating & Lazy Loading 3D Chunks using Perlin Noise, Lighting Amplified by Ambient Occlusion, Model Transforms, Screen-Space Reflection, Depth Sampling & Frustum Culling
-
Updated
Sep 19, 2025 - Rust
x86_64 Operating System in Rust with Bootloader, Interrupt Handling, Window Manager, VGA Graphics Driver, Terminal Emulation and Software-Rendered 3D Graphics in a no_std Environment All Memory Safe
-
Updated
Mar 21, 2025 - Rust
A Low-Level and Cycle Accurate Super Nintendo Emulator with WDC 65816 CPU Emulation, Full PPU Layering and Mode 7 Support, APU SPC700 & DSP Emulation, DMA/HDMA Timing, Cartridge Memory Mapping with LoROM/HiROM, and Expansion Chip Support (SA-1, SuperFX)
-
Updated
May 20, 2025 - Go
Indefinite Integral is the Integral of a Function Without any Specified Limits, the Family of Anti-Derivatives of the Function, Expressed As: ∫f(x)dx=F(x)+C.
-
Updated
Nov 1, 2025 - Rust
Cycle Accurate Game Boy Advance Emulator with ARM7TDMI CPU Emulation, Accurate BIOS and Memory Timings, Pixel-Perfect PPU Rendering, DMA, Timer and Interrupt Handling, Cartridge Save Support, Real-Time Clock Emulation, and Debuggable Execution with Audio
-
Updated
May 23, 2025 - Go
The DPLL Algorithm is a Complete, Backtracking-Based Search Algorithm Designed to Solve the Boolean Satisfiability Problem (SAT) for Formulas in Conjunctive Normal Form (CNF)
-
Updated
Nov 20, 2025 - Rust
The General Number Field Sieve (GNFS) is the Most Efficient Classical Algorithm Known for Factoring Extremely Large Composite Integers, Typically Those Over 100 Decimal Digits (Like Those Used in RSA Cryptography)
-
Updated
Nov 24, 2025 - Rust
The Robertson-Seymour Theorem (or Graph Minors Theorem) States that the Class of Finite Undirected Graphs is Well-Quasi-Ordered by the Graph Minor Relation, Thereby Proving that any Graph Property Closed Under Taking Minors can be Characterized by a Finite Set of Forbidden Minors
-
Updated
Nov 22, 2025 - Rust
Syntax Analysis for Unused Variable & Function Symbols, Supporting; C, C++, JavaScript, TypeScript, Python, Go, Rust & Java
-
Updated
May 2, 2025 - Zig
Line Sweep Algorithm Simulates a Line ("Sweep Line") Moving Across a 2-Dimensional, Processing Geometric Objects, Used in Computer Geometry
-
Updated
Oct 18, 2025 - Rust
Showcasing the Difference in Execution Efficiency Between Emulator Interpreters vs Just-In-Time Dynamic Recompilers (JIT-Dynarec) with 100 Million Iterations
-
Updated
May 17, 2025 - Rust
A Minimal and Interpreted CHIP-8 Emulator with Monochrome Display, Opcode-Level Accuracy, Quirks Mode Compatibility, Timers, Hex Keypad Input, and SuperCHIP Instruction Support for Extended Graphics and Resolution
-
Updated
May 7, 2025 - Go
Cross-Platform System Emulator for the Nintendo DS; Formerly Project Nitro / IRIS — Complete System Emulation of Asymmetrical Dual-Core, 32-bit ARM946E-S (67MHz) and ARM7TDMI Co-Processor (33MHz) with respective ARM & THUMB Instructions, High Speed Tightly Coupled Memory (TCM) Hardware-Accelerated GPU for Integer Scaling up to 8x at 4k.
-
Updated
Aug 15, 2025 - Rust
Enhanced Subpixel Morphological Anti-Aliasing is an Image Based Implementation of Morphological Anti-Aliasing which Detects Edges in the Final Rendered Image, Finding Specific Patterns in These Edges, and Then Blending Pixels along These Borders to Reduce Jagged Edges
-
Updated
May 11, 2025 - Rust
Stream Control Transmission Protocol (SCTP) with Common Header (Source Port, Destination Port, Verification Tag, Checksum) & Chunk-Based Data. Provides Reliable, Message-Oriented Delivery with Multi-Streaming, Multi-Homing & Four-Way Handshake using Transmission Sequence Numbers (TSN), ideal for Telecom & WebRTC Applications.
-
Updated
Oct 5, 2025 - Rust
Union-Find (Disjoint Set Union) Efficiently Keeps Track of a Collection of Elements Partitioned Into a Number of Disjointed Sets, Ideal for Determining if Two Elements are in The Same Set / Merge Two Sets Together. Used in Dynamic Programming
-
Updated
Oct 15, 2025 - Rust
Van Emde Boas (vEB) Trees are a Sophisticated Data Structure Designed to Efficiently Perform Operations on a Set of Integers Within a Fixed Universe in O(log log n)
-
Updated
Nov 4, 2025 - Rust
Generative Model using Markov's Chain Algorithm to Analyse a Corpus of Text to Learn Statistical Patterns of Word Sequences & Use Those Patterns to Generate New, Original Text
-
Updated
Jul 1, 2025 - Go
Improve this page
Add a description, image, and links to the parsonlabs topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the parsonlabs topic, visit your repo's landing page and select "manage topics."