Δήλωση Θέματος Παρουσίασης

Δεν απαντήθηκε ακόμα

C. Martinez, S. Roura, Randomized Binary Search Trees, 1998

Tarjan, Amortized Computational Complexity, 1985

M. Fredman, R. Tarjan, Fibonacci Heaps and their uses in improved network optimization algorithms, 1987

J. Driscoll, H. Gabow, R. Shrairman, R. Tarjan, Relaxed Heaps: An alternative to Fibonacci Heaps with applications to parallel computation, 1988

M. Fredman, D. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, 1994

B. Maggs, S. Plotkin, Minimum-cost spanning tree as a path-finding problem, 1988

J. Edmonds , Paths, trees, and flowers, 1965 (Πλήρες)

Per-Ake Larson, Dynamic Hash Tables, 1988 (Πλήρες)

Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, 1996 (Πλήρες)

Stephen A. Cook, The Complexity of Theorem-Proving Procedures, 1971

Andrew C. Yao, Theory and application of trapdoor functions, 1982

Diffie and Hellman, New Directions in Cryptography, 1976 (Πλήρες)

Rasmus Pagh, Flemming Friche Rodler, Cuckoo Hashing, 2004 (Πλήρες)

Approximation algorithms for TSP and Vertex Cover

Solving Knapsack through its pareto curve and Smoothness

Fast Fourier Transform (Πλήρες)