Related Research Articles
A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another. Distributed computing is a field of computer science that studies distributed systems.
Jack Joseph Dongarra is an American computer scientist and mathematician. He is the American University Distinguished Professor of Computer Science in the Electrical Engineering and Computer Science Department at the University of Tennessee. He holds the position of a Distinguished Research Staff member in the Computer Science and Mathematics Division at Oak Ridge National Laboratory, Turing Fellowship in the School of Mathematics at the University of Manchester, and is an adjunct professor and teacher in the Computer Science Department at Rice University. He served as a faculty fellow at the Texas A&M University Institute for Advanced Study (2014–2018). Dongarra is the founding director of the Innovative Computing Laboratory at the University of Tennessee. He was the recipient of the Turing Award in 2021.
Professor Sartaj Kumar Sahni is a computer scientist based in the United States, and is one of the pioneers in the field of data structures. He is a distinguished professor in the Department of Computer and Information Science and Engineering at the University of Florida.
Charles Eric Leiserson is a computer scientist, specializing in the theory of parallel computing and distributed computing, and particularly practical applications thereof. As part of this effort, he developed the Cilk multithreaded language. He invented the fat-tree interconnection network, a hardware-universal interconnection network used in many supercomputers, including the Connection Machine CM5, for which he was network architect. He helped pioneer the development of VLSI theory, including the retiming method of digital optimization with James B. Saxe and systolic arrays with H. T. Kung. He conceived of the notion of cache-oblivious algorithms, which are algorithms that have no tuning parameters for cache size or cache-line length, but nevertheless use cache near-optimally. He developed the Cilk language for multithreaded programming, which uses a provably good work-stealing algorithm for scheduling. Leiserson coauthored the standard algorithms textbook Introduction to Algorithms together with Thomas H. Cormen, Ronald L. Rivest, and Clifford Stein.
David A. Bader is a Distinguished Professor and Director of the Institute for Data Science at the New Jersey Institute of Technology. Previously, he served as the Chair of the Georgia Institute of Technology School of Computational Science & Engineering, where he was also a founding professor, and the executive director of High-Performance Computing at the Georgia Tech College of Computing. In 2007, he was named the first director of the Sony Toshiba IBM Center of Competence for the Cell Processor at Georgia Tech.
Zvi Galil is an Israeli-American computer scientist and mathematician. Galil served as the president of Tel Aviv University from 2007 through 2009. From 2010 to 2019, he was the dean of the Georgia Institute of Technology College of Computing. His research interests include the design and analysis of algorithms, computational complexity and cryptography. He has been credited with coining the terms stringology and sparsification. He has published over 200 scientific papers and is listed as an ISI highly cited researcher.
Michael George Luby is a mathematician and computer scientist, CEO of BitRipple, senior research scientist at the International Computer Science Institute (ICSI), former VP Technology at Qualcomm, co-founder and former chief technology officer of Digital Fountain. In coding theory he is known for leading the invention of the Tornado codes and the LT codes. In cryptography he is known for his contributions showing that any one-way function can be used as the basis for private cryptography, and for his analysis, in collaboration with Charles Rackoff, of the Feistel cipher construction. His distributed algorithm to find a maximal independent set in a computer network has also been influential.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
Krishna V. Palem is a computer scientist and engineer of Indian origin and is the Kenneth and Audrey Kennedy Professor of Computing at Rice University and the director of Institute for Sustainable Nanoelectronics (ISNE) at Nanyang Technological University (NTU). He is recognized for his "pioneering contributions to the algorithmic, compilation, and architectural foundations of embedded computing", as stated in the citation of his 2009 Wallace McDowell Award, the "highest technical award made solely by the IEEE Computer Society".
Roberto Tamassia is an American Italian computer scientist, the Plastech Professor of Computer Science at Brown University, and served as the chair of the Brown Computer Science department from 2007 to 2014. His research specialty is in the design and analysis of algorithms for graph drawing, computational geometry, and computer security; he is also the author of several textbooks.
Michael T. Goodrich is a mathematician and computer scientist. He is a distinguished professor of computer science and the former chair of the department of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.
Mobile Cloud Computing (MCC) is the combination of cloud computing and mobile computing to bring rich computational resources to mobile users, network operators, as well as cloud computing providers. The ultimate goal of MCC is to enable execution of rich mobile applications on a plethora of mobile devices, with a rich user experience. MCC provides business opportunities for mobile network operators as well as cloud providers. More comprehensively, MCC can be defined as "a rich mobile computing technology that leverages unified elastic resources of varied clouds and network technologies toward unrestricted functionality, storage, and mobility to serve a multitude of mobile devices anywhere, anytime through the channel of Ethernet or Internet regardless of heterogeneous environments and platforms based on the pay-as-you-use principle."
Subhash Suri is an Indian-American computer scientist, a professor at the University of California, Santa Barbara. He is known for his research in computational geometry, computer networks, and algorithmic game theory.
Alan Stuart Edelman is an American mathematician and computer scientist. He is a professor of applied mathematics at the Massachusetts Institute of Technology (MIT) and a Principal Investigator at the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL) where he leads a group in applied computing. In 2004, he founded a business called Interactive Supercomputing which was later acquired by Microsoft. Edelman is a fellow of American Mathematical Society (AMS), Society for Industrial and Applied Mathematics (SIAM), Institute of Electrical and Electronics Engineers (IEEE), and Association for Computing Machinery (ACM), for his contributions in numerical linear algebra, computational science, parallel computing, and random matrix theory. He is one of the cocreators of the technical programming language Julia.
Nancy Marie Amato is an American computer scientist noted for her research on the algorithmic foundations of motion planning, computational biology, computational geometry and parallel computing. Amato is the Abel Bliss Professor of Engineering and Head of the Department of Computer Science at the University of Illinois at Urbana-Champaign. Amato is noted for her leadership in broadening participation in computing, and is currently a member of the steering committee of CRA-WP, of which she has been a member of the board since 2000.
Takao Nishizeki was a Japanese mathematician and computer scientist who specialized in graph algorithms and graph drawing.
Haesun Park is a professor and chair of Computational Science and Engineering at the Georgia Institute of Technology. She is an IEEE Fellow, ACM Fellow, and Society for Industrial and Applied Mathematics Fellow. Park's main areas of research are Numerical Algorithms, Data Analysis, Visual Analytics and Parallel Computing. She has co-authored over 100 articles in peer-reviewed journals and conferences.
Srinivas Aluru is a professor in the School of Computational Science and Engineering at Georgia Institute of Technology, and co-Executive Director for the Georgia Tech Interdisciplinary Research Institute in Data Engineering and Science. His main areas of research are high performance computing, data science, bioinformatics and systems biology, combinatorial methods in scientific computing, and string algorithms. Aluru is a Fellow of the American Association for the Advancement of Science (AAAS) and the Institute for Electrical and Electronic Engineers (IEEE). He is best known for his research contributions in parallel algorithms and applications, interdisciplinary research in bioinformatics and computational biology, and particularly the intersection of these two fields.
Edmond Chow is a full professor in the School of Computational Science and Engineering of Georgia Institute of Technology. His main areas of research are in designing numerical methods for high-performance computing and applying these methods to solve large-scale scientific computing problems.
Tamal Krishna Dey is an Indian mathematician and computer scientist specializing in computational geometry and computational topology. He is a professor at Purdue University.
References
- 1 2 Department faculty profile, Purdue University, retrieved 2011-09-29.
- 1 2 Mikhail Jibrayil Atallah at the Mathematics Genealogy Project
- ↑ Arxan Appoints Dr. Mikhail J. Atallah as Chief Technology Officer Archived 2012-01-29 at the Wayback Machine , Arxan Technologies, retrieved 2011-09-29.
- ↑ DBLP listing of Atallah's publications, retrieved 2011-09-29.
- ↑ Atallah, Mikhail J. (1985), "Some dynamic computational geometry problems", Computers & Mathematics with Applications, 11 (12): 1171–1181, doi:10.1016/0898-1221(85)90105-1, MR 0822083 . Atallah, Mikhail J.; Goodrich, Michael T. (1986), "Efficient parallel solutions to some geometric problems", J. Parallel Distrib. Comput., 3 (4): 492–507, doi:10.1016/0743-7315(86)90011-0 .
- ↑ Atallah, Mikhail J. (1985), "On symmetry detection", IEEE Transactions on Computers, 34 (7): 663–666, doi:10.1109/TC.1985.1676605, MR 0800338, S2CID 1341755 .
- ↑ Atallah, Mikhail J.; Cole, Richard; Goodrich, Michael T. (1989), "Cascading divide-and-conquer: a technique for designing parallel algorithms", SIAM Journal on Computing, 18 (3): 499–532, doi:10.1137/0218035, MR 0996833, S2CID 1752195 .
- ↑ Apostolico, Alberto; Atallah, Mikhail J.; Larmore, Lawrence L.; McFaddin, Scott (1990), "Efficient parallel algorithms for string editing and related problems", SIAM Journal on Computing, 19 (5): 968–988, CiteSeerX 10.1.1.100.9057 , doi:10.1137/0219066, MR 1059665 .
- ↑ "Word order may stump hackers", Times Higher Education , May 4, 2001.
- ↑ "Purdue Team Develops Watermark To Protect Electronic Documents", ScienceDaily, April 27, 2001
- ↑ "Multiple "guards" foil hackers", USA Today Magazine, June 1, 2003.
- ↑ ACM Fellow award citation, retrieved 2011-09-29.
- ↑ Fellows in Region 4 Archived 2011-08-05 at the Wayback Machine , IEEE, retrieved 2011-09-29.
