Processing Math: Done
No jsMath TeX fonts found -- using unicode fonts instead.
This may be slow and might not print well.
Use the jsMath control panel to get additional information.
jsMath Control PanelHide this Message


jsMath
Differences between revisions 18 and 20 (spanning 2 versions)
Revision 18 as of 2007-05-25 17:15:44
Size: 1043
Editor: wstein
Comment:
Revision 20 as of 2007-05-25 17:16:43
Size: 1088
Editor: wstein
Comment:
Deletions are marked like this. Additions are marked like this.
Line 14: Line 14:
= Talks = = Colloquium Talks =
 * 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, June 16 at 3pm): '''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.'''
Line 16: Line 22:
= Developer Talks =
Line 18: Line 25:
 * 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.''

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

Colloquium Talks

  • 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, 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)

days4schedule (last edited 2008-11-14 13:42:10 by anonymous)