Ran Libeskind-Hadas

Ran Libeskind-Hadas is a professor of Computer Science at Harvey Mudd College. His research interests lie in the fields of algorithm design and analysis and complexity theory, but focus more specifically on routing algorithms for optical networks and collective communication in parallel computers and networks.[1]

Libeskind-Hadas graduated from Harvard University with a degree in Applied Mathematics in 1987. He went on to complete an M.S. and Ph.D. in Computer Science at the University of Illinois at Urbana-Champaign in 1993. In August of that year he was hired into the Department of Mathematics at Harvey Mudd College, a liberal arts school that focuses on science and engineering. He has been in the Department of Computer Science since May 1994, and served as acting chair of the department in 2006-2007.

Libeskind-Hadas held the Joseph B. Platt Endowed Chair for effective teaching from 2005 to 2010. His research has been funded by the National Science Foundation.[2] Most recently, he has been the director of an NSF Research Experiences for Undergraduates (REU) site at Harvey Mudd College, which has allowed Harvey Mudd to greatly increase the number of undergraduate research students it can support during the summers, in addition to increasing cross-university interactions.[3] Additionally, Libeskind-Hadas has been the key faculty member in encouraging a group of students to form a student chapter for the Association for Computing Machinery (ACM), which has been successfully running and helping members of the Claremont Colleges and surrounding community since the beginning of 2005.

Module orientation problem

Libeskind-Hadas has produced noted research in the module orientation problem, a branch of computer science important in design of large scale integrated circuits.[4]

Publications

Libeskind-Hadas is a coauthor of R. Libeskind-Hadas, N. Hasan, J. Cong, P. McKinley, and C. L. Liu. Fault Covering Problems in Reconfigurable VLSI Systems. Kluwer Academic Publishers, 1992., and has published 16 peer reviewed papers and 20 peer-reviewed conference proceedings.

Reference line notes
  1. Ran Libeskind-Hadas, Nimish Shrivastava, Rami G. Melhem, C. L. Liu, Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays IEEE Transactions on Parallel and Distributed Systems archive, Volume 6 , Issue 5 (May 1995) Pages: 498 - 511, ISSN 1045-9219
  2. Announcement by President Jon Strauss Archived 2012-08-05 at Archive.today, March 4, 2005
  3. 2006 Harvey Mudd College REU site, retrieved from the Internet Archive
  4. Yoshiyasu Takefuji, Neural Network Parallel Computing(1992) Springer Publishing ISBN 0-7923-9190-X
gollark: Destroying the original universe *does* at least fix issues with the drive causing people to cease to exist.
gollark: I think many worlds holds that that's happening constantly anyway, but use of the drive does it more.
gollark: I'm not sure exactly what I was thinking of at the time, but assuming you accept the alternate branches as "existing" in some way then creating new ones is ethically fraught, since you're basically duplicating all morally relevant entities ever.
gollark: A better version would destroy the original universe, to fix some of the ethical issues.
gollark: I guess there's a universe in which the drives have always worked perfectly, one where it's always just unexisted the users, and a bunch of intermediate ones.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.