Difference between revisions of "Robert A. Wagner"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Robert A. Wagner''' FILE:rawagner.jpg|border|right|thumb|link=https://users.cs.duke.edu/~raw/| Robert Wagner <ref>[https://users.cs.duk...") |
GerdIsenberg (talk | contribs) |
||
| Line 8: | Line 8: | ||
In 1961 at MIT, Robert A. Wagner became member of the "the chess group" supervised by [[John McCarthy]], along with [[Alan Kotok]], [[Charles Niessen]] and [[Michael A. Lieberman]]. | In 1961 at MIT, Robert A. Wagner became member of the "the chess group" supervised by [[John McCarthy]], along with [[Alan Kotok]], [[Charles Niessen]] and [[Michael A. Lieberman]]. | ||
They wrote the chess program for the [[IBM 7090]] <ref>[[Alan Kotok]] ('''1962'''). ''[http://www.kotok.org/AI_Memo_41.html Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program]''.</ref>, which later evolved to the [[Kotok-McCarthy-Program|Kotok-McCarthy-Chess Program]]. | They wrote the chess program for the [[IBM 7090]] <ref>[[Alan Kotok]] ('''1962'''). ''[http://www.kotok.org/AI_Memo_41.html Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program]''.</ref>, which later evolved to the [[Kotok-McCarthy-Program|Kotok-McCarthy-Chess Program]]. | ||
| − | In a 1982 usenet post, [[Tom Truscott]] mentions Wagner's encoding of [[Chess Position|chess positions]], which requires ~143 bits | + | In a 1982 usenet post, [[Tom Truscott]] mentions Wagner's encoding of [[Chess Position|chess positions]], which requires ~143 bits <ref>[http://quux.org:70/Archives/usenet-a-news/NET.chess/82.01.05_duke.1553_net.chess.txt Re: sri-unix.426: compact representation of a position] by [[Tom Truscott]], [http://quux.org:70/Archives/usenet-a-news/NET.chess net.chess], January 5, 1982</ref> |
| − | |||
| − | <ref>[http://quux.org:70/Archives/usenet-a-news/NET.chess/82.01.05_duke.1553_net.chess.txt Re: sri-unix.426: compact representation of a position] by [[Tom Truscott]], [http://quux.org:70/Archives/usenet-a-news/NET.chess net.chess], January 5, 1982</ref> | ||
<ref>[http://quux.org:70/Archives/usenet-a-news/NET.chess/82.01.07_duke.1593_net.chess.txt Re: sri-unix.444: compact representation of chess positions] by [[Tom Truscott]], [http://quux.org:70/Archives/usenet-a-news/NET.chess net.chess], January 7, 1982</ref>. | <ref>[http://quux.org:70/Archives/usenet-a-news/NET.chess/82.01.07_duke.1593_net.chess.txt Re: sri-unix.444: compact representation of chess positions] by [[Tom Truscott]], [http://quux.org:70/Archives/usenet-a-news/NET.chess net.chess], January 7, 1982</ref>. | ||
Revision as of 14:21, 27 February 2020
Home * People * Robert A. Wagner
Robert Wagner [1]
Robert Alan Wagner,
an American mathematician and computer scientist, since 1978 associate professor, since 2007 professor emeritus at Department of Computer Science, Levine Science Research Center, Duke University. He received his B.S. degree from Massachusetts Institute of Technology in 1962, and the Ph.D. degree from the Carnegie Mellon University in 1968, and before Duke, he was assistant professor at Cornell University and associate professor of CS at Vanderbilt University [2].
His research interests include experimental VLSI architectures, application of dynamic programming to algorithms and systems design, design of optimal software and hardware systems, and time-cost trade-offs in abstract parallel computer models.
In 1961 at MIT, Robert A. Wagner became member of the "the chess group" supervised by John McCarthy, along with Alan Kotok, Charles Niessen and Michael A. Lieberman.
They wrote the chess program for the IBM 7090 [3], which later evolved to the Kotok-McCarthy-Chess Program.
In a 1982 usenet post, Tom Truscott mentions Wagner's encoding of chess positions, which requires ~143 bits [4]
[5].
Contents
Selected Publications
1968
- Robert A. Wagner (1968). Some Techniques for Algorithm Optimization with Application to Matrix Arithmetic Expressions. Ph.D. thesis, Carnegie Mellon University, advisor Alan Jay Perlis
1970 ...
- Stuart Dreyfus, Robert A. Wagner (1972). The Steiner Problem in Graphs. Networks, Vol. 1, pdf [7]
- Robert A. Wagner (1973). Algorithm 444: An Algorithm for Extracting Phrases in a Space-Optimal Fashion. Communications of the ACM, Vol. 16, No. 3
- Robert A. Wagner, Michael J. Fischer (1974). The String-to-String Correction Problem. Journal of the ACM, Vol. 21, No. 1 [8]
- Robert A. Wagner (1976). A Shortest Path Algorithm for Edge-Sparse Graphs. Journal of the ACM, Vol. 23, No. 1
1980 ...
- Robert A. Wagner, Kishor S. Trivedi (1980). Hardware configuration selection through discretizing a continuous variable solution. SIGMETRICS Performance, Vol. 9, No. 2
- Kishor S. Trivedi, Robert A. Wagner, Timothy M. Sigmon (1980). Optimal Selection of CPU Speed, Device Capacities, and File Assignments. Journal of the ACM, Vol. 27, No. 3
- Robert A. Wagner (1983). The Boolean Vector Machine [BVM]. ISCA 1983
- Robert A. Wagner, Robert Geist (1984). The Crippled Queen Placement Problem. Science of Computer Programming, Vol. 4, No. 3, pdf
- Robert A. Wagner, Merrell L. Patrick (1988). A sparse matrix algorithm on the Boolean vector machine. Parallel Computing, Vol 6., No. 3
1990 ...
- Yijie Han, Robert A. Wagner (1990). An Efficient and Fast Parallel-Connected Component Algorithm. Journal of the ACM, Vol. 37, No. 3
- Robert A. Wagner (1997). Evaluating Uniform Expressions Within Two Steps of Minimum Parallel Time. Journal of the ACM, Vol. 44, No. 2
External Links
References
- ↑ Robert Wagner's Home Page
- ↑ Robert Wagner's Home Page
- ↑ Alan Kotok (1962). Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program.
- ↑ Re: sri-unix.426: compact representation of a position by Tom Truscott, net.chess, January 5, 1982
- ↑ Re: sri-unix.444: compact representation of chess positions by Tom Truscott, net.chess, January 7, 1982
- ↑ dblp: Robert A. Wagner
- ↑ Steiner tree problem from Wikipedia
- ↑ String-to-string correction problem from Wikipedia
