Извините, регистрация закрыта. Возможно, на событие уже зарегистрировалось слишком много человек, либо истек срок регистрации. Подробности Вы можете узнать у организаторов события.
Обязательна регистрация на events.yandex.ru/events/science-sem...
Consider a setting in which inputs to and outputs from a computational problem are so large, that there is not time to read them in their entirety. However, if one is only interested in small parts of the output at any given time, is it really necessary to solve the entire computational problem? Is it even necessary to view the whole input? We survey recent work in the model of local computation algorithms which for a given input, supports queries by a user to values of specified bits of a legal output. The goal is to design local computation algorithms in such a way that very little of the input needs to be seen in order to determine the value of any single bit of the output. In this talk, we describe results on a variety of problems for which sublinear time and space local computation algorithms have been developed — we will give special focus to finding maximal independent sets and sparse spanning graphs.
Biography of a lector
Ronitt Rubinfeld is a professor in the Department of Electrical Engineering and Computer Science and a member of the Computer Science and Artificial Intelligence Laboratory at MIT and a professor of Computer Science at Tel Aviv university. Her main research area is theory of computation. Her current interests include randomized and sublinear time algorithms. In particular, she is interested in what can be understood about data by looking at only a very small portion of it.
Ronitt received her PhD from the University of California, Berkeley in 1991, and prior to that graduated from the University of Michigan with a BSE in Electrical and Computer Engineering. She then spent a year as a postdoctoral researcher at Princeton University, followed by a year at Hebrew University in Jerusalem. In 1992, she joined the faculty of the Computer Science Department at Cornell University, where she was an ONR Young Investigator, a Sloan Research Fellow, the 1995 Cornell Association for Computer Science Undergraduates Faculty of the Year, and a recipient of the Cornell College of Engineering Teaching Award. During this time, she also held visiting positions at MIT and IBM Almaden. From 1999 to 2003, Ronitt was a Senior Research Scientist at NEC Research Laboratories, and prior to arriving at MIT, she was a Fellow at the Radcliffe Institute for Advanced Study. She joined the MIT faculty in 2004, and Tel Aviv University in 2008.
Ronitt has served on the program committees of numerous conferences in theoretical computer science and is on the editorial board of the Theory of Computing Systems, Algorithmica and ACM ToCT journals. She is a co-chair of the DIMACS Special Focus on Network Security.