<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05988661</id>
  <dt>a</dt>
  <an>05988661</an>
  <augroup>
    <au>Goodrich, Michael T.</au>
    <au>Sitchinava, Nodari</au>
    <au>Zhang, Qin</au>
  </augroup>
  <ti>Sorting, searching, and simulation in the mapreduce framework.</ti>
  <so>Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5--8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 374-383 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-25591-5_39</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We study the MapReduce framework from an algorithmic standpoint, providing a generalization of the previous algorithmic models for MapReduce. We present optimal solutions for the fundamental problems of all-prefix-sums, sorting and multi-searching. Additionally, we design optimal simulations of the the well-established PRAM and BSP models in MapReduce, immediately resulting in optimal solutions to the problems of computing fixed-dimensional linear programming and 2-D and 3-D convex hulls.</ab>
    <rv></rv>
  </abgroup>
</item>