25,161
edits
Changes
Created page with "'''Home * People * Andrew Shapira''' '''Andrew Shapira''',<br/> an American computer scientist, software and game developer, and principal engineer at [http..."
'''[[Main Page|Home]] * [[People]] * Andrew Shapira'''
'''Andrew Shapira''',<br/>
an American computer scientist, software and game developer, and principal engineer at [https://en.wikipedia.org/wiki/Amazon.com Amazon.com] <ref>[https://www.linkedin.com/in/andrewshapira/ Andrew Shapira | LinkedIn]</ref>.
He holds a B.Sc. in CS from [[University of Illinois at Urbana-Champaign]] (1985), and a M.Sc. (1990) and Ph.D. (1997) in computer engineering from [https://en.wikipedia.org/wiki/Rensselaer_Polytechnic_Institute Rensselaer Polytechnic Institute] under supervision of [[Mathematician#Krishnamoorthy|Mukkai S. Krishnamoorthy]].
Already at age 14, Andrew Shapira co-authored the early graphics-based multi-user highly interactive [https://en.wikipedia.org/wiki/Role-playing_video_game role-playing computer game], [https://en.wikipedia.org/wiki/Avatar_%28PLATO_system_video_game%29 Avatar], created on the [[University of Illinois at Urbana-Champaign|University of Illinois']] [https://en.wikipedia.org/wiki/Control_Data_Corporation Control Data Corporation] [https://en.wikipedia.org/wiki/PLATO_%28computer_system%29 PLATO system].
His research interests include [[Pseudorandom Number Generator|random number generation]] and testing, [https://en.wikipedia.org/wiki/Matching_%28graph_theory%29 maximum matching], [https://en.wikipedia.org/wiki/Graph_coloring#Vertex_coloring vertex coloring], [https://en.wikipedia.org/wiki/Network_topology network topologies] for supercomputers,
the [[Backtracking#8QinBitboards|nonattacking queens problem]], an [https://en.wikipedia.org/wiki/NP-complete NP-complete] [https://en.wikipedia.org/wiki/Decision_problem problem] arising in [https://en.wikipedia.org/wiki/Optical_character_recognition optical character recognition], [https://en.wikipedia.org/wiki/Graph_isomorphism graph isomorphism], and some problems in computer graphics.
His non professional interests include [https://en.wikipedia.org/wiki/Fast_chess one minute chess games] and [[Games|board games]].
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/s/Shapira:Andrew.html dblp: Andrew Shapira]</ref> <ref>[http://onezero.org/research-software-and-papers onezero » Research, Software, and Papers]</ref>
* [https://dblp.uni-trier.de/pid/57/5146.html Dz-Mou Jung], [[Mathematician#Krishnamoorthy|Mukkai S. Krishnamoorthy]], [https://www.ecse.rpi.edu/~nagy/ George Nagy], [[Andrew Shapira]] ('''1996'''). ''N-Tuple Features for OCR Revisited''. [[IEEE#TPAMI|IEEE Transactions on Pattern Analysis and Machine Intelligence]], Vol. 18, No. 7
* [[Andrew Shapira]] ('''1997'''). ''[https://www.combinatorics.org/ojs/index.php/eljc/article/view/v4i1r25 An Exact Performance Bound for an O(m+n) Greedy Matching Procedure]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics The Electronic Journal of Combinatorics], Vol. 4, No. 1 <ref>[https://en.wikipedia.org/wiki/Greedy_algorithm Greedy algorithm from Wikipedia]</ref>
* [[Andrew Shapira]] ('''1997'''). ''Cycle parity random number generators, and a general random number library''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Rensselaer_Polytechnic_Institute Rensselaer Polytechnic Institute], advisor [[Mathematician#Krishnamoorthy|Mukkai S. Krishnamoorthy]].
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=424966 Maximum Number of Legal Moves] by [[Andrew Shapira]], [[CCC]], May 08, 2005 » [[Encoding Moves]]
* [https://www.stmintz.com/ccc/index.php?id=431088 Re: And a still unsolved test position] by [[Andrew Shapira]], [[CCC]], June 13, 2005 » [[Path-Dependency]]
* [https://www.stmintz.com/ccc/index.php?id=445400 quiescence search / horizon question] by [[Andrew Shapira]], [[CCC]], August 26, 2005 » [[Quiescence Search]]
* [https://www.stmintz.com/ccc/index.php?id=450730 mask of highest bit] by [[Andrew Shapira]], [[CCC]], September 21, 2005 » [[General Setwise Operations#TheMostSignificantOneBitMS1B|Most Significant One]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4447 move ordering statistic] by [[Andrew Shapira]], [[Computer Chess Forums|Winboard Forum]], March 03, 2006 » [[Move Ordering]]
=External Links=
* [http://onezero.org/ onezero » Andrew Shapira]
: [http://onezero.org/blog onezero - Blog]
* [https://www.linkedin.com/in/andrewshapira/ Andrew Shapira | LinkedIn]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=164929 The Mathematics Genealogy Project - Andrew Shapira]
* [http://www.codeproject.com/Articles/17607/The-Option-Pattern The Option Pattern - CodeProject] by [[Andrew Shapira]], February 11, 2007
=References=
<references />
'''[[People|Up one level]]'''
'''Andrew Shapira''',<br/>
an American computer scientist, software and game developer, and principal engineer at [https://en.wikipedia.org/wiki/Amazon.com Amazon.com] <ref>[https://www.linkedin.com/in/andrewshapira/ Andrew Shapira | LinkedIn]</ref>.
He holds a B.Sc. in CS from [[University of Illinois at Urbana-Champaign]] (1985), and a M.Sc. (1990) and Ph.D. (1997) in computer engineering from [https://en.wikipedia.org/wiki/Rensselaer_Polytechnic_Institute Rensselaer Polytechnic Institute] under supervision of [[Mathematician#Krishnamoorthy|Mukkai S. Krishnamoorthy]].
Already at age 14, Andrew Shapira co-authored the early graphics-based multi-user highly interactive [https://en.wikipedia.org/wiki/Role-playing_video_game role-playing computer game], [https://en.wikipedia.org/wiki/Avatar_%28PLATO_system_video_game%29 Avatar], created on the [[University of Illinois at Urbana-Champaign|University of Illinois']] [https://en.wikipedia.org/wiki/Control_Data_Corporation Control Data Corporation] [https://en.wikipedia.org/wiki/PLATO_%28computer_system%29 PLATO system].
His research interests include [[Pseudorandom Number Generator|random number generation]] and testing, [https://en.wikipedia.org/wiki/Matching_%28graph_theory%29 maximum matching], [https://en.wikipedia.org/wiki/Graph_coloring#Vertex_coloring vertex coloring], [https://en.wikipedia.org/wiki/Network_topology network topologies] for supercomputers,
the [[Backtracking#8QinBitboards|nonattacking queens problem]], an [https://en.wikipedia.org/wiki/NP-complete NP-complete] [https://en.wikipedia.org/wiki/Decision_problem problem] arising in [https://en.wikipedia.org/wiki/Optical_character_recognition optical character recognition], [https://en.wikipedia.org/wiki/Graph_isomorphism graph isomorphism], and some problems in computer graphics.
His non professional interests include [https://en.wikipedia.org/wiki/Fast_chess one minute chess games] and [[Games|board games]].
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/s/Shapira:Andrew.html dblp: Andrew Shapira]</ref> <ref>[http://onezero.org/research-software-and-papers onezero » Research, Software, and Papers]</ref>
* [https://dblp.uni-trier.de/pid/57/5146.html Dz-Mou Jung], [[Mathematician#Krishnamoorthy|Mukkai S. Krishnamoorthy]], [https://www.ecse.rpi.edu/~nagy/ George Nagy], [[Andrew Shapira]] ('''1996'''). ''N-Tuple Features for OCR Revisited''. [[IEEE#TPAMI|IEEE Transactions on Pattern Analysis and Machine Intelligence]], Vol. 18, No. 7
* [[Andrew Shapira]] ('''1997'''). ''[https://www.combinatorics.org/ojs/index.php/eljc/article/view/v4i1r25 An Exact Performance Bound for an O(m+n) Greedy Matching Procedure]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics The Electronic Journal of Combinatorics], Vol. 4, No. 1 <ref>[https://en.wikipedia.org/wiki/Greedy_algorithm Greedy algorithm from Wikipedia]</ref>
* [[Andrew Shapira]] ('''1997'''). ''Cycle parity random number generators, and a general random number library''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Rensselaer_Polytechnic_Institute Rensselaer Polytechnic Institute], advisor [[Mathematician#Krishnamoorthy|Mukkai S. Krishnamoorthy]].
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=424966 Maximum Number of Legal Moves] by [[Andrew Shapira]], [[CCC]], May 08, 2005 » [[Encoding Moves]]
* [https://www.stmintz.com/ccc/index.php?id=431088 Re: And a still unsolved test position] by [[Andrew Shapira]], [[CCC]], June 13, 2005 » [[Path-Dependency]]
* [https://www.stmintz.com/ccc/index.php?id=445400 quiescence search / horizon question] by [[Andrew Shapira]], [[CCC]], August 26, 2005 » [[Quiescence Search]]
* [https://www.stmintz.com/ccc/index.php?id=450730 mask of highest bit] by [[Andrew Shapira]], [[CCC]], September 21, 2005 » [[General Setwise Operations#TheMostSignificantOneBitMS1B|Most Significant One]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4447 move ordering statistic] by [[Andrew Shapira]], [[Computer Chess Forums|Winboard Forum]], March 03, 2006 » [[Move Ordering]]
=External Links=
* [http://onezero.org/ onezero » Andrew Shapira]
: [http://onezero.org/blog onezero - Blog]
* [https://www.linkedin.com/in/andrewshapira/ Andrew Shapira | LinkedIn]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=164929 The Mathematics Genealogy Project - Andrew Shapira]
* [http://www.codeproject.com/Articles/17607/The-Option-Pattern The Option Pattern - CodeProject] by [[Andrew Shapira]], February 11, 2007
=References=
<references />
'''[[People|Up one level]]'''
