External Links

Journal: Journal of the ACM

Volume 50, Issue 6

795 -- 824Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
825 -- 851Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo. Improving table compression with combinatorial optimization
852 -- 921Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer. Magic Functions
922 -- 954Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal. Conditions on input vectors for consensus solvability in asynchronous distributed systems
955 -- 980Marie-Pierre Béal, Dominique Perrin. On the generating sequences of regular languages on ::::k:::: symbols

Volume 50, Issue 5

591 -- 640Andrei A. Krokhin, Peter Jeavons, Peter Jonsson. Reasoning about temporal relations: The tractable subalgebras of Allen s interval algebra
641 -- 664Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe. The geometric maximum traveling salesman problem
665 -- 693Wei Biao Wu, Chinya V. Ravishankar. The performance of difference coding for sets and relational tables
694 -- 751Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. Definable relations and first-order query languages over strings
752 -- 794Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith. Counterexample-guided abstraction refinement for symbolic model checking

Volume 50, Issue 4

427 -- 428Prabhakar Raghavan. Editorial: Preserving excellence through change
429 -- 443Manindra Agrawal, Somenath Biswas. Primality and identity testing via Chinese remaindering
444 -- 468Hagit Attiya, Arie Fouren. Algorithms adapting to point contention
469 -- 505Ning Zhong 0002, Klaus Weihrauch. Computatbility theory of generalized functions
506 -- 519Avrim Blum, Adam Kalai, Hal Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model
520 -- 550Emilio Leonardi, Marco Mellia, Fabio Neri, Marco Ajmone Marsan. Bounds on delays and queue lengths in input-queued cell switches
551 -- 567Bala Kalyanasundaram, Kirk Pruhs. Minimizing flow time nonclairvoyantly
568 -- 589Berthold Vöcking. How asymmetry helps load balancing

Volume 50, Issue 3

277 -- 279Yuanlin Zhang, Roland H. C. Yap. Erratum: P. van Beek and R. Dechter s theorem on constraint looseness and local consistency
280 -- 305Adnan Darwiche. A differential approach to inference in Bayesian networks
306 -- 332Bruce A. Reed. The height of a random binary search tree
333 -- 374Michael Drmota. An analytic approach to the height of binary search trees II
375 -- 425Gianfranco Bilardi, Keshav Pingali. Algorithms for computing the static single assignment form

Volume 50, Issue 2

107 -- 153Rina Dechter, Irina Rish. Mini-buckets: A general scheme for bounded inference
154 -- 195Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. Time-space trade-off lower bounds for randomized computation of decision problems
196 -- 249Amit Sahai, Salil P. Vadhan. A complete problem for statistical zero knowledge
250 -- 275D. N. Jayasimha, Loren Schwiebert, D. Manivannan, Jeff A. May. A foundation for designing deadlock-free routing algorithms in wormhole networks

Volume 50, Issue 1

3 -- 7Joseph Y. Halpern. JACM s 50th anniversary
9 -- 0. JACM editors-in-chief
10 -- 11Franz L. Alt. Journal of the ACM - the beginnings
12 -- 13Mario L. Juncosa. Transitions 1959-1964
14 -- 0C. C. Gotlieb. A Golden Age for JACM
15 -- 0Raymond E. Miller. JACM 1973-1975
16 -- 0Edward G. Coffman Jr.. JACM 1976-1979
17 -- 0Michael J. Fischer. JACM 1983-1986
18 -- 0Daniel J. Rosenkrantz. JACM 1986-1990
19 -- 0Frank Thomson Leighton. JACM 1991-1997
21 -- 23Mark Mandelbaum. A report from Headquarters
25 -- 26Frederick P. Brooks Jr.. Three great challenges for half-century-old computer science
27 -- 29Stephen A. Cook. The importance of the P versus NP question
30 -- 31Fernando J. Corbató. On computer system challenges
32 -- 40Edward A. Feigenbaum. Some challenges and grand challenges for computational intelligence
41 -- 57Jim Gray. What next?: A dozen information-technology research goals
58 -- 62Juris Hartmanis. Separation of complexity classes
63 -- 69C. A. R. Hoare. The verifying compiler: A grand challenge for computing research
70 -- 72Butler W. Lampson. Getting computers to understand
73 -- 79John McCarthy. Problems and projections in CS for the next 49 year
80 -- 82Alexander A. Razborov. Propositional proof complexity
83 -- 86Raj Reddy. Three open problems in AI
87 -- 90Peter W. Shor. Why haven t more quantum algorithms been found?
91 -- 95Richard Edwin Stearns. Deterministic versus nondeterministic time and lower bound problems
96 -- 99Leslie G. Valiant. Three problems in computer science
100 -- 105Andrew Chi-Chih Yao. Classical physics and the Church-Turing Thesis
runs on