%%% ====================================================================
%%%  @LaTeX-file{
%%%     filename  = "goodrichk96.ltx",
%%%     date      = "7 June 1996",
%%%     time      = "13:44:11 EDT",
%%%     author    = "David M. Jones",
%%%     email     = "jacm@theory.lcs.mit.edu",
%%%     url       = "http://theory.lcs.mit.edu/~jacm/",
%%%     address   = "Journal of the ACM
%%%                  MIT Laboratory for Computer Science
%%%                  Room NE43-316
%%%                  545 Technology Square
%%%                  Cambridge, MA 02139
%%%                  USA",
%%%     telephone = "(617) 253-5936",
%%%     FAX       = "(617) 253-3480",
%%%     checksum  = "49505 105 408 3530",
%%%     codetable = "ISO/ASCII",
%%%     supported = "yes",
%%%     docstring = "Copyright (c) 1995 by ACM, Inc.
%%%                  Permission to make digital or hard copies of part
%%%                  or all of this work for personal or classroom use
%%%                  is granted without fee provided that copies are
%%%                  not made or distributed for profit or direct
%%%                  commercial advantage and that copies bear this
%%%                  notice and the full citation on the first page.
%%%                  Copyrights for components of this work owned by
%%%                  others than ACM must be honored. Abstracting with
%%%                  credit is permitted. To copy otherwise, to
%%%                  republish, to post on servers, or to redistribute
%%%                  to lists, requires prior specific permission
%%%                  and/or a fee. Request permissions from
%%%                  Publications Dept, ACM Inc., fax +1 (212)
%%%                  869-0481, or permissions@acm.org.
%%%
%%%                  This is a LaTeX2e file.  To process it, you will
%%%                  need a copy of the acmabs document class, which is
%%%                  available via the following URL:
%%%
%%%                  http://theory.lcs.mit.edu/~jacm/acmart/acmabs.cls
%%%                  ",
%%%  }
%%% ====================================================================

\documentclass{acmabs}

\begin{document}

\Journal{Journal of the ACM}

\refkey{GoodrichK96}

\title{Sorting on a Parallel Pointer Machine with Applications to Set
Expression Evaluation}

\author{Michael~T. Goodrich \and S.~Rao Kosaraju}

\Pages{331--361}

\Month{March}

\Year{1996}

\Volume{43}

\Number{2}

\maketitle

\begin{abstract}

We present optimal algorithms for sorting on parallel CREW and EREW
versions of the pointer machine model. Intuitively, one can view our
methods as being based on a parallel mergesort using linked lists
rather than arrays (the usual parallel data structure). We also show
how to exploit the ``locality'' of our approach to solve the set
expression evaluation problem, a problem with applications to database
querying and logic-programming, in $O(\log n)$ time using $O(n)$
processors. Interestingly, this is an asymptotic improvement over what
seems possible using previous techniques.

\end{abstract}

\begin{categories}

E.1 [\textbf{Data Structures}]---\emph{arrays\textup; lists}; F.2.2
[\textbf{Analysis of Algorithms and Problem Complexity}]: Nonnumerical
Algorithms and Problems---\emph{sorting and searching}

\end{categories}

\begin{terms}

Algorithms, Theory, Verification

\end{terms}

\begin{keywords}

Cascade merging, expression evaluation, linking automaton, mergesort,
parallel algorithms, pointer machine, PRAM

\end{keywords}

\end{document}
