James Munkres

James Munkres

James Raymond Munkres (b. August 18, 1930) is a Professor Emeritus of mathematics at MIT and the author of several texts in the area of topology, including Topology (a well-known undergraduate-level text), Analysis on Manifolds, Elements of Algebraic Topology, and Elementary Differential Topology. He is also the author of Elementary Linear Algebra.

He completed his undergraduate education at Nebraska Wesleyan University[1] and received his Ph.D. from the University of Michigan in 1956; his advisor was Edwin E. Moise. Earlier in his career he taught at the University of Michigan and at Princeton University.[1]

Among his contributions to mathematics is the development of what is sometimes called the Munkres assignment algorithm.

References

  1. ^ a b "Mathematics", The Tech, Volume 119, Issue 33, August 27, 1999

External links



Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Algorithme hongrois — L algorithme hongrois ou méthode hongroise (parfois appelé aussi algorithme de Kuhn) est un algorithme d optimisation combinatoire, qui résout le problème d affectation en temps polynomial. Il a été proposé en 1955 par le mathématicien américain… …   Wikipédia en Français

  • Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… …   Wikipedia

  • Algoritmo Húngaro — Saltar a navegación, búsqueda EL algoritmo Húngaro es un algoritmo de optimización el cual resuelve problemas de asignación en tiempo . La primera versión conocida del método Húngaro, fue inventado y publicado por Harold Kuhn en 1955. Este fue… …   Wikipedia Español

  • Algoritmo húngaro — EL algoritmo Húngaro es un algoritmo de optimización el cual resuelve problemas de asignación en tiempo . La primera versión conocida del método Húngaro, fue inventado y publicado por Harold Kuhn en 1955. Este fue revisado por James Munkres en… …   Wikipedia Español

  • Triangulation (topology) — In mathematics, topology generalizes the notion of triangulation in a natural way as follows: A triangulation of a topological space X is a simplicial complex K , homeomorphic to X , together with a homeomorphism h : K o X . Triangulation is… …   Wikipedia

  • Ungarische Methode — Die Ungarische Methode, auch Kuhn Munkres Algorithmus genannt, ist ein Algorithmus zum Lösen gewichteter Zuordnungsprobleme auf bipartiten Graphen. Diese Problemklasse ist ein Spezialfall der Linearen Optimierung, für die Algorithmen der… …   Deutsch Wikipedia

  • Zig-zag lemma — In mathematics, particularly homological algebra, the zig zag lemma asserts the existence of a particular long exact sequence in the homology groups of certain chain complexes. The result is valid in every abelian category. Statement In an… …   Wikipedia

  • Chemin (topologie) — Pour les articles homonymes, voir Chemin. Points parcourus par un chemin de A à B dans R². Cependant, différents chemins peuvent parcourir le même ensemble de points. En mathématiques, un che …   Wikipédia en Français

  • Nebraska Wesleyan University — Established 1887 Type Private Religious affiliation United Methodist Church …   Wikipedia

  • Edwin E. Moise — Infobox Scientist box width = name = Edwin Evariste Moise image size = 150px caption = birth date = birth date|1918|12|22 birth place = New Orleans, Louisiana death date = dda|1998|12|18|1918|12|22 death place = New York, New York fields =… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”