Analysis of algorithms

Related lectures (28)

Page 3 of 3

Covers the Shor algorithm for quantum factorization and the general formula for arithmetic periods.

Discusses accuracy and stability in computational algorithms, focusing on the Verlet and Gear algorithms and comparing their performance.

Covers the median search algorithm and the Hoare algorithm for finding the smallest element in a list.

Explores MIMO spatial multiplexing, ML detection, receivers with fading, tree representation, and sphere decoding.

Covers complexity analysis, pseudo-code, and algorithm justification through examples and theoretical explanations.

Explores stream ciphers, buteforce inversion algorithms, key recovery games, and attacks in cryptography.

Explores dichotomy search algorithms, analyzing complexity and implementation details for efficient searching in sorted lists.

By Quoc Tran-Dinh explores accelerated algorithms for monotone inclusions, covering optimization models, challenges, and new algorithms.