Related Research Articles
Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.
Pancake sorting is the mathematical problem of sorting a disordered stack of pancakes in order of size when a spatula can be inserted at any point in the stack and used to flip all pancakes above it. A pancake number is the minimum number of flips required for a given number of pancakes. In this form, the problem was first discussed by American geometer Jacob E. Goodman. A variant of the problem is concerned with burnt pancakes, where each pancake has a burnt side and all pancakes must, in addition, end up with the burnt side on bottom.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
In computational complexity theory, SL is the complexity class of problems log-space reducible to USTCON, which is the problem of determining whether there exists a path between two vertices in an undirected graph, otherwise described as the problem of determining whether two vertices are in the same connected component. This problem is also called the undirected reachability problem. It does not matter whether many-one reducibility or Turing reducibility is used. Although originally described in terms of symmetric Turing machines, that equivalent formulation is very complex, and the reducibility definition is what is used in practice.
László Lovász is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.
Clyde P. Kruskal 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.
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two cycles of consecutive edges share any vertex with each other, nor can any two cycles be connected to each other by a path of consecutive edges. A pseudotree is a connected pseudoforest.
Joseph O'Rourke is the Spencer T. and Ann W. Olin Professor of Computer Science at Smith College and the founding chair of the Smith computer science department. His main research interest is computational geometry.
Cristian Sorin Calude is a Romanian-New Zealander mathematician and computer scientist.
Mikhail Jibrayil (Mike) Atallah is a Lebanese American computer scientist, a distinguished professor of computer science at Purdue University.
Hans Leo Bodlaender is a Dutch computer scientist, a professor of computer science at Utrecht University. Bodlaender is known for his work on graph algorithms and parameterized complexity and in particular for algorithms relating to tree decomposition of graphs.
Marcos Faundez-Zanuy is full professor and the Dean at Escuela Universitaria Politécnica de Mataró. He has a Phd on Telecommunication from UPC. He was the chair of the European COST action 277 "Non-linear Speech Processing", as well as the secretary of COST-2102 "Cross-Modal Analysis of Verbal and Non-verbal Communication"
Carla Diane Savage is an American computer scientist and mathematician, a professor of computer science at North Carolina State University and a former secretary of the American Mathematical Society (2013-2020).
Uwe Schöning is a retired German computer scientist, known for his research in computational complexity theory.
Ewa Maria Kubicka is a Polish mathematician interested in graph theory and actuarial science. She is known for introducing the concept of the chromatic sum of a graph, the minimum possible sum when the vertices are labeled by natural numbers with no two adjacent vertices having equal labels.
Deborah A. Joseph is an American computer scientist known for her research in computational geometry, computational biology, and computational complexity theory. She is a professor emeritus of computer science at the University of Wisconsin–Madison.
Mirka Miller was a Czech-Australian mathematician and computer scientist interested in graph theory and data security. She was a professor of electrical engineering and computer science at the University of Newcastle.
In graph theory, the cutwidth of an undirected graph is the smallest integer with the following property: there is an ordering of the vertices of the graph, such that every cut obtained by partitioning the vertices into earlier and later subsets of the ordering is crossed by at most edges. That is, if the vertices are numbered , then for every , the number of edges with and is at most .
Panagiota (Youla) Fatourou is a Greek computer scientist, specializing in distributed computing and concurrent computing, including the design of data structures that can be used in non-blocking algorithms. She is a professor of computer science at the University of Crete, the former chair of the ACM Europe Council, and the founder of the Greek chapter of the ACM Council on Women in Computing.
María Luisa Bonet Carbonell is a Spanish computer scientist interested in logic in computer science, including proof complexity and algorithms for the maximum satisfiability problem. She is a professor of computer science at the Polytechnic University of Catalonia.
References
- ↑ Birth year from Library of Congress catalog entry, retrieved 2023-04-06
- ↑ Àlvarez, Carme; Duch, Amalia (2021), "Some results of Maria Serna on strategic games: complexity of equilibria and models", Computer Science Review, 39: Paper No. 100346, doi:10.1016/j.cosrev.2020.100346, hdl: 2117/362998 , MR 4193708
- ↑ Blesa, Maria J.; Fernández Anta, Antonio (2021), "Maria Serna's contributions to adversarial queuing theory", Computer Science Review, 39, Paper No. 100348, doi:10.1016/j.cosrev.2020.100348, hdl: 2117/363804 , MR 4198164
- ↑ Àlvarez, Carme (2021), "Maria Serna in Barcelona", Computer Science Review, 39: Paper No. 100351, doi:10.1016/j.cosrev.2020.100351, hdl: 2117/362999 , MR 4192041
- 1 2 3 Curriculum vitae , retrieved 2023-04-06
- ↑ Spirakis, Paul G. (2021), "Maria Serna and her years in Patras", Computer Science Review, 39: Paper No. 100350, doi:10.1016/j.cosrev.2020.100350, MR 4198165
- ↑ Maria Serna at the Mathematics Genealogy Project
- ↑ Reviews of Paradigms for Fast Parallel Approximability: Juraj Hromkovič, MR 1475925; Costică Moroşanu, Zbl 0927.68120
- ↑ Díaz, Josep; Nešetřil, Jarik (2021), "Preface [special issue dedicated to celebrate the 61th anniversary of Professor Maria Serna]", Computer Science Review, 39: Paper No. 100354, doi:10.1016/j.cosrev.2020.100354, MR 4198166
