Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 28, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Stephen Chestnut

Streaming space complexity of nearly all functions of one variable

A data stream can be viewed as a long list of updates to a high dimensional vector. A processor reads the items one-at-a-time, in the order they are given, and is tasked to compute a function of the stream. With applications to distributed computing, databases, and high throughput scientific data, data streaming has emerged as an important model of computation in scenarios where it is impractical or impossible to store the input. This talk first reviews a few of the basic tools used for streaming algorithms and lower bounds. Next, we go on to characterize the space complexity for a large class of functions that generalizes the well-known frequency moments problem and others. This is joint work with Vladimir Braverman and Lin F. Yang at Johns Hopkins University.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login