堵丁柱

美籍华裔计算机科学家

堵丁柱(1948年5月21日),美籍華裔計算機科學家,德克薩斯州大學達拉斯分校計算機科學教授。[1]他因為證明了Gilbert-Pollak猜想和Derman-Leiberman-Ross猜想而著名。[2][3]

堵丁柱
出生 (1948-05-21) 1948年5月21日76歲)
網站Ding-Zhu Du
科學生涯
研究領域計算機算法
機構德克薩斯州大學達拉斯分校

生平

編輯

1982年畢業於中國科學院應用數學所運籌學專業,獲碩士學位。1985年,1985年獲得美國加利福尼亞大學聖塔芭芭拉分校博士學位。[1]

出版著作

編輯
  • Theory of Computational Complexity.[4]
  • Problem Solving in Automata, Languages, and Complexity.[5]
  • Pooling Designs and Nonadaptive Group Testing.[6]
  • Mathematical Theory of Optimization.[7]
  • Combinatorial Group Testing and Its Applications (2nd Edition).[8]
  • Connected Dominating Set: Theory and Applications.[9]
  • Design and Analysis of Approximation Algorithms.[10]
  • Steiner Tree Problems In Computer Communication Networks.[11]

參考資料

編輯
  1. ^ 1.0 1.1 Du, Ding-Zhu - Department of Computer Science - The University of Texas at Dallas – Erik Jonsson School of Engineering and Computer Science. cs.utdallas.edu. [2018-02-16]. (原始內容存檔於2020-10-25). 
  2. ^ Kolata, Gina. Solution to Old Puzzle: How Short a Shortcut?. The New York Times. 1990-10-30 [2018-02-16]. ISSN 0362-4331. (原始內容存檔於2018-06-18). 
  3. ^ PROOF OF GILBERT-POLLAK CONJECTURE (PDF). (原始內容 (PDF)存檔於2019-02-23). 
  4. ^ Du,, Dingzhu. Theory of computational complexity. [2018-02-16]. 
  5. ^ Du,, Dingzhu. Problem solving in automata, languages, and complexity. Ko, Ker-I. Second. New York: Wiley. 2001. ISBN 0471439606. OCLC 53229117. 
  6. ^ Du,, Dingzhu. Pooling designs and nonadaptive group testing : important tools for DNA sequencing. Hwang, Frank. New Jersey: World Scientific. 2006. ISBN 9812568220. OCLC 285162303. 
  7. ^ Du,, Dingzhu. Mathematical theory of optimization. Du, Dingzhu., Pardalos, P. M. (Panos M.), 1954-, Wu, Weili. Dordrecht: Kluwer Academic. 2001. ISBN 1402000154. OCLC 47716389. 
  8. ^ Du,, Dingzhu. Combinatorial group testing and its applications. Hwang, Frank. 2nd. Singapore: World Scientific. 2000. ISBN 9810241070. OCLC 42421028. 
  9. ^ Du,, Dingzhu. Connected dominating set : theory and applications. Wan, Peng-Jun, 1970- 2nd. New York: Springer Science+Business Media. 2013. ISBN 9781461452423. OCLC 819816599. 
  10. ^ Du, Dingzhu. Design and analysis of approximation algorithms. Ko, Ker-I., Hu, Xiaodong, 1962-. New York, NY: Springer. 2012. ISBN 1461417015. OCLC 765365870. 
  11. ^ Du,, Dingzhu. Steiner tree problems in computer communication networks. Hu, Xiaodong. Hackensack, NJ: World Scientific. 2008. ISBN 9812791442. OCLC 263426948.