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: ```2: enp0s31f6: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qdisc fq_codel state UP group default qlen 1000 link/ether 8c:0f:6f:79:3c:11 brd ff:ff:ff:ff:ff:ff inet 192.168.1.3/24 brd 192.168.1.255 scope global dynamic noprefixroute enp0s31f6 valid_lft 76132sec preferred_lft 76132sec inet6 2a00:23c7:5415:d300:8152:48aa:288d:30ee/64 scope global dynamic noprefixroute valid_lft 315359952sec preferred_lft 315359952sec inet6 fdaa:bbcc:ddee:0:8809:32c8:2206:c1f1/64 scope global noprefixroute valid_lft forever preferred_lft forever inet6 fe80::c1c0:d8c0:f52e:773f/64 scope link noprefixroute valid_lft forever preferred_lft forever```
gollark: No.
gollark: A link-local one.
gollark: As I said, it should be a multicast address.
gollark: It's on my laptop, which isn't currently on WiFi or anything, so yes.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.