Journal of the ACM, Volume 55, 2009

Volume 56, Number 1, January 2009

• Kousha Etessami, Mihalis Yannakakis:
  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations.
  Electronic Edition (ACM DL) BibTeX
• Moni Naor, Guy N. Rothblum:
  The complexity of online memory checking.
  Electronic Edition (ACM DL) BibTeX
• Leslie G. Valiant:
  Evolvability.
  Electronic Edition (ACM DL) BibTeX
• Moshe Babaioff, Ron Lavi, Elan Pavlov:
  Single-value combinatorial auctions and algorithmic implementation in undominated strategies.
  Electronic Edition (ACM DL) BibTeX

Volume 56, Number 2, April 2009

• Sanjeev Arora, Satish Rao, Umesh V. Vazirani:
  Expander flows, geometric embeddings and graph partitioning.
  Electronic Edition (ACM DL) BibTeX
• Julia Chuzhoy, Sanjeev Khanna:
  Polynomial flow-cut gaps and hardness of directed cut problems.
  Electronic Edition (ACM DL) BibTeX
• Lars Arvestad, Jens Lagergren, Bengt Sennblad:
  The gene evolution model and computing its associated probabilities.
  Electronic Edition (ACM DL) BibTeX
• Ran Raz:
  Multi-linear formulas for permanent and determinant are of super-polynomial size.
  Electronic Edition (ACM DL) BibTeX
• Glencora Borradaile, Philip N. Klein:
  An O(n log n) algorithm for maximum st-flow in a directed planar graph.
  Electronic Edition (ACM DL) BibTeX
• Markus Püschel, Peter A. Milder, James C. Hoe:
  Permuting streaming data using RAMs.
  Electronic Edition (ACM DL) BibTeX