Events

Tuesday, May 21, 2019 — 9:30 AM EDT

Michael Farag, Master’s candidate
David R. Cheriton School of Computer Science

Tuesday, May 21, 2019 — 2:00 PM EDT

Hung Viet Pham, PhD candidate
David R. Cheriton School of Computer Science

Wednesday, May 22, 2019 — 1:30 PM EDT

Lily Wang, University of Waterloo

A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element. Similarly, we can ask about the dual problem: for each element of an array of integers $A[i]$, what is the position of the furthest smaller element? 

Wednesday, May 29, 2019 — 10:30 AM EDT

Kyle Jamieson
Department of Computer Science, Princeton University

Wednesday, May 29, 2019 — 12:15 PM EDT

Besat Kassaie, PhD candidate
David R. Cheriton School of Computer Science

Wednesday, May 29, 2019 — 2:30 PM EDT

Meng Tang, PhD candidate
David R. Cheriton School of Computer Science

Thursday, June 20, 2019 — 10:00 AM EDT

Gustavo Fortes Tondello, PhD candidate
David R. Cheriton School of Computer Science

S M T W T F S
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
  1. 2019 (118)
    1. June (1)
    2. May (20)
    3. April (32)
    4. March (25)
    5. February (16)
    6. January (24)
  2. 2018 (221)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (23)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)