Due to the need to prepare visitor passes and badges to enter AT & T, we ask attendees to notify Nicole Clark (nicolec@dimacs.rutgers.edu) by October 30, 2009 of their intention to attend and their place of employment. Even AT&T employees should do this, as it would help us get a better handle on how much food to order. Those who do not RSVP are still welcome, but we would appreciate your giving us your intentions in advance.
10:00 - 10:45 Registration - coffee and tea served (Allow sufficient time to sign in and receive your AT & T visitor's badge) 10:45 - 11:00 Welcome and opening remarks Fred Roberts, DIMACS Director Graham Cormode, AT&T 11:00 - 11:40 Secure Message Transmission with Small Public Discussion Juan Garay, AT&T 11:45 - 12:10 Basis Reduction and the Complexity of Branch-and-bound Mustafa Tural, Telcordia 12:10 - 1:20 lunch 1:20 - 1:45 From Adversaries to Algorithms Troy Lee, Dept of Computer Science postdoc Rutgers University 1:50 - 2:15 Experiences with Energy-Aware Computing: From Embedded systems to Multicore systems and beyond Athanasios (Thanos) Stathopoulos, Alcatel-Lucent 2:20 - 2:50 coffee break 2:50 - 3:15 On the Possibility of Faster SAT Algorithms Mihai Patrascu, AT&T 3:20 - 4:00 Massive Datasets Jon Kettenring, Drew University 4:05 - 4:10 closing remarks