|
Salil Vadhan
Salil Vadhan is an American computer scientist. He is Vicky Joseph Professor of Computer Science and Applied Mathematics at Harvard University. After completing his undergraduate degree in Mathematics and Computer Science at Harvard in 1995, he obtained his PhD in Applied Mathematics from Massachusetts Institute of Technology in 1999, where his advisor was Shafi Goldwasser. His research centers around the interface between computational complexity theory and cryptography. He focuses on the topics of pseudorandomness and zero-knowledge proofs. His work on the zig-zag product, with Omer Reingold and Avi Wigderson, was awarded the 2009 Gödel Prize. Contributions Zig-zag graph product for constructing expander graphs One of the main contributions of his work is a new type of graph product, called the zig-zag product. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree from the small one, and its e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Complexity Theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computationa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polylogarithmic Function
In mathematics, a polylogarithmic function in is a polynomial in the logarithm of , : a_k (\log n)^k + a_ (\log n)^ + \cdots + a_1(\log n) + a_0. The notation is often used as a shorthand for , analogous to for . In computer science, polylogarithmic functions occur as the order of time or memory used by some algorithms (e.g., "it has polylogarithmic order"). All polylogarithmic functions of are for every exponent (for the meaning of this symbol, see small o notation), that is, a polylogarithmic function grows more slowly than any positive exponent. This observation is the basis for the soft O notation Big ''O'' notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. Big O is a member of a family of notations invented by Paul Bachmann, Edmund Lan ... . References * Mathematical analysis Polynomials Analysis of algorithms {{comp-sci-theory-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Massachusetts Institute Of Technology School Of Science Alumni
Massachusetts (Massachusett: ''Muhsachuweesut Massachusett_writing_systems.html" ;"title="nowiki/> məhswatʃəwiːsət.html" ;"title="Massachusett writing systems">məhswatʃəwiːsət">Massachusett writing systems">məhswatʃəwiːsət'' English: , ), officially the Commonwealth of Massachusetts, is the most populous state in the New England region of the Northeastern United States. It borders on the Atlantic Ocean and Gulf of Maine to the east, Connecticut and Rhode Island to the south, New Hampshire and Vermont to the north, and New York to the west. The state's capital and most populous city, as well as its cultural and financial center, is Boston. Massachusetts is also home to the urban core of Greater Boston, the largest metropolitan area in New England and a region profoundly influential upon American history, academia, and the research economy. Originally dependent on agriculture, fishing, and trade. Massachusetts was transformed into a manufacturing center during ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harvard College 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 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] |
Theoretical Computer Scientists
A theory is a rational type of abstract thinking about a phenomenon, or the results of such thinking. The process of contemplative and rational thinking is often associated with such processes as observational study or research. Theories may be scientific, belong to a non-scientific discipline, or no discipline at all. Depending on the context, a theory's assertions might, for example, include generalized explanations of how nature works. The word has its roots in ancient Greek, but in modern use it has taken on several related meanings. In modern science, the term "theory" refers to scientific theories, a well-confirmed type of explanation of nature, made in a way consistent with the scientific method, and fulfilling the criteria required by modern science. Such theories are described in such a way that scientific tests should be able to provide empirical support for it, or empirical contradiction ("falsify") of it. Scientific theories are the most reliable, rigorous, and compr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John A
Sir John Alexander Macdonald (January 10 or 11, 1815 – June 6, 1891) was the first prime minister of Canada, serving from 1867 to 1873 and from 1878 to 1891. The dominant figure of Canadian Confederation, he had a political career that spanned almost half a century. Macdonald was born in Scotland; when he was a boy his family immigrated to Kingston in the Province of Upper Canada (today in eastern Ontario). As a lawyer, he was involved in several high-profile cases and quickly became prominent in Kingston, which elected him in 1844 to the legislature of the Province of Canada. By 1857, he had become premier under the colony's unstable political system. In 1864, when no party proved capable of governing for long, Macdonald agreed to a proposal from his political rival, George Brown, that the parties unite in a Great Coalition to seek federation and political reform. Macdonald was the leading figure in the subsequent discussions and conferences, which resulted in the Brit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Association For Computing Machinery
The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, claiming nearly 110,000 student and professional members . Its headquarters are in New York City. The ACM is an umbrella organization for academic and scholarly interests in computer science ( informatics). Its motto is "Advancing Computing as a Science & Profession". History In 1947, a notice was sent to various people: On January 10, 1947, at the Symposium on Large-Scale Digital Calculating Machinery at the Harvard computation Laboratory, Professor Samuel H. Caldwell of Massachusetts Institute of Technology spoke of the need for an association of those interested in computing machinery, and of the need for communication between them. ..After making some inquiries during May and June, we believe there is ample interest to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ACM Fellow
ACM or A.C.M. may refer to: Aviation * AGM-129 ACM, 1990–2012 USAF cruise missile * Air chief marshal * Air combat manoeuvring or dogfighting * Air cycle machine * Arica Airport (Colombia) (IATA: ACM), in Arica, Amazonas, Colombia Computing * Abstract Control Model, for USB to act as a serial port * Association for Computing Machinery, a US-based international learned society for computing * Asynchronous communication mechanism * Audio Compression Manager, Microsoft Windows codec manager Education * Allegany College of Maryland * Associated Colleges of the Midwest * Association for College Management Music * Academy of Contemporary Music, in Guildford, England, UK * Academy of Country Music * Association for Contemporary Music, in the Russian Federation Organizations or businesses * Alliance for Community Media * American Center for Mobility * American Ceylon Mission * Anaconda Copper Mining Company * Anti-Coalition Militia, anti-NATO Taliban in Afghanistan * Anti-cult ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Randomness Extractor
A randomness extractor, often simply called an "extractor", is a function, which being applied to output from a weakly random information entropy, entropy source, together with a short, uniformly random seed, generates a highly random output that appears Independent and identically distributed random variables, independent from the source and Uniform distribution (discrete), uniformly distributed. Examples of weakly random sources include radioactive decay or thermal noise; the only restriction on possible sources is that there is no way they can be fully controlled, calculated or predicted, and that a lower bound on their entropy rate can be established. For a given source, a randomness extractor can even be considered to be a true random number generator (Hardware_random_number_generator, TRNG); but there is no single extractor that has been proven to produce truly random output from any type of weakly random source. Sometimes the term "bias" is used to denote a weakly random sou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Amit Sahai
Amit Sahai (born 1974) is an American computer scientist. He is a professor of computer science at UCLA and the director of the Center for Encrypted Functionalities. Biography Amit Sahai was born in 1974 in Thousand Oaks, California, to parents who had immigrated from India. He received a B.A. in mathematics with a computer science minor from the University of California, Berkeley, summa cum laude, in 1996. At Berkeley, Sahai was named Computing Research Association Outstanding Undergraduate of the Year, North America, and was a member of the three-person team that won first place in the 1996 ACM International Collegiate Programming Contest. Sahai received his Ph.D. in Computer Science from MIT in 2000, and joined the computer science faculty at Princeton University. In 2004 he moved to UCLA, where he currently holds the position of Professor of Computer Science. Research and Recognition Amit Sahai's research interests are in security and cryptography, and theoretical computer sci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oded Goldreich
Oded Goldreich ( he, עודד גולדרייך; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography, and computational complexity theory. He won the Knuth Prize in 2017 and was selected in 2021 to receive the Israel Prize in mathematics. Biography Goldreich received a DSc in Computer Science at Technion in 1983 under Shimon Even. Goldreich has contributed to the development of pseudorandomness, zero knowledge proofs, secure function evaluation, property testing,Oded Goldreich, Shafi Goldwasser, and Dana Ron. 1998 Property Testing and its connection to Learning and Approximation. ''Journal of the ACM'', pages 653-750. and other areas in cryptography and computational complexity. Goldreich has also authored several books including: ''Fou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
