Home * People * Yanjun Zhang

Yanjun Zhang,
an 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


External Links


  1. ^ Yanjun Zhang | LinkedIn
  2. ^ The Mathematics Genealogy Project - Yanjun Zhang
  3. ^ Richard Karp, Yanjun Zhang (1988). A randomized parallel branch-and-bound procedure. STOC '88
  4. ^ Abhiram Ranade (1990). A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method. Technical Report, University of California, Berkeley
  5. ^ Peter Sanders (1995). Fast priority queues for parallel branch-and-bound. IRREGULAR 1995
  6. ^ Tiankai Liu (2003). A Implementation of the Karp-Zhang ParallelBranch-and-Bound Algorithm. under direction of Charles Leiserson, Massachusetts Institute of Technology
  7. ^ dblp: Yanjun Zhang

What links here?

Up one level