<div dir="ltr">Hi all,<div><br></div><div>Jelani Nelson is giving a talk tomorrow at NU distinguished lecture series which could be of interest to you. Please see the announcement below.</div><div><br></div><div>Best,</div><div>Ali</div><div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">---------- Forwarded message ---------<br>From: <strong class="gmail_sendername" dir="auto">Samir Khuller</strong> <span dir="auto"><<a href="mailto:samir.khuller@northwestern.edu" target="_blank">samir.khuller@northwestern.edu</a>></span><br>Date: Tue, Jan 19, 2021 at 1:34 PM<br>Subject: Fw: UPDATED Department of Computer Science Bulletin: Upcoming Events starting Friday January 15<br>To: Ali Vakilian <<a href="mailto:vakilian@ttic.edu" target="_blank">vakilian@ttic.edu</a>><br></div><br><br>




<div dir="ltr">
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
<br>
</div>
<div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
Please forward to TTIC friends.</div>
<div id="m_-2873041861394579640m_734572157269413177Signature">
<div>
<div></div>
<div></div>
<div name="divtagdefaultwrapper">
<div><br>
</div>
<div>Samir Khuller</div>
<div>Peter and Adrienne Barris Professor and Chair </div>
<div>Computer Science Department</div>
<div>R.R. McCormick School of Engineering and Applied Sciences</div>
<div>3017 Seeley Mudd </div>
<div>Northwestern University</div>
<div><br>
</div>
</div>
</div>
</div>
</div>
<div>
<div id="m_-2873041861394579640m_734572157269413177appendonsend"></div>
<hr style="display:inline-block;width:98%">
<div id="m_-2873041861394579640m_734572157269413177divRplyFwdMsg" dir="ltr"><span style="font-family:Calibri,sans-serif;font-size:11pt"> </span><br></div><div lang="EN-US" style="word-wrap:break-word"><div>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-bottom:12.0pt">
<b><span style="font-size:15.0pt;font-family:"Century Gothic",sans-serif;color:#7030a0">WEDNESDAY / CS Distinguished Lecture Series </span></b><b><span style="font-size:13.5pt;font-family:"Century Gothic",sans-serif;color:#7030a0"><br>
</span></b><b><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif;color:#7030a0">January 20  / 12:00 pm
</span></b><b><span style="font-size:13.0pt;font-family:"Century Gothic",sans-serif;color:#7030a0">  </span></b><b><span style="font-size:15.0pt;font-family:"Century Gothic",sans-serif;color:#7030a0"></span></b></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">“Sketching Algorithms”</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Jelani Nelson, UC Berkeley
</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif"> </span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-right:0in;margin-bottom:12.0pt;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Zoom: <br>
</span><a href="https://urldefense.com/v3/__https://northwestern.zoom.us/j/99265312096?pwd=VGZTZjhBa2Vva2ZOMTc5SHpKMFJkQT09__;!!Dq0X2DkFhyF93HkjWTBQKhk!G7FOlKQoTQDpovX9280i3CJJHLAGbDKqg2K87dpVNdyeHkAB4GO-Lb4YG5hQnJ126_tkPa09$" target="_blank"><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">https://northwestern.zoom.us/j/99265312096?pwd=VGZTZjhBa2Vva2ZOMTc5SHpKMFJkQT09</span></a><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif"></span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Livestream:<br>
</span><a href="https://urldefense.com/v3/__https://northwestern.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=dd081a99-5e70-4c48-9536-acb1010b70d0__;!!Dq0X2DkFhyF93HkjWTBQKhk!G7FOlKQoTQDpovX9280i3CJJHLAGbDKqg2K87dpVNdyeHkAB4GO-Lb4YG5hQnJ126xx4ylrT$" target="_blank"><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">https://northwestern.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=dd081a99-5e70-4c48-9536-acb1010b70d0</span></a><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif"><br>
<br>
<b>Abstract:</b></span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">A “sketch” is a data structure supporting some pre-specified set of queries and updates to a database while consuming space substantially (often exponentially) less than the information
 theoretic minimum required to store everything seen, and thus can also be seen as some form of functional compression. The advantages of sketching include less memory consumption, faster algorithms, and reduced bandwidth requirements in distributed computing
 environments. Work on sketching and streaming started in the late 70s and early 80s with algorithms such as the Morris approximate counter, Flajolet-Martin probabilistic counting (“distinct elements”), the Munro-Paterson rank/ select algorithms, and the Misra-Gries
 ‘Frequent’ algorithm, paused for a bit until the mid 1990s, and has maintained steam again since the 1996 work of Alon, Matias, and Szegedy. Despite decades of work in the area, some of the most basic questions still remain open or were only resolved recently.
 In this talk, I survey recent results across a wide variety of sketching topics, some old and some new.</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif"> </span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<b><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Biography:
</span></b></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-right:0in;margin-bottom:12.0pt;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Jelani Nelson is Professor in the Department of EECS at UC Berkeley.</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-right:0in;margin-bottom:12.0pt;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">His research interests include sketching and streaming algorithms, dimensionality reduction, compressing sensing, and randomized linear algebra. In the past he has been a recipient of the
 PECASE award, a Sloan Research Fellowship, and an NSF CAREER award. He is also the Founder and President of a 501(c)(3) nonprofit, “AddisCoder Inc.”, which organizes annual summer camps that have provided algorithms training to over 500 high school students
 in Ethiopia.</span></p>
</div>
</div>
</div>
</div>

</div></div></div>