Sublinear Algorithms Dagstuhl Seminar

Artur Czumaj, S Muthukrishnan, Ronitt Rubinfeld, Christian Sohler
unpublished
From August 17 to August 22, 2008, the Dagstuhl Seminar 08341 Sublinear Algorithms was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in
more » ... Links to extended abstracts or full papers are provided, if available. 08341 Executive Summary Sublinear Algorithms With the increasing role of information technologies we are often confronted with a huge amount of information that is generated without pace by distributed sources or by large scale complex information systems. In many scenarios, it is not possible to entirely store this information on standard storage devices. Examples include the World Wide Web, data accumulated in network trac monitoring, or sensor network data. One of the key challenges in this context is to eciently process these massive data sets and to extract knowledge by summarizing and aggregating their major features. Most of the time, it is impossible to use traditional algorithms for this purpose. Even linear time algorithms are typically too slow because they require random access to the input data. We require algorithm that either look only at a small random sample of the input or process the data as it arrives extracting a small summary.
fatcat:cwqcw4opkbcxrknrsuzecr7ary