You are here: News & Events

News & Events

News

Thinktank report on Future Spaces for Children

2008.08.27 |

Center Manager, Kaj Grønbæk has been a member of Aarhus Municipality's Thinktank on "Future Spaces for Children" which has delivered its final report. The report gives a rich set of recommendations for development of future institutional spaces for children. The report includes recommendations on use of pervasive computing technologies as well as…

Events

Mon Aug 11
14:15-15:00 | IT-huset Lille Auditorie
MADALGO seminar, Alexander Wolff, Eindhoven U. ofTechnology

Title: Geometric Networks - Construction, Analysis and VisualizationSpeaker: Alexander Wolff, Eindhoven University of TechnologyAbstract: Geometric Networks are graphs whose nodes correspond to points in theplane.Such networks appear in many applications, from trafficnetworks via VLSI chip layout to sensor networks. The construction,analysis and…

Tue Aug 12
09:00-17:00 | Ada 333
OEHack Week

OpenEngine, in cooperation with the Alexandra Institute, hosts a workshop on game programming on August 12 - 17. Members of the OpenEngine community and special guests from the Danish game industry will come and tell abouttheir experiences, research and development in the gamingindustry.The event is open to everybody, so please come and join the…

Wed Aug 13
13:00-14:00 | DI-Turing-014
Maters's Thesis Examination Troels Lund Rasmussen
Fri Aug 15
13:15-14:00 | DI-Turing-014
MADALGO seminar, John Iacono, Polytechnic Institute of NY Uni

Titel: Blasting Transdichotomous Atomic RamboSpeaker: John Iacono, Polytechnic Institute of New York UniversityAbstract:Suppose you have a fixed set of n numbers and you want to create a datastructure that allows a fast search in this set. How fast can such a search be?Well it depends on what computer you have. But theoreticians don't…

Mon Aug 25
07:00-08:00 | DI-pvagt
Start of 1st quarter
Wed Aug 27
15:15-16:15 | DI-Turing-014
CoMa seminar: Michal Koucky, Czech Academy of Sciences.

Michal Koucky, Czech Academy of Sciences, Seminar.Title: Amplifying Lower Bounds by Means of Self-ReducibilityAbstract:We observe that many important computational problems in $NC1$ share a simple self-reducibility property. We then show that, for any problem $A$ having this self-reducibility property, $A$ has polynomial size $TC0$ circuits if…

Comments on content: 
Revised 24.08.2011