Nyt om navne

Oksana Orlenko. Vi har været så heldige at få en kontorelev tilknyttet vores institut. Hun starter den 1/9, d.v.s. mandag den 3. september og skal være her i to år. Vi har glædet os meget til at byde hende velkommen og håber at I vil tage godt imod hende.

Oksana fortæller følgende om sig selv: Jeg hedder Oksana.  Jeg er meget glad for at jeg har fået en elevplads på Aarhus Universitet og kan fortsætte min uddannelse.  Jeres afdeling er et spændende sted, hvor der vil være mange ting jeg kan lære. Jeg kommer fra Ukraine og har boet i Danmark i 3 år. I Ukraine arbejdede jeg som folkeskolelære og var IT-administrator i paskontrol service afdelingen i lufthavnen. Jeg er gift og har en søn. I min fritid kan jeg godt lide at arbejde i haven, jeg elsker blomster, læse en bog, eller møde mine venner, hvor vi godt kan lide at synge sammen. Jeg glæder mig til at mødes med jer og håber på et godt samarbejde.

Lasse Deleuran. Jeg er nystartet ph.d.-student på del A af 4+4-ordningen på Datalogisk Institut. Her skal jeg arbejde på MADALGO centret, hvor Lars Arge er min vejleder. Jeg skal i første omgang se på algoritmer til massive terrændata.

Dorthe Foldager er ansat i regnskabsafdelingen hos Alexandra og skal bistå Charlotte, Lone og Rohini i det daglige.

Dorthe fortæller flg. om sig selv: Jeg er 35 år og har altid arbejdet med regnskab og vil altid arbejde med regnskab. Fritiden bruges bla. til at løbe, men kun for mig selv.

Anders Viskum er pr. 15. august tiltrådt som webprogrammør hos Daimi. Det betyder at der nu igen er tre deltidsansatte webprogrammører til at supportere Daimi og Alexandra Instituttet.

Maurice Jansen is a Post Doctoral Fellow at the Center for Theory in Natural Sciences (CTN). Maurice will be visiting until August 31, 2008. His research area is computational complexity theory, the science of how much time and other resources are needed to solve computational problems. During his stay at Aarhus University Maurice will be doing interdisciplinary research in collaboration with the Mathematics and Computer Science Departments in the subfield of algebraic complexity theory.
Dr. Jansen received his Ph.D. in Computer Science from the State University of New York at Buffalo in September 2006.

Jerzy Karczmarczuk works at the university of Caen, France, in the dept. of Computer Science. Until the end of February 2008 he is a visiting associated professor. His scientific interests concentrate on the applications of functional programming techniques to scientific and engineering problems, including multimedia. He will give a lecture on functional approach to the representation of quantum structures, and quantum algorithms.

Nikos Triandopoulos is a post-doctoral researcher in the Cryptology group at DAIMI. His primary research interests are in information security (theory and applications), cryptography and algorithms and data structures, especially in the context of secure data management and secure computations. Nikos completed his Ph.D. studies in Computer Science at Brown University in 2006, specializing in secure protocol design for data authentication. Here, he plans to extend his data authentication research with new cryptographic constructions and also work on rational cryptography. Nikos received his diploma in Computer Engineering and Informatics at the University of Patras, Greece, in 1999 and his Sc.M. in Computer Science at Brown in 2002. Before joining DAIMI, he spent a year as a research fellow at the Institute for Security Technology Studies at Dartmouth College.

Srinivasa Rao Satti is a postdoc at the Center for Massive Data Algorithmics (MADALGO). He received his PhD in Computer Science from the Institute of Mathematical Sciences, Chennai, India in 2002. He worked as a research associate at the University of Leicester, and as a postdoc at the University of Waterloo, Canada and at the IT University of Copenhagen, Denmark before joining the Aarhus University.
Dr. Rao works in the area of succinct or highly space efficient data structures. During his stay at the MADALGO center, he mainly plans to extend the results in succinct data structures to I/O efficient and cache-oblivious models. His other research interests include approximation algorithms, parameterized complexity and bioinformatics."