Journal of the ACM: Current Articles
Articles in September 2005, Volume 52, Number 5
Frontier Search
by R. E. Korf, W. Zhang, I. Thayer, and H. Hohwald
Lattice Problems in NP Intersects coNP
by D. Aharonov and O. Regev
On the Impossibility of Dimension Reduction in l1
by B. Brinkman and M. Charikar
Hardness of Approximating the Shortest Vector Problem in Lattices
by. S. Khot
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High-Speed Wireless Data
by M. Andrews and L. Zhang
Articles in July 2005, Volume 52, Number 4
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
by G. Franceschini and V. Geffert
Asymmetric k-Center Is log* n-Hard to Approximate
by J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz, R. Krauthgamer, and J. Naor
Indexing Compressed Test
by P. Ferragina and G. Manzini
Source Routing and Scheduling in Packet Networks
by M. Andrews, A. Fernandez, A. Goel, and L. Zhang
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
by H. Kaplan, M. Lewenstein, N. Shafrir, and M. Sviridenko
Remote Attribute Grammars
by J. T. Boyland
Boosting Textual Compression in Optimal LInear Time
by P. Ferragina, R. Giancarlo, G. Manzini, and M. Sciortino
Articles in May 2005, Volume 52, Number 3
An Improved Exponential-Time Algorithm for k-SAT
by R. Paturi, P. Pudlak, M. E. Saks, and F. Zane
Simplify: A Theorem Prover for Program Checking
by D. Detlefs, G. Nelson, and J. B. Saxe
Beyond Proof-of-Compliance: Security Analysis in Trust Management
by N. Li, J. C. Mitchell, and W. H. Winsborough
Articles in March 2005, Volume 52, Number 2
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking through the O(n2) Barrier
by C. Demetrescu and G. F. Italiano
Lower Bounds for Linear Degeneracy Testing
by N. Ailon and B. Chazelle
Simple Extractors for All Min-Entropies and a New Pseudorandom Generator
by R. Shaltiel and C. Umans
Trade-Offs in Probabilistic Packet Marking for IP Traceback
by M. Adler
Introduction to Special Section PODS 2003
An Information-Theoretic Approach to Normal Forms for Relational and XML Data
by M. Arenas and L. Libkin
The Complexity of XPath Query Evaluation and XML Typing
by G. Gottlob, C. Koch, R. Pichler, and L. Segoufin
Articles in January 2005, Volume 52, Number 1
Approximate Distance Oracles
by M. Thorup and U. Zwick
Determining Approximate Shortest Paths on Weighted Polyhedral Surfaces
by L. Aleksandrov, A. Maheshwari, and J. R. Sack
Aggregate Operators in Probabilistic Databases
by R. Ross, V. S. Subrahmanian, and J. Grant
Analyzing Security Protocols with Secrecy Types and Logic Programs
by M. Abadi and B. Blanchet
Articles in November 2004, Volume 51, Number 6
Concurrent Zero-Knowledge
by C. Dwork, M. Naor, and A. Sahai
New Lattice-Based Cryptographic Constructions
by O. Regev
Spatial Gossip and Resource Location Protocols
by D. Kempe, J. Kleinberg, and A. Demers
A New Approach to Dynamic All Pairs Shortest Paths
by C. Demetrescu and G. F. Italiano
Compact Oracles for Reachability and Approximate Distances in Planar Diagraphs
by M. Thorup
Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations
by A. Frieze, R. Kannan, and S. Vempala
Articles in September 2004, Volume 51, Number 5
Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions
by V. Koltun
Automatic Information Extraction from Large Websites
by V. Crescenzi and G. Mecca
Self-Stabilizing Clock Synchronization in the Presence of Byzantine Faults
by S. Dolev and J. L. Welch
A Unified Theory of Shared Memory Consistency
by R. C. Steinke and G. J. Nutt
http://www.acm.org/jacm/Current.html