Bureaucrats, editor, Administrators
373
edits
Changes
From Theory
→Fall 2012
| Oct 5 || 3:30-4:30 PM|| AVW3258|| [http://www.dcs.warwick.ac.uk/~harry/ Harald Räcke]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-05-2012 An $O(\log k)$-competitive Algorithm for Generalized Caching]
| Oct 5 || 3:30-4:30 PM|| AVW3258|| [http://www.dcs.warwick.ac.uk/~harry/ Harald Räcke]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-05-2012 An $O(\log k)$-competitive Algorithm for Generalized Caching]
|-
|-
| Oct 12|| 3:30-4:30 PM|| AVW3258|| [http://research.google.com/pubs/NitishKorula.html Nitish Korula]|| -
| Oct 12|| 3:30-4:30 PM|| AVW3258|| [http://research.google.com/pubs/NitishKorula.html Nitish Korula]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-12-2012 Bicriteria Online Matching: Maximizing Weight and Cardinality]
|-
|-
| Oct 19|| 1:00-2:00 PM|| CSIC2117|| [http://www.cs.sfu.ca/~cenk/ S. Cenk Sahinalp] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-19-2012 Efficient communication and storage vs accurate variant calls in high throughput sequencing: two sides of the same coin] (joint with Colloquium Series)
| Oct 19|| 1:00-2:00 PM|| CSIC2117|| [http://www.cs.sfu.ca/~cenk/ S. Cenk Sahinalp] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-19-2012 Efficient communication and storage vs accurate variant calls in high throughput sequencing: two sides of the same coin] (joint with Colloquium Series)
