WikiMili The Free Encyclopedia

This biography of a living person needs additional citations for verification .(August 2012) (Learn how and when to remove this template message) |

Thomas H. Cormen | |
---|---|

Born | 1956 |

Residence | U.S. |

Nationality | American |

Alma mater | Massachusetts Institute of Technology Princeton University |

Scientific career | |

Fields | Computer Science |

Institutions | Dartmouth College |

Doctoral advisor | Charles E. Leiserson |

**Thomas H. Cormen**^{ [1] } is the co-author of * Introduction to Algorithms *, along with Charles Leiserson, Ron Rivest, and Cliff Stein. In 2013, he published a new book titled * Algorithms Unlocked *. He is a professor of computer science at Dartmouth College and former Chairman of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program.^{ [2] } His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.

* Introduction to Algorithms* is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation "

**Ronald Linn Rivest** is a cryptographer and an Institute Professor at MIT. He is a member of MIT's Department of Electrical Engineering and Computer Science (EECS) and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). He was a member of the Election Assistance Commission's Technical Guidelines Development Committee, tasked with assisting the EAC in drafting the Voluntary Voting System Guidelines.

**Clifford Seth Stein**, a computer scientist, is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science. Stein is chair of the Industrial Engineering and Operations Research Department at Columbia University. Prior to joining Columbia, Stein was a professor at Dartmouth College in New Hampshire.

Thomas H. Cormen was born in New York City in 1956. He grew up in Oceanside, New York.

The **City of New York**, usually called either **New York City** (**NYC**) or simply **New York** (**NY**), is the most populous city in the United States. With an estimated 2018 population of 8,398,748 distributed over a land area of about 302.6 square miles (784 km^{2}), New York is also the most densely populated major city in the United States. Located at the southern tip of the state of New York, the city is the center of the New York metropolitan area, the largest metropolitan area in the world by urban landmass and one of the world's most populous megacities, with an estimated 19,979,477 people in its 2018 Metropolitan Statistical Area and 22,679,948 residents in its Combined Statistical Area. A global power city, New York City has been described as the cultural, financial, and media capital of the world, and exerts a significant impact upon commerce, entertainment, research, technology, education, politics, tourism, art, fashion, and sports. The city's fast pace has inspired the term *New York minute*. Home to the headquarters of the United Nations, New York is an important center for international diplomacy.

**Oceanside** is a hamlet and census-designated place (CDP) located in the southern part of the town of Hempstead, Nassau County, New York. The population was 32,109 at the 2010 census.

He received his bachelor's degree * summa cum laude * in *Electrical Engineering and Computer Science* from Princeton University in June 1978.^{ [3] }

A **bachelor's degree** or **baccalaureate** is an undergraduate academic degree awarded by colleges and universities upon completion of a course of study lasting three to seven years. In some institutions and educational systems, some bachelor's degrees can only be taken as graduate or postgraduate degrees after a first degree has been completed. In countries with qualifications frameworks, bachelor's degrees are normally one of the major levels in the framework, although some qualifications titled bachelor's degrees may be at other levels and some qualifications with non-bachelor's titles may be classified as bachelor's degrees.

**Princeton University ** is a private Ivy League research university in Princeton, New Jersey. Founded in 1746 in Elizabeth as the **College of New Jersey**, Princeton is the fourth-oldest institution of higher education in the United States and one of the nine colonial colleges chartered before the American Revolution. The institution moved to Newark in 1747, then to the current site nine years later, and renamed itself Princeton University in 1896.

He then went to the Massachusetts Institute of Technology, where he earned his master's degree in *Electrical Engineering and Computer Science* in May 1986 with a thesis on "Concentrator Switches for Routing Messages in Parallel Computers"^{ [3] } and his PhD with a thesis on "Virtual Memory for Data-Parallel Computing"^{ [4] } in February 1993.^{ [3] }

**Massachusetts Institute of Technology** (**MIT**) is a private research university in Cambridge, Massachusetts. The Institute is a land-grant, sea-grant, and space-grant university, with an urban campus that extends more than a mile (1.6 km) alongside the Charles River. The Institute also encompasses a number of major off-campus facilities such as the MIT Lincoln Laboratory, the Bates Center, and the Haystack Observatory, as well as affiliated laboratories such as the Broad and Whitehead Institutes. Founded in 1861 in response to the increasing industrialization of the United States, MIT adopted a European polytechnic university model and stressed laboratory instruction in applied science and engineering. It has since played a key role in the development of many aspects of modern science, engineering, mathematics, and technology, and is widely known for its innovation and academic strength, making it one of the most prestigious institutions of higher learning in the world.

A **master's degree** is an academic degree awarded by universities or colleges upon completion of a course of study demonstrating mastery or a high-order overview of a specific field of study or area of professional practice. A master's degree normally requires previous study at the bachelor's level, either as a separate degree or as part of an integrated course. Within the area studied, master's graduates are expected to possess advanced knowledge of a specialized body of theoretical and applied topics; high order skills in analysis, critical evaluation, or professional application; and the ability to solve complex problems and think rigorously and independently.

From July 2004 through June 2008, he was the director of the Dartmouth Institute for Writing and Rhetoric.

During his career he received several honors and awards:^{ [3] }

