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