Dean F. Kelley

According to our database, Dean F. Kelley authored at least 7 papers between 1995 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Technical Report Column.

Dean F. Kelley

SIGACT News, 2018

2009

Joint review of algorithms by Richard Johnsonbaugh and Marcus Schaefer (Pearson/Prentice-Hall, 004) and algorithms by Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani (McGraw-Hill, 008).

Dean F. Kelley

SIGACT News, 2009

Review of a programmer's companion to algorithm analysis by Ernst Leiss (Chapman & Hall/CRC, 2007).

Dean F. Kelley

SIGACT News, 2009

1998

Approximations for Subset Interconnection Designs.

Xiufeng Du, Weili Wu, Dean F. Kelley

Theor. Comput. Sci., 1998

1997

A 3/2 log 3-Competitive Algorithm for the Counterfeit Coin Problem.

Peng-Jun Wan, Qifan Yang, Dean F. Kelley

Theor. Comput. Sci., 1997

1995

On complexity of subset interconnection designs.

Ding-Zhu Du, Dean F. Kelley

J. Glob. Optim., 1995

A 3/2 log3-Competive Algorithm for the Counterfeit Cain Problem.

Dean F. Kelley, Peng-Jun Wan, Qifan Yang

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995