Search results
Jump to navigation
Jump to search
- {{Short description|British mathematician and computer scientist}} ...n}} is a British mathematician, [[theoretical computer science|theoretical computer scientist]], and [[software engineering|software engineer]] who holds a per ...3 KB (385 words) - 05:11, 15 November 2023
- {{Short description|Israeli theoretical computer scientist}} | fields = Theoretical Computer Science ...5 KB (637 words) - 20:33, 3 November 2024
- ...Hashiguchi'''|橋口 攻三郎|Hashiguchi Kōsaburō}} is a Japanese mathematician and computer scientist at the [[Toyohashi University of Technology]] and [[Okayama Unive | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]] ...4 KB (529 words) - 21:07, 26 December 2022
- {{Short description|Dutch computer scientist}} ...'' (born April 21, 1960) is a Dutch [[computer scientist]], a professor of computer science at [[Utrecht University]].<ref name="cv">{{citation|url=https://web ...5 KB (576 words) - 00:12, 12 January 2024
- {{Short description|Theoretical computer scientist}} {{about|computer scientist}} ...7 KB (844 words) - 05:56, 21 January 2025
- {{short description|American theoretical physicist}} ...own_for = {{ublist|[[Quantum computing]]|[[Loss–DiVincenzo quantum computer]]| [[DiVincenzo's criteria]]}} ...6 KB (771 words) - 04:24, 31 July 2024
- {{short description|Theoretical computer scientist}} ...Finn Career Development Associate Professor of Electrical Engineering and Computer Science at the [[Massachusetts Institute of Technology]].{{r|sloan}} She is ...9 KB (1,083 words) - 08:14, 20 November 2024
- {{Short description|Israeli-American computer scientist}} | field = [[Computer science]], [[Lattice-based cryptography]] ...9 KB (1,224 words) - 16:47, 29 January 2025
- ...s a [[USSR|Soviet]] and [[United States|American]] [[mathematician]] and [[computer scientist]], known for his research on [[algorithm]]s for [[polynomial]]s a | title = Proceedings of the 19th Annual Symposium on Foundations of Computer Science (FOCS 1978)| pages = 166–176 ...10 KB (1,326 words) - 07:19, 3 November 2024
- ...ests lie in [[combinatorics]], [[discrete optimisation]] and [[theoretical computer science]]. Currently, he focuses on the probabilistic aspects of these area ...e is married to [[Carol Frieze]], who directs two outreach efforts for the computer science department at Carnegie Mellon University.<ref>{{citation|url=https: ...8 KB (1,330 words) - 13:13, 14 October 2023
- | fields = [[Mathematics]] [[Computer Science]] [[Cryptography]] ...Cite web|url=https://www.cs.qc.cuny.edu/kahrobaei.html|title=Department of Computer Science, Queens College, CUNY|website=www.cs.qc.cuny.edu|access-date=2024-0 ...16 KB (2,116 words) - 21:09, 31 December 2024
- {{Short description|American computer scientist (died 2023)}} | field = [[Computer Science]] ...11 KB (1,369 words) - 04:06, 18 June 2024
- {{Short description|Dutch mathematician and computer scientist}} | fields = [[Computer science]], [[Mathematics]] ...8 KB (1,049 words) - 09:47, 11 June 2024
- ...ee 1966, master's degree 1967), where he received his doctorate in 1969 in computer science under Ronald C. Mullin and [[Ralph Gordon Stanton]] (''A generaliza ...liams prime]]s were named for him. He developed custom hardware for number-theoretical calculations, for example the MSSU in 1995.<ref>[https://archive.today/2012 ...7 KB (912 words) - 03:01, 24 August 2024
- ...l methods. This position is in large part due to the exponential growth of computer power which has allowed us to tackle ever larger and more complex problems. ...re then reduced to a system of algebraic equations that can be solved on a computer. Errors creep in during the discretization process. The nature and characte ...9 KB (1,294 words) - 03:42, 4 March 2024
- |fields = [[Theoretical physics]] In 1953, Gavrilă was accepted for doctoral studies in theoretical physics by Professor [[Șerban Țițeica]] in the School of Physics at the Un ...13 KB (1,809 words) - 03:58, 4 September 2024
- ...hn (mathematician)|Jeff Kahn]] showed that there exist a tight information-theoretical lower bound for sorting under [[partially ordered]] information up to a mul ...last2=Wigderson |first2=Avi |title=27th Annual Symposium on Foundations of Computer Science (SFCS 1986) |chapter=Probabilistic Boolean decision trees and the c ...7 KB (971 words) - 04:25, 27 September 2024
- | field = [[Computer Science]], [[Computational complexity theory]] ...]] and the [[Cornell University College of Arts and Sciences|Department of Computer Science]] at [[Cornell University]]. He obtained his Ph.D. from the [[Unive ...12 KB (1,785 words) - 07:25, 6 May 2024
- | fields = [[Theoretical physics]] ...9, in [[San José, Costa Rica]]) is a [[Costa Rica]]n [[theoretical physics|theoretical physicist]]. He is currently a professor at the [[University of Costa Rica ...11 KB (1,418 words) - 11:51, 16 October 2024
- ...ee}}. A preliminary version appeared in 23rd [[Symposium on Foundations of Computer Science]], 1982, {{doi|10.1109/SFCS.1982.39}}.</ref> [[random matrix|random [[Category:Theoretical computer scientists]] ...7 KB (1,063 words) - 15:42, 22 September 2024