Joint Mathematics Meetings AMS Special Session
Current as of Friday, January 18, 2013 00:31:56
Joint Mathematics Meetings
San Diego Convention Center and San Diego Marriott Hotel and Marina, San Diego, CA
January 912, 2013 (Wednesday  Saturday)
Meeting #1086
Associate secretaries:
Georgia Benkart, AMS benkart@math.wisc.edu
Gerard A Venema, MAA venema@calvin.edu
AMS Special Session on Mathematical Underpinnings of Multivariate Complexity Theory and Algorithm Design, and Its Frontiers and the Field of Incrementalization

Friday January 11, 2013, 8:00 a.m.10:50 a.m.
AMS Special Session on Mathematical Underpinnings of Multivariate Complexity Theory and Algorithm Design, and Its Frontiers and the Field of Incrementalization, I
Room 31C, Upper Level, San Diego Convention Center
Organizers:
Rodney Downey, Victoria University of Wellington, New Zealand
Michael Fellows, Charles Darwin University, Australia
Anil Nerode, Cornell University
Frances Rosamond, Charles Darwin University, Australia Frances.Rosamond@cdu.edu.au

8:00 a.m.
Parameterized Complexity Overview.
Rodney G Downey*, Victoria University
(108668518) 
8:30 a.m.
Incrementalization: From Clarity to Efficiency.
Yanhong Annie Liu*, State University of New York at Stony Brook
(1086681571) 
9:00 a.m.
Database Queries  Logic and Complexity.
Moshe Y. Vardi*, Rice University
(1086681136) 
9:30 a.m.
On the AND and ORConjectures: Limits to Efficient Preprocessing.
Andrew D Drucker*, Institute for Advanced Study
(1086681505) 
10:00 a.m.
Towards relating program transformation, incremental computation and parameterized complexity.
Neil D. Jones*, University of Copenhagen
(108668954) 
10:30 a.m.
On the Linear and QuaisLinear CPU Time for Most Relational Calculus and Data Mining Queries Using O(N) Space.
Dan E Willard*, University at Albany (Computer Science Department)
(1086681072)

8:00 a.m.

Saturday January 12, 2013, 1:00 p.m.5:50 p.m.
AMS Special Session on Mathematical Underpinnings of Multivariate Complexity Theory and Algorithm Design, and Its Frontiers and the Field of Incrementalization, II
Room 31C, Upper Level, San Diego Convention Center
Organizers:
Rodney Downey, Victoria University of Wellington, New Zealand
Michael Fellows, Charles Darwin University, Australia
Anil Nerode, Cornell University
Frances Rosamond, Charles Darwin University, Australia Frances.Rosamond@cdu.edu.au

1:00 p.m.
Synthesis of Dynamic Algorithms.
Neil Immerman*, Computer Science Dept., University of Massachusetts, Amherst
(1086682140) 
1:30 p.m.
How Fast Can We Compute Combinatorial Problems such as the Permanent and the Tutte Polynomial?
Holger Dell*, UW Madison
(1086051847) 
2:00 p.m.
Parameterized Algorithms and Circuit Lower Bounds.
Ryan Williams*, Stanford University
(1086681876) 
2:30 p.m.
On an odd case of an XP algorithm for graphs of bounded cliquewidth.
Petr Hliněný*, Faculty of Informatics, Masaryk University, Brno, Czech Republic
Robert Ganian, GoetheUniversität Frankfurt am Main, Germany
Jan Obdržálek, Faculty of Informatics, Masaryk University, Brno, Czech Republic
(108668915) 
3:00 p.m.
Parameterized Complexity and Permutation Group Problems.
Vikraman Arvind*, Institute of Mathematical Sciences, Chennai 600113, India
(1086681517) 
3:30 p.m.
Applying Parameterized Complexity to Cognitive Science.
Ulrike Stege*, University of Victoria
(1086681681) 
4:00 p.m.
Incremental List Coloring of Graphs, Parameterized by Conservation.
Sepp Hartung, TU Berlin
Rolf Niedermeier*, TU Berlin
(1086681804) 
4:30 p.m.
Algebraization in parameterized algorithms and complexity.
Ioannis Koutis*, University of Puerto Rico, Rio Piedras
(1086681680) 
5:00 p.m.
Formal Coalgebraic Specifications and their Refinement.
Douglas R Smith*, Kestrel Institute
(1086682907) 
5:30 p.m.
Summary and Future Directions Discussion.
Michael Fellows*, Charles Darwin University, Australia
Rodney Downey, Victoria University of Wellington, NZ
Annie Liu, State University of NY at Stonybrook
Anil Nerode, Cornell University
(1086681291)

1:00 p.m.