|
William Gasarch
William Ian Gasarch ( ; born 1959) is an American computer scientist known for his work in computational complexity theory, computability theory, computational learning theory, and Ramsey theory. He is currently a professor at the University of Maryland Department of Computer Science with an affiliate appointment in Mathematics. As of 2015 he has supervised over 40 high school students on research projects, including Jacob Lurie. He has co-blogged on computational complexity with Lance Fortnow since 2007. He was book review editor for ACM SIGACT NEWS from 1997 to 2015. Education Gasarch received his doctorate in computer science from Harvard in 1985, advised by Harry R. Lewis. His thesis was titled ''Recursion-Theoretic Techniques in Complexity Theory and Combinatorics''. He was hired into a tenure track professorial job at the University of Maryland in the Fall of 1985. He was promoted to Associate Professor with Tenure in 1991, and to Full Professor in 1998. Work Gasarch ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacob Lurie
Jacob Alexander Lurie (born December 7, 1977) is an American mathematician who is a professor at the Institute for Advanced Study. Lurie is a 2014 MacArthur Fellow. Life When he was a student in the Science, Mathematics, and Computer Science Magnet Program at Montgomery Blair High School, Lurie took part in the International Mathematical Olympiad, where he won a gold medal with a perfect score in 1994. In 1996 he took first place in the Westinghouse Science Talent Search and was featured in a front-page story in the ''Washington Times''. Lurie earned his bachelor's degree in mathematics from Harvard College in 2000 and was awarded in the same year the Morgan Prize for his undergraduate thesis on Lie algebras. He earned his Ph.D. from the Massachusetts Institute of Technology under supervision of Michael J. Hopkins, in 2004 with a thesis on derived algebraic geometry. In 2007, he became associate professor at MIT, and in 2009 he became professor at Harvard University. In 20 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harvard University Alumni
The list of Harvard University people includes notable graduates, professors, and administrators affiliated with Harvard University. For a list of notable non-graduates of Harvard, see notable non-graduate alumni of Harvard. For a list of Harvard's presidents, see President of Harvard University. Eight President of the United States, Presidents of the United States have graduated from Harvard University: John Adams, John Quincy Adams, Rutherford B. Hayes, John F. Kennedy, Franklin Delano Roosevelt, Theodore Roosevelt, George W. Bush, and Barack Obama. Bush graduated from Harvard Business School, Hayes and Obama from Harvard Law School, and the others from Harvard College. Over 150 Nobel Prize winners have been associated with the university as alumni, researchers or faculty. Nobel laureates Pulitzer Prize winners ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Maryland, College Park Faculty
A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, the designation is reserved for colleges that have a graduate school. The word ''university'' is derived from the Latin ''universitas magistrorum et scholarium'', which roughly means "community of teachers and scholars". The first universities were created in Europe by Catholic Church monks. The University of Bologna (''Università di Bologna''), founded in 1088, is the first university in the sense of: *Being a high degree-awarding institute. *Having independence from the ecclesiastic schools, although conducted by both clergy and non-clergy. *Using the word ''universitas'' (which was coined at its foundation). *Issuing secular and non-secular degrees: grammar, rhetoric, logic, theology, canon law, notarial law.Hunt Janin: "The university ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computability Theorists
Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem. The most widely studied models of computability are the Turing-computable and μ-recursive functions, and the lambda calculus, all of which have computationally equivalent power. Other forms of computability are studied as well: computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation. Problems A central idea in computability is that of a (computational) problem, which is a task whose computability can be explored. There are two key types of problems: * A decision problem fixes a set ''S'', which may be a set of strings, natural numbers, or o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Computer Scientists
American(s) may refer to: * American, something of, from, or related to the United States of America, commonly known as the "United States" or "America" ** Americans, citizens and nationals of the United States of America ** American ancestry, people who self-identify their ancestry as "American" ** American English, the set of varieties of the English language native to the United States ** Native Americans in the United States, indigenous peoples of the United States * American, something of, from, or related to the Americas, also known as "America" ** Indigenous peoples of the Americas * American (word), for analysis and history of the meanings in various contexts Organizations * American Airlines, U.S.-based airline headquartered in Fort Worth, Texas * American Athletic Conference, an American college athletic conference * American Recordings (record label), a record label previously known as Def American * American University, in Washington, D.C. Sports teams Soccer * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
P Vs NP
The P versus NP problem is a major unsolved problem in theoretical computer science. In informal terms, it asks whether every problem whose solution can be quickly verified can also be quickly solved. The informal term ''quickly'', used above, means the existence of an algorithm solving the task that runs in polynomial time, such that the time to complete the task varies as a polynomial function on the size of the input to the algorithm (as opposed to, say, exponential time). The general class of questions for which some algorithm can provide an answer in polynomial time is " P" or "class P". For some questions, there is no known way to find an answer quickly, but if one is provided with information showing what the answer is, it is possible to verify the answer quickly. The class of questions for which an answer can be ''verified'' in polynomial time is NP, which stands for "nondeterministic polynomial time".A nondeterministic Turing machine can move to a state that is not de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Carl Herbert Smith
Carl Herbert Smith (1950–2004) was an American computer scientist. He was a pioneer in computational complexity theory and computational learning theory. Smith was program manager of the National Science Foundation's theoretical computer science program, and editor of the '' International Journal of the Foundations of Computer Science'', ''Theoretical Computer Science'', and ''Fundamenta Informaticae''. He held professorships at Purdue University and the University of Maryland, College Park. He organized the first conferences on computational learning in the U.S. in the 1980s. He earned a PhD from the State University at Buffalo in 1979, and received Habilitation degree from the University of Latvia in 1993. He was a member of the Latvian Academy of Sciences The Latvian Academy of Sciences ( lv, Latvijas Zinātņu akadēmija) is the official Academy of Sciences, science academy of Latvia and is an association of the country's foremost scientists. The academy was founded as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Eppstein
David Arthur Eppstein (born 1963) 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. Biography Born in Windsor, England, in 1963, Eppstein received a B.S. in Mathematics from Stanford University in 1984, and later an M.S. (1985) and Ph.D. (1989) in computer science from Columbia University, after which he took a postdoctoral position at Xerox's Palo Alto Research Center. He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005. In 2014, he was named a Chancellor's Professor. In October 2017, Eppstein was one of 396 members elected as fellows of the American Association for the Advancement of Science. Eppstein is also an amateur digital photographer. Research interests In computer science, E ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clyde Kruskal
Clyde P. Kruskal (born May 25, 1954)Author biography from is an American computer scientist, working on parallel computing architectures, models, and algorithms. As part of the ultracomputer project, he was one of the inventors of the read–modify–write concept in parallel and distributed computing. He is an associate professor of computer science at the University of Maryland, College Park. Early life, education, and career Kruskal is the son of mathematician Martin Kruskal. He graduated from Brandeis University in 1976, and went to the Courant Institute of Mathematical Sciences at New York University for graduate study, earning a master's degree in 1978 and completing his Ph.D. in 1981. His dissertation, ''Upper and Lower Bounds on the Performance of Parallel Algorithms'', was supervised by Jack Schwartz. He became an assistant professor of computer science at the University of Illinois at Urbana–Champaign before moving to Maryland. Selected publications With William Gas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ACM SIGACT
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer. Publications SIGACT publishes a quarterly print newsletter, ''SIGACT News''. Its online version, ''SIGACT News Online'', is available since 1996 for SIGACT members, with unrestricted access to some features. Conferences SIGACT sponsors or has sponsored several annual conferences. *COLT: Conference on Learning Theory, until 1999 *PODC: ACM Symposium on Principles of Distributed Computing (jointly sponsored by SIGOPS) *PODS: ACM Symposium on Principles of Database Systems *POPL: ACM Symposium on Principles of Programming Languages *SOCG: ACM Symposium on Computational Geometry (jointly sponsored by SIGGRAPH), until 2014 *SODA: ACM/SIAM Symposium on Discrete Algorithms (jointly sponsored by the Society for Industrial and Applied Mathematics). ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
_-_09.JPG "Click for more on -> University Of Maryland, College Park Faculty")
