Journals in DBLP

J. ACM
2005, volume: 52, number: 4

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