From wajc at stanford.edu Wed Nov 4 12:07:13 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 4 Nov 2020 12:07:13 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
Message-ID:
Hi all,
Theory lunch will be happening tomorrow at our gather space
(12pm PT,
*password:* SongComplexity). After checking whether gather's halloween
avatars are still active, Mohammad will tell us about work titled *Towards
no-signaling PCPs with constant locality.*
*Abstract:*
Suppose we have a multiplayer interactive game in which players are located
in different rooms but may have access to non-local correlations (like
shared quantum entangled states). We denote any strategy used by this
players, that does not imply communication, as a *no-signaling strategy*.
No-signaling strategies are a generalization of quantum strategies that
have been studied in physics over the past three decades. Recently, they
have found applications in theoretical computer science, including to
proving inapproximability results for linear programming and to
constructing protocols for delegating computation. A central tool for these
applications is probabilistically checkable proof (PCPs) systems that are
sound against non-signaling strategies.
In this talk we show, assuming a certain geometrical hypothesis about noise
robustness of non-signaling proofs (or equivalently, about noise robustness
of solutions to the Sherali-Adams linear program), that a slight variant of
the parallel repetition of the exponential-length constant-query PCP
construction due to Arora et al. is sound against non-signaling strategies
with constant locality. The key idea is to parallel repeated proofs for
locality amplification, rather than soundness amplification.
Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
Cheers,
David
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Wed Nov 4 12:07:13 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 4 Nov 2020 12:07:13 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
Message-ID:
Hi all,
Theory lunch will be happening tomorrow at our gather space
(12pm PT,
*password:* SongComplexity). After checking whether gather's halloween
avatars are still active, Mohammad will tell us about work titled *Towards
no-signaling PCPs with constant locality.*
*Abstract:*
Suppose we have a multiplayer interactive game in which players are located
in different rooms but may have access to non-local correlations (like
shared quantum entangled states). We denote any strategy used by this
players, that does not imply communication, as a *no-signaling strategy*.
No-signaling strategies are a generalization of quantum strategies that
have been studied in physics over the past three decades. Recently, they
have found applications in theoretical computer science, including to
proving inapproximability results for linear programming and to
constructing protocols for delegating computation. A central tool for these
applications is probabilistically checkable proof (PCPs) systems that are
sound against non-signaling strategies.
In this talk we show, assuming a certain geometrical hypothesis about noise
robustness of non-signaling proofs (or equivalently, about noise robustness
of solutions to the Sherali-Adams linear program), that a slight variant of
the parallel repetition of the exponential-length constant-query PCP
construction due to Arora et al. is sound against non-signaling strategies
with constant locality. The key idea is to parallel repeated proofs for
locality amplification, rather than soundness amplification.
Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
Cheers,
David
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 5 12:11:17 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 5 Nov 2020 12:11:17 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
In-Reply-To:
References:
Message-ID:
Reminder: this is happening now!
If you have trouble clicking the url link above, here it is in plain text:
https://gather.town/dashboard/lR6jRBPK44nZ7V68/StanfordTheory (password:
SongComplexity)
Cheers,
David
On Wed, 4 Nov 2020 at 12:07, David Wajc wrote:
> Hi all,
>
>
> Theory lunch will be happening tomorrow at our gather space
> (12pm PT,
> *password:* SongComplexity). After checking whether gather's halloween
> avatars are still active, Mohammad will tell us about work titled *Towards
> no-signaling PCPs with constant locality.*
>
>
> *Abstract:*
>
> Suppose we have a multiplayer interactive game in which players are
> located in different rooms but may have access to non-local correlations
> (like shared quantum entangled states). We denote any strategy used by this
> players, that does not imply communication, as a *no-signaling strategy*.
>
> No-signaling strategies are a generalization of quantum strategies that
> have been studied in physics over the past three decades. Recently, they
> have found applications in theoretical computer science, including to
> proving inapproximability results for linear programming and to
> constructing protocols for delegating computation. A central tool for these
> applications is probabilistically checkable proof (PCPs) systems that are
> sound against non-signaling strategies.
>
> In this talk we show, assuming a certain geometrical hypothesis about
> noise robustness of non-signaling proofs (or equivalently, about noise
> robustness of solutions to the Sherali-Adams linear program), that a slight
> variant of the parallel repetition of the exponential-length constant-query
> PCP construction due to Arora et al. is sound against non-signaling
> strategies with constant locality. The key idea is to parallel repeated
> proofs for locality amplification, rather than soundness amplification.
>
> Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
>
>
> Cheers,
>
> David
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 5 12:11:17 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 5 Nov 2020 12:11:17 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
In-Reply-To:
References:
Message-ID:
Reminder: this is happening now!
If you have trouble clicking the url link above, here it is in plain text:
https://gather.town/dashboard/lR6jRBPK44nZ7V68/StanfordTheory (password:
SongComplexity)
Cheers,
David
On Wed, 4 Nov 2020 at 12:07, David Wajc wrote:
> Hi all,
>
>
> Theory lunch will be happening tomorrow at our gather space
> (12pm PT,
> *password:* SongComplexity). After checking whether gather's halloween
> avatars are still active, Mohammad will tell us about work titled *Towards
> no-signaling PCPs with constant locality.*
>
>
> *Abstract:*
>
> Suppose we have a multiplayer interactive game in which players are
> located in different rooms but may have access to non-local correlations
> (like shared quantum entangled states). We denote any strategy used by this
> players, that does not imply communication, as a *no-signaling strategy*.
>
> No-signaling strategies are a generalization of quantum strategies that
> have been studied in physics over the past three decades. Recently, they
> have found applications in theoretical computer science, including to
> proving inapproximability results for linear programming and to
> constructing protocols for delegating computation. A central tool for these
> applications is probabilistically checkable proof (PCPs) systems that are
> sound against non-signaling strategies.
>
> In this talk we show, assuming a certain geometrical hypothesis about
> noise robustness of non-signaling proofs (or equivalently, about noise
> robustness of solutions to the Sherali-Adams linear program), that a slight
> variant of the parallel repetition of the exponential-length constant-query
> PCP construction due to Arora et al. is sound against non-signaling
> strategies with constant locality. The key idea is to parallel repeated
> proofs for locality amplification, rather than soundness amplification.
>
> Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
>
>
> Cheers,
>
> David
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 5 12:17:57 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 5 Nov 2020 12:17:57 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
In-Reply-To:
References:
Message-ID:
Apologies, the link was to the administrator dashboard. The correct link
is: https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (password:
SongComplexity)
Cheers,
David
On Thu, 5 Nov 2020 at 12:11, David Wajc wrote:
> Reminder: this is happening now!
> If you have trouble clicking the url link above, here it is in plain text:
> https://gather.town/dashboard/lR6jRBPK44nZ7V68/StanfordTheory (password:
> SongComplexity)
>
> Cheers,
> David
>
> On Wed, 4 Nov 2020 at 12:07, David Wajc wrote:
>
>> Hi all,
>>
>>
>> Theory lunch will be happening tomorrow at our gather space
>> (12pm
>> PT, *password:* SongComplexity). After checking whether gather's
>> halloween avatars are still active, Mohammad will tell us about work
>> titled *Towards no-signaling PCPs with constant locality.*
>>
>>
>> *Abstract:*
>>
>> Suppose we have a multiplayer interactive game in which players are
>> located in different rooms but may have access to non-local correlations
>> (like shared quantum entangled states). We denote any strategy used by this
>> players, that does not imply communication, as a *no-signaling strategy*.
>>
>> No-signaling strategies are a generalization of quantum strategies that
>> have been studied in physics over the past three decades. Recently, they
>> have found applications in theoretical computer science, including to
>> proving inapproximability results for linear programming and to
>> constructing protocols for delegating computation. A central tool for these
>> applications is probabilistically checkable proof (PCPs) systems that are
>> sound against non-signaling strategies.
>>
>> In this talk we show, assuming a certain geometrical hypothesis about
>> noise robustness of non-signaling proofs (or equivalently, about noise
>> robustness of solutions to the Sherali-Adams linear program), that a slight
>> variant of the parallel repetition of the exponential-length constant-query
>> PCP construction due to Arora et al. is sound against non-signaling
>> strategies with constant locality. The key idea is to parallel repeated
>> proofs for locality amplification, rather than soundness amplification.
>>
>> Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
>>
>>
>> Cheers,
>>
>> David
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 5 12:17:57 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 5 Nov 2020 12:17:57 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
In-Reply-To:
References:
Message-ID:
Apologies, the link was to the administrator dashboard. The correct link
is: https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (password:
SongComplexity)
Cheers,
David
On Thu, 5 Nov 2020 at 12:11, David Wajc wrote:
> Reminder: this is happening now!
> If you have trouble clicking the url link above, here it is in plain text:
> https://gather.town/dashboard/lR6jRBPK44nZ7V68/StanfordTheory (password:
> SongComplexity)
>
> Cheers,
> David
>
> On Wed, 4 Nov 2020 at 12:07, David Wajc wrote:
>
>> Hi all,
>>
>>
>> Theory lunch will be happening tomorrow at our gather space
>> (12pm
>> PT, *password:* SongComplexity). After checking whether gather's
>> halloween avatars are still active, Mohammad will tell us about work
>> titled *Towards no-signaling PCPs with constant locality.*
>>
>>
>> *Abstract:*
>>
>> Suppose we have a multiplayer interactive game in which players are
>> located in different rooms but may have access to non-local correlations
>> (like shared quantum entangled states). We denote any strategy used by this
>> players, that does not imply communication, as a *no-signaling strategy*.
>>
>> No-signaling strategies are a generalization of quantum strategies that
>> have been studied in physics over the past three decades. Recently, they
>> have found applications in theoretical computer science, including to
>> proving inapproximability results for linear programming and to
>> constructing protocols for delegating computation. A central tool for these
>> applications is probabilistically checkable proof (PCPs) systems that are
>> sound against non-signaling strategies.
>>
>> In this talk we show, assuming a certain geometrical hypothesis about
>> noise robustness of non-signaling proofs (or equivalently, about noise
>> robustness of solutions to the Sherali-Adams linear program), that a slight
>> variant of the parallel repetition of the exponential-length constant-query
>> PCP construction due to Arora et al. is sound against non-signaling
>> strategies with constant locality. The key idea is to parallel repeated
>> proofs for locality amplification, rather than soundness amplification.
>>
>> Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
>>
>>
>> Cheers,
>>
>> David
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 5 12:35:28 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 5 Nov 2020 12:35:28 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
In-Reply-To:
References:
Message-ID:
Addendum: the zoom from gather seems buggy right now. If you want to join,
join us here:
https://stanford.zoom.us/j/96997066639?pwd=ZVpCMTRhTjlTQ0R4RzliVGx1SWxHZz09
Cheers,
David
On Thu, 5 Nov 2020 at 12:17, David Wajc wrote:
> Apologies, the link was to the administrator dashboard. The correct link
> is: https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (password:
> SongComplexity)
>
> Cheers,
> David
>
> On Thu, 5 Nov 2020 at 12:11, David Wajc wrote:
>
>> Reminder: this is happening now!
>> If you have trouble clicking the url link above, here it is in plain
>> text: https://gather.town/dashboard/lR6jRBPK44nZ7V68/StanfordTheory (password:
>> SongComplexity)
>>
>> Cheers,
>> David
>>
>> On Wed, 4 Nov 2020 at 12:07, David Wajc wrote:
>>
>>> Hi all,
>>>
>>>
>>> Theory lunch will be happening tomorrow at our gather space
>>> (12pm
>>> PT, *password:* SongComplexity). After checking whether gather's
>>> halloween avatars are still active, Mohammad will tell us about work
>>> titled *Towards no-signaling PCPs with constant locality.*
>>>
>>>
>>> *Abstract:*
>>>
>>> Suppose we have a multiplayer interactive game in which players are
>>> located in different rooms but may have access to non-local correlations
>>> (like shared quantum entangled states). We denote any strategy used by this
>>> players, that does not imply communication, as a *no-signaling strategy*
>>> .
>>>
>>> No-signaling strategies are a generalization of quantum strategies that
>>> have been studied in physics over the past three decades. Recently, they
>>> have found applications in theoretical computer science, including to
>>> proving inapproximability results for linear programming and to
>>> constructing protocols for delegating computation. A central tool for these
>>> applications is probabilistically checkable proof (PCPs) systems that are
>>> sound against non-signaling strategies.
>>>
>>> In this talk we show, assuming a certain geometrical hypothesis about
>>> noise robustness of non-signaling proofs (or equivalently, about noise
>>> robustness of solutions to the Sherali-Adams linear program), that a slight
>>> variant of the parallel repetition of the exponential-length constant-query
>>> PCP construction due to Arora et al. is sound against non-signaling
>>> strategies with constant locality. The key idea is to parallel repeated
>>> proofs for locality amplification, rather than soundness amplification.
>>>
>>> Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
>>>
>>>
>>> Cheers,
>>>
>>> David
>>>
>>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 5 12:35:28 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 5 Nov 2020 12:35:28 -0800
Subject: [theory-seminar] Theory Lunch 11/4: Mohammad Jahanara
In-Reply-To:
References:
Message-ID:
Addendum: the zoom from gather seems buggy right now. If you want to join,
join us here:
https://stanford.zoom.us/j/96997066639?pwd=ZVpCMTRhTjlTQ0R4RzliVGx1SWxHZz09
Cheers,
David
On Thu, 5 Nov 2020 at 12:17, David Wajc wrote:
> Apologies, the link was to the administrator dashboard. The correct link
> is: https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (password:
> SongComplexity)
>
> Cheers,
> David
>
> On Thu, 5 Nov 2020 at 12:11, David Wajc wrote:
>
>> Reminder: this is happening now!
>> If you have trouble clicking the url link above, here it is in plain
>> text: https://gather.town/dashboard/lR6jRBPK44nZ7V68/StanfordTheory (password:
>> SongComplexity)
>>
>> Cheers,
>> David
>>
>> On Wed, 4 Nov 2020 at 12:07, David Wajc wrote:
>>
>>> Hi all,
>>>
>>>
>>> Theory lunch will be happening tomorrow at our gather space
>>> (12pm
>>> PT, *password:* SongComplexity). After checking whether gather's
>>> halloween avatars are still active, Mohammad will tell us about work
>>> titled *Towards no-signaling PCPs with constant locality.*
>>>
>>>
>>> *Abstract:*
>>>
>>> Suppose we have a multiplayer interactive game in which players are
>>> located in different rooms but may have access to non-local correlations
>>> (like shared quantum entangled states). We denote any strategy used by this
>>> players, that does not imply communication, as a *no-signaling strategy*
>>> .
>>>
>>> No-signaling strategies are a generalization of quantum strategies that
>>> have been studied in physics over the past three decades. Recently, they
>>> have found applications in theoretical computer science, including to
>>> proving inapproximability results for linear programming and to
>>> constructing protocols for delegating computation. A central tool for these
>>> applications is probabilistically checkable proof (PCPs) systems that are
>>> sound against non-signaling strategies.
>>>
>>> In this talk we show, assuming a certain geometrical hypothesis about
>>> noise robustness of non-signaling proofs (or equivalently, about noise
>>> robustness of solutions to the Sherali-Adams linear program), that a slight
>>> variant of the parallel repetition of the exponential-length constant-query
>>> PCP construction due to Arora et al. is sound against non-signaling
>>> strategies with constant locality. The key idea is to parallel repeated
>>> proofs for locality amplification, rather than soundness amplification.
>>>
>>> Based on the following joint work: https://arxiv.org/pdf/2009.04892.pdf.
>>>
>>>
>>> Cheers,
>>>
>>> David
>>>
>>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From tavorb at stanford.edu Mon Nov 9 13:58:06 2020
From: tavorb at stanford.edu (Tavor Baharav)
Date: Mon, 9 Nov 2020 13:58:06 -0800
Subject: [theory-seminar] =?utf-8?q?Fwd=3A_ISL_Colloquium=3A_=22A_Very_Ske?=
=?utf-8?q?tchy_Talk=22_=E2=80=93_David_Woodruff_=28Fri=2C_13-Nov_?=
=?utf-8?b?QCAxOjE1cG0p?=
In-Reply-To:
References:
Message-ID:
David Woodruff is giving the ISL Colloquium this Friday at 1:15pm, which
may be of interest to some on this mailing list (details below).
Best,
Tavor
---------- Forwarded message ---------
From: Tavor Baharav
Date: Mon, Nov 9, 2020 at 1:47 PM
Subject: ISL Colloquium: "A Very Sketchy Talk" ? David Woodruff (Fri,
13-Nov @ 1:15pm)
To: , ,
, <
cs-students-announce at lists.stanford.edu>, <
icme-linear-algebra-seminar at lists.stanford.edu>, <
msande-seminars at lists.stanford.edu>
A Very Sketchy Talk David Woodruff ? Professor, CMU
Fri, 13-Nov / 1:15pm / Zoom:
https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
*To avoid Zoom-bombing, we ask attendees to sign in via the above URL to
receive the Zoom meeting details by email.*
Note the non-standard day, time, and Zoom link!
*If you would like to meet with the speaker, please sign up here:*
*https://docs.google.com/spreadsheets/d/1AnLThI8jtZs1sEE7Y0lJHQTnONgLBfKp9lDo5FkgXgc/edit?usp=sharing
*
Abstract
We give an overview of dimensionality reduction methods, or sketching, for
a number of problems in optimization, first surveying work using these
methods for classical problems, which gives near optimal algorithms for
regression, low rank approximation, and natural variants. We then survey
recent work applying sketching to column subset selection, kernel methods,
sublinear algorithms for structured matrices, tensors, trace estimation,
and so on. The focus in the talk will be on fast algorithms.
Bio
David Woodruff has been an associate professor at Carnegie Mellon
University in the Computer Science Department since 2017. Before that he
was a research scientist at the IBM Almaden Research Center, which he
joined in 2007 after completing his Ph.D. at MIT in theoretical computer
science. His research interests include data stream algorithms, distributed
algorithms, machine learning, numerical linear algebra, optimization,
sketching, and sparse recovery. He is the recipient of the 2020 Simons
Investigator Award, the 2014 Presburger Award, and Best Paper Awards at
STOC 2013, PODS 2010, and PODS, 2020. At IBM he was a member of the Academy
of Technology and a Master Inventor.
------------------------------
Mailing list: https://mailman.stanford.edu/mailman/listinfo/isl-colloq
This talk: http://isl.stanford.edu/talks/talks/2020q4/david-woodruff/
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From margalit.r.glasgow at gmail.com Mon Nov 9 20:45:43 2020
From: margalit.r.glasgow at gmail.com (Margalit Glasgow)
Date: Mon, 9 Nov 2020 20:45:43 -0800
Subject: [theory-seminar] Theory Group Mixing Opportunities
Message-ID:
Hi theory students, postdocs, professors and other friends,
Looking for more ways to engage with the theory group in small groups? Fill
out this form (if you haven't
already).
*- Small group rapid-mixing. *I'll randomly set up groups of 3-4 to meet
every week, only on the weeks you want to participate. You coordinate on
your own when to meet.
*- More senior* theory folk: take out a newer* student to coffee!* You can
set this up on your own, or indicate that you want to be matched on the
form. Then grab coffee virtually or socially distantly and get reimbursed
for drinks/food by emailing Natasha (nsharp at stanford.edu) your receipt with
the subject "Take a newer student out to coffee". Newer students: lots of
senior students have already told me they want to take you out, but I
haven't heard back from many of you.
*There doesn't have to be a seniority gap. But senior students are
encouraged to reach out to first years and vice versa.
Margalit
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Wed Nov 11 11:34:02 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 11 Nov 2020 11:34:02 -0800
Subject: [theory-seminar] Theory Lunch 11/12: Ray Li
Message-ID:
Hi all,
Theory lunch will be happening tomorrow at noon (PDT), at our gather space:
https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
SongComplexity).
Ray will tell us about *Settling SETH vs. Approximate Sparse Directed
Unweighted Diameter (up to (NU)NSETH)*
Abstract:
In this talk, we discuss some recent work on the fine-grained complexity of
approximating the diameter of a graph. The results include the following.
- For any eps>0, assuming the Strong Exponential Time Hypothesis (SETH),
there are no near-linear time (2-eps)-approximation algorithms for the
Diameter of a sparse directed graph, even in unweighted graphs. This result
shows that a simple near-linear time 2-approximation algorithm for Diameter
is optimal under SETH, answering a question from a survey of Rubinstein and
Vassilevska-Williams (SIGACT '19) for the case of directed graphs.
- In the same survey, Rubinstein and Vassilevska-Williams also asked if it
is possible to show that there are no 2-eps approximation algorithms for
Diameter in a directed graph in O(n^{1.499}) time. We show that, assuming a
hypothesis called NSETH, one *cannot *use a deterministic SETH-based
reduction to rule out the existence of such algorithms. Furthermore,
assuming another hypothesis called Non-Uniform NSETH (NUNSETH), one cannot
use even a randomized SETH-based reduction to rule out the existence of
such algorithms.
- Extending the techniques in these two results, we *characterize *whether
a 2-eps approximation algorithm running in O(n^{1+delta}) time for the
Diameter of a sparse directed unweighted graph can be ruled out by a
SETH-based reduction for every delta\in(0,1) and (essentially) every
eps\in(0,1), assuming NSETH. We make the same characterization for
randomized SETH-based reductions, assuming NUNSETH. This settles the
SETH-hardness of approximating the diameter of sparse directed unweighted
graphs for deterministic reductions, up to NSETH, and for randomized
reductions, up to NUNSETH.
Cheers,
David
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Wed Nov 11 11:34:02 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 11 Nov 2020 11:34:02 -0800
Subject: [theory-seminar] Theory Lunch 11/12: Ray Li
Message-ID:
Hi all,
Theory lunch will be happening tomorrow at noon (PDT), at our gather space:
https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
SongComplexity).
Ray will tell us about *Settling SETH vs. Approximate Sparse Directed
Unweighted Diameter (up to (NU)NSETH)*
Abstract:
In this talk, we discuss some recent work on the fine-grained complexity of
approximating the diameter of a graph. The results include the following.
- For any eps>0, assuming the Strong Exponential Time Hypothesis (SETH),
there are no near-linear time (2-eps)-approximation algorithms for the
Diameter of a sparse directed graph, even in unweighted graphs. This result
shows that a simple near-linear time 2-approximation algorithm for Diameter
is optimal under SETH, answering a question from a survey of Rubinstein and
Vassilevska-Williams (SIGACT '19) for the case of directed graphs.
- In the same survey, Rubinstein and Vassilevska-Williams also asked if it
is possible to show that there are no 2-eps approximation algorithms for
Diameter in a directed graph in O(n^{1.499}) time. We show that, assuming a
hypothesis called NSETH, one *cannot *use a deterministic SETH-based
reduction to rule out the existence of such algorithms. Furthermore,
assuming another hypothesis called Non-Uniform NSETH (NUNSETH), one cannot
use even a randomized SETH-based reduction to rule out the existence of
such algorithms.
- Extending the techniques in these two results, we *characterize *whether
a 2-eps approximation algorithm running in O(n^{1+delta}) time for the
Diameter of a sparse directed unweighted graph can be ruled out by a
SETH-based reduction for every delta\in(0,1) and (essentially) every
eps\in(0,1), assuming NSETH. We make the same characterization for
randomized SETH-based reductions, assuming NUNSETH. This settles the
SETH-hardness of approximating the diameter of sparse directed unweighted
graphs for deterministic reductions, up to NSETH, and for randomized
reductions, up to NUNSETH.
Cheers,
David
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From tavorb at stanford.edu Wed Nov 11 13:28:22 2020
From: tavorb at stanford.edu (Tavor Baharav)
Date: Wed, 11 Nov 2020 13:28:22 -0800
Subject: [theory-seminar]
=?utf-8?q?ISL_Colloquium=3A_=22A_Very_Sketchy_Ta?=
=?utf-8?b?bGsiIOKAkyBEYXZpZCBXb29kcnVmZiAoRnJpLCAxMy1Ob3YgQCAxOjE1?=
=?utf-8?b?cG0p?=
In-Reply-To:
References:
Message-ID:
Reminder: this talk is happening Friday, 13-Nov at 1:15pm, via Zoom
https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
If you would like to meet with the speaker, please sign up here:
https://docs.google.com/spreadsheets/d/1AnLThI8jtZs1sEE7Y0lJHQTnONgLBfKp9lDo5FkgXgc/edit?usp=sharing
On Mon, Nov 9, 2020 at 1:47 PM Tavor Baharav wrote:
> A Very Sketchy TalkDavid Woodruff ? Professor, CMU
>
> Fri, 13-Nov / 1:15pm / Zoom:
> https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
>
> *To avoid Zoom-bombing, we ask attendees to sign in via the above URL to
> receive the Zoom meeting details by email.*
>
> Note the non-standard day, time, and Zoom link!
>
> *If you would like to meet with the speaker, please sign up here:* *https://docs.google.com/spreadsheets/d/1AnLThI8jtZs1sEE7Y0lJHQTnONgLBfKp9lDo5FkgXgc/edit?usp=sharing
> *
> Abstract
>
> We give an overview of dimensionality reduction methods, or sketching, for
> a number of problems in optimization, first surveying work using these
> methods for classical problems, which gives near optimal algorithms for
> regression, low rank approximation, and natural variants. We then survey
> recent work applying sketching to column subset selection, kernel methods,
> sublinear algorithms for structured matrices, tensors, trace estimation,
> and so on. The focus in the talk will be on fast algorithms.
> Bio
>
> David Woodruff has been an associate professor at Carnegie Mellon
> University in the Computer Science Department since 2017. Before that he
> was a research scientist at the IBM Almaden Research Center, which he
> joined in 2007 after completing his Ph.D. at MIT in theoretical computer
> science. His research interests include data stream algorithms, distributed
> algorithms, machine learning, numerical linear algebra, optimization,
> sketching, and sparse recovery. He is the recipient of the 2020 Simons
> Investigator Award, the 2014 Presburger Award, and Best Paper Awards at
> STOC 2013, PODS 2010, and PODS, 2020. At IBM he was a member of the Academy
> of Technology and a Master Inventor.
> ------------------------------
>
> Mailing list: https://mailman.stanford.edu/mailman/listinfo/isl-colloq
> This talk: http://isl.stanford.edu/talks/talks/2020q4/david-woodruff/
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 12 08:31:11 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 12 Nov 2020 08:31:11 -0800
Subject: [theory-seminar] Theory Lunch 11/12: Ray Li
In-Reply-To:
References:
Message-ID:
*Reminder:* This is happening today at noon!
Today, we have a newly refurbished lecture hall (a little cozier than a
250-seat room.)
*Pro tip:* To join the zoom talk:
(1) go to the lecture hall,
(2) grab a seat, and
(3)* press X to join the zoom lecture*.
See you soon!
David
On Wed, 11 Nov 2020 at 11:34, David Wajc wrote:
> Hi all,
>
> Theory lunch will be happening tomorrow at noon (PDT), at our gather
> space:
> https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
> SongComplexity).
> Ray will tell us about *Settling SETH vs. Approximate Sparse Directed
> Unweighted Diameter (up to (NU)NSETH)*
>
> Abstract:
> In this talk, we discuss some recent work on the fine-grained complexity
> of approximating the diameter of a graph. The results include the
> following.
> - For any eps>0, assuming the Strong Exponential Time Hypothesis (SETH),
> there are no near-linear time (2-eps)-approximation algorithms for the
> Diameter of a sparse directed graph, even in unweighted graphs. This result
> shows that a simple near-linear time 2-approximation algorithm for Diameter
> is optimal under SETH, answering a question from a survey of Rubinstein and
> Vassilevska-Williams (SIGACT '19) for the case of directed graphs.
> - In the same survey, Rubinstein and Vassilevska-Williams also asked if it
> is possible to show that there are no 2-eps approximation algorithms for
> Diameter in a directed graph in O(n^{1.499}) time. We show that, assuming a
> hypothesis called NSETH, one *cannot *use a deterministic SETH-based
> reduction to rule out the existence of such algorithms. Furthermore,
> assuming another hypothesis called Non-Uniform NSETH (NUNSETH), one cannot
> use even a randomized SETH-based reduction to rule out the existence of
> such algorithms.
> - Extending the techniques in these two results, we *characterize *whether
> a 2-eps approximation algorithm running in O(n^{1+delta}) time for the
> Diameter of a sparse directed unweighted graph can be ruled out by a
> SETH-based reduction for every delta\in(0,1) and (essentially) every
> eps\in(0,1), assuming NSETH. We make the same characterization for
> randomized SETH-based reductions, assuming NUNSETH. This settles the
> SETH-hardness of approximating the diameter of sparse directed unweighted
> graphs for deterministic reductions, up to NSETH, and for randomized
> reductions, up to NUNSETH.
>
> Cheers,
>
> David
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 12 08:31:11 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 12 Nov 2020 08:31:11 -0800
Subject: [theory-seminar] Theory Lunch 11/12: Ray Li
In-Reply-To:
References:
Message-ID:
*Reminder:* This is happening today at noon!
Today, we have a newly refurbished lecture hall (a little cozier than a
250-seat room.)
*Pro tip:* To join the zoom talk:
(1) go to the lecture hall,
(2) grab a seat, and
(3)* press X to join the zoom lecture*.
See you soon!
David
On Wed, 11 Nov 2020 at 11:34, David Wajc wrote:
> Hi all,
>
> Theory lunch will be happening tomorrow at noon (PDT), at our gather
> space:
> https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
> SongComplexity).
> Ray will tell us about *Settling SETH vs. Approximate Sparse Directed
> Unweighted Diameter (up to (NU)NSETH)*
>
> Abstract:
> In this talk, we discuss some recent work on the fine-grained complexity
> of approximating the diameter of a graph. The results include the
> following.
> - For any eps>0, assuming the Strong Exponential Time Hypothesis (SETH),
> there are no near-linear time (2-eps)-approximation algorithms for the
> Diameter of a sparse directed graph, even in unweighted graphs. This result
> shows that a simple near-linear time 2-approximation algorithm for Diameter
> is optimal under SETH, answering a question from a survey of Rubinstein and
> Vassilevska-Williams (SIGACT '19) for the case of directed graphs.
> - In the same survey, Rubinstein and Vassilevska-Williams also asked if it
> is possible to show that there are no 2-eps approximation algorithms for
> Diameter in a directed graph in O(n^{1.499}) time. We show that, assuming a
> hypothesis called NSETH, one *cannot *use a deterministic SETH-based
> reduction to rule out the existence of such algorithms. Furthermore,
> assuming another hypothesis called Non-Uniform NSETH (NUNSETH), one cannot
> use even a randomized SETH-based reduction to rule out the existence of
> such algorithms.
> - Extending the techniques in these two results, we *characterize *whether
> a 2-eps approximation algorithm running in O(n^{1+delta}) time for the
> Diameter of a sparse directed unweighted graph can be ruled out by a
> SETH-based reduction for every delta\in(0,1) and (essentially) every
> eps\in(0,1), assuming NSETH. We make the same characterization for
> randomized SETH-based reductions, assuming NUNSETH. This settles the
> SETH-hardness of approximating the diameter of sparse directed unweighted
> graphs for deterministic reductions, up to NSETH, and for randomized
> reductions, up to NUNSETH.
>
> Cheers,
>
> David
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From moses at cs.stanford.edu Tue Nov 17 16:46:55 2020
From: moses at cs.stanford.edu (Moses Charikar)
Date: Tue, 17 Nov 2020 16:46:55 -0800
Subject: [theory-seminar] Fwd: Simons Institute Research Fellowship
Applications
In-Reply-To:
References:
Message-ID:
For those of you looking to apply for postdoc positions this year, the
Simons Institute has several opportunities -- more than usual (see below).
Cheers,
Moses
---------- Forwarded message ---------
From: Peter Bartlett
Date: Tue, Nov 17, 2020 at 4:35 PM
Subject: Simons Institute Research Fellowship Applications
To: Moses Charikar
Hi Moses,
I hope all is well with you.
I'm writing to ask for your help in spreading the word about Simons
Institute Fellowships for the next academic year. In addition to the usual
Research Fellowships for participation in Simons Institute programs, we
have five one- or two-year postdoctoral fellowships. The original call went
out a while ago, and the deadline is December 15. It would be great if you
could make sure that folks at Stanford are aware of this, as well as other
outstanding young people you know.
Here's the official announcement. The call for applications is accessible
from https://simons.berkeley.edu.
Thanks,
Peter
--------------------------------------------------------------------------------------------------------------------------------------------------
The Simons Institute for the Theory of Computing at UC Berkeley invites
applications for Postdoctoral Fellowships and Research Fellowships for the
academic year 2021-22.
Simons-Berkeley Postdoctoral Fellowships are prestigious one- or two-year
postdoctoral positions funded by the Simons Foundation in response to the
COVID-19 crisis. Postdoctoral Fellows will start in Fall 2021 and will have
the opportunity to collaborate with UC Berkeley faculty and to participate
in Simons Institute programs. Further details and application instructions
can be found at
https://simons.berkeley.edu/simons-berkeley-research-fellowship-call-applications
.
Simons-Berkeley Research Fellowships are an opportunity for outstanding
junior scientists to spend one or both semesters at the Institute in
connection with one or more of its programs. The programs for 2021-22 are
as follows:
* Computational Complexity of Statistical Inference (Fall 2021)
* Geometric Methods in Optimization and Sampling (Fall 2021)
* Causality (Spring 2022)
* Learning and Games (Spring 2022)
Applicants who already hold junior faculty or postdoctoral positions are
welcome to apply. In particular, applicants who hold, or expect to hold,
postdoctoral appointments at other institutions are encouraged to apply to
spend one semester as a Simons-Berkeley Fellow subject to the approval of
the postdoctoral institution. Further details and application instructions
can be found at
https://simons.berkeley.edu/simons-berkeley-research-fellowship-call-applications.
Information about the Institute and the above programs can be found at
http://simons.berkeley.edu.
Deadline for applications: December 15, 2020.
Peter Bartlett
Associate Director, Simons Institute for the Theory of Computing
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From bspang at stanford.edu Wed Nov 18 09:50:04 2020
From: bspang at stanford.edu (Bruce Spang)
Date: Wed, 18 Nov 2020 17:50:04 +0000
Subject: [theory-seminar] Talk on Friday Nov. 20 - General lower bounds for
estimation under information constraints
References:
Message-ID: <86FD4FC8-21E8-4C86-841C-360981A2DA9C@stanford.edu>
Hi all,
Forwarding along a message from Cl?ment about a virtual talk that may be interesting to this mailing list: https://dstheory.wordpress.com/2020/11/11/friday-nov-20-himanshu-tyagi-for-the-indian-institute-of-science-iisc/. Title and abstract is below
Enjoy your Wednesday!
Bruce
?
Himanshu Tyagi from IISc will speak about ?General lower bounds for estimation under information constraints?.
Abstract: We present very general lower bounds for parametric estimation when only limited information per sample is allowed. These limitations can arise, for example, in form of communication constraints, privacy constraints, or linear measurements. Our lower bounds hold for discrete distributions with large alphabet as well as continuous distributions with high-dimensional parameters, apply for any information constraint, and are valid for any $\ell_p$ loss function. Our bounds recover both strong data processing inequality based bounds and Cram?r-Rao based bound as special cases.
This talk is based on joint work with Jayadev Acharya and Cl?ment Canonne.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Wed Nov 18 10:00:14 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 18 Nov 2020 10:00:14 -0800
Subject: [theory-seminar] Theory Lunch 11/19: Yeganeh Ali Mohammadi
Message-ID:
Hi all,
Theory lunch will be happening tomorrow at noon (PDT), at our gather space:
https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
SongComplexity).
Yeganeh will tell us about her work, titled *On the Local Limit of an
Infection Process on Well-Connected Networks.*
*Abstract: *
We consider a simple infection process in which every node infects its
neighbors independently with probability $p$, on a sequence of expanders
with bounded average degree. In an infection process, an outbreak happens
if eventually a linear fraction of nodes are infected. Under the assumption
that the sequence of graphs has a weak local limit, we show that the
threshold for emergence of an outbreak, as well as the number of nodes
infected, and the probability of an outbreak are local properties, i.e.
they can be read off the limit graph. In the course of proving this, we
also prove local convergence for ``bond percolation?? which can be seen as
the unoriented version of the infection process.
Cheers,
David
PS
*Pro tip:* To join the zoom talk:
(1) go to the lecture hall,
(2) grab a seat, and
(3)* press X to join the zoom lecture*.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Wed Nov 18 10:00:14 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 18 Nov 2020 10:00:14 -0800
Subject: [theory-seminar] Theory Lunch 11/19: Yeganeh Ali Mohammadi
Message-ID:
Hi all,
Theory lunch will be happening tomorrow at noon (PDT), at our gather space:
https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
SongComplexity).
Yeganeh will tell us about her work, titled *On the Local Limit of an
Infection Process on Well-Connected Networks.*
*Abstract: *
We consider a simple infection process in which every node infects its
neighbors independently with probability $p$, on a sequence of expanders
with bounded average degree. In an infection process, an outbreak happens
if eventually a linear fraction of nodes are infected. Under the assumption
that the sequence of graphs has a weak local limit, we show that the
threshold for emergence of an outbreak, as well as the number of nodes
infected, and the probability of an outbreak are local properties, i.e.
they can be read off the limit graph. In the course of proving this, we
also prove local convergence for ``bond percolation?? which can be seen as
the unoriented version of the infection process.
Cheers,
David
PS
*Pro tip:* To join the zoom talk:
(1) go to the lecture hall,
(2) grab a seat, and
(3)* press X to join the zoom lecture*.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 19 12:25:43 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 19 Nov 2020 12:25:43 -0800
Subject: [theory-seminar] Theory Lunch 11/19: Yeganeh Ali Mohammadi
In-Reply-To:
References:
Message-ID:
Reminder: This talk is starting in 5 minutes.
Cheers,
David
On Wed, 18 Nov 2020 at 10:00, David Wajc wrote:
> Hi all,
>
> Theory lunch will be happening tomorrow at noon (PDT), at our gather
> space:
> https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
> SongComplexity).
> Yeganeh will tell us about her work, titled *On the Local Limit of an
> Infection Process on Well-Connected Networks.*
>
> *Abstract: *
> We consider a simple infection process in which every node infects its
> neighbors independently with probability $p$, on a sequence of expanders
> with bounded average degree. In an infection process, an outbreak happens
> if eventually a linear fraction of nodes are infected. Under the assumption
> that the sequence of graphs has a weak local limit, we show that the
> threshold for emergence of an outbreak, as well as the number of nodes
> infected, and the probability of an outbreak are local properties, i.e.
> they can be read off the limit graph. In the course of proving this, we
> also prove local convergence for ``bond percolation?? which can be seen as
> the unoriented version of the infection process.
>
> Cheers,
> David
>
> PS
> *Pro tip:* To join the zoom talk:
> (1) go to the lecture hall,
> (2) grab a seat, and
> (3)* press X to join the zoom lecture*.
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Thu Nov 19 12:25:43 2020
From: wajc at stanford.edu (David Wajc)
Date: Thu, 19 Nov 2020 12:25:43 -0800
Subject: [theory-seminar] Theory Lunch 11/19: Yeganeh Ali Mohammadi
In-Reply-To:
References:
Message-ID:
Reminder: This talk is starting in 5 minutes.
Cheers,
David
On Wed, 18 Nov 2020 at 10:00, David Wajc wrote:
> Hi all,
>
> Theory lunch will be happening tomorrow at noon (PDT), at our gather
> space:
> https://gather.town/app/lR6jRBPK44nZ7V68/StanfordTheory (*password:*
> SongComplexity).
> Yeganeh will tell us about her work, titled *On the Local Limit of an
> Infection Process on Well-Connected Networks.*
>
> *Abstract: *
> We consider a simple infection process in which every node infects its
> neighbors independently with probability $p$, on a sequence of expanders
> with bounded average degree. In an infection process, an outbreak happens
> if eventually a linear fraction of nodes are infected. Under the assumption
> that the sequence of graphs has a weak local limit, we show that the
> threshold for emergence of an outbreak, as well as the number of nodes
> infected, and the probability of an outbreak are local properties, i.e.
> they can be read off the limit graph. In the course of proving this, we
> also prove local convergence for ``bond percolation?? which can be seen as
> the unoriented version of the infection process.
>
> Cheers,
> David
>
> PS
> *Pro tip:* To join the zoom talk:
> (1) go to the lecture hall,
> (2) grab a seat, and
> (3)* press X to join the zoom lecture*.
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From ktian6 at gmail.com Sun Nov 22 14:41:30 2020
From: ktian6 at gmail.com (Kevin Tian)
Date: Sun, 22 Nov 2020 16:41:30 -0600
Subject: [theory-seminar] Theory group mixing
Message-ID:
Hi guys,
I will be taking over theory small-group rapid mixing, to give Margalit a
break from organizing all the social activities during the quarantine era.
I'll try to send out the small groups every week on Sunday night or
early-ish Monday to give people time to prepare. This is a reminder email
to fill out the form
https://docs.google.com/forms/d/e/1FAIpQLSckJZgjqOq0VKqU1A-055G-__hlmIKw_7yFsZOPVn5fxy5qkQ/viewform
if you have not already done so -- I'll send out another one of these for
next quarter at some point.
Also, moving forward I wonder how people feel about mixing up the "online"
pool and the "in person" pool to give everyone a chance to meet each other
(online). If you have objections to going to an online-only setup, please
let me know -- I am fine with either, but worry that if not too many people
sign up for the "in person only" pool, then we will run into a situation
where the same few people are mixing. Until I hear back from folks I think
I will just stick with the preferences people have already expressed for
now.
Cheers,
Kevin
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From mdharris at stanford.edu Mon Nov 23 10:11:30 2020
From: mdharris at stanford.edu (Megan D. Harris)
Date: Mon, 23 Nov 2020 18:11:30 +0000
Subject: [theory-seminar] Theory group mixing
In-Reply-To:
References:
Message-ID:
Thank you, Kevin!
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)
353 Jane Stanford Way, Rm 479
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Kevin Tian
Sent: Sunday, November 22, 2020 2:41 PM
To: theory-seminar at lists.stanford.edu ; theory-students at lists.stanford.edu
Subject: [theory-seminar] Theory group mixing
Hi guys,
I will be taking over theory small-group rapid mixing, to give Margalit a break from organizing all the social activities during the quarantine era. I'll try to send out the small groups every week on Sunday night or early-ish Monday to give people time to prepare. This is a reminder email to fill out the form https://docs.google.com/forms/d/e/1FAIpQLSckJZgjqOq0VKqU1A-055G-__hlmIKw_7yFsZOPVn5fxy5qkQ/viewform if you have not already done so -- I'll send out another one of these for next quarter at some point.
Also, moving forward I wonder how people feel about mixing up the "online" pool and the "in person" pool to give everyone a chance to meet each other (online). If you have objections to going to an online-only setup, please let me know -- I am fine with either, but worry that if not too many people sign up for the "in person only" pool, then we will run into a situation where the same few people are mixing. Until I hear back from folks I think I will just stick with the preferences people have already expressed for now.
Cheers,
Kevin
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From moses at cs.stanford.edu Tue Nov 24 22:49:13 2020
From: moses at cs.stanford.edu (Moses Charikar)
Date: Tue, 24 Nov 2020 22:49:13 -0800
Subject: [theory-seminar] Fwd: Postdocs at NU
In-Reply-To:
References:
Message-ID:
For those of you graduating this year and looking for postdoc positions,
there are several theory positions at Northwestern (which has a strong
theory group and many theoreticians in the Chicago area). See below. Feel
free to contact Samir Khuller and
Konstantin Makarychev if you have any
questions.
Best,
Moses
---------- Forwarded message ---------
From: Samir Khuller
https://academicjobsonline.org/ajo/jobs/17450
Dear Colleagues:
We have multiple postdoc positions at Northwestern. Together with
activities of IDEAL and UIC, UofC, TTI-C, this has created a very
collaborative and vibrant theory culture in the Chicago area.
Could you please circulate this job ad to theory students at your school
who are graduating?
Thanks so much!
samir
PS: If your students have any questions, they can email Kostya and me.
Please avoid reply-all messages. Thanks so much for your help!
Samir Khuller
Peter and Adrienne Barris Professor and Chair
Computer Science Department
R.R. McCormick School of Engineering and Applied Sciences
3017 Seeley Mudd
Northwestern University
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Wed Nov 25 23:22:32 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 25 Nov 2020 23:22:32 -0800
Subject: [theory-seminar] Theory Lunch 11/26: Thanksgiving [No Talk]
Message-ID:
Hi all,
Theory Lunch will not take place tomorrow due to Thanksgiving. Talks will
resume next week. Those of you celebrating, enjoy your turkey!
Cheers,
David
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wajc at stanford.edu Wed Nov 25 23:22:32 2020
From: wajc at stanford.edu (David Wajc)
Date: Wed, 25 Nov 2020 23:22:32 -0800
Subject: [theory-seminar] Theory Lunch 11/26: Thanksgiving [No Talk]
Message-ID:
Hi all,
Theory Lunch will not take place tomorrow due to Thanksgiving. Talks will
resume next week. Those of you celebrating, enjoy your turkey!
Cheers,
David
-------------- next part --------------
An HTML attachment was scrubbed...
URL: