For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
The relentless push for high performance in custom digital circuits has led to renewed emphasis on circuit optimization or tuning. The parameters of the optimization are typically...
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...