Journal: Theory Comput. Syst.

Volume 45, Issue 2

187 -- 0Robert D. Kleinberg, Christian Scheideler. Foreword
188 -- 202François Le Gall. Exponential Separation of Quantum and Classical Online Space Complexity
203 -- 233Matteo Frigo, Volker Strumpen. The Cache Complexity of Multithreaded Cache Oblivious Algorithms
234 -- 260Baruch Awerbuch, Christian Scheideler. Towards a Scalable and Robust DHT
261 -- 279Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir. Tell Me Who I Am: An Interactive Recommendation System
280 -- 301Brighten Godfrey, Richard M. Karp. On the Price of Heterogeneity in Parallel Systems
302 -- 324Ho-Lin Chen, Tim Roughgarden. Network Design with Weighted Players
325 -- 354Ami Litman, Shiri Moran-Schein. Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game
355 -- 371Costas S. Iliopoulos, Mohammad Sohel Rahman. A New Efficient Algorithm for Computing the Longest Common Subsequence
372 -- 380Vladimir Lipets. Bounds on Mincut for Cayley Graphs over Abelian Groups
381 -- 406Francine Blanchet-Sadri, N. C. Brownstein, Andy Kalcic, Justin Palumbo, T. Weyand. Unavoidable Sets of Partial Words
407 -- 425Sun-Yuan Hsieh, Yu-fen Weng. Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults