Which algorithm was created by a Dutch computer scientist who held the Schlumberger Centennial Chair in Computer Sciences at the University of Texas at Austin?
2478881ec8bdaf5cf564226a71d25521
Dekker's algorithm Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in an unpublished paper on sequential process descriptions and his manuscript on cooperating sequential processes. It allows two threads to share a single-use resource without conflict, using only shared memory for communication.
ab18d3431815c65d53e041da3ddfc6a2
Edsger W. Dijkstra Edsger Wybe Dijkstra (] ; 11 May 1930 – 6 August 2002) was a Dutch computer scientist and an early pioneer in many research areas of computing science who held the Schlumberger Centennial Chair in Computer Sciences at the University of Texas at Austin from 1984 until his retirement in 1999. A theoretical physicist by training, he worked as a programmer at the Mathematisch Centrum (Amsterdam) from 1952 to 1962. He was a professor of mathematics at the Eindhoven University of Technology (1962–1984) and a research fellow at the Burroughs Corporation (1973–1984).
37c31007549ad504c17e9d24684e919f
Berndt–Hall–Hall–Hausman algorithm The Berndt–Hall–Hall–Hausman (BHHH) algorithm is a numerical optimization algorithm similar to the Gauss–Newton algorithm. It is named after the four originators: Ernst R. Berndt, B. Hall, Robert Hall, and Jerry Hausman.
d2bf7658b5f9ad9b09991fa53730e50d
Berlekamp–Zassenhaus algorithm In mathematics, in particular in computational algebra, the Berlekamp–Zassenhaus algorithm is an algorithm for factoring polynomials over the integers, named after Elwyn Berlekamp and Hans Zassenhaus. As a consequence of Gauss's lemma, this amounts to solving the problem also over the rationals.
052c076689b6acd3cc3d3cbe1d2fde2b
Martin Charles Golumbic Martin Charles Golumbic (born September 30, 1948) is a mathematician and computer scientist, best known for his work in algorithmic graph theory and in artificial intelligence. He is the founding editor-in-chief of the journal "Annals of Mathematics and Artificial Intelligence".
205353ac2d350fa72fe3f844960f2d89
Runge–Kutta–Fehlberg method In mathematics, the Runge–Kutta–Fehlberg method (or Fehlberg method) is an algorithm in numerical analysis for the numerical solution of ordinary differential equations. It was developed by the German mathematician Erwin Fehlberg and is based on the large class of Runge–Kutta methods.
3cf076ab7a9a9183e54e45388d703310
Warnock algorithm The Warnock algorithm is a hidden surface algorithm invented by John Warnock that is typically used in the field of computer graphics.
2e1b26457e98b08eca6a2cddafa70694
Egon Zakrajšek Egon Zakrajšek (July 7, 1941 – September 2002) was a Slovene mathematician and computer scientist.
1f502490288c8857f292372dcb8a6029
Herbert Edelsbrunner Herbert Edelsbrunner (born 1958) is a computer scientist working in the field of computational geometry, the Arts & Science Professor of Computer Science and Mathematics at Duke University, Professor at the Institute of Science and Technology Austria (IST Austria), and the co-founder of Geomagic, Inc. He was the first of only three computer scientists to win the National Science Foundation's Alan T. Waterman Award.
0cd66ebeb3d9da1ed24a2711b7e1edda
Axel van Lamsweerde Axel van Lamsweerde (born 1947) is a Belgian computer scientist and Professor of Computing Science at the Universite catholique de Louvain, known for his work on requirements engineering and the development of the KAOS goal-oriented modeling language.
9dbc426a41192a3f6d73d2a99fc468a1
Selim Akl Selim G. Akl (Ph.D., McGill University, 1978) is a professor at Queen's University in the Queen's School of Computing, where he leads the Parallel and Unconventional Computation Group. His research interests are primarily in the area of algorithm design and analysis, in particular for problems in parallel computing and unconventional computing.
d9207064b535c40ab15c2a5cc5f5c17c
Eric de Sturler Eric de Sturler (born 15 January 1966, Groningen) is a Professor of Mathematics at Virginia Tech in Blacksburg, Virginia. He is on the editorial board of "Applied Numerical Mathematics" and the "Open Applied Mathematics Journal".
2c0d413d99254b73d71733dc835cfc2e
Moses Charikar Moses Samson Charikar is an Indian computer scientist who works as a professor at Stanford University. He was previously a professor at Princeton University. The topics of his research include approximation algorithms, streaming algorithms, and metric embeddings. He is known for the creation of the SimHash algorithm used by Google for near duplicate detection.
a69dd4a2b2f899b11e614e4cf40b8254
Pollard's rho algorithm for logarithms Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's rho algorithm to solve the integer factorization problem.
5fd345b57448afe05d05a3502390a372
Orc (programming language) Orc is a concurrent, nondeterministic computer programming language created by Jayadev Misra at the University of Texas at Austin.
629aea1ac88add2821e7bba31b8c0e17
Calvin Gotlieb Calvin Carl "Kelly" Gotlieb, {'1': ", '2': ", '3': ", '4': "} (March 27, 1921 – October 16, 2016) was a Canadian professor and computer scientist who has been called the "Father of Computing" in Canada. He was a Professor in Computer Science at the University of Toronto.
ea73dc67f95faa12e75c939a0bf96b27
Quantum algorithm In quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer, the term quantum algorithm is usually used for those algorithms which seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.
affd301d4437a72071c91a2f94931de2
BKM algorithm The BKM algorithm is a shift-and-add algorithm for computing elementary functions, first published in 1994 by Jean-Claude Bajard, Sylvanus Kla, and Jean-Michel Muller. BKM is based on computing complex logarithms ("L-mode") and exponentials ("E-mode") using a method similar to the algorithm Henry Briggs used to compute logarithms. By using a precomputed table of logarithms of negative powers of two, the BKM algorithm computes elementary functions using only integer add, shift, and compare operations.
d8f5c603e1d7d976cea512ee1dbf416a
Sethi–Ullman algorithm In computer science, the Sethi–Ullman algorithm is an algorithm named after Ravi Sethi and Jeffrey D. Ullman, its inventors, for translating abstract syntax trees into machine code that uses as few registers as possible.
184bfeda3dc3c99f6b332ff426686d2f
Paul Boersma Paulus Petrus Gerardus "Paul" Boersma (born 15 November 1959, Sint Nicolaasga) is Professor of Phonetic Sciences at the University of Amsterdam. His research and teaching focus on the relationship between phonology and phonetics. Prof. dr. Boersma is mainly known for designing the worldwide used speech signal processing program Praat (together with David Weenink).
bff03a84b85cb5b6db6848232f1d2848
Hungarian algorithm The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal-dual methods. It was developed and published in 1955 by Harold Kuhn, who gave the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians: Dénes Kőnig and Jenő Egerváry.
fd3a2a151f9cfcf291b948971a0d8d40
HeuristicLab HeuristicLab is a software environment for heuristic and evolutionary algorithms, developed by members of the Heuristic and Evolutionary Algorithm Laboratory (HEAL) at the University of Applied Sciences Upper Austria, Campus Hagenberg.