|
Michal Parnas
Michal Parnas ( he, מיכל פרנס) is an Israeli theoretical computer scientist known for her work on property testing and sublinear-time algorithms. She is a professor of computer science at the Academic College of Tel Aviv-Yafo in Israel, where she was a founding faculty member and was also the dean of the school of computer science from 2011 to 2016. Since October 2022 she is the vice president of academic affairs of the college. Parnas is the daughter of neurobiologist (1935–2012). She was a master's student at the Hebrew University of Jerusalem, working with Avi Wigderson on a 1990 master's thesis on ''Approximate Counting, Almost Uniform Generation and Random Walks''. She completed her Ph.D. at the Hebrew University in 1994. Her dissertation, ''Robust Algorithms and Data Structures for Information Retrieval'', was jointly supervised by Danny Dolev and Noam Nisan. She is the co-author of a book in Hebrew on discrete mathematics Discrete mathematics is the study o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michal Parnas
Michal Parnas ( he, מיכל פרנס) is an Israeli theoretical computer scientist known for her work on property testing and sublinear-time algorithms. She is a professor of computer science at the Academic College of Tel Aviv-Yafo in Israel, where she was a founding faculty member and was also the dean of the school of computer science from 2011 to 2016. Since October 2022 she is the vice president of academic affairs of the college. Parnas is the daughter of neurobiologist (1935–2012). She was a master's student at the Hebrew University of Jerusalem, working with Avi Wigderson on a 1990 master's thesis on ''Approximate Counting, Almost Uniform Generation and Random Walks''. She completed her Ph.D. at the Hebrew University in 1994. Her dissertation, ''Robust Algorithms and Data Structures for Information Retrieval'', was jointly supervised by Danny Dolev and Noam Nisan. She is the co-author of a book in Hebrew on discrete mathematics Discrete mathematics is the study o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Science
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the theoretical areas precisely. The Association for Computing Machinery, ACM's ACM SIGACT, Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description: History While logical inference and mathematical proof had existed previously, in 1931 Kurt Gödel proved with his incompleteness theorem that there are fundamental limitations on what statements could be proved or disproved. Information theory was added to the field with a 1948 mathematical theory of communication by Claude Shannon. In the same decade, Donald Hebb introduced a mathematical model of Hebbian learning, learning in the brain. With mounting biological data supporting this hypothesis with some modification, the fields of n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Property Testing
In computer science, a property testing algorithm for a decision problem is an algorithm whose query complexity to its input is much smaller than the instance size of the problem. Typically property testing algorithms are used to distinguish if some combinatorial structure ''S'' (such as a graph or a boolean function) satisfies some property ''P'', or is "far" from having this property (meaning an ε-fraction of the representation of ''S'' need be modified in order to make ''S'' satisfy ''P''), using only a small number of "local" queries to the object. For example, the following promise problem admits an algorithm whose query complexity is independent of the instance size (for an arbitrary constant ε > 0): :"Given a graph ''G'' on ''n'' vertices, decide if ''G'' is bipartite, or ''G'' cannot be made bipartite even after removing an arbitrary subset of at most \epsilon\tbinom n2 edges of ''G''." Property testing algorithms are central to the definition of probabilistically ch ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sublinear Algorithm
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is generally expresse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hebrew University Of Jerusalem
The Hebrew University of Jerusalem (HUJI; he, הַאוּנִיבֶרְסִיטָה הַעִבְרִית בִּירוּשָׁלַיִם) is a public research university based in Jerusalem, Israel. Co-founded by Albert Einstein and Dr. Chaim Weizmann in July 1918, the public university officially opened in April 1925. It is the second-oldest Israeli university, having been founded 30 years before the establishment of the State of Israel but six years after the older Technion university. The HUJI has three campuses in Jerusalem and one in Rehovot. The world's largest library for Jewish studies—the National Library of Israel—is located on its Edmond J. Safra campus in the Givat Ram neighbourhood of Jerusalem. The university has five affiliated teaching hospitals (including the Hadassah Medical Center), seven faculties, more than 100 research centers, and 315 academic departments. , one-third of all the doctoral candidates in Israel were studying at the HUJI. Among its first ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Avi Wigderson
Avi Wigderson ( he, אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science. Biography Avi Wigderson was born in Haifa, Israel, to Holocaust survivors. Wigderson is a graduate of the Hebrew Reali School in Haifa, and did his undergraduate studies at the Technion in Haifa, Israel, graduating in 1980, and went on to graduate study at Princeton University. He received his PhD in computer science in 1983 after completing a doctoral dissertation, titled "Studies in computational complexity", under the supervision of Richard Lipton. After short-term positions at t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Danny Dolev
Daniel (Danny) Dolev is an Israeli computer scientist known for his research in cryptography and distributed computing. He holds the Berthold Badler Chair in Computer Science at the Hebrew University of Jerusalem and is a member of the scientific council of the European Research Council.. Biography Dolev did his undergraduate studies at the Hebrew University, earning a bachelor's degree in 1971. He then moved to the Weizmann Institute of Science, earning a master's degree in 1973 and a doctorate in 1979 under the supervision of Eli Shamir. After postdoctoral research at Stanford University and IBM Research, he joined the Hebrew University faculty in 1982. He took a second position at the IBM Almaden Research Center from 1987 to 1993, but retained his appointment at the Hebrew University. From 1998 to 2002, he was chair of the Institute of Computer Science and then Director of the School of Engineering and Computer Science at the Hebrew University. In 2011, he became the first Israe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Noam Nisan
Noam Nisan ( he, נעם ניסן; born June 20, 1961) is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory. Biography Nisan did his undergraduate studies at the Hebrew University, graduating in 1984. He went to the University of California, Berkeley for graduate school, and received a Ph.D. in 1988 under the supervision of Richard Karp. After postdoctoral studies at the Massachusetts Institute of Technology he joined the Hebrew University faculty in 1990.Curriculum vitae retrieved 2012-03-01. Selected publications Nisan is the author of[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics". The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deals with finite se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nati Linial
Nathan (Nati) Linial (born 1953 in Haifa, Israel) is an Israeli mathematician and computer scientist, a professor in the Rachel and Selim Benin School of Computer Science and Engineering at the Hebrew University of Jerusalem, and an ISI highly cited researcher. Linial did his undergraduate studies at the Technion, and received his PhD in 1978 from the Hebrew University under the supervision of Micha Perles. He was a postgraduate researcher at the University of California, Los Angeles before returning to the Hebrew University as a faculty member. In 2012 he became a fellow of the American Mathematical Society. In 2019 he won the FOCS Test of Time Award for the paper "''Constant Depth Circuits, Fourier Transform, and Learnability''", co-authored with Yishay Mansour and Noam Nisan. Selected publications *. The paper won the 2013 Dijkstra Prize. In the words of the prize committee: "This paper has had a major impact on distributed message-passing algorithms. It focused a spotlight ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Year Of Birth Missing (living People)
A year or annus is the orbital period of a planetary body, for example, the Earth, moving in its orbit around the Sun. Due to the Earth's axial tilt, the course of a year sees the passing of the seasons, marked by change in weather, the hours of daylight, and, consequently, vegetation and soil fertility. In temperate and subpolar regions around the planet, four seasons are generally recognized: spring, summer, autumn and winter. In tropical and subtropical regions, several geographical sectors do not present defined seasons; but in the seasonal tropics, the annual wet and dry seasons are recognized and tracked. A calendar year is an approximation of the number of days of the Earth's orbital period, as counted in a given calendar. The Gregorian calendar, or modern calendar, presents its calendar year to be either a common year of 365 days or a leap year of 366 days, as do the Julian calendars. For the Gregorian calendar, the average length of the calendar year (the ... [...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] |
