|
Size: 2949
Comment:
|
Size: 2894
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| = Colloquium Talks = | == Invited Colloquium Speakers == |
| Line 9: | Line 9: |
| * Paul Beame (UW Computer Science, June 16 at 3pm): '''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.''' = Developer Talks = * William Stein (UW Math): '''State of the SAGE project''' * David Harvey (Harvard Math): '''FLINT and Fast Polynomial Arithmetic''' * Carl Witty (Newton Research Labs, June 16): '''Fast real root isolation''' (tentative) |
* Paul Beame (UW Computer Science): '''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.''' |
| Line 33: | Line 28: |
| * 1:30 - 2:30 talk on improvements made to SAGE | * 1:30 - 2:30 David Harvey (Harvard Math): '''FLINT and Fast Polynomial Arithmetic''' |
| Line 66: | Line 61: |
| * 1:30 - 2:30 talk on improvements made to SAGE * 3:00 - 4:00 talk on what SAGE needs in order to improve |
* 1:30 - 2:30 Carl Witty (Newton Research Labs): '''Fast real root isolation''' (tentative) * 3:00 - 4:00 Paul Beame (UW Computer Science): '''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.''' |
Schedule for [:days4: SAGE Days 4], which is June 12-17, 2007.
Invited Colloquium Speakers
- Sarah Billey (UW Math): TBA
- Henry Cohn (Microsoft Research, June 13): TBA
- Charles Doran (UW Math, June 17 at 11am): TBA
- Randy Leveque (UW Applied Math): TBA
Jim Morrow (UW Math): Graph theory and electrical networks.
Paul Beame (UW Computer Science): Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.
Daily schedule
Tuesday, June 12
- 9-12: (optional) early-bird coffee, bagels, etc.
- 12-1 lunch at a designated restaurant
- 1:30 - 2:30 William Stein -- State of the SAGE project
- 3:00 - 4:00 talk on what SAGE needs in order to improve
- 4:30 - 5:00 strategy session
- 5:00 - 7:00 coding sprints
- 7:00 - 9:00 dinner
- 9:00 - very late: coding sprints
Wednesday, June 13
- 9-12: (optional) early-bird coffee, bagels, etc.
- 12-1 lunch at a designated restaurant
1:30 - 2:30 David Harvey (Harvard Math): FLINT and Fast Polynomial Arithmetic
- 3:00 - 4:00 Henry Cohn (Microsoft Research) -- colloquium talk
- 4:30 - 5:00 strategy session
- 5:00 - 7:00 coding sprints
- 7:00 - 9:00 dinner
- 9:00 - very late: coding sprints
Thursday, June 14
- 9-12: (optional) early-bird coffee, bagels, etc.
- 12-1 lunch at a designated restaurant
- 1:30 - 2:30 talk on improvements made to SAGE
- 3:00 - 4:00 talk on what SAGE needs in order to improve
- 4:30 - 5:00 strategy session
- 5:00 - 7:00 coding sprints
- 7:00 - 9:00 dinner
- 9:00 - very late: coding sprints
Friday, June 15
- 9-12: (optional) early-bird coffee, bagels, etc.
- 12-1 lunch at a designated restaurant
- 1:30 - 2:30 talk on improvements made to SAGE
- 3:00 - 4:00 talk on what SAGE needs in order to improve
- 4:30 - 5:00 strategy session
- 5:00 - 7:00 coding sprints
- 7:00 - 9:00 dinner
- 9:00 - very late: coding sprints
Saturday, June 16
- 9-12: (optional) early-bird coffee, bagels, etc.
- 12-1 lunch at a designated restaurant
1:30 - 2:30 Carl Witty (Newton Research Labs): Fast real root isolation (tentative)
3:00 - 4:00 Paul Beame (UW Computer Science): Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.
- 4:30 - 5:00 strategy session
- 5:00 - 7:00 coding sprints
- 7:00 - 9:00 dinner
- 9:00 - very late: coding sprints
Sunday, June 17
- 9-12: (optional) early-bird coffee, bagels, etc.
- 12-1 lunch at a designated restaurant
- 1:30 - 2:30 talk on improvements made to SAGE
- 3:00 - 4:00 talk on what SAGE needs in order to improve
- 4:30 - 5:00 strategy session
- 5:00 - 7:00 coding sprints
- 7:00 - 9:00 dinner
- 9:00 - very late: coding sprints