|
Martin Fürer
Martin Fürer is a Swiss Computer Scientist and a professor of Computer Science at Pennsylvania State University. He is mostly known for his work on fast integer multiplication. Research and career One of Fürer's notable results is his fast integer multiplication algorithm STOC presented in 2007 and published in 2009 (). His main research is on Graph Theory Algorithms, Approximation Algorithms, Fixed Parameter Tractable Algorithm, and Computational Complexity. He obtained his PhD in Mathematics from ETH Zurich in 1978 under supervision of Ernst P. Specker and has been a faculty member at Pennsylvania State University The Pennsylvania State University (Penn State or PSU) is a Public university, public Commonwealth System of Higher Education, state-related Land-grant university, land-grant research university with campuses and facilities throughout Pennsyl ... since 1987. He is on the editorial board of Journal of Graph Algorithms and Applications and Information ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pennsylvania State University
The Pennsylvania State University (Penn State or PSU) is a Public university, public Commonwealth System of Higher Education, state-related Land-grant university, land-grant research university with campuses and facilities throughout Pennsylvania, United States. Founded in 1855 as Farmers' High School of Pennsylvania, Penn State was named the state's first land-grant university eight years later, in 1863. Its primary campus, known as Penn State University Park, is located in State College, Pennsylvania, State College and College Township, Pennsylvania, College Township. Penn State enrolls more than 89,000 students, of which more than 74,000 are undergraduates and more than 14,000 are postgraduates. In addition to its land-grant designation, the university is a National Sea Grant College Program, sea-grant, National Space Grant College and Fellowship Program, space-grant, and one of only six Sun Grant Association, sun-grant universities. It is Carnegie Classification of Instit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ETH Zurich
ETH Zurich (; ) is a public university in Zurich, Switzerland. Founded in 1854 with the stated mission to educate engineers and scientists, the university focuses primarily on science, technology, engineering, and mathematics. ETH Zurich ranks among Europe's best universities. Like its sister institution École Polytechnique Fédérale de Lausanne, EPFL, ETH Zurich is part of the ETH Domain, Swiss Federal Institutes of Technology Domain, a consortium of universities and research institutes under the Swiss Federal Department of Economic Affairs, Education and Research. , ETH Zurich enrolled 25,380 students from over 120 countries, of which 4,425 were pursuing doctoral degrees. Students, faculty, and researchers affiliated with ETH Zurich include 22 Nobel Prize, Nobel laureates, two Fields Medalists, three Pritzker Architecture Prize, Pritzker Prize winners, and one Turing Award, Turing Award recipient, including Albert Einstein and John von Neumann. It is a founding member o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pennsylvania State University Faculty
Pennsylvania, officially the Commonwealth of Pennsylvania, is a state spanning the Mid-Atlantic, Northeastern, Appalachian, and Great Lakes regions of the United States. It borders Delaware to its southeast, Maryland to its south, West Virginia to its southwest, Ohio and the Ohio River to its west, Lake Erie and New York to its north, the Delaware River and New Jersey to its east, and the Canadian province of Ontario to its northwest via Lake Erie. Pennsylvania's most populous city is Philadelphia. Pennsylvania was founded in 1681 through a royal land grant to William Penn, the son of the state's namesake. Before that, between 1638 and 1655, a southeast portion of the state was part of New Sweden, a Swedish colony. Established as a haven for religious and political tolerance, the colonial-era Province of Pennsylvania was known for its relatively peaceful relations with native tribes, innovative government system, and religious pluralism. Pennsylvania later played a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Swiss Computer Scientists
Swiss most commonly refers to: * the adjectival form of Switzerland *Swiss people Swiss may also refer to: Places * Swiss, Missouri * Swiss, North Carolina * Swiss, West Virginia * Swiss, Wisconsin Other uses * Swiss Café, an old café located in Baghdad, Iraq *Swiss-system tournament, in various games and sports * Swiss International Air Lines **Swiss Global Air Lines, a subsidiary *Swissair, former national air line of Switzerland * .swiss alternative TLD for Switzerland See also *Swiss made, label for Swiss products *Swiss cheese (other) *Switzerland (other) *Languages of Switzerland, none of which are called "Swiss" *International Typographic Style, also known as Swiss Style, in graphic design *Schweizer (other), meaning Swiss in German *Schweitzer Schweitzer is a surname. Notable people with the surname include: * Albert Schweitzer (1875–1965), German theologian, musician, physician, and medical missionary, winner of the 1952 Nobel Peace Priz ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Purpose: Because living persons may suffer personal harm from inappropriate information, we should watch their articles carefully. By adding an article to this category, it marks them with a notice about sources whenever someone tries to edit them, to remind them of WP:BLP (biographies of living persons) policy that these articles must maintain a neutral point of view, maintain factual accuracy, and be properly sourced. Recent changes to these articles are listed on Special:RecentChangesLinked/Living people. Organization: This category should not be sub-categorized. Entries are generally sorted by family name In many societies, a surname, family name, or last name is the mostly hereditary portion of one's personal name that indicates one's family. It is typically combined with a given name to form the full name of a person, although several give .... Maintenance: Individuals of advanced age (over 90), for whom there has been no new documentation in the last ten ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Information And Computation
''Information and Computation'' is a closed-access computer science journal published by Elsevier (formerly Academic Press). The journal was founded in 1957 under its former name ''Information and Control'' and given its current title in 1987. , the current editor-in-chief is David Peleg. The journal publishes 12 issues a year. History ''Information and Computation'' was founded as ''Information and Control'' in 1957 at the initiative of Leon Brillouin and under the editorship of Leon Brillouin, Colin Cherry and Peter Elias. Murray Eden joined as editor in 1962 and became sole editor-in-chief in 1967. He was succeeded by Albert R. Meyer in 1981, under whose editorship the journal was rebranded ''Information and Computation'' in 1987 in response to the shifted focus of the journal towards theory of computation and away from control theory. In 2020, Albert Mayer was succeeded by David Peleg as editor-in-chief of the journal. Indexing All articles from the ''Information and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Graph Algorithms And Applications
The ''Journal of Graph Algorithms and Applications'' is a diamond open access peer-reviewed scientific journal covering the subject of graph algorithms and graph drawing. The journal was established in 1997 and the current co-editors-in-chief are Emilio Di Giacomo (University of Perugia) and Martin Nöllenburg (TU Wien). It is published by Brown University and is a member of the Free Journal Network. It is abstracted and indexed by Scopus and MathSciNet MathSciNet is a searchable online bibliographic database created by the American Mathematical Society in 1996. It contains all of the contents of the journal ''Mathematical Reviews'' (MR) since 1940 along with an extensive author database, links .... MathS ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ernst Specker
Ernst Paul Specker (11 February 1920, Zürich – 10 December 2011, Zürich) was a Swiss mathematician. Much of his most influential work was on Quine's New Foundations, a set theory with a universal set, but he is most famous for the Kochen–Specker theorem in quantum mechanics, showing that certain types of hidden-variable theories are impossible. He also proved the ordinal partition relation thereby solving a problem of Erdős. Specker received his Ph.D. in 1949 from ETH Zurich ETH Zurich (; ) is a public university in Zurich, Switzerland. Founded in 1854 with the stated mission to educate engineers and scientists, the university focuses primarily on science, technology, engineering, and mathematics. ETH Zurich ran ...,. where he remained throughout his professional career. See also * Specker sequence * Baer–Specker group References External links Biography at the University of St. Andrews Ernst Specker (1920-2011) Martin Fürer, January 25, 2012. * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplication Algorithm
A multiplication algorithm is an algorithm (or method) to multiplication, multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others. Numerous algorithms are known and there has been much research into the topic. The oldest and simplest method, known since Ancient history, antiquity as long multiplication or grade-school multiplication, consists of multiplying every digit in the first number by every digit in the second and adding the results. This has a time complexity of O(n^2), where ''n'' is the number of digits. When done by hand, this may also be reframed as grid method multiplication or lattice multiplication. In software, this may be called "shift and add" due to bitshifts and addition being the only two operations needed. In 1960, Anatoly Karatsuba discovered Karatsuba multiplication, unleashing a flood of research into fast multiplication algorithms. This method uses three multiplications rather than four to multiply ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doctor Of Philosophy
A Doctor of Philosophy (PhD, DPhil; or ) is a terminal degree that usually denotes the highest level of academic achievement in a given discipline and is awarded following a course of Postgraduate education, graduate study and original research. The name of the degree is most often abbreviated PhD (or, at times, as Ph.D. in North American English, North America), pronounced as three separate letters ( ). The University of Oxford uses the alternative abbreviation "DPhil". PhDs are awarded for programs across the whole breadth of academic fields. Since 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, in some cases, defend their work before a panel of other experts in the field. In many fields, the completion of a PhD is typically required for employment as a university professor, researcher, or scientist. Definition In the context o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Complexity
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory. Both areas are highly related, as the complexity of an algorithm is always an upper bound on the complexity of the problem solved by this algorithm. Moreover, for designing efficient algorithms, it is often fundamental to compare the complexity of a specific algorithm to the complexity of the problem to be solved. Also, in most cases, the only thing that is known about the complexity of a problem is that it is lower than the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
