Λίστα Παρουσιάσεων 2012-2013
23.4
ΘΕΟΦΑΝΗΣ ΡΑΠΤΗΣ
Yijie Han: Deterministic sorting in O(nloglogn) time and linear space. J. Algorithms 50(1): 96-105
(2004).
ΚΛΑΥΔΙΑΝΟΣ ΧΡΗΣΤΟΣ
G. S. Brodal. Finger Search Trees with Constant Insertion Time. In Proc. 9th Annual ACM-SIAM
Symposium on Discrete Algorithms, pages 540-549, 1998.
14.5
ΓΕΡΑΣΙΜΟΣ ΑΡΒΑΝΙΤΗΣ
Mihai Bădoiu and Erik D. Demaine, A Simplified and Dynamic Unified Structure,in Proceedings of
the 6th Latin American Symposium on Theoretical Informatics (LATIN 2004),Lecture Notes in
Computer Science, volume 2976, Buenos Aires, Argentina, April 5-8, 2004, pages 466-473.
ΒΕΛΑΩΡΑ ΑΠΟΣΤΟΛΙΑ
Rajamani Sundar, Robert Endre Tarjan: Unique Binary Search Tree Representations and Equalitytesting of Sets and Sequences STOC 1990: 18-25
ΚΑΛΑΝΤΖΗ ΜΑΡΙΑ
Quasi-succinct indices.
21.5
ΓΕΩΡΓΙΟΣ ΑΝΥΣΙΟΣ
John Iacono, Alternatives to Splay Trees with O(logn) Worst-Case Access Times, ACM/SIAM
SODA 2001, 516-522.
ΣΠΥΡΟΥ ΑΛΕΞΑΝΔΡΟΣ
M. A. Bender and M. Farach-Colton. The Level Ancestor Problem Simplified. LATIN, pages 508515, 2002.
AΘΑΝΑΣΙΑ XANTZH
D.E. Demaine, D. Harmon, J. Iacono, M. Pătraşcu, (2004), Dynamic Optimality —Almost, IEEE
Symp. on the Foundations of Computer Science, 45th, Rome, Italy, Oct. 17–19, pp. 484–490.
28.5
ΜΠΟΥΡΔΟΥΛΗΣ ΘΕΟΔΩΡΟΣ
Fast algorithms for finding nearest common ancestors
ΑΓΓΕΛΙΚΗ ΡΑΠΤΗ
M. A. Bender, R. Cole, E. Demaine, M. Farach-Colton, and J. Zito. Two Simplified Algorithms for
Maintaining Order in a List. Proceedings of the 10th European Symposium on Algorithms (ESA),
pages 152-164, 2002.
ΝΤΙΡΛΗΣ ΝΙΚΟΛΑΟΣ
A.K. Tsakalidis, AVL trees for Localized search, Information and Control, 67:173-194, 1985
ΜΟΥΡΤΖΙΚΟΥ ΓΙΑΝΝΟΥΛΑ
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick: Melding priority queues. ACM
Transactions on Algorithms 2(4): 535-556 (2006)
4.6
ΠΟΤΑΜΙΑ ΣΤΑΥΡΟΥΛΑ
Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences under Equality Tests
in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997).
ΔΕΛΗΓΙΑΝΝΙΔΟΥ
Α.Fiat, H. Kaplan, Making Data Structures Confluently Persistent, ACM SODA 2001
ΠΑΠΑΒΑΣΙΛΕΙΟΥ ΧΡΗΣΤΟΣ
A.K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree, Acta Informatica 25, 37-54
(1988).
11.6
ΓΑΡΔΙΚΗΣ ΔΗΜΗΤΡΙΟΣ
J. R. Driscoll, D. D. K. Sleator, R. E. Tarjan, Fully Persistent Lists with Catenation,
Journal of the ACM, Vol 41. No 5, September 1Y94. pp. 943–959
ΠΑΝΑΓΙΩΤΑ ΜΠΕΡΓΙΑΝΝΟΥ
S. Alstrup and M. Thorup, Optimal Pointer Algorithms for Finding Nearest Common Ancestors in
Dynamic Trees, Journal of Algorithms, 35(2): 169-188 (2000)
ΤΣΙΡΩΝΗΣ ΝΙΚΟΛΑΟΣ
R. Cole and R. Hariharan, Dynamic lca queries on trees, In Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA), 10, 1999