% emails
% dsig: jkatz, subhayan@acm.org, springer
% walk: bona, worldsci
% wealth: shehab1@umbc.edu, ppress NEED AUTHOR
% exp algs shoshana.marcus@kbcc.cuny.edu,cambrev, ccm@cs.amherst.edu
% fpt: downey,fellows, rajeshchitnis@gmail.com
% king: basicbooks, eowyn.cenek@eagles.usm.edu NEED David Berlinski}

%ASK Princeton Press to contact: Benjamin Wardhaugh, author of wealth of Numbers
%ASK basicbooks to contact: David Berlinski

% FOR THIS COLUMN: Bill/pop: knuth 2 books (Bill, cs/history, algorithm theme), tao blog book (Bill, math), 
% unplugged (algorithm theme)
% tech: stringology, strings (both algorithm theme)

%Emails for 46-2:
%Cult: Alberto A. Martinez, Pitt press:
% almartinez@austin.utexas.edu, msticco@upress.pitt.edu
%Infinitesimal: Amir Alexander, FSG:
%  amiralex@ucla.edu, fsg.publicity@fsgbooks.com, elisabeth.mcavoy@fsgbooks.com
%Gardner: Michael Henle and Brian Hopkins, 
%  Michael.Henle@oberlin.edu, bhopkins@saintpeters.edu, swebb@maa.org, MAA
%Knuth: Lonely Scholar
%   editor@lonelyscholar.com, egdaylight@dijkstrascry.com
%Lovemath: Edward Frenkel, 
%  frenkel@math.berkeley.edu, perseus.promos@perseusbooks.com, Basic Books
%Tao: Tao, AMS
%  tao@math.ucla.edu, reviewcopies@ams.org


\documentclass[11pt]{article}
\usepackage{html}
\usepackage{fullpage}
\usepackage{latexsym}
\usepackage{amsmath}
%\usepackage{url}
\usepackage{hyperref}
\usepackage{comment}
\usepackage{times}
\newcommand{\UU}{\mathbb{U}}
\newcommand{\VV}{\mathbb{V}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\paths}{{\cal P}}
\newcommand{\links}{E}
\newcommand{\xvec}[1]{x_1,\ldots,x_{#1}}
\newcommand{\Erdos}{Erd\H{o}s }
\newcommand{\Erdosns}{Erd\H{o}s}

\begin{document}

\centerline{\bf BOOKS THAT NEED REVIEWERS FOR THE SIGACT NEWS COLUMN}

\vskip 0.1in
\centerline{\bf Algorithms}

\vskip -0.25in


\begin{enumerate}

%\item
%{\it Distributed Systems: An algorithmic approach (second edition)},
%by Ghosh\\[-0.26in]%CRC 2014

\item
{\it Tractability: Practical approach to Hard Problems},
Edited by Bordeaux, Hamadi, Kohli\\[-0.26in]%Cambridge 2014

\item
{\it Recent progress in the Boolean Domain},
Edited by Bernd Steinbach\\[-0.26in]%Cambridge Scholars 2014

%\item {\it 
%A Guide to Graph Colouring
%Algorithms and Applications},
%by R.M.R.~Lewis\\[-0.26in]% Springer 2016

%\item {\it Twenty Lectures on Algorithmic Game Theory,} by Tim
%Roughgarden\\[-0.26in]% Cambridge 2016

%\item {\it Finite Elements: Theory and Algorithms},
%   by Sahikumaar Ganesan and Lutz Tobiska
%   \\[-0.26in]%Cambridge 2017    (Maulik)
   
%\item {\it Probability and Computing: Randomization and Probabilistic Techniques
%in Algorithms and Data Analysis}, by Michael Mitzenmacher and Eli Upfal
%\\[-0.26in]%Cambridge 2017

\item {\it Introduction to Property Testing}, by Oded Goldreich.\\[-0.26in]
%Cambridge 2017

\item {\it Algorithmic Aspects of Machine Learning}, by Ankur Moitra. % Cambridge 2018

\end{enumerate}

%\centerline{\bf Programming Languages}
%\begin{enumerate}

%\item
%{\it Selected Papers on Computer Languages} by Donald Knuth\\[-0.22in]

%\item
%{\it Practical Foundations for Programming Languages,} by Robert Harper\\[-0.22in]%Cambridge 2016

%\end{enumerate}

\centerline{\bf Miscellaneous Computer Science}

\begin{enumerate}

%\item
%{\it Algebraic Geometry Modeling in Information Theory,}
%Edited by Edgar Moro\\[-0.28in]% World Scientific 2013

%\item
%{\it Communication Networks: An Optimization, Control, and Stochastic
%Networks Perspective} by Srikant and Ying\\[-0.26in]%Cambridge 2014

%\item {\it Actual Causality}, by Joseph Y.\/ Halpern\\[-0.26in] % MIT Press 2016

\item {\it Elements of Causal Inference: Foundations and Learning Algorithms}, 
by Jonas Peters, Dominik Janzing, and Bernhard Sch\"{o}lkopf.\\[-0.26in]% MIT Press 2017
 
\item {\it Elements of Parallel Computing}, by Eric Aubanel\\[-0.26in]% CRC 2016

\item
{\it CoCo: The colorful history of Tandy's Underdog Computer}
by Boisy Pitre and Bill Loguidice\\[-0.26in]% CRC 2013

\item {\it Introduction to Reversible Computing}, by
Kalyan S. Perumalla\\[-0.26in]% CRC 2013

\item {\it A Short Course in Computational Geometry and Topology},
by Herbert Edelsbrunner\\[-0.26in]% Springer 2014

\item {\it Partially Observed Markov Decision Processes,} by Vikram Krishnamurthy\\[-0.26in]% Cambridge 2016

%\item {\it The Power of Networks}, by Christopher G.\/ Brinton and Mung Chiang\\[-0.26in]% Princeton 2017 (Louridas)

\item {\it Statistical Modeling and Machine Learning for Molecular Biology}, by
Alan Moses\\[-0.26in] % CRC 2016

%\item {\it Market Design: A Linear Programming Approach to Auctions and Matching,}
%by Martin Bichler.\\[-0.26in] % Cambridge 2018

\item {\it The Problem With Software: Why Smart Engineers Write Bad Code,} by
Adam Barr. \\[-0.26in] %MIT 2018

\item {\it Language, Cognition, and Computational Models,} Theirry Poibeau and
Aline Villavicencio, eds. % Cambridge 2018

\end{enumerate}

\centerline{\bf Computability, Complexity, Logic}

\begin{enumerate}
\item 
{\it The Foundations of Computability Theory,}
by Borut Robi\v{c}\\[-0.26in]%Springer 2015

%\item 
%{\it Models of Computation},
%by Roberto Bruni and Ugo Montanari\\[-0.26in]%Springer 2016

%\item
%{\it Proof Analysis: A Contribution to Hilbert's Last Problem} by Negri and Von Plato.\\[-0.26in]
%Cambridge 2014

\item {\it Applied Logic for Computer Scientists: Computational Deduction and 
Formal Proofs}, by Mauricio Ayala-Rinc\'on and Fl\'avio L.C. de Moura. 
\\[-0.26in]
%Springer 2017

\item {\it Descriptive Complexity, Canonisation, and Definable Graph Structure Theory},
by Martin Grohe.\\[-0.26in]
%Cambridge 2017

\item {\it Kernelization: Theory of Parameterized Preprocessing,}
by Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and 
Meirav Zehavi.%\\[-0.26in]
% Cambridge 2019

\end{enumerate}

\centerline{\bf Cryptography and Security}

\begin{enumerate}

\item {\it Cryptography in Constant Parallel Time,} by
Benny Appelbaum\\[-0.26in] %Springer 2014

\item {\it Secure Multiparty Computation and Secret Sharing},
    Ronald Cramer, Ivan Bjerre Damg{\aa}rd, and
    Jesper Buus Nielsen\\[-0.26in]% Cambridge 2015
    
%\item {\it Codes, Cryptography and Curves with Computer Algebra},
%Ruud Pellikaan, Xin-Wen Wu, Stanislav Bulygin, and
%Relinde Jurrius\\[-0.26in]% Cambridge 2018 (Nagaraj)
    
\item {\it A Cryptography Primer:
Secrets and Promises},
by Philip N. Klein%\\[-0.26in]% Cambridge 2014

\end{enumerate}

%\pagebreak
\centerline{\bf  Combinatorics and Graph Theory}

\begin{enumerate}

\item {\it Finite Geometry and Combinatorial Applications},
by Simeon Ball\\[-0.26in]%Cambridge 2015

\item {\it Introduction to Random Graphs},
by    Alan Frieze and Micha\l{} Karo{\'n}ski\\[-0.26in]% Cambridge 2016

\item {\it \Erdos--Ko--Rado Theorems: Algebraic Approaches},
by    Christopher Godsil and Karen Meagher\\[-0.26in]% Cambridge 2015

\item {\it Combinatorics, Words and Symbolic Dynamics,}
Edited by Val{\'e}rie Berth{\'e} and Michel Rigo\\%[-0.26in]% Cambridge 2016

\end{enumerate}

\centerline{\bf Miscellaneous Mathematics}

\begin{enumerate}

\item {\it Introduction to Probability}, by David F.~Anderson,
Timo Sepp\"{a}l\"{a}inen, and Benedek Valk{\'o}.% Cambridge 2018

%\item {\it The Banach-Tarski Paradox (2nd Ed.)}, by
%Grzegorz Tomkowicz and Stan Wagon. % Cambridge 2016


\end{enumerate}

\end{document}

