Efficient implementations of Merge Sort and Bitonic Sort algorithms using CUDA for GPU parallel processing, resulting in accelerated sorting of large arrays. Includes both CPU and GPU versions, along with a performance comparison.

The repository provides code, build instructions, and usage guidelines for each FFT implementation.

This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

Preemptive Priority Scheduling algorithm in Java

Spring 2021 - Automation of Scientific Research - course project

🌐 Explore biological and ecological networks with ggNetView, an R package offering flexible tools for effective network analysis and visualization.

This repository contains a curated collection of fundamental algorithms implemented in C++, covering essential topics such as sorting, searching, graph traversal, dynamic programming, and greedy algorithms. Each implementation is designed for clarity and educational value, making it an excellent resource for students, educators,

A C++ program that adds two non-negative integers represented by reverse-ordered linked lists and returns the sum as a new linked list, simulating digit-by-digit addition in reverse order.

Algorithm and data structures implementation for contests

An implementation of a novel Gradient Boosting algorithm inspired by ARMA models, as detailed in the associated IEEE paper on nonlinear sequential regression.

🎤 Fine-tune the Llasa TTS model with GRPO using Hugging Face tools to enhance performance and evaluate rewards with Whisper ASR and WER metrics.

Unlock the world of clandestine communication with Python's XOR cipher, enabling the concealment and revelation of messages through sophisticated encryption and decryption techniques.

Spring 2021 - Automation of Scientific Research - course project

Curve25519 and Secp256k1 plot from Weierstrass Polynomial Form. Key topics covered include - Elliptic Curve Cryptography (ECC) - Cryptographic Curves

Fundamentals of Computer Algorithms" (Second Edition) by Ellis Horowitz, Sartaj Sahni, and Sanguthevar Rajasekaran

Notes, algorithms, and final project for Discrete Mathematics II – Computer Science @ FAMAF (UNC)

A repository showcasing implementations of various algorithms, including graph algorithms (BFS, DFS, Dijkstra, Kruskal), dynamic programming solutions, and more. Designed for learning, practice, and demonstration of algorithmic problem-solving.

Implementation of Chang-Roberts Election Algorithm in OMNeT++ Discrete Event Simulator

A hypergraph matching algorithm for efficient virtual resource allocation in mobile edge computing, based on the approach proposed in the paper L. Zhang, H. Zhang, L. Yu, H. Xu, L. Song and Z. Han, "Virtual Resource Allocation for Mobile Edge Computing: A Hypergraph Matching Approach"

This repository hosts the automatically updated Javadoc documentation for the MEC Virtual Resource Allocation project.

This Ruby implementation of DES (Data Encryption Standard) allows users to encrypt and decrypt messages using a symmetric key. DES is a block cipher that works on 64-bit blocks of data and uses a 56-bit key.

Этот репозиторий содержит материалы для выполнения лабораторных работ по курсу "Моделирование систем" . Здесь вы найдете реализации различных моделей, включая: Моделирование случайных величин. Анализ систем массового обслуживания (СМО). Статистический анализ данных. Сравнение алгоритмов сортировки и другие задачи.

This project uses secp256k1, keccak256 hashing, and BIP39 for generating vanity addresses, implementing secure cryptographic operations and creating mnemonic phrases.

Soluções LeetCode e trabalhos acadêmicos focados em algoritmos de estruturas de dados, árvores binárias e algoritmos de ordenação (merge sort, quick sort). Desenvolvido para AED I (2025/1) com foco em implementações práticas.

A collection of LeetCode problem solutions in various languages.

This project is about sort data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed it must have to manipulate various types of algorithms and choose the most appropriate solution (out of many) for an optimized data sorting.

A C-based application designed to manage student information efficiently Key features includes: Student Management, Search and Display, File I/O, Data Analysis

A high-performance polynomial regression implementation in pure C with gradient descent optimization and visualization support.

A computational simulation engine predicting call blocking probabilities in 6G telecommunication networks using Roberts-Kaufman and RLA algorithms.

Genetic Algorithm framework for solving the Traveling Salesman Problem (TSP) using evolutionary computation techniques.