|
David Karger
David Ron Karger (born May 1, 1967) is a professor of computer science and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) at the Massachusetts Institute of Technology. Education Karger received a Bachelor of Arts degree from Harvard University and a PhD in computer science from Stanford University. Research Karger's work in algorithms has focused on applications of randomization to optimization problems and led to significant progress on several core problems. He is responsible for Karger's algorithm, a Monte Carlo method to compute the minimum cut of a connected graph. Karger developed the fastest minimum spanning tree algorithm to date, with Philip Klein and Robert Tarjan. They found a linear time randomized algorithm based on a combination of Borůvka's algorithm and the reverse-delete algorithm. With Ion Stoica, Robert Morris, Frans Kaashoek, and Hari Balakrishnan, he also developed Chord, one of the four original distributed hash table ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Information Management
Information management (IM) concerns a cycle of organizational activity: the acquisition of information from one or more sources, the custodianship and the distribution of that information to those who need it, and its ultimate disposal through archiving or deletion. This cycle of information organisation involves a variety of stakeholders, including those who are responsible for assuring the quality, accessibility and utility of acquired information; those who are responsible for its safe storage and disposal; and those who need it for decision making. Stakeholders might have rights to originate, change, distribute or delete information according to organisational information management policies. Information management embraces all the generic concepts of management, including the planning, organizing, structuring, processing, controlling, evaluation and reporting of information activities, all of which is needed in order to meet the needs of those with organisational r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bachelor Of Arts
Bachelor of arts (BA or AB; from the Latin ', ', or ') is a bachelor's degree awarded for an undergraduate program in the arts, or, in some cases, other disciplines. A Bachelor of Arts degree course is generally completed in three or four years, depending on the country and institution. * Degree attainment typically takes four years in Afghanistan, Armenia, Azerbaijan, Bangladesh, Brazil, Brunei, China, Egypt, Ghana, Greece, Georgia, Hong Kong, Indonesia, Iran, Iraq, Ireland, Japan, Kazakhstan, Kenya, Kuwait, Latvia, Lebanon, Lithuania, Mexico, Malaysia, Mongolia, Myanmar, Nepal, Netherlands, Nigeria, Pakistan, the Philippines, Qatar, Russia, Saudi Arabia, Scotland, Serbia, South Korea, Spain, Sri Lanka, Taiwan, Thailand, Turkey, Ukraine, the United States and Zambia. * Degree attainment typically takes three years in Albania, Australia, Bosnia and Herzegovina, the Caribbean, Iceland, India, Israel, Italy, New Zealand, Norway, South Africa, Switzerland, the Canadian province of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distributed Hash Table
A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table: key–value pairs are stored in a DHT, and any participating node can efficiently retrieve the value associated with a given key. The main advantage of a DHT is that nodes can be added or removed with minimum work around re-distributing keys. ''Keys'' are unique identifiers which map to particular ''values'', which in turn can be anything from addresses, to documents, to arbitrary data. Responsibility for maintaining the mapping from keys to values is distributed among the nodes, in such a way that a change in the set of participants causes a minimal amount of disruption. This allows a DHT to scale to extremely large numbers of nodes and to handle continual node arrivals, departures, and failures. DHTs form an infrastructure that can be used to build more complex services, such as anycast, cooperative web caching, distributed file systems, domain name services, instant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hari Balakrishnan
Hari Balakrishnan is the Fujitsu Professor of Computer Science and Artificial Intelligence in the Department of Electrical Engineering and Computer Science at MIT, and the Co-founder and CTO at Cambridge Mobile Telematics. Early life and career Balakrishnan was born in Nagpur, India, and was raised in Bombay (Mumbai) and Chennai. He received his bachelor's degree in computer science from the Indian Institute of Technology, Madras in 1993 and his doctoral degree in computer science from the University of California, Berkeley in 1998. He has been at MIT since 1998. His father, V. Balakrishnan, is a renowned physics educator and researcher in theoretical physics, his mother, Radha Balakrishnan, is also a well-known theoretical physicist, and his sister, Hamsa Balakrishnan, is a Professor and Associate Department Head of MIT's Department of Aeronautics and Astronautics. Balakrishnan is well known for his highly-cited and influential contributions to computer networks, networked ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frans Kaashoek
Marinus Frans (Frans) Kaashoek (born 1965, Leiden) is a Dutch computer scientist, entrepreneur, and Charles Piper Professor at the Massachusetts Institute of Technology. He was elected a member of the National Academy of Engineering (2006) for contributions to computer systems, distributed systems, and content-distribution networks. Biography Kaashoek received his MA in 1988 and his Ph.D degree in Computer Science in 1992 from the Vrije Universiteit under the supervision of Andy Tanenbaum for the thesis "Group communication in distributed computer systems." In 1993 Kaashoek was appointed Charles Piper Professor in the Department of Electrical Engineering and Computer Science of the Massachusetts Institute of Technology. He is a member of the MIT Computer Science and Artificial Intelligence Laboratory's Parallel and Distributed Operating Systems group. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robert Tappan Morris
Robert Tappan Morris (born November 8, 1965) is an American computer scientist and entrepreneur. He is best known for creating the Morris worm in 1988, considered the first computer worm on the Internet. Morris was prosecuted for releasing the worm, and became the first person convicted under the then-new Computer Fraud and Abuse Act (CFAA). He went on to cofound the online store Viaweb, one of the first web applications, and later the venture capital funding firm Y Combinator, both with Paul Graham. He later joined the faculty in the department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT), where he received tenure in 2006. He was elected to the National Academy of Engineering in 2019. Early life Morris was born in 1965 to parents Robert Morris and Anne Farlow Morris. The senior Robert Morris was a computer scientist at Bell Labs, who helped design Multics and Unix; and later became the chief scientist at the National Co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ion Stoica
Ion Stoica is a Romanian-American computer scientist specializing in distributed systems, cloud computing and computer networking. He is a professor of computer science at the University of California, Berkeley and co-director of AMPLab. He co-founded Conviva and Databricks with other original developers of Apache Spark. As of April 2022, Forbes ranked him and Matei Zaharia as the 3rd- richest people in Romania with a net worth of $1.6 billion. Education Stoica was born in Romania, where he grew up and attended Polytechnic University of Bucharest, receiving a MS in Electrical Engineering and Computer Science in 1989. He moved to the USA in 1994 to start a PhD at Old Dominion University with computer-science professor Hussein Abdel-Wahab. In 1996, he transferred to Carnegie Mellon University (CMU), where in 2000 he received a PhD in Electrical & Computer Engineering supervised by Hui Zhang. Subjects included Chord (peer-to-peer), Core-Stateless Fair Queueing (CSFQ), and Inter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Borůvka's Algorithm
Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected. It was first published in 1926 by Otakar Borůvka as a method of constructing an efficient electricity network for Moravia. The algorithm was rediscovered by Choquet in 1938; again by Florek, Łukasiewicz, Perkal, Steinhaus, and Zubrzycki in 1951; and again by Georges Sollin in 1965. This algorithm is frequently called Sollin's algorithm, especially in the parallel computing literature. The algorithm begins by finding the minimum-weight edge incident to each vertex of the graph, and adding all of those edges to the forest. Then, it repeats a similar process of finding the minimum-weight edge from each tree constructed so far to a different tree, and adding all of those edges to the forest. Each repetition of this process reduces the number of trees, within each connected component of the graph, to at most half ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Randomized Algorithm
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables. One has to distinguish between algorithms that use the random input so that they always terminate with the correct answer, but where the expected running time is finite (Las Vegas algorithms, for example Quicksort), and algorithms which have a chance of producing an incorrect result (Monte Carlo algorithms, for example the Monte Carlo algorithm for the MFAS problem) or fail to produce a result either by signaling a failure or failing to terminate. In some cases, probabilistic algorithms are the only practical means of solving a problem. In common practice, randomized algor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Time
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is generally expresse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robert Tarjan
Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's off-line lowest common ancestors algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University, and the Chief Scientist at Intertrust Technologies Corporation. Early life and education He was born in Pomona, California. His father, raised in Hungary, was a child psychiatrist, specializing in mental retardation, and ran a state hospital. As a child, Tarjan read a lot of science fiction, and wanted to be an astronomer. He became interested in mathematics after reading Martin Gardner's mathematical games column in Scientific American. He became seriously interested in math in the eighth grade, thanks to a "very stimulating" teacher. While he was in high school, Tarjan got a job, where he work ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minimum Spanning Tree
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components. There are many use cases for minimum spanning trees. One example is a telecommunications company trying to lay cable in a new neighborhood. If it is constrained to bury the cable only along certain paths (e.g. roads), then there would be a graph containing the points (e.g. houses) connected by those paths. Some of the paths might be more expensive, because they are longer, or require the cable to be buried deeper; these paths would be represented by edges with larger weights ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
