http:^^www.das.harvard.edu^users^faculty^michael_rabin^michael_rabin.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 67 行

HTML
67
字号
Date: Wed, 20 Nov 1996 23:00:35 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Wed, 23 Mar 1994 00:48:36 GMTContent-length: 2598<HTML><HEAD><title>Michael O. Rabin</title></HEAD><BODY><h1>Michael Rabin</h1><!WA0><img align=top src=http://www.das.harvard.edu/users/faculty/Michael_Rabin/Michael_Rabin.gif><h3>Thomas J. Watson, Sr., Professor of Computer Science</h3><h3>THEORY OF COMPUTATION</h3><p>Professor Rabin studies the theory and application of computeralgorithms.  His special interests are computer security andapplications of randomization in computations.<p>One project involves the use of sophisticated algorithmsto protect computer files and a computer's operatingsystem against unauthorized intrusion (i.e., against "hackers").  Witha doctoral student, D. Tygar (now at CMU), Professor Rabin invented anew model for computer security and a series of tools which can beincorporated into existing and future operating systems to ensure theirprotection.  The system, called ITOSS (Integrated Toolkit forOperating System Security), has been implemented and isbeing tested.  Work on extensions, including the development of a userinterface, is in progress.<p>The new technologies of parallel computers and distributed systemsraise important theoretical and practical problems concerninginterprocessor communications and the coordination and synchronizationof distributed computing processes.  Professor Rabin has developed aninnnovative algorithm called IDA (Information Dispersal Algorithm) forthe dispersal of information.  Heis studying the applications of IDA to efficient and fault-tolerantrouting of information in parallel computers and general networks, andto the storage of information in arrays of disks (RAIDs).<p>Professor Rabin also continues to work at creating efficientalgorithms for problems in algebra, number theory, data structures, andcombinatorics.  In addition to their theoretical interest, many ofthese algorithms, including one recently devised for pattern-matching,have important practical significance.<hr><ul><li>M. O. Rabin, <i>Efficient dispersal of information for security, loadbalancing, and fault tolerance,</i> J. ACM 38, 335-348 (1989).<li>M. O. Rabin and J. D. Tygar, <i>An Integrated Toolkit for Operating System Security,</i> Foundations of Data Organization andAlgorithms, (W. Litwin and H. J. Schek, Eds.), Springer-Verlag,2-15 (1989).<li>R. Karp and M. O. Rabin, <i>Efficient randomized pattern-matchingalgorithm,</i> IBM J. Res. Dev. 31, 249 (1987).<li><i>Randomized Byzantine generals,</i> IEEE 24th Symp. Found. of Comp.Sci., (IEEE Computer Society Press, Los Angeles, 1983), p. 403.<li><i>Probabilistic tests for primality,</i> J. Num. Theory 12, 128(1980).</BODY></HTML>

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?