https://www.chessprogramming.org/index.php?title=Robert_A._Wagner&feed=atom&action=historyRobert A. Wagner - Revision history2024-03-28T10:31:22ZRevision history for this page on the wikiMediaWiki 1.30.1https://www.chessprogramming.org/index.php?title=Robert_A._Wagner&diff=22228&oldid=prevSergeiMarkoff at 06:39, 16 November 20202020-11-16T06:39:04Z<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 06:39, 16 November 2020</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l3" >Line 3:</td>
<td colspan="2" class="diff-lineno">Line 3:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[FILE:rawagner.jpg|border|right|thumb|link=https://users.cs.duke.edu/~raw/| Robert Wagner <ref>[https://users.cs.duke.edu/~raw/ Robert Wagner's Home Page]</ref> ]]  </div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[FILE:rawagner.jpg|border|right|thumb|link=https://users.cs.duke.edu/~raw/| Robert Wagner <ref>[https://users.cs.duke.edu/~raw/ Robert Wagner's Home Page]</ref> ]]  </div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>'''Robert Alan Wagner''',<br/></div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>'''Robert Alan Wagner''', <ins class="diffchange diffchange-inline">(March 1941 - December 22, 2018)</ins><br/></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>an American mathematician and computer scientist, since 1978 associate professor, since 2007 professor emeritus at Department of Computer Science, [https://en.wikipedia.org/wiki/Levine_Science_Research_Center 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 [https://en.wikipedia.org/wiki/Cornell_University Cornell University] and associate professor of CS at [https://en.wikipedia.org/wiki/Vanderbilt_University Vanderbilt University] <ref>[https://users.cs.duke.edu/~raw/ Robert Wagner's Home Page]</ref>.  </div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>an American mathematician and computer scientist, since 1978 associate professor, since 2007 professor emeritus at Department of Computer Science, [https://en.wikipedia.org/wiki/Levine_Science_Research_Center 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 [https://en.wikipedia.org/wiki/Cornell_University Cornell University] and associate professor of CS at [https://en.wikipedia.org/wiki/Vanderbilt_University Vanderbilt University] <ref>[https://users.cs.duke.edu/~raw/ Robert Wagner's Home Page]</ref>.  </div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>His research interests include experimental [[VLSI Design|VLSI architectures]], application of [[Dynamic Programming|dynamic programming]] to [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Systems_design systems design], design of optimal software and hardware systems, and time-cost trade-offs in abstract parallel computer models.</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>His research interests include experimental [[VLSI Design|VLSI architectures]], application of [[Dynamic Programming|dynamic programming]] to [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Systems_design systems design], design of optimal software and hardware systems, and time-cost trade-offs in abstract parallel computer models.</div></td></tr>
</table>SergeiMarkoffhttps://www.chessprogramming.org/index.php?title=Robert_A._Wagner&diff=18168&oldid=prevGerdIsenberg at 12:21, 27 February 20202020-02-27T12:21:49Z<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 12:21, 27 February 2020</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l8" >Line 8:</td>
<td colspan="2" class="diff-lineno">Line 8:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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]].  </div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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]].  </div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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]].  </div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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]].  </div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>In a 1982 usenet post, [[Tom Truscott]] mentions Wagner's encoding of [[Chess Position|chess positions]], which requires ~143 bits  </div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>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></div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div> </div></td><td colspan="2"> </td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><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></div></td><td colspan="2"> </td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div><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>.  </div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div><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>.  </div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
</table>GerdIsenberghttps://www.chessprogramming.org/index.php?title=Robert_A._Wagner&diff=18167&oldid=prevGerdIsenberg: 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..."2020-02-27T12:20:13Z<p>Created page with "'''<a href="/Main_Page" title="Main Page">Home</a> * <a href="/People" title="People">People</a> * Robert A. Wagner''' FILE:rawagner.jpg|border|right|thumb|link=https://users.cs.duke.edu/~raw/| Robert Wagner <ref>[https://users.cs.duk..."</p>
<p><b>New page</b></p><div>'''[[Main Page|Home]] * [[People]] * Robert A. Wagner'''<br />
<br />
[[FILE:rawagner.jpg|border|right|thumb|link=https://users.cs.duke.edu/~raw/| Robert Wagner <ref>[https://users.cs.duke.edu/~raw/ Robert Wagner's Home Page]</ref> ]] <br />
<br />
'''Robert Alan Wagner''',<br/><br />
an American mathematician and computer scientist, since 1978 associate professor, since 2007 professor emeritus at Department of Computer Science, [https://en.wikipedia.org/wiki/Levine_Science_Research_Center 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 [https://en.wikipedia.org/wiki/Cornell_University Cornell University] and associate professor of CS at [https://en.wikipedia.org/wiki/Vanderbilt_University Vanderbilt University] <ref>[https://users.cs.duke.edu/~raw/ Robert Wagner's Home Page]</ref>. <br />
His research interests include experimental [[VLSI Design|VLSI architectures]], application of [[Dynamic Programming|dynamic programming]] to [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Systems_design systems design], design of optimal software and hardware systems, and time-cost trade-offs in abstract parallel computer models.<br />
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]]. <br />
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]]. <br />
In a 1982 usenet post, [[Tom Truscott]] mentions Wagner's encoding of [[Chess Position|chess positions]], which requires ~143 bits <br />
<br />
<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><br />
<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>. <br />
<br />
=Selected Publications=<br />
<ref>[https://dblp.uni-trier.de/pers/w/Wagner:Robert_A=.html dblp: Robert A. Wagner]</ref><br />
==1968==<br />
* [[Robert A. Wagner]] ('''1968'''). ''[https://dl.acm.org/doi/book/10.5555/905019 Some Techniques for Algorithm Optimization with Application to Matrix Arithmetic Expressions]''. Ph.D. thesis, [[Carnegie Mellon University]], advisor [[Mathematician#Perlis|Alan Jay Perlis]]<br />
==1970 ...==<br />
* [[Mathematician#SEDreyfus|Stuart Dreyfus]], [[Robert A. Wagner]] ('''1972'''). ''The Steiner Problem in Graphs''. Networks, Vol. 1, [http://faculty.cs.tamu.edu/chen/courses/689/2006/presentation/meng1.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Steiner_tree_problem Steiner tree problem from Wikipedia]</ref><br />
* [[Robert A. Wagner]] ('''1973'''). ''[https://dl.acm.org/doi/abs/10.1145/361972.361998 Algorithm 444: An Algorithm for Extracting Phrases in a Space-Optimal Fashion]''. [[ACM#Communications|Communications of the ACM]], Vol. 16, No. 3<br />
* [[Robert A. Wagner]], [[Mathematician#MJFischer|Michael J. Fischer]] ('''1974'''). ''[https://dl.acm.org/doi/10.1145/321796.321811 The String-to-String Correction Problem]''. [[ACM#Journal|Journal of the ACM]], Vol. 21, No. 1 <ref>[https://en.wikipedia.org/wiki/String-to-string_correction_problem String-to-string correction problem from Wikipedia]</ref><br />
* [[Robert A. Wagner]] ('''1976'''). ''[https://dl.acm.org/doi/10.1145/321921.321927 A Shortest Path Algorithm for Edge-Sparse Graphs]''. [[ACM#Journal|Journal of the ACM]], Vol. 23, No. 1<br />
==1980 ...==<br />
* [[Robert A. Wagner]], [[Mathematician#KSTrivedi|Kishor S. Trivedi]] ('''1980'''). ''[https://dl.acm.org/doi/10.1145/800199.806156 Hardware configuration selection through discretizing a continuous variable solution]''. [https://dblp.uni-trier.de/db/journals/sigmetrics/sigmetrics9.html SIGMETRICS Performance, Vol. 9], No. 2<br />
* [[Mathematician#KSTrivedi|Kishor S. Trivedi]], [[Robert A. Wagner]], [[Mathematician#TMSigmon|Timothy M. Sigmon]] ('''1980'''). ''[https://dl.acm.org/doi/10.1145/322203.322208 Optimal Selection of CPU Speed, Device Capacities, and File Assignments]''. [[ACM#Journal|Journal of the ACM]], Vol. 27, No. 3 <br />
* [[Robert A. Wagner]] ('''1983'''). ''[https://dl.acm.org/doi/10.1145/800046.801639 The Boolean Vector Machine <nowiki>[BVM]</nowiki>]''. [https://dblp.uni-trier.de/db/conf/isca/isca83.html ISCA 1983]<br />
* [[Robert A. Wagner]], [[Mathematician#RGeist|Robert Geist]] ('''1984'''). ''The Crippled Queen Placement Problem''. [https://dblp.uni-trier.de/db/journals/scp/scp4.html Science of Computer Programming, Vol. 4], No. 3, [https://core.ac.uk/download/pdf/82594002.pdf pdf]<br />
* [[Robert A. Wagner]], Merrell L. Patrick ('''1988'''). ''[https://ntrs.nasa.gov/search.jsp?R=19880042939 A sparse matrix algorithm on the Boolean vector machine]''. [https://dblp.uni-trier.de/db/journals/pc/pc6.html Parallel Computing, Vol 6.], No. 3<br />
==1990 ...==<br />
* [https://dblp.uni-trier.de/pers/h/Han:Yijie.html Yijie Han], [[Robert A. Wagner]] ('''1990'''). ''[https://dl.acm.org/doi/10.1145/79147.214077 An Efficient and Fast Parallel-Connected Component Algorithm]''. [[ACM#Journal|Journal of the ACM]], Vol. 37, No. 3<br />
* [[Robert A. Wagner]] ('''1997'''). ''[https://dl.acm.org/doi/10.1145/256303.256314 Evaluating Uniform Expressions Within Two Steps of Minimum Parallel Time]''. [[ACM#Journal|Journal of the ACM]], Vol. 44, No. 2<br />
<br />
=External Links= <br />
* [https://users.cs.duke.edu/~raw/ Robert Wagner's Home Page]<br />
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=87566 The Mathematics Genealogy Project - Robert Wagner]<br />
<br />
=References= <br />
<references /><br />
'''[[People|Up one level]]'''<br />
[[Category:Mathematician|Wagner]]<br />
[[Category:Researcher|Wagner]]<br />
[[Category:Chess Programmer|Wagner]]</div>GerdIsenberg