Αλγόριθμοι και Πολυπλοκότητα
Δήλωση Θέματος Παρουσίασης
Εδώ δηλώνετε το θέμα που θέλετε να παρουσιάσετε κατά την διάρκεια του μαθήματος. Πέρα από αυτά, μπορείτε σε συνεννόηση με τους διδάσκοντες να προτείνετε και να παρουσιάσετε κάποιο δικό σας θέμα.
Η παρουσίαση θα είναι 45 λεπτών θα πρέπει να δίνει μια γενική εικόνα του αντικειμένου, να εξηγεί τα σχετικά λήμματα, θεωρήματα κλπ και να αποδεικνύει τουλάχιστον 1-2 από αυτά (μέτριας δυσκολίας).
Sorry, this activity closed on Friday, 6 December 2024, 12:05 PM and is no longer available
Responses
| Choice options | Not answered yet | Robert Floyd, Ronald Rivest, Expected time bounds for selection, 1975 | Lestor R. Ford, Selmer Johnson, A tournament problem, 1959 | Michael ben-Or, Lower Bounds for Algebraic Computation Trees, 1983 | C. Martinez, S. Roura, Randomized Binary Search Trees, 1998 | Tarjan, Amortized Computational Complexity, 1985 | Brown, Implementation and analysis of binomial queue algorithms, 1978 | 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 | R. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, 1979 | 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 | R. Karp, Reducibility among combinatorial problems, 1972 | Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, 1996 | Hartmanis, J.; Stearns, R. E. On the computational complexity of algorithms, 1965 | Stephen A. Cook, The Complexity of Theorem-Proving Procedures, 1971 | Walter J.Savitch, Relationships between nondeterministic and deterministic tape complexities, 1970 | 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 | L. Carter, M. Wegman, Universal Classes of Hash Functions | Approximation algorithms for TSP and Vertex Cover | Solving Knapsack through its pareto curve and Smoothness | Fast Fourier Transform | Multiplying numbers fast (from Kolmogorov to Karatsuba and beyond) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Number of responses | 12 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 |
| Users who chose this option |