Games: From Logic and Automata to Algorithms
Explore the intersection of logic, automata, and algorithms through game theory, focusing on theoretical foundations and computational applications.
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Explore efficient algorithms for submodular maximization with knapsack constraints, focusing on nearly-linear time solutions and their applications in discrete optimization.
A 1.5-Approximation for Path TSP
Explores a 1.5-approximation algorithm for the Metric Path Traveling Salesman Problem, introducing novel techniques to handle larger s-t cuts and achieve a simplified approach matching Christofides' TSP algorithm.
The Approximation Ratio of the k-Opt Heuristic for Euclidean TSP
Explore the k-Opt heuristic's approximation ratio for Euclidean TSP, improving upper bounds and providing new lower bounds for k ≥ 3, applicable to various p-norms.
Gradient Descent and Stochastic Gradient Descent
Explore gradient descent and stochastic gradient descent in deep neural networks, covering convergence rates, learning rate effects, and challenges in optimization algorithms.
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Explore parallel algorithms for approximating undirected shortest paths using low hop emulators. Learn about innovative techniques and their applications in graph theory.
Theory Seminar - Algorithms and Hardness for Linear Algebra on Geometric Graphs, Aaron Schild
Explore algorithms and hardness for linear algebra on geometric graphs, focusing on efficient spectral graph theory and its limitations in high-dimensional spaces.
The Traveling Salesman Problem - When Good Enough Beats Perfect
Explore heuristic approaches and optimization techniques for the Traveling Salesman Problem, including nearest neighbor, greedy, Christofides, local search, simulated annealing, and ant colony optimization.
PageRank - A Trillion Dollar Algorithm
Explore the mathematical foundations and complexities of PageRank, the revolutionary search algorithm. Learn about Markov chains, stationary distributions, and their practical applications in web search technology.
Huffman Codes - An Information Theory Perspective
Explore the evolution of data compression algorithms, from information theory principles to Huffman's groundbreaking discovery, with practical examples and implementation insights.
A Strange But Elegant Approach to a Surprisingly Hard Problem - GJK Algorithm
Explore the ingenious Gilbert Johnson Keerthi algorithm for detecting object collisions, covering convexity, Minkowski sums, support functions, and implementation details in 2D space.
The Fast Fourier Transform - Most Ingenious Algorithm Ever?
Explore the Fast Fourier Transform algorithm through polynomial multiplication, discovering its efficiency in converting between coefficient and value representations for complex calculations.
Simple Steps for Solving Dynamic Programming Problems
Learn a systematic approach to tackle dynamic programming problems, illustrated with examples like longest increasing subsequence and optimal box stacking.
Depth First Search Explained - Algorithm, Examples, and Code
Comprehensive exploration of Depth First Search algorithm, covering implementation methods, traversal types, and practical applications in graph theory.
Towers of Hanoi - A Complete Recursive Visualization
Explore the Towers of Hanoi puzzle through a strategic approach, converting it into a recursive solution. Learn a framework for tackling complex recursive problems and analyze the unraveling of recursion.
Explained Gradient Descent Optimizer
Comprehensive explanation of gradient descent optimization, covering mathematical foundations, weight updates, and backpropagation for machine learning and deep learning applications.
The Word RAM Model - Lecture 6c of CS Theory Toolkit
Explore the Word RAM model for algorithms and its impact on integer sorting complexity in this graduate-level lecture on theoretical computer science fundamentals.
Bubble Sort With Example
Learn to implement and understand the Bubble Sort algorithm, including its efficiency and practical applications in sorting data structures.
Binary Search with Example
Learn efficient array searching techniques with binary search, reducing search space for faster implementation compared to linear search. Includes practical examples.
Searching an Element in Binary Search Tree - Data Structures
Learn efficient element searching in Binary Search Trees (BST) through key comparisons with the root node, navigating left or right subtrees based on value relationships.
Deletion of an Element from Binary Search Tree - Data Structures
Learn efficient techniques for deleting elements from a Binary Search Tree, enhancing your understanding of data structures and tree manipulation algorithms.