|
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] |
Pomona, California
Pomona is a city in Los Angeles County, California. Pomona is located in the Pomona Valley, between the Inland Empire and the San Gabriel Valley. At the 2020 census, the city's population was 151,713. The main campus of California State Polytechnic University, Pomona, also known as Cal Poly Pomona, lies partially within Pomona's city limits, with the rest being located in the neigboring unincorporated community of Ramona. History Beginnings to 1880 The area was originally occupied by the Tongva Native Americans. The city is named after Pomona, the ancient Roman goddess of fruit. For horticulturist Solomon Gates, "Pomona" was the winning entry in a contest to name the city in 1875, before anyone had ever planted a fruit tree there.A Brief History of Pomona The city was first settled by Ricardo Véjar an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doctor Of Philosophy
A Doctor of Philosophy (PhD, Ph.D., or DPhil; Latin: or ') is the most common Academic degree, degree at the highest academic level awarded following a course of study. PhDs are awarded for programs across the whole breadth of academic fields. Because it is an earned research degree, those studying for a PhD are required to produce original research that expands the boundaries of knowledge, normally in the form of a Thesis, dissertation, and defend their work before a panel of other experts in the field. The completion of a PhD is often a requirement for employment as a university professor, researcher, or scientist in many fields. Individuals who have earned a Doctor of Philosophy degree may, in many jurisdictions, use the title ''Doctor (title), Doctor'' (often abbreviated "Dr" or "Dr.") with their name, although the proper etiquette associated with this usage may also be subject to the professional ethics of their own scholarly field, culture, or society. Those who teach at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematician
A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, structure, space, models, and change. History One of the earliest known mathematicians were Thales of Miletus (c. 624–c.546 BC); he has been hailed as the first true mathematician and the first known individual to whom a mathematical discovery has been attributed. He is credited with the first use of deductive reasoning applied to geometry, by deriving four corollaries to Thales' Theorem. The number of known mathematicians grew when Pythagoras of Samos (c. 582–c. 507 BC) established the Pythagorean School, whose doctrine it was that mathematics ruled the universe and whose motto was "All is number". It was the Pythagoreans who coined the term "mathematics", and with whom the study of mathematics for its own sake begins. The first woman mathematician recorded by history was Hypati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Scientist
A computer scientist is a person who is trained in the academic study of computer science. Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (although there is overlap). Although computer scientists can also focus their work and research on specific areas (such as algorithm and data structure development and design, software engineering, information theory, database theory, computational complexity theory, numerical analysis, programming language theory, computer graphics, and computer vision), their foundation is the theoretical study of computing from which these other fields derive. A primary goal of computer scientists is to develop or validate models, often mathematical, to describe the properties of computational systems (processors, programs, computers interacting with people, computers interacting with other computers, etc.) with an overall objective of discovering des ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nevanlinna Prize
The IMU Abacus Medal, known before 2022 as the Rolf Nevanlinna Prize, is awarded once every four years at the International Congress of Mathematicians, hosted by the International Mathematical Union (IMU), for outstanding contributions in Mathematical Aspects of Information Sciences including: #All mathematical aspects of computer science, including computational complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence. #Scientific computing and numerical analysis. Computational aspects of optimization and control theory. Computer algebra. The prize was established in 1981 by the Executive Committee of the International Mathematical Union and named for the Finnish mathematician Rolf Nevanlinna. It consists of a gold medal and cash prize. The prize is targeted at younger theoretical computer scientists, and only those younger than 40 on January 1 of the award yea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turing Award
The ACM A. M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) for contributions of lasting and major technical importance to computer science. It is generally recognized as the highest distinction in computer science and is colloquially known as or often referred to as the " Nobel Prize of Computing". The award is named after Alan Turing, who was a British mathematician and reader in mathematics at the University of Manchester. Turing is often credited as being the key founder of theoretical computer science and artificial intelligence. From 2007 to 2013, the award was accompanied by an additional prize of US$250,000, with financial support provided by Intel and Google. Since 2014, the award has been accompanied by a prize of US$1 million, with financial support provided by Google. The first recipient, in 1966, was Alan Perlis, of Carnegie Mellon University. The first female recipient was Frances E. Allen of IBM in 2006. The latest reci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paris Kanellakis Award
The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing". It was instituted in 1996, in memory of Paris C. Kanellakis, a computer scientist who died with his immediate family in an airplane crash in South America in 1995 (American Airlines Flight 965). The award is accompanied by a prize of $10,000 and is endowed by contributions from Kanellakis's parents, with additional financial support provided by four ACM Special Interest Groups (SIGACT, SIGDA, SIGMOD, and SIGPLAN), the ACM SIG Projects Fund, and individual contributions. Winners See also * List of computer science awards This list of computer science awards is an index to articles on notable awards related to computer science. It includes lists of awards by the Association for Computing Machinery, the Institute of Electrical and Electronic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jeff Westbrook
Jeff Westbrook is a TV writer best known for his work on ''The Simpsons'' and ''Futurama'', for which he is a three-time winner of the WGA Award. Education and pre-TV Prior to becoming a TV writer, Westbrook was a successful algorithms researcher. After majoring in physics and history of science at Harvard University, he studied computer science with Robert Tarjan at Princeton University, receiving his Ph.D. in 1989 with a thesis entitled ''Algorithms and Data Structures for Dynamic Graph Algorithms''. He then took a faculty position at Yale University, later becoming a researcher for AT&T Laboratories before leaving research for Hollywood. Erdős and Bacon numbers Westbrook's Erdős number is three due to his research collaborations with Tarjan and others. His Bacon number is also three, due to his appearance as an extra in the movie '' Master and Commander: The Far Side of the World'', giving a combined Erdős–Bacon number of six. Writing credits ''Futurama'' episodes *"Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Daniel Sleator
Daniel Dominic Kaplan Sleator (born 10 December 1953) is a Professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 1999, he won the ACM Paris Kanellakis Award (jointly with Robert Tarjan) for the splay tree data structure. He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic, and splay trees. He invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps. The Sleator and Tarjan paper on the move-to-front heuristic first suggested the idea of comparing an online algorithm to an optimal offline algorithm, for which the term competitive analysis was later coined in a paper of Karlin, Manasse, Rudolph, and Sleator. Sleator also developed the theory of link grammars, and the Serioso music analyzer for analyzing meter and harmony in written music. Personal life Sleator was born to William Warner Sleator, Jr., a profess ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ramesh Sitaraman
Ramesh Sitaraman is an Indian American computer scientist known for his work on distributed algorithms, content delivery networks, streaming video delivery, and application delivery networks. He helped build the Akamai content delivery network, one of the world's largest distributed computing platforms. He is currently in the computer science department at University of Massachusetts Amherst. Biography Ramesh Sitaraman received a B.Tech in electrical engineering from the Indian Institute of Technology, Madras and a Ph.D (1993) in computer science from Princeton University under Robert Tarjan. He helped build Akamai's high-performance network for delivering web and media content and is an Akamai Fellow. Currently, he is a distinguished professor in the computer science department at University of Massachusetts, Amherst. Research Sitaraman's early research centered on algorithms for building reliable parallel networks from unreliable components by emulating a virtual overlay netw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monika Henzinger
Monika Henzinger (born as Monika Rauch, 17 April 1966 in Weiden in der Oberpfalz) is a German computer scientist, and is a former director of research at Google. She is currently a professor at the University of Vienna. Her expertise is mainly on algorithms with a focus on data structures, algorithmic game theory, information retrieval, search algorithms and Web data mining. She is married to Thomas Henzinger and has three children. Career She completed her PhD in 1993 from Princeton University under the supervision of Robert Tarjan. She then became an assistant professor of computer science at Cornell University, a research staff at Digital Equipment Corporation, an associate professor at the Saarland University, a director of research at Google, and a full professor of computer science at École Polytechnique Fédérale de Lausanne. She is currently a full professor of computer science at the University of Vienna, Austria. Awards * 1995: NSF Career Award * 1997: Best Pap ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Turing Award")