- Elected to Phi Beta Kappa, Tau Beta Pi, Eta Kappa Nu.
- National Science Foundation Fellowship.
- Best Presentation Award, 1986 International Conference on Parallel Processing, St. Charles, Illinois.
- Distinguished Presentation Award, 1987 International Conference on Parallel Processing, St. Charles, Illinois.
- Professional and Scholarly Publishing Award in Computer Science and Data Processing, Association of American Publishers, 1990.
- Dartmouth College Class of 1962 Faculty Fellowship, 1995–1996.
- Jacobus Family Fellow, Dartmouth College, 1998–1999.
- McLane Family Fellow, Dartmouth College, 2004–2005.

- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990).
*Introduction to Algorithms*(first ed.). MIT Press and McGraw-Hill. ISBN 978-0-262-03141-7.CS1 maint: multiple names: authors list (link) - Cormen, Thomas H. (2002).
*Algorithmic Complexity*. CRC Press. - Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001).
*Introduction to Algorithms*(second ed.). MIT Press and McGraw-Hill. ISBN 978-0-262-53196-2.CS1 maint: multiple names: authors list (link) - Cormen, Thomas H.; Clara Lee; Erica Lin (2002).
*Instructor's Manual to Accompany Introduction to Algorithms, Second Edition*(second ed.). MIT Press. - Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009).
*Introduction to Algorithms*(third ed.). MIT Press. ISBN 978-0-262-03384-8.CS1 maint: multiple names: authors list (link) - Cormen, Thomas H. (2009).
*Instructor's Manual to Accompany Introduction to Algorithms, Third edition*(third ed.). MIT Press. - Cormen, Thomas H. (2013).
*Algorithms Unlocked*(first ed.). MIT Press. ISBN 978-0-262-51880-2.

- ↑ The middle name is just 'H.'
- ↑ The actual title was:
- 2004-2005: Director of the Dartmouth College Writing Program
- 2005-2008: Chair of the Dartmouth College Writing Program
- 2008: Director of the Dartmouth College Institute for Writing and Rhetoric
- 2008: Chair of the Dartmouth College Writing and Rhetoric Program (the curricular component of the Institute)

- 1 2 3 4 "Thomas H. Cormen profile" (PDF). cs.dartmouth.edu. Archived from the original (PDF) on June 6, 2011. Retrieved 2 September 2012.
- ↑ "Thomas H. Cormen, Virtual Memory for Data-Parallel Computing, MIT, 1992" (PDF). cs.dartmouth.edu. Retrieved 2 September 2012.

This article about an American scientist is a stub. You can help Wikipedia by expanding it. |

This biographical article relating to a computer specialist in the United States is a stub. You can help Wikipedia by expanding it. |

In computer science, a **priority queue** is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. In some implementations, if two elements have the same priority, they are served according to the order in which they were enqueued, while in other implementations, ordering of elements with the same priority is undefined.

** Kruskal's algorithm** is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a *minimum spanning forest*.

In computer science, the **Edmonds–Karp algorithm** is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in time. The algorithm was first published by Yefim Dinitz in 1970 and independently published by Jack Edmonds and Richard Karp in 1972. Dinic's algorithm includes additional techniques that reduce the running time to .

**MacDraw** was a vector graphic drawing application released along with the first Apple Macintosh systems in 1984. MacDraw was one of the first WYSIWYG drawing programs that could be used in collaboration with MacWrite. MacDraw was useful for drawing technical diagrams and floorplans. It was eventually adapted by Claris and, in the early 1990s, MacDraw Pro was released with color support. MacDraw was the vector cousin of MacPaint.

**Stooge sort** is a recursive sorting algorithm. It is notable for its exceptional bad time complexity of O(*n*^{log 3 / log 1.5 }) = O(*n*^{2.7095...}). The running time of the algorithm is thus slower compared to reasonable sorting algorithms, and is slower than Bubble sort, a canonical example of a fairly inefficient sort. It is however more efficient than Slowsort. The name comes from The Three Stooges.

**Ken Batcher**, full name **Kenneth Edward Batcher** is an emeritus professor of Computer Science at Kent State University. He also worked as a computer architect at Goodyear Aerospace in Akron, Ohio for 28 years.

In computer science, a **topological sort** or **topological ordering** of a directed graph is a linear ordering of its vertices such that for every directed edge *uv* from vertex *u* to vertex *v*, *u* comes before *v* in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edges may represent constraints that one task must be performed before another; in this application, a topological ordering is just a valid sequence for the tasks. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG). Any DAG has at least one topological ordering, and algorithms are known for constructing a topological ordering of any DAG in linear time.

In computer science, the **iterated logarithm** of , written log* , is the number of times the logarithm function must be iteratively applied before the result is less than or equal to . The simplest formal definition is the result of this recurrence relation:

In computer science, a problem is said to have **overlapping subproblems** if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than always generating new subproblems.

**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.

In geometry, two points are called **coincident** when they are actually the same point as each other. The same word has also been used more generally for other forms of incidence or special position between geometric objects.

In computational geometry, the **line segment intersection problem** supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect (cross).

In computational geometry, a **bitonic tour** of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice.

In computer science, the **worst-case complexity** measures the resources an algorithm requires in the worst-case. It gives an upper bound on the resources required by the algorithm.

**Donald Bruce Johnson** was an American computer scientist, a researcher in the design and analysis of algorithms, and the founding chair of the computer science department at Dartmouth College.

In computer science, an **order statistic tree** is a variant of the binary search tree that supports two additional operations beyond insertion, lookup and deletion:

In computer science, a **mergeable heap** is an abstract data type, which is a heap supporting a merge operation.

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.