Michelle Lynn Wachs is an American mathematician who specializes in algebraic combinatorics and works as a professor of mathematics at the University of Miami. [1]
Michelle Lynn Wachs is an American mathematician who specializes in algebraic combinatorics and works as a professor of mathematics at the University of Miami. [1]
Wachs and her advisor Adriano Garsia are the namesakes of the Garsia–Wachs algorithm for optimal binary search trees, which they published in 1977. [2] [A] She is also known for her research on shellings for simplicial complexes, [F] partially ordered sets, [C] and Coxeter groups, [B] and on random permutation statistics [E] and set partition statistics. [D]
Wachs earned her doctorate in 1977 from the University of California, San Diego, under the supervision of Adriano Garsia. Her dissertation was Discrete Variational Techniques in Finite Mathematics. [3]
In 2012 Wachs became one of the inaugural fellows of the American Mathematical Society. [4] In 2013 she and her husband, mathematician Gregory Galloway (the chair of the mathematics department at Miami) were recognized as Simons Fellows. [5] A conference in her honor was held in January 2015 at the University of Miami. [6]
| A. | Garsia, Adriano M.; Wachs, Michelle L. (1977), "A new algorithm for minimum cost binary trees", SIAM Journal on Computing , 6 (4): 622–642, doi:10.1137/0206045, MR 0520738 |
| B. | Björner, Anders; Wachs, Michelle (1982), "Bruhat order of Coxeter groups and shellability", Advances in Mathematics , 43 (1): 87–100, doi: 10.1016/0001-8708(82)90029-9 , MR 0644668 |
| C. | Björner, Anders; Wachs, Michelle (1983), "On lexicographically shellable posets", Transactions of the American Mathematical Society , 277 (1): 323–341, doi:10.2307/1999359, JSTOR 1999359, MR 0690055 |
| D. | Wachs, Michelle; White, Dennis (1991), "-Stirling numbers and set partition statistics", Journal of Combinatorial Theory , Series A, 56 (1): 27–46, doi: 10.1016/0097-3165(91)90020-H , MR 1082841 |
| E. | Björner, Anders; Wachs, Michelle L. (1991), "Permutation statistics and linear extensions of posets", Journal of Combinatorial Theory , Series A, 58 (1): 85–114, doi: 10.1016/0097-3165(91)90075-R , MR 1119703 |
| F. | Björner, Anders; Wachs, Michelle L. (1996), "Shellable nonpure complexes and posets I", Transactions of the American Mathematical Society , 348 (4): 1299–1327, doi: 10.1090/S0002-9947-96-01534-6 , MR 1333388 ; Part II, Trans. AMS 349 (10): 3945–3975, 1997, doi:10.1090/S0002-9947-97-01838-2, MR 1401765 |
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code is Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".
Robert Endre Tarjan is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components 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.
Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.
Joseph Bernard Kruskal, Jr. was an American mathematician, statistician, computer scientist and psychometrician.
David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
Daniel Mertz Kane is an American mathematician. He is a full professor with a joint position in the Mathematics Department and the Computer Science and Engineering Department at the University of California, San Diego.
Adriano Mario Garsia is a Tunisian-born Italian American mathematician who works in analysis, combinatorics, representation theory, and algebraic geometry. He is a student of Charles Loewner and has published work on representation theory, symmetric functions, and algebraic combinatorics. He and Mark Haiman made the N!_conjecture. He is also the namesake of the Garsia–Wachs algorithm for optimal binary search trees, which he published with his student Michelle L. Wachs in 1977.
Maria Chudnovsky is an Israeli-American mathematician working on graph theory and combinatorial optimization. She is a 2012 MacArthur Fellow.
Leslie Frederick Greengard is an American mathematician, physicist and computer scientist. He is co-inventor with Vladimir Rokhlin Jr. of the fast multipole method (FMM) in 1987, recognized as one of the top-ten algorithms of the 20th century.
Sara Cosette Billey is an American mathematician working in algebraic combinatorics. She is known for her contributions on Schubert polynomials, singular loci of Schubert varieties, Kostant polynomials, and Kazhdan–Lusztig polynomials often using computer verified proofs. She is currently a professor of mathematics at the University of Washington.
Alexander (Lex) Schrijver is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the Centrum Wiskunde & Informatica in Amsterdam. Since 1993 he has been co-editor in chief of the journal Combinatorica.
James Ian Munro is a Canadian computer scientist. He is known for his fundamental contributions to algorithms and data structures.
In computer science, an optimal binary search tree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search time (or expected search time) for a given sequence of accesses (or access probabilities). Optimal BSTs are generally divided into two types: static and dynamic.
Hélène Barcelo is a mathematician from Québec specializing in algebraic combinatorics. Within that field, her interests include combinatorial representation theory, homotopy theory, and arrangements of hyperplanes. She is a professor emeritus of mathematics at Arizona State University, and deputy director of the Mathematical Sciences Research Institute (MSRI). She was editor-in-chief of the Journal of Combinatorial Theory, Series A, from 2001 to 2009.
Ewa Maria Kubicka is a Polish mathematician interested in graph theory and actuarial science. She is known for introducing the concept of the chromatic sum of a graph, the minimum possible sum when the vertices are labeled by natural numbers with no two adjacent vertices having equal labels.
Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference.
The Garsia–Wachs algorithm is an efficient method for computers to construct optimal binary search trees and alphabetic Huffman codes, in linearithmic time. It is named after Adriano Garsia and Michelle L. Wachs.
Jennifer Leigh Morse is a mathematician specializing in algebraic combinatorics. She is a professor of mathematics at the University of Virginia.
Charles "Chuck" Joel Stone was an American statistician and mathematician.
Violet Bushwick Haas was an American applied mathematician specializing in control theory and optimal estimation who became a professor of electrical engineering at Purdue University College of Engineering.
