Journal: SIGACT News

Volume 44, Issue 4

18 -- 24William I. Gasarch. Joint review of the honor class: Hilbert's problems and their solver by Ben Yandell and: Mathematical developments arising from Hilbert's problems edited by Felix Browder
24 -- 26Farhan Nasim. Review of variable-length codes for data compression by David Salomon
27 -- 28S. V. Nagaraj. Review of history of mathematics: highways and byways by Amy Dahan-Dalmedico and Jeanne Peiffer
29 -- 31Jon Katz. Review of identity-based encryption by Sanjit Chattarjee and Palash Sarkar
31 -- 34Myriam Abramson. Review of resources for teaching discrete mathematics: classroom projects, history modules, and articles edited by Brian Hopkins
35 -- 37Michaël Cadilhac. Review of proofs and algorithms by Gilles Dowek (translation by Maribel Fernandez)
38 -- 41Dimitris Papamichail. Review of introduction to computational proteomics by Golan Yona
41 -- 42Jeffrey Shallit. Review of computability and complexity theory by Steven Homer and Alan L. Selman
42 -- 47Frederic Green. Review quantum computing since democritus by Scott Aaronson
47 -- 48William I. Gasarch. Review of algorithmic puzzles by Anany Levitin and Maria Levitin
49 -- 51Dean Kelley. Technical report column
52 -- 0Lane A. Hemaspaandra. SIGACT news complexity theory column 80
53 -- 72Arnab Bhattacharyya. Guest column: on testing affine-invariant properties over finite fields
73 -- 78Adrian Dumitrescu, Minghui Jiang. Computational geometry column 58
79 -- 80Jennifer L. Welch. Distributed computing column 52: annual review 2013
81 -- 82. 2013 Dijkstra Prize in distributed computing to Nati Linial: 2013 Principles of Distributed Computing Doctoral Dissertation Award to Shiri Chechik and Danupon Nanongkai
83 -- 86Nicolas Braud-Santoni. PODC 2013 review
87 -- 90Shahar Timnat. DISC 2013 review
91 -- 97Ami Paz. Bremen workshop review

Volume 44, Issue 3

7 -- 8Richard Jankowski. Review of theoretical computer science: introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography by Juraj Hromkovic
9 -- 11Aaron Sterling. Review of the mathematics of life by Ian Stewart
12 -- 15Wesley Calvert. Review of universal semantic communication by B. Juba
15 -- 16Anthony Labarre. Review of graph algorithms (2nd edition) by Shimon Even, edited by Guy Even
17 -- 19Brittany Terese Fasy, David L. Millman. Review of how to fold it by J. O'Rourke
20 -- 24Dimitris Papamichail. Review of bioinformatics for biologists edited by Pavel Pevzner and Ron Shamir
24 -- 27Miklós Bóna. Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna
28 -- 31Angèle M. Hame. Review of enumerative combinatorics, volume 1, second edition by Richard P. Stanley
31 -- 35Akash Kumar. Review of combinatorial optimization by B. Korte and J. Vygen
35 -- 37Cynthia DiPaula, Andrew Wonnacott. Review11 of the golden ticket: P, NP, and the search for the impossible by Lance Fortnow
38 -- 39Joshua Brulé. Review of probably approximately correct by Leslie Valiant
40 -- 41Dean Kelley. Technical report column
42 -- 55Raghav Kulkarni. Gems in decision tree complexity revisited
56 -- 68Suresh Venkatasubramanian. Moving heaven and earth: distances between distributions
69 -- 71Wenfei Fan. Report on PODS 2013
72 -- 0Idit Keidar. Distributed computing column 51: large-scale transaction replication
73 -- 77Dahlia Malkhi, Jean-Philippe Martin. Spanner's concurrency control
78 -- 84Ittay Eyal. Fault tolerant transaction architectures

Volume 44, Issue 2

