External Links

Journal: Journal of the ACM

Volume 46, Issue 6

787 -- 832Frank Thomson Leighton, Satish Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
833 -- 857Yunhong Zhou, Subhash Suri. Analysis of a bounding box heuristic for object intersection
858 -- 923Maurice Herlihy, Nir Shavit. The topological structure of asynchronous computability
924 -- 942Rolf H. Möhring, Andreas S. Schulz, Marc Uetz. Approximation in stochastic scheduling: the power of LP-based priority policies

Volume 46, Issue 5

604 -- 632Jon M. Kleinberg. Authoritative Sources in a Hyperlinked Environment
667 -- 683Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos. Linear Hash Functions
684 -- 719Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans-Ulrich Simon. Sample-Efficient Strategies for Learning in the Presence of Noise
720 -- 748Robert D. Blumofe, Charles E. Leiserson. Scheduling Multithreaded Computations by Work Stealing

Volume 46, Issue 4

437 -- 449Martin Farach, Sampath Kannan. Efficient Algorithms for Inverting Evolution
450 -- 472Shafi Goldwasser, Joe Kilian. Primality Testing Using Elliptic Curves
473 -- 501Michael L. Fredman. On the Efficiency of Pairing Heaps and Related Data Structures
502 -- 516Monika Rauch Henzinger, Valerie King. Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation
517 -- 536Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi. Mutual Search
537 -- 555Saugata Basu. New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases
556 -- 0Michael Rodeh, Shmuel Sagiv. Finding Circular Attributes in Attribute Grammars

Volume 46, Issue 3

325 -- 361Fiora Pirri, Raymond Reiter. Some Contributions to the Metatheory of the Situation Calculus
362 -- 394Mikkel Thorup. Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time
395 -- 415Gene Myers. A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
416 -- 435Fung Yu Young, Chris C. N. Chu, D. F. Wong. Generation of Universal Series-Parallel Boolean Functions

Volume 46, Issue 2

185 -- 211Joel Hass, J. C. Lagarias, Nicholas Pippenger. The Computational Complexity of Knot and Link Problems
212 -- 235Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton. Reconstructing a Three-Dimensional Model with Arbitrary Errors
236 -- 280Paolo Ferragina, Roberto Grossi. The String B-tree: A New Data Structure for String Search in External Memory and Its Applications
281 -- 321Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias. Provably Efficient Scheduling for Languages with Fine-Grained Parallelism

Volume 46, Issue 1

1 -- 27Sridhar Hannenhalli, Pavel A. Pevzner. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals
28 -- 91Zvi Galil, Giuseppe F. Italiano, Neil Sarnak. Fully Dynamic Planarity Testing with Applications
92 -- 112Elizabeth J. O Neil, Patrick E. O Neil, Gerhard Weikum. An Optimality Proof of the LRU-::::K:::: Page Replacement Algorithm
113 -- 184Felipe Cucker, Steve Smale. Complexity Estimates Depending on Condition and Round-Off Error
runs on