Font size: Αα Αα Αα hide gadgets
You are here: Events » 2006 { prev, contents, next }

Events in 2006

Date Event
Δεκέμβριος 2006
2006-12-22 T. Pheidas (Decidability in algebra—for beginners)
2006-12-20 graduation ceremony
2006-12-01 MSc defense of Βασίλειος Πασχάλης
2006-12-01 MSc defense of Γεώργιος Ζήκος
2006-12-01 D. Gounopoulos (Top-K Query Processing)
Νοέμβριος 2006
2006-11-24 R. Kaye (Nonstandard symmetric groups)
2006-11-15 V. Selivanov (Fine hierarchy of regular aperiodic -languages)
2006-11-10 Χ. Καπουτσής (Small sweeping 2NFAs are not closed under complement)
2006-11-03 D. Richerby (How to kill a Minotaur: An introduction to graph searching)
2006-11-01 MSc defense of C. Manouvelos
Οκτώβριος 2006
2006-10-20 Y. N. Moschovakis (“... (a+bn)/n=x, hence God exists”—with Logic only!)
2006-10-13 H. Schwichtenberg (Logic for computable functionals and their approximations)
2006-10-06 K. Yamazaki (Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs)
2006-10-01 MSc defense of Χ. Αναγνωστόπουλου
Σεπτέμβριος 2006
2006-09-01 MSc defense of Νικολάου Βαπόρη
2006-09-01 MSc defense of Αχιλλέα Κουτσιούμπα
Ιούλιος 2006
2006-07-01 MSc defense of Χρήστου Κοναξή
Ιούνιος 2006
2006-06-01 MSc defense of Γεωργίου Πήλιουρα
Μάιος 2006
2006-05-12 E. Kranakis (Local computation and global communication in wireless networks)
2006-05-05 C. Nikolaidis (Combinatorial algorithms for the symmetric group S_n)
Απρίλιος 2006
2006-04-14 Δ. Μ. Θηλυκός (Using submodular functions to generate with parameters: the issues of monotonicity and connectivity)
2006-04-07 E. Paschos (Robustness under uncertainty)
2006-04-01 MSc defense of Ξενοφώντος Ραφιού
Μάρτιος 2006
2006-03-31 D. Richerby (Hilbert's ε-operator)
2006-03-24 Y. N. Moschovakis (Recursion and complexity)
Ιανουάριος 2006
2006-01-27 Ε. Ζάχος (Hierarchies of complexity classes)
2006-01-20 S. Artemov & E. Nogina (Proofs, Evidence, Knowledge)


Web standards: XHTML1.0, CSS3.
© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.