Yanjun+Zhang

toc
 * Home * People * Yanjun Zhang**

an American mathematician, computer scientist, and research scientist at [|Sabre Inc.], in the 90s assistant professor at [|Southern Methodist University]. He received a Ph.D. on //Parallel Algorithms for Combinatorial Search Problems// from University of California, Berkeley in 1989 under thesis advisor Richard Karp. 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.
 * Yanjun Zhang**,

=Selected Publications=
 * Richard Karp, Yanjun Zhang (**1988**). //[|A randomized parallel branch-and-bound procedure]//. [|STOC '88]
 * Yanjun Zhang (**1989**). //Parallel Algorithms for Combinatorial Search Problems//. Ph.D. thesis, University of California, Berkeley, advisor Richard Karp
 * Richard Karp, Yanjun Zhang (**1989**). //[|On parallel evaluation of game trees]//. [|SPAA '89]
 * Richard Karp, Yanjun Zhang (**1993**). //[|Randomized parallel algorithms for backtrack search and branch-and-bound computation]//. Journal of the ACM, Vol. 40, No. 3
 * Richard Karp, Yanjun Zhang (**1995**). //[|Bounded branching process and and/or tree evaluation]//. [|Random Structures & Algorithms, Vol. 7, No. 2]

=External Links=
 * [|Yanjun Zhang | LinkedIn]
 * [|The Mathematics Genealogy Project - Yanjun Zhang]

=References= =What links here?= include page="Yanjun Zhang" component="backlinks" limit="40"
 * Up one level**