Yanjun Zhang

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Yanjun Zhang

Yanjun Zhang,
a Chinese American mathematician, computer scientist, and research scientist at Sabre Inc., in the 90s assistant professor at Southern Methodist University [1]. He received a Ph.D. on Parallel Algorithms for Combinatorial Search Problems from University of California, Berkeley in 1989 under thesis advisor Richard Karp [2]. In 1988, Yanjun Zhang and Richard Karp presented a general method for deriving randomized parallel branch-and-bound algorithms from sequential ones. They showed that with high probability the resulting algorithms attained optimal speedup to within a constant factor for large enough problems [3] [4] [5] [6].

Selected Publications


1988 ...

1990 ...

2000 ...

External Links


Up one level