External Links

Journal: Journal of the ACM

Volume 52, Issue 6

835 -- 865Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas. Time-space lower bounds for satisfiability
866 -- 893Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. Subexponential parameterized algorithms on bounded-genus graphs and ::::H::::-minor-free graphs
894 -- 960Anindya Banerjee, David A. Naumann. Ownership confinement ensures representation independence for object-oriented programs
961 -- 1023Massimo Merro, Francesco Zappa Nardelli. Behavioral theory for mobile ambients

Volume 52, Issue 5

715 -- 748Richard E. Korf, Weixiong Zhang, Ignacio Thayer, Heath Hohwald. Frontier search
749 -- 765Dorit Aharonov, Oded Regev. Lattice problems in NP cap coNP
766 -- 788Bo Brinkman, Moses Charikar. On the impossibility of dimension reduction in l::1::
789 -- 808Subhash Khot. Hardness of approximating the shortest vector problem in lattices
809 -- 834Matthew Andrews, Lisa Zhang. Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data

Volume 52, Issue 4

515 -- 537Gianni Franceschini, Viliam Geffert. An in-place sorting with ::::O::::(::::n::::log ::::n::::) comparisons and ::::O::::(::::n::::) moves
538 -- 551Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor. Asymmetric ::::k::::-center is log:::*::: ::::n::::-hard to approximate
552 -- 581Paolo Ferragina, Giovanni Manzini. Indexing compressed text
582 -- 601Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang. Source routing and scheduling in packet networks
602 -- 626Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
627 -- 687John Tang Boyland. Remote attribute grammars
688 -- 713Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Marinella Sciortino. Boosting textual compression in optimal linear time

Volume 52, Issue 3

337 -- 364Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane. An improved exponential-time algorithm for ::::k::::-SAT
365 -- 473David Detlefs, Greg Nelson, James B. Saxe. Simplify: a theorem prover for program checking
474 -- 514Ninghui Li, John C. Mitchell, William H. Winsborough. Beyond proof-of-compliance: security analysis in trust management

Volume 52, Issue 2

147 -- 156Camil Demetrescu, Giuseppe F. Italiano. Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n:::2::: barrier
157 -- 171Nir Ailon, Bernard Chazelle. Lower bounds for linear degeneracy testing
172 -- 216Ronen Shaltiel, Christopher Umans. Simple extractors for all min-entropies and a new pseudorandom generator
217 -- 244Micah Adler. Trade-offs in probabilistic packet marking for IP traceback
245 -- 0Tova Milo, Victor Vianu. Introduction
246 -- 283Marcelo Arenas, Leonid Libkin. An information-theoretic approach to normal forms for relational and XML data
284 -- 335Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin. The complexity of XPath query evaluation and XML typing

Volume 52, Issue 1

1 -- 24Mikkel Thorup, Uri Zwick. Approximate distance oracles
25 -- 53Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. Determining approximate shortest paths on weighted polyhedral surfaces
54 -- 101Robert B. Ross, V. S. Subrahmanian, John Grant. Aggregate operators in probabilistic databases
102 -- 146Martín Abadi, Bruno Blanchet. Analyzing security protocols with secrecy types and logic programs
runs on