Asymptotic Analysis Courses and Certifications

NPTEL;  IIT Kharagpur

Introduction to Algorithms and Analysis

1 review

Comprehensive exploration of algorithmic concepts, from sorting and analysis to advanced data structures and graph algorithms, emphasizing practical implementation and theoretical foundations.

• YouTube
• 1 day 5 hours
• On-Demand
• Free Video

Simple Snippets

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

Comprehensive tutorial on Big O notation, time complexity, and algorithm analysis in data structures. Covers key concepts, practical examples, and calculation methods.

• YouTube
• 39 minutes
• On-Demand
• Free Video

Qiskit

Quantum Algorithmic Foundations: Understanding Quantum Information and Computation - Lesson 6

Explore computational costs in quantum and classical computing, focusing on circuit implementations, Boolean operations, and methods for performing classical computations using quantum circuits.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Dr Trefor Bazett

Optimal Block Stacking - Tower of Lire and Parabolic Methods

Explore optimal block stacking strategies, from spinal to parabolic configurations, analyzing asymptotic behavior and balancing forces in mathematical tower construction.

• YouTube
• 15 minutes
• On-Demand
• Free Video

Michael Penn

On the Growth of a Nice Recursive Sequence

Explore the growth patterns and behavior of a specific recursive sequence in this mathematical analysis, examining its properties and characteristics.

• YouTube
• 14 minutes
• On-Demand
• Free Video

IAS | PCMI Park City Mathematics Institute

Universality for Random Matrix Ensembles of Wigner Type

Dive into advanced random matrix theory with Terry Tao, exploring universality phenomena in Wigner-type ensembles through rigorous mathematical analysis and proofs.

• YouTube
• 4 hours 8 minutes
• On-Demand
• Free Video

Alan Turing Institute

Solving Private Set Intersection via Cuckoo Hashing - Benny Pinkas, Bar-Ilan University, Israel

Explore private set intersection protocols, including custom and generic MPC approaches, with a focus on Cuckoo hashing for efficient computation of PSI variants in cryptography and security.

• YouTube
• 1 hour
• On-Demand
• Free Video

Ryan O'Donnell

Big O and Friends - Lecture 2a of CS Theory Toolkit

Explore asymptotic notation in theoretical computer science, covering Big O, Omega, and related concepts. Essential for understanding algorithm efficiency and complexity analysis.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Institut des Hautes Etudes Scientifiques (IHES)

New Perspectives on Borel Summation - Lecture 4

Explore Airy-Lucas functions through Borel summation, focusing on thimble integrals and hypergeometric Laplace transforms. Gain insights into Stokes phenomenon reflections in the Borel plane.

• YouTube
• 51 minutes
• On-Demand
• Free Video

Institut des Hautes Etudes Scientifiques (IHES)

New Perspectives on Borel Summation - Lecture 1

Explore new perspectives on Borel summation, focusing on linear ODEs and integrals over Lefschetz thimbles, to understand when divergent series solutions produce holomorphic solutions.

• YouTube
• 1 hour 12 minutes
• On-Demand
• Free Video

Neso Academy

Time Complexity of Loops - Solved Problem 1

Detailed analysis of loop time complexity using a GATE 2006 problem, focusing on algorithmic efficiency and problem-solving techniques for computer science students.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Neso Academy

Time Complexity of Single Loops - Conditional Statement with a Function

Explore time complexity analysis for single loops with conditional statements and functions, enhancing your understanding of algorithm efficiency and performance evaluation.

• YouTube
• 18 minutes
• On-Demand
• Free Video

Neso Academy

Time Complexity of Single Loops - Multiplying the Update Expression

Explore time complexity analysis for single loops with multiplicative update expressions, enhancing algorithm efficiency understanding and problem-solving skills.

• YouTube
• 13 minutes
• On-Demand
• Free Video

Neso Academy

The Little Omega Notation in Algorithms

Explore Little Omega Notation in algorithms, its definition, and relationship with Big Omega Notation. Gain insights into asymptotic analysis for algorithm performance evaluation.

• YouTube
• 18 minutes
• On-Demand
• Free Video

Neso Academy

Time Complexity of Loops - Solved Problem 6

Analyze time complexity of loops through a GATE 2023 problem, enhancing algorithm understanding and problem-solving skills for computer science students.

• YouTube
• 21 minutes
• On-Demand
• Free Video