|
Size: 344
Comment:
|
Size: 906
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| == Daily schedule == | = Daily schedule = |
| Line 3: | Line 3: |
| 9-12: (optional) early-bird coffee, bagels, etc. | Schedule for [:days4: SAGE Days 4]. |
| Line 5: | Line 5: |
| 12-1 lunch at a designated restaurant | * 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 |
| Line 7: | Line 14: |
| 1:30 - 2:30 talk on improvements made to SAGE | = Talks = |
| Line 9: | Line 16: |
| 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 |
* Sarah Billey (UW Math): TBA * Henry Cohn (Microsoft Research, June 13): TBA * Charles Doran (UW Math, June 17 at 11am) * Randy Leveque (UW Applied Math): TBA * Jim Morrow (UW Math): Graph theory and electrical networks. * 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.'' * Carl Witty (Newton Research Labs, June 16): '''Fast real root isolation''' (tentative) |
Daily schedule
Schedule for [:days4: SAGE Days 4].
- 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
Talks
- Sarah Billey (UW Math): TBA
- Henry Cohn (Microsoft Research, June 13): TBA
- Charles Doran (UW Math, June 17 at 11am)
- Randy Leveque (UW Applied Math): TBA
- Jim Morrow (UW Math): Graph theory and electrical networks.
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.
Carl Witty (Newton Research Labs, June 16): Fast real root isolation (tentative)