YoVDO

Sorting Using Partial Information - Lecture

Offered By: Institute for Advanced Study via YouTube

Tags

Sorting Algorithms Courses Computer Science Courses Discrete Mathematics Courses Time Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking seminar on sorting algorithms that utilize partial information. Delve into a novel approach presented by Robert Tarjan from Princeton University, addressing a problem that has remained unsolved since 1978. Learn about a simple yet powerful algorithm with an optimal running time of O(m + n + log T), where n is the number of items, m is the number of pre-existing comparisons, and T represents the number of total orders consistent with the pre-existing comparison outcomes. Discover how this algorithm combines topological sort and heapsort techniques to achieve O(log T) comparisons, making it best possible up to constant factors. Gain insights into the collaborative efforts behind this research, involving Bernhard Haeupler, Richard Hladík, John lacono, Vaclay Rozhoi, and Jakub Tětek. Enhance your understanding of advanced sorting techniques and their applications in computer science and discrete mathematics.

Syllabus

Sorting Using Partial Information - Robert Tarjan


Taught by

Institute for Advanced Study

Related Courses

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax
离散数学概论 Discrete Mathematics Generality
Peking University via Coursera
Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam
Discrete Mathematics
Shanghai Jiao Tong University via Coursera