University COVID-19 update

 Visit our Coronavirus Information website for more information.

Events by date

Wednesday, February 1, 2017

Wednesday, February 1, 2017 — 11:45 to 11:45 AM EST

Extended Learning Graphs for Triangle Finding

Mathieu Lauriere, New York University, Shanghai

In this talk we present new quantum algorithms for Triangle Finding improving its best previously known quantum query complexities for both dense and spare instances. For dense graphs on n vertices, we get a query complexity of O(n^{5/4}) without any of the extra logarithmic factors present in the previous algorithm of Le Gall [FOCS’14]. For sparse graphs we also improve some of the results obtained by Le Gall and Nakajima [ISAAC’15].

Wednesday, February 1, 2017 — 3:00 PM EST

Vincent Russo of the Department of Computer Science is defending his thesis:

Extended nonlocal games

Vincent is supervised by IQC faculty members John Watrous and Michele Mosca.

S M T W T F S
29
30
31
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
1
2
3
4
  1. 2020 (16)
    1. August (1)
    2. June (4)
    3. April (1)
    4. March (3)
    5. February (5)
    6. January (2)
  2. 2019 (139)
    1. December (7)
    2. November (10)
    3. October (7)
    4. September (5)
    5. August (10)
    6. July (16)
    7. June (13)
    8. May (15)
    9. April (15)
    10. March (11)
    11. February (20)
    12. January (12)
  3. 2018 (144)
  4. 2017 (131)
    1. December (11)
    2. November (7)
    3. October (11)
    4. September (13)
    5. August (10)
    6. July (8)
    7. June (12)
    8. May (9)
    9. April (13)
    10. March (13)
    11. February (18)
    12. January (7)
  5. 2016 (88)
  6. 2015 (82)
  7. 2014 (94)
  8. 2013 (91)
  9. 2012 (122)
  10. 2011 (117)
  11. 2010 (41)
  12. 2009 (4)
  13. 2008 (1)
  14. 2005 (1)
  15. 2004 (3)