Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Algorithm Analysis

Showing: 156 courses
NPTEL

Design and Analysis of Algorithms

7 rewiews
Learn algorithm design and analysis, covering sorting, graphs, dynamic programming, and complexity theory. Gain practical skills in efficient problem-solving and algorithm implementation.
Add to list
56 Lesons
15 hours
On-Demand
Free-Video
Harvard University

Advanced Algorithms - COMPSCI 224

3 rewiews
Explore cutting-edge algorithmic techniques through comprehensive lectures, enhancing problem-solving skills and deepening understanding of complex computational challenges.
Add to list
25 Lesons
1 day 11 hours
On-Demand
Free-Video
Memorial University of Newfoundland

Data Structures and Algorithms

1 rewiews
Explore advanced data structures and algorithms, including sorting techniques, tree traversals, graph theory, and hash tables. Enhance problem-solving skills for efficient programming.
Add to list
19 Lesons
1 hour 30 minutes
On-Demand
Free-Video
NPTEL

Introduction to Algorithms and Analysis

1 rewiews
Comprehensive exploration of algorithmic concepts, from sorting and analysis to advanced data structures and graph algorithms, emphasizing practical implementation and theoretical foundations.
Add to list
60 Lesons
1 day 5 hours
On-Demand
Free-Video
NPTEL

Design & Analysis of Algorithms

1 rewiews
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Add to list
34 Lesons
1 day 6 hours
On-Demand
Free-Video
Great Learning

Sensitivity Analysis - Types of Sensitivity Analysis

1 rewiews
Explore sensitivity analysis techniques, applications, and practical demonstrations to enhance data-driven decision-making and assess variable impacts on outcomes in various domains.
Add to list
9 Lesons
54 minutes
On-Demand
Free-Video
Harvard University

CS50 2012 - Week 3 Continued: Search Algorithms and Sorting Techniques

0 rewiews
Explore efficient search and sorting algorithms, including linear and binary search, bubble sort, selection sort, and merge sort. Learn asymptotic notation for algorithm analysis.
Add to list
11 Lesons
1 hour 5 minutes
On-Demand
Free-Video
Stanford University

Stanford Lecture - Don Knuth - "A Conjecture That Had To Be True"

0 rewiews
Donald Knuth explores a fascinating problem in combinatorial geometry, presenting an intriguing formula and its unexpected universal application, showcasing the beauty of mathematical discovery.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Stanford University

The Analysis of Algorithms - 2015 Recreation of 1969 Lecture

0 rewiews
Explore the foundations of algorithm analysis with legendary computer scientist Donald Knuth as he recreates his inaugural Stanford lecture from 1969.
Add to list
1 Lesons
54 minutes
On-Demand
Free-Video
Stanford University

Hamiltonian Paths in Antiquity - Stanford Lecture 2016

0 rewiews
Explore the ancient origins of Hamiltonian paths with Donald Knuth, tracing their history from Graeco-Roman times through Sanskrit and Arabic documents, and their modern relevance in computer science.
Add to list
1 Lesons
1 hour 12 minutes
On-Demand
Free-Video
Stanford University

LZ and Universal Compression - Lecture 10

0 rewiews
Explore Lempel-Ziv algorithms and universal compression techniques in this Stanford lecture, delving into advanced data compression theory and applications.
Add to list
1 Lesons
1 hour 25 minutes
On-Demand
Free-Video
NPTEL

Design and Analysis of Algorithms

0 rewiews
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Add to list
34 Lesons
1 day 6 hours
On-Demand
Free-Video
NPTEL

Fundamental Algorithms - Design and Analysis

0 rewiews
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.
Add to list
20 Lesons
10 hours
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Optimal Binary Search Tree Using Dynamic Programming - Successful Searches Only

0 rewiews
Explore optimal binary search tree construction using dynamic programming for successful searches. Learn to minimize expected search time based on access frequencies.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
Neso Academy

Space Complexity of Recursive Algorithms - Solved Problem 3

0 rewiews
Analyze space complexity of recursive algorithms through a solved problem, enhancing understanding of memory usage in algorithmic design.
Add to list
1 Lesons
15 minutes
On-Demand
Free-Video
INSAIT Institute

Self-Adjusting Data Structures - Designing for Efficient Operation Sequences

0 rewiews
Explore self-adjusting data structures with Prof. Robert Tarjan. Learn about adaptive designs that optimize total operational costs, enhancing efficiency in various computational scenarios.
Add to list
1 Lesons
1 hour 13 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Optimal Binary Search Tree Using Dynamic Programming - Successful and Unsuccessful Searches

0 rewiews
Master optimal binary search tree construction using dynamic programming, considering both successful and unsuccessful searches. Enhance your understanding of efficient data structures and algorithms.
Add to list
1 Lesons
50 minutes
On-Demand
Free-Video
Great Learning

Selection Sort in Java

0 rewiews
Learn to implement and analyze Selection Sort in Java, covering its logic, implementation, time complexity, and practical applications.
Add to list
5 Lesons
30 minutes
On-Demand
Free-Video
Great Learning

Random Forest Regression

0 rewiews
Learn Random Forest Regression: its advantages, disadvantages, algorithm, and applications. Compare with logistic regression and explore its impact in machine learning across various domains.
Add to list
9 Lesons
49 minutes
On-Demand
Free-Video
Great Learning

Quick Sort Program in C

0 rewiews
Learn the QuickSort algorithm in C, including its implementation, time and space complexity, and practical examples. Gain a deep understanding of this efficient sorting technique.
Add to list
11 Lesons
39 minutes
On-Demand
Free-Video

Sorting Algorithm Lectures

0 rewiews
Comprehensive exploration of various sorting algorithms, covering their concepts, implementations, and complexities through a series of in-depth lectures.
Add to list
13 Lesons
4 hours 30 minutes
On-Demand
Free-Video

Design and Analysis of Algorithms

0 rewiews
Explore algorithm fundamentals, analysis techniques, and key concepts for GATE/NET exams. Learn to write effective algorithms and understand their properties.
Add to list
5 Lesons
30 minutes
On-Demand
Free-Video
Simple Snippets

Binary Search Tree Data Structure - How BST Has O(log N) Time Complexity for Searching? - DSA

0 rewiews
Comprehensive exploration of Binary Search Trees, covering structure, time complexity analysis, and comparisons with linear data types. Ideal for understanding BST efficiency.
Add to list
6 Lesons
39 minutes
On-Demand
Free-Video
Institute for Advanced Study

An Introduction to Boolean Function Analysis - Dor Minzer

0 rewiews
Explore Boolean function analysis, covering influences, PCP theory, and hypercontractive inequalities. Gain insights into fundamental concepts and advanced techniques in discrete mathematics and theoretical computer science.
Add to list
10 Lesons
1 hour 50 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Types of Time Complexities in Data Structures and Algorithms

0 rewiews
Explore various time complexity types in algorithm analysis, understanding their impact on performance and efficiency in solving computational problems.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
CodeWithHarry

How to Calculate Time Complexity of an Algorithm - Solved Questions

0 rewiews
Comprehensive guide to calculating time complexity in Hindi, covering Big O notation and algorithm analysis with practical examples and solved questions for interview preparation.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
CodeWithHarry

Best Case, Worst Case and Average Case Analysis of Algorithms

0 rewiews
Explore best, worst, and average case analysis for algorithms and data structures. Learn essential techniques to evaluate algorithm efficiency and performance in different scenarios.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video
CodeWithHarry

Asymptotic Notations - Big O, Big Omega and Big Theta Explained

0 rewiews
Comprehensive explanation of asymptotic notations used in algorithm analysis, covering Big O, Big Omega, and Big Theta with practical examples and downloadable notes.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Dijkstra's Algorithm - Finding Single Source Shortest Path

0 rewiews
Explore Dijkstra's algorithm for finding the shortest path in graphs. Learn its implementation, applications, and role in greedy methods for efficient problem-solving.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
ICTP-SAIFR

Computational Methods for Simulating and Analyzing Ecological Systems - Class 4

0 rewiews
Explore computational methods for ecological simulations and analysis, focusing on plotting techniques, floating points, and algorithmic problem-solving in quantitative ecology.
Add to list
14 Lesons
42 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Randomness and Complexity - Lecture 2

0 rewiews
Explore connections between randomness and complexity in mathematics, focusing on advanced concepts and their applications in discrete mathematics and computer science.
Add to list
1 Lesons
1 hour 26 minutes
On-Demand
Free-Video
Ryan O'Donnell

Fast Fourier Transform - Lecture 7c of CS Theory Toolkit

0 rewiews
Explore the Fast Fourier Transform algorithm and its application in efficient integer multiplication, with insights from a CMU graduate-level computer science theory course.
Add to list
5 Lesons
26 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Aspects of Convex, Nonconvex, and Geometric Optimization

0 rewiews
Explore advanced optimization techniques in convex, nonconvex, and geometric contexts with expert insights on signal processing applications and mathematical foundations.
Add to list
1 Lesons
1 hour 31 minutes
On-Demand
Free-Video
Alan Turing Institute

Optimisation - An Introduction: Professor Coralia Cartis, University of Oxford

0 rewiews
Explore optimization techniques, from basic concepts to advanced methods, covering minimizers, derivatives, quadratic functions, and gradient methods for solving complex mathematical problems.
Add to list
16 Lesons
2 hours 31 minutes
On-Demand
Free-Video
Ryan O'Donnell

Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit

0 rewiews
Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.
Add to list
17 Lesons
23 minutes
On-Demand
Free-Video
Simons Institute

Finding Large Cliques in Random and Semi-Random Graphs

0 rewiews
Explore algorithms for finding large cliques in graphs, including constructive arguments, polynomial-time proofs, and paradigms for tackling this NP-hard problem.
Add to list
12 Lesons
1 hour
On-Demand
Free-Video
Association for Computing Machinery (ACM)

An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games

0 rewiews
Explore advanced cutting plane methods for convex optimization and games, covering improved algorithms, runtime bottlenecks, data structures, and practical applications in computational mathematics.
Add to list
13 Lesons
24 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Provable Submodular Function Minimization via Fujishige Wolfe Algorithm

0 rewiews
Explore submodular function minimization through the Fujishige-Wolfe algorithm, analyzing its convergence and implications for combinatorial optimization.
Add to list
18 Lesons
25 minutes
On-Demand
Free-Video
Society for Industrial and Applied Mathematics

Functions of Matrices - Lecture 5

0 rewiews
Explore matrix functions with Nick Higham, covering algorithms, analysis, nonnormality bounds, and practical coding experiments for advanced mathematical understanding.
Add to list
11 Lesons
1 hour 44 minutes
On-Demand
Free-Video
Alan Turing Institute

The Sharp Threshold for Making Squares

0 rewiews
Explores the threshold for finding perfect square products in random integer sequences, combining number theory and probabilistic combinatorics to prove a conjecture on this sharp threshold.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Cutoff for Biased Transpositions in Card Shuffling

0 rewiews
Explore card shuffling algorithms and mixing times with biased transpositions, extending Diaconis and Shahshahani's work on random transpositions in deck shuffling.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
Simons Institute

Maximal Matching in Bounded-deletion Streams

0 rewiews
Explore maximal matching in bounded-deletion graph streams, analyzing space complexity as a function of deletion parameter K. Gain insights into algorithmic techniques and lower bound results.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
Tech with Tim

BigO Notation and Time Complexity Tutorial - Code Efficiency and Algorithm Analysis

0 rewiews
Learn to analyze algorithm efficiency using BigO notation and time complexity. Gain skills to write better code, choose optimal algorithms, and improve overall programming performance.
Add to list
17 Lesons
46 minutes
On-Demand
Free-Video
Paul G. Allen School

Regularizing the Irregular: Analyses and Transformations for Recursive, Irregular Applications

0 rewiews
Explores techniques for optimizing irregular programs operating on trees, using vector-based abstractions to enhance locality and enable vectorization in compiler research.
Add to list
1 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Quick Sort Using Divide and Conquer - Algorithm, Example, and Time Complexity

0 rewiews
Comprehensive exploration of Quick Sort algorithm, including divide-and-conquer approach, implementation examples, and time complexity analysis for efficient sorting techniques.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Binary Search Using Divide and Conquer - Time Complexity and Examples

0 rewiews
Explore binary search algorithm using divide and conquer approach, including implementation examples and time complexity analysis for efficient problem-solving in computer science.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video
Neso Academy

Space Complexity of Recursive Algorithms - Problem 4

0 rewiews
Master the calculation of space complexity in recursive algorithms through a detailed solved example demonstrating key analytical techniques and practical applications.
Add to list
1 Lesons
10 minutes
On-Demand
Free-Video
Institute for Advanced Study

When and How are Promise Constraint Satisfaction Problems Efficiently Solvable

0 rewiews
Delve into the mathematical foundations of Constraint Satisfaction Problems (CSP), exploring algorithmic efficiency, polymorphisms, and promise CSP applications in graph coloring and discrepancy minimization.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Differences Between Divide and Conquer and Dynamic Programming in Algorithm Design

0 rewiews
Understand key distinctions between Divide & Conquer and Dynamic Programming approaches in algorithm design, exploring their unique problem-solving methodologies and implementation strategies.
Add to list
1 Lesons
13 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Introduction to Hashing in Data Structures - Hash Functions, Hash Tables, Hash Keys, and Hash Values

0 rewiews
Master the fundamentals of hashing in data structures, including hash functions, tables, keys, and values. Learn efficient data storage and retrieval techniques for optimized programming solutions.
Add to list
1 Lesons
11 minutes
On-Demand
Free-Video
Squid: Schools for Quantum Information Development

Identity Check Problem for Shallow Quantum Circuits

0 rewiews
Explore an efficient classical algorithm for checking quantum circuit identity, focusing on shallow geometrically local circuits and their distance approximation to identity channels.
Add to list
1 Lesons
25 minutes
On-Demand
Free-Video
Centre for Networked Intelligence, IISc

Finite Time Analysis of Temporal Difference Learning with Linear Function Approximation: Tail Averaging and Regularization

0 rewiews
Delve into advanced temporal difference learning analysis, exploring tail-averaging techniques and regularization methods for improved convergence rates in reinforcement learning applications.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Paul G. Allen School

Network Security and Cryptography - Lecture 2

0 rewiews
Explore advanced network algorithms, protocols, and architectures in this comprehensive lecture on computer networking fundamentals and cutting-edge technologies.
Add to list
1 Lesons
2 hours 56 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

How to Calculate Time Complexity with Examples - Part 1

0 rewiews
Learn to calculate time complexity with practical examples, focusing on analyzing algorithms efficiently for better problem-solving and optimization in computer science.
Add to list
1 Lesons
25 minutes
On-Demand
Free-Video
Neso Academy

Space Complexity of Recursive Algorithms - nth Fibonacci Number

0 rewiews
Analyze space complexity of recursive algorithms using the nth Fibonacci number as an example. Explore the Fibonacci sequence and its implementation.
Add to list
1 Lesons
15 minutes
On-Demand
Free-Video
Aleksa Gordić - The AI Epiphany

Graph SAGE - Inductive Representation Learning on Large Graphs - GNN Paper Explained

0 rewiews
Deep dive into Graph SAGE, exploring its innovative approach to large-scale graph learning. Covers key concepts, training methods, aggregator functions, and comparisons with other graph neural networks.
Add to list
13 Lesons
44 minutes
On-Demand
Free-Video
Yannic Kilcher

Improving Intrinsic Exploration with Language Abstractions - Machine Learning Paper Explained

0 rewiews
Explores using natural language to improve reinforcement learning agents' exploration in sparse-reward environments, demonstrating significant performance gains across challenging tasks in MiniGrid and MiniHack.
Add to list
11 Lesons
42 minutes
On-Demand
Free-Video
Simons Institute

Beyond Worst-Case Analysis - Panel Discussion

0 rewiews
Experts discuss advanced algorithmic analysis, exploring beyond worst-case scenarios to improve efficiency and understanding in computer science and machine learning applications.
Add to list
14 Lesons
1 hour 10 minutes
On-Demand
Free-Video
Simple Snippets

Radix Sort (Bucket Sort) Sorting Algorithm - Part 1

0 rewiews
Comprehensive tutorial on Radix Sort algorithm, covering its working principles, implementation using queues, and step-by-step explanation with diagrams for efficient non-comparative sorting.
Add to list
5 Lesons
24 minutes
On-Demand
Free-Video
Simple Snippets

Quick Sort Algorithm - How It Works with Example Diagram - Part 1

0 rewiews
Comprehensive visual explanation of Quick Sort algorithm, including its partitioning process, pivot selection methods, and step-by-step demonstration using diagrams and examples.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
Simple Snippets

Space Complexity of Algorithms - Calculation and Analysis

0 rewiews
Learn to calculate and understand space complexity in algorithms, including auxiliary space, big O notation, and practical examples for various algorithm types.
Add to list
11 Lesons
28 minutes
On-Demand
Free-Video
Simple Snippets

Big Oh vs Big Omega vs Big Theta Notations - Asymptotic Analysis of Algorithms with Example

0 rewiews
Explore Big O, Omega, and Theta notations for algorithm analysis. Learn their mathematical definitions, practical applications, and differences in measuring best, worst, and average-case time complexities.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Simple Snippets

What Is Big O Notation and Time Complexity of Algorithms - Algorithm Analysis in Data Structures

0 rewiews
Comprehensive tutorial on Big O notation, time complexity, and algorithm analysis in data structures. Covers key concepts, practical examples, and calculation methods.
Add to list
8 Lesons
39 minutes
On-Demand
Free-Video
Simple Snippets

Counting Sort Algorithm with Diagram - Part 1

0 rewiews
Learn the Counting Sort algorithm with step-by-step explanations and visual diagrams. Understand its linear time complexity, implementation, and applications in other sorting techniques.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

The Power of Randomization - Distributed Submodular Maximization on Massive Datasets

0 rewiews
Explore distributed algorithms for submodular maximization in machine learning, focusing on a parallel approach that achieves constant factor approximation guarantees for large-scale problems.
Add to list
17 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Randomized Composable Core-Sets for Submodular Maximization

0 rewiews
Explores randomized composable core-sets for distributed submodular and diversity maximization, presenting improved algorithms and analysis techniques for big data optimization problems.
Add to list
14 Lesons
33 minutes
On-Demand
Free-Video
TheIACR

Asiacrypt 2022 - Lattice Algorithms and Cryptanalysis

0 rewiews
Explore lattice algorithms and cryptanalysis, covering topics like psychotomic fields, quantum decomposition, and optimization frameworks in this comprehensive talk from Asiacrypt 2022.
Add to list
20 Lesons
1 hour 18 minutes
On-Demand
Free-Video
Simons Institute

Fine-Grained Complexity 2 - Advanced Concepts and Applications

0 rewiews
Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and computational limits in database theory and AI applications.
Add to list
1 Lesons
1 hour 3 minutes
On-Demand
Free-Video
Simons Institute

Fine-Grained Complexity - Lecture 1

0 rewiews
Explore cutting-edge research in fine-grained complexity theory with MIT expert Virginia Vassilevska Williams, delving into advanced algorithmic concepts and their applications.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Simons Institute

Conditional Hardness and Fine-grained Complexity

0 rewiews
Explore advanced concepts in computational complexity, focusing on conditional hardness and fine-grained analysis of algorithms for deeper understanding of efficiency limits.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Simons Institute

Fine-Grained Complexity - Lecture 4

0 rewiews
Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and their implications for database theory and AI applications.
Add to list
1 Lesons
58 minutes
On-Demand
Free-Video
Simons Institute

Fine-Grained Complexity 3 - Logic and Algorithms in Database Theory and AI

0 rewiews
Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and their implications for database theory and AI.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Derek Banas

Big O Notations - Understanding Algorithm Efficiency

0 rewiews
Explore Big O Notations to understand algorithm efficiency as data scales. Learn about O(1), O(N), O(N^2), O(log N), and O(N log N) with practical examples and simplified explanations.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

STOC 2020 - Online Algorithms

0 rewiews
Explore online algorithms, including caching with time windows, vector balancing, and primal-dual matching. Learn about recent advancements and open problems in this dynamic field of computer science.
Add to list
20 Lesons
38 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Breaching the 2-Approximation Barrier for Connectivity Augmentation

0 rewiews
Explore advanced techniques in network design, focusing on connectivity augmentation and its reduction to the Steiner Tree problem. Learn about novel approximation algorithms and open challenges in the field.
Add to list
17 Lesons
20 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions

0 rewiews
Explore unexpected findings on Kolmogorov complexity, including hardness results, limits, conjectures, and implications for pseudorandom generators and computational complexity.
Add to list
16 Lesons
22 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization

0 rewiews
Explore adaptive complexity in submodular maximization, covering nonmonotone approximation and hardness. Gain insights into this advanced computational topic through a concise presentation of key concepts and findings.
Add to list
7 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Computational Barriers in Statistical Estimation and Learning

0 rewiews
Explore statistical estimation challenges, information theory, and computational barriers in high-dimensional settings with Stanford's Andrea Montanari in this Richard M. Karp Distinguished Lecture.
Add to list
16 Lesons
1 hour 3 minutes
On-Demand
Free-Video
International Mathematical Union

Constraint Satisfaction Problem - What Makes the Problem Easy

0 rewiews
Explore constraint satisfaction problems, their complexity, and variants. Learn about polynomial-time solvable cases and NP-complete instances in this mathematical deep dive.
Add to list
1 Lesons
43 minutes
On-Demand
Free-Video
Simons Institute

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach

0 rewiews
Explores NP-hardness of approximating meta-complexity using cryptographic constructions, focusing on near-optimal results for Minimum Oracle Circuit Size Problem and its implications.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Economic Fairness - IPAM at UCLA

0 rewiews
Explore economic fairness concepts with Sendhil Mullainathan in this UCLA summer school lecture, covering key principles and their applications in algorithmic decision-making.
Add to list
1 Lesons
54 minutes
On-Demand
Free-Video
IMSA

Braids and Machine Learning

0 rewiews
Explore the fascinating intersection of braids and machine learning, uncovering innovative applications and insights in mathematics and data science.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Paul G. Allen School

Money, Circuits, Mythic Figures, and More - Theory in the Allen School

0 rewiews
Diverse theoretical computer science research: algorithms, data structures, complexity, combinatorics, and economics. Insights from UW Allen School's theory group on cutting-edge topics.
Add to list
19 Lesons
53 minutes
On-Demand
Free-Video
Ryan O'Donnell

Undergrad Complexity at CMU - Oracle Turing Machines and P^NP

0 rewiews
Explore oracle Turing machines and P^NP in computational complexity theory, focusing on solving algorithms, consequences, and the Minimum Circuit Problem.
Add to list
15 Lesons
1 hour 22 minutes
On-Demand
Free-Video
Ryan O'Donnell

Time-Space Tradeoffs for SAT - Graduate Complexity Lecture at CMU

0 rewiews
Explore time/space tradeoffs for SAT in this graduate-level complexity theory lecture, covering key results, proofs, and techniques like padding and alternation elimination.
Add to list
12 Lesons
1 hour 32 minutes
On-Demand
Free-Video
Ryan O'Donnell

Great Ideas in Theoretical Computer Science: Time Complexity - Spring 2016

0 rewiews
Explore time complexity in theoretical computer science, covering running time, worst-case scenarios, and common runtime scaling, with practical examples and formal definitions.
Add to list
13 Lesons
1 hour 17 minutes
On-Demand
Free-Video
Ryan O'Donnell

Time Complexity

0 rewiews
Learn about time complexity in algorithms, covering input sizes, running time analysis, worst-case scenarios, and efficiency considerations for various computational problems.
Add to list
21 Lesons
1 hour 12 minutes
On-Demand
Free-Video
Ryan O'Donnell

Great Ideas in Theoretical Computer Science - Approximation Algorithms

0 rewiews
Explore approximation algorithms for NP-hard problems, focusing on Vertex Cover, k-Coverage, and Traveling Salesperson. Learn techniques to find near-optimal solutions efficiently.
Add to list
25 Lesons
1 hour 20 minutes
On-Demand
Free-Video
IEEE

Testing Linear-Invariant Properties

0 rewiews
Explore efficient methods for testing linear-invariant properties in mathematical structures, focusing on advanced techniques and their applications in various fields.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video
IEEE

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions

0 rewiews
Explore the randomized query complexity of partial functions and its tight composition theorem, advancing understanding in computational complexity theory.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video
IEEE

Understanding Deep Learning - Challenges for Statistical Learning Theory

0 rewiews
Explore statistical learning theory challenges in deep learning, focusing on key concepts and recent developments in this complex field.
Add to list
1 Lesons
1 hour 28 minutes
On-Demand
Free-Video
Simons Institute

Incremental View Maintenance: Beyond Worst-Case Analysis I

0 rewiews
Explore advanced techniques in incremental view maintenance, focusing on fine-grained complexity analysis and its applications in logic and query evaluation.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
Paul G. Allen School

Natural Language Processing - Lecture 5

0 rewiews
Explore advanced topics in computer science, focusing on cutting-edge algorithms, data structures, and problem-solving techniques in this comprehensive lecture.
Add to list
1 Lesons
2 hours 50 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Should We Use Parameterized Quantum Circuits for Machine Learning?

0 rewiews
Exploration of parameterized quantum circuits for machine learning, discussing evidence for and against their use, focusing on learning output distributions and supervised learning applications.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video

Untwisting the Mersenne Twister: How I Killed the PRNG Moloch

0 rewiews
Unraveling the Mersenne Twister algorithm: exploring its vulnerabilities, testing methods, and implications for pseudorandom number generation in various applications.
Add to list
19 Lesons
43 minutes
On-Demand
Free-Video
Kunal Kushwaha

Radix Sort Algorithm - Theory and Implementation

0 rewiews
Comprehensive exploration of radix sort algorithm, including theory, complexity analysis, optimization techniques, and code examples. Ideal for deepening understanding of sorting algorithms.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
Kunal Kushwaha

Count Sort Algorithm - Theory and Implementation

0 rewiews
Comprehensive exploration of count sort algorithm, including theory, complexity analysis, optimization techniques, and code examples. Ideal for enhancing understanding of sorting algorithms.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Longest Common Subsequence Using Dynamic Programming - Design and Analysis of Algorithms

0 rewiews
Explore dynamic programming to solve the Longest Common Subsequence problem efficiently. Learn step-by-step implementation and optimization techniques for this fundamental algorithm.
Add to list
1 Lesons
27 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Sum of Subset Problem Using Backtracking - Design and Analysis of Algorithms

0 rewiews
Explore the Sum of Subset problem using backtracking, with practical examples. Learn efficient algorithm design and analysis techniques for solving complex computational challenges.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
Simons Institute

Testing Boolean Functions

0 rewiews
Explore efficient algorithms for testing Boolean function properties, covering definitions, variants, and key analyses in sublinear complexity.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video