Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Andrew Shapira
Edit
0
5
…
3
Tags
mathematician
people
programmers
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Andrew Shapira
Andrew Shapira
,
an American computer scientist, software and game developer, and principal engineer at
Amazon.com
[1]
. 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
Rensselaer Polytechnic Institute
under supervision of
Mukkai S. Krishnamoorthy
. Already at age 14, Andrew Shapira co-authored the early graphics-based multi-user highly interactive
role-playing computer game
,
Avatar
, created on the
University of Illinois'
Control Data Corporation
PLATO system
. His research interests include
random number generation
and testing,
maximum matching
,
vertex coloring
,
network topologies
for supercomputers, the
nonattacking queens problem
, an
NP-complete
problem
arising in
optical character recognition
,
graph isomorphism
, and some problems in computer graphics. His non professional interests include
one minute chess games
and
board games
.
Andrew Shapira
[2]
Table of Contents
Selected Publications
Forum Posts
External Links
References
What links here?
Selected Publications
[3]
[4]
Dz-Mou Jung
,
Mukkai S. Krishnamoorthy
,
George Nagy
,
Andrew Shapira
(
1996
).
N-Tuple Features for OCR Revisited
.
IEEE Transactions on Pattern Analysis and Machine Intelligence
, Vol. 18, No. 7
Andrew Shapira
(
1997
).
An Exact Performance Bound for an O(m+n) Greedy Matching Procedure
.
The Electronic Journal of Combinatorics
, Vol. 4, No. 1
[5]
Andrew Shapira
(
1997
).
Cycle parity random number generators, and a general random number library
. Ph.D. thesis,
Rensselaer Polytechnic Institute
, advisor
Mukkai S. Krishnamoorthy
.
Forum Posts
Maximum Number of Legal Moves
by
Andrew Shapira
,
CCC
, May 08, 2005 »
Encoding Moves
Re: And a still unsolved test position
by
Andrew Shapira
,
CCC
, June 13, 2005 »
Path-Dependency
quiescence search / horizon question
by
Andrew Shapira
,
CCC
, August 26, 2005 »
Quiescence Search
mask of highest bit
by
Andrew Shapira
,
CCC
, September 21, 2005 »
Most Significant One
External Links
onezero » Andrew Shapira
onezero - Blog
Andrew Shapira | LinkedIn
The Mathematics Genealogy Project - Andrew Shapira
The Option Pattern - CodeProject
by
Andrew Shapira
, February 11, 2007
References
^
Andrew Shapira | LinkedIn
^
onezero » Andrew Shapira
^
dblp: Andrew Shapira
^
onezero » Research, Software, and Papers
^
Greedy algorithm from Wikipedia
What links here?
Page
Date Edited
Andrew Shapira
May 7, 2017
Encoding Moves
Mar 27, 2016
General Setwise Operations
Feb 25, 2018
Mathematician
Apr 9, 2018
People
Feb 28, 2018
Pseudorandom number generator
May 11, 2017
Quiescence Search
Aug 19, 2017
University of Illinois at Urbana-Champaign
Oct 12, 2016
Up one level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
an American computer scientist, software and game developer, and principal engineer at Amazon.com [1]. 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 Rensselaer Polytechnic Institute under supervision of Mukkai S. Krishnamoorthy. Already at age 14, Andrew Shapira co-authored the early graphics-based multi-user highly interactive role-playing computer game, Avatar, created on the University of Illinois' Control Data Corporation PLATO system. His research interests include random number generation and testing, maximum matching, vertex coloring, network topologies for supercomputers, the nonattacking queens problem, an NP-complete problem arising in optical character recognition, graph isomorphism, and some problems in computer graphics. His non professional interests include one minute chess games and board games.
Table of Contents
Selected Publications
[3] [4]Forum Posts
External Links
onezero - Blog
References
What links here?
Up one level