7 -- 9William I. Gasarch. The book review column
10 -- 12Mohsen Vakilian. Joint review of how to solve it: a new aspect of mathematical method by George Polya and Street-fighting mathematics by Sanjoy Mahajan
12 -- 14Matthias Gallé. Review of grammatical inference: learning automata and grammars by Colin de la Higuera
14 -- 17Arthur Milchior. Review of logical foundation of proof complexity by Stephen Cook and Phuong Nguyen
17 -- 21Michael Lampis. Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch
22 -- 26Sven Herrmann. Review of bioinspired computation in combinatorial optimization by Frank Neumann and Carsten Witt
26 -- 28Michael Murphy. Review of triangulations: structure for algorithms and applications by Jesús A. De Lorea, Jörg Rambau, and Francisco Santos
28 -- 30Yixin Cao. Review of flows in networks by L. R. Ford Jr. and D. R. Fulkerson
31 -- 35Kyriakos N. Sgarbas. Review of quantum computing: a gentle introduction by Eleanor Rieffel and Wolfgang Polak
36 -- 39John D. Rogers. Review of the art of computer programming: volume 4a by Donald E. Knuth
39 -- 41William I. Gasarch. Review of boolean function complexity: advances and frontiers by Stasys Jukna
42 -- 45Dean Kelley. Technical report column
45 -- 46Lane A. Hemaspaandra. SIGACT news complexity theory column 78
47 -- 79Dorit Aharonov, Itai Arad, Thomas Vidick. Guest column: the quantum PCP conjecture
80 -- 87Adrian Dumitrescu, Minghui Jiang. Computational geometry column 56
88 -- 0Idit Keidar. Distributed computing column 50: distributing trusted third parties, innovation prize, and SIROCCO review
89 -- 91David Peleg. Prize for innovation in distributed computing: awarded to Roger Wattenhofer
92 -- 112Alptekin Küpçü. Distributing trusted third parties
113 -- 118Heger Arfaoui. A review of SIROCCO 2012
119 -- 124Li Chen. Education forum: digital geometry and its algorithms: an introduction
125 -- 0Rob van Stee. SIGACT news online algorithms column 22
126 -- 142Michael Dinitz. Recent advances on the matroid secretary problem

Volume 44, Issue 1

7 -- 9William I. Gasarch. The book review column
10 -- 11S. V. Nagaraj. Review of P, NP, and NP-Completeness by Oded Goldreich
12 -- 14Miklós Bóna. Review of Bijective Combinatorics by Nicholas Loehr
14 -- 16Tal Moran. Review of Surveillance or Security? by Susan Landau
17 -- 19Dave Werden. Review of Spyware and Adware by John Aycock
19 -- 21Harry Lewis. Review of Burdens of Proof By Jean-François Blanchette
21 -- 24Marcin Kaminski. Review of Boolean Models and Methods in Mathematics, Computer Science, and Engineering by Yves Crama and Peter L. Hammer
25 -- 28Jason Teutsch. Review of Algorithmic Randomness and Complexity by Downey and Hirschfeldt
29 -- 33Paul Rubin. Review of Information Retrieval By Buettcher, Clarke, Cormack
34 -- 35Mark C. Wilson. Review of Models of Conflict and Cooperation by Rick Gillman and David Housman
36 -- 37Marius Zimand. Review of Deterministic Extraction from weak random sources by Ariel Gabizon
38 -- 40Jonathan Katz. Review of Applied Information Security by David Basin, Patrick Schaller, and Michael Schläpfer
40 -- 42Mohsen Mahmoudi Aznaveh. Review of Introduction to Bio-Ontologies by Peter N. Robinson and Sebastian Bauer
42 -- 45Omar Shehab. Review of The Dots and Boxes Game: Sophisticated Child's Play by Elwyn Berlekamp
46 -- 48Dean Kelley. Technical report column
49 -- 0Lane A. Hemaspaandra. SIGACT news complexity theory column 77
50 -- 69Kai-Min Chung, Rafael Pass. Guest column: parallel repetition theorems for interactive arguments
70 -- 78Suresh Venkatasubramanian. Computational geometry column 55: new developments in nonnegative matrix factorization
79 -- 0Idit Keidar. Distributed computing column 49: coding for distributed storage
80 -- 88Yuval Cassuto. What can coding theory do for storage systems?
89 -- 105Anwitaman Datta, Frédérique E. Oggier. An overview of codes tailor-made for better repairability in networked distributed storage systems
110 -- 114Mikkel Thorup. Mihai Pǎtraşcu: obituary and open problems