|
Ludwig Staiger
Ludwig Staiger is a German mathematician and computer scientist at the Martin Luther University of Halle-Wittenberg. He received his Ph.D. in mathematics from the University of Jena in 1976; Staiger wrote his doctoral thesis, ''Zur Topologie der regulären Mengen'', under the direction of and Rolf Lindner. Previously he held positions at the Academy of Sciences in Berlin (East), the Central Institute of Cybernetics and Information Processes, the Karl Weierstrass Institute for Mathematics and the Technical University Otto-von-Guericke Magdeburg. He was a visiting professor at RWTH Aachen University, the universities Dortmund, Siegen, and Cottbus in Germany and the Technical University Vienna, Austria. He is a member of the Managing Committee of the Georg Cantor Association and an external researcher of the Center for Discrete Mathematics and Theoretical Computer Science at the University of Auckland, New Zealand. He co-invented with Klaus Wagner the Staiger–Wagner auto ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematician
A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, structure, space, models, and change. History One of the earliest known mathematicians were Thales of Miletus (c. 624–c.546 BC); he has been hailed as the first true mathematician and the first known individual to whom a mathematical discovery has been attributed. He is credited with the first use of deductive reasoning applied to geometry, by deriving four corollaries to Thales' Theorem. The number of known mathematicians grew when Pythagoras of Samos (c. 582–c. 507 BC) established the Pythagorean School, whose doctrine it was that mathematics ruled the universe and whose motto was "All is number". It was the Pythagoreans who coined the term "mathematics", and with whom the study of mathematics for its own sake begins. The first woman mathematician recorded by history was Hypati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grzegorz Rozenberg
Grzegorz Rozenberg (born 14 March 1942, Warsaw) is a Polish and Dutch computer scientist. His primary research areas are natural computing, formal language and automata theory, graph transformations, and concurrent systems. He is referred to as the guru of natural computing, as he was promoting the vision of natural computing as a coherent scientific discipline already in the 1970s, gave this discipline its current name, and defined its scope. His research career spans over forty five years. He is a professor at the Leiden Institute of Advanced Computer Science of Leiden University, The Netherlands and adjoint professor at the Department of Computer Science, University of Colorado at Boulder, USA. Rozenberg is also a performing magician, with the artist name Bolgani and specializing in close-up illusions. He is the father of well-known Dutch artist Dadara. Education and career Rozenberg received his Master and Engineer degrees in computer science from the Warsaw Unive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springer Science+Business Media
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business internationally, o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michael Dinneen
Michael J. Dinneen is an American-New Zealand mathematician and computer scientist working as a senior lecturer at the University of Auckland, New Zealand. He is co-director of the Center for Discrete Mathematics and Theoretical Computer Science. He does research in combinatorial algorithms, distributive programming, experimental graph theory, and experimental algorithmic information theory. Selected bibliography * Michael J. Dinneen, Georgy Gimel'farb, and Mark C. Wilson. ''Introduction to Algorithms, Data Structures and Formal Languages''. Pearson (Education New Zealand), 2004. (pages 253). * Cristian S. Calude, Michael J. Dinneen, and Chi-Kou Shu. Computing a glimpse of randomness. "Experimental Mathematics", 11(2):369-378, 2002. http://www.cs.auckland.ac.nz/~cristian/Calude361_370.pdf * Joshua J. Arulanandham, Cristian S. Calude, and Michael J. Dinneen. A fast natural algorithm for searching. "Theoretical Computer Science", 320(1):3-13, 2004. http://authors.elsevier.com/s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
World Scientific
World Scientific Publishing is an academic publisher of scientific, technical, and medical books and journals headquartered in Singapore. The company was founded in 1981. It publishes about 600 books annually, along with 135 journals in various fields. In 1995, World Scientific co-founded the London-based Imperial College Press together with the Imperial College of Science, Technology and Medicine. Company structure The company head office is in Singapore. The Chairman and Editor-in-Chief is Dr Phua Kok Khoo, while the Managing Director is Doreen Liu. The company was co-founded by them in 1981. Imperial College Press In 1995 the company co-founded Imperial College Press, specializing in engineering, medicine and information technology, with Imperial College London. In 2006, World Scientific assumed full ownership of Imperial College Press, under a license granted by the university. Finally, in August 2016, ICP was fully incorporated into World Scientific under the new imprint ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cristian S
Cristian is the Romanian and Spanish form of the male given name Christian. In Romanian, it is also a surname. Cristian may refer to: People * Cristian (footballer, born 1994), Brazilian footballer * Cristian Adomniței (born 1975), Romanian engineer and politician * Cristian Agnelli (born 1985), Italian footballer * Cristian Alberdi (born 1980), Spanish footballer * Cristian Albu (born 1993), Romanian footballer * Cristian Alessandrini (born 1985), Argentine footballer * Cristian Alex (born 1993), Brazilian footballer * Cristian Alexanda, Australian R&B singer * Cristian Amarilla (born 1993), Argentine footballer * Cristian Amigo (born 1963), American composer, guitarist, and sound designer * Cristian Andreoni (born 1992), Italian footballer * Cristian Andrés Campozano (born 1985), Argentine footballer * Cristian Ansaldi (born 1986), Argentine footballer * Cristián Arriagada (born 1981), Chilean actor * Cristian Avram (born 1994), Moldovan footballer * Cristian Baroni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alexandra Bellow
Alexandra Bellow (née Bagdasar; previously Ionescu Tulcea; born 30 August 1935) is a Romanian-American mathematician, who has made contributions to the fields of ergodic theory, probability and analysis. Biography Bellow was born in Bucharest, Romania, on August 30, 1935, as Alexandra Bagdasar. Her parents were both physicians. Her mother, Florica Bagdasar (née Ciumetti), was a child psychiatrist. Her father, , was a neurosurgeon. She received her M.S. in mathematics from the University of Bucharest in 1957, where she met and married her first husband, mathematician Cassius Ionescu-Tulcea. She accompanied her husband to the United States in 1957 and received her Ph.D. from Yale University in 1959 under the direction of Shizuo Kakutani with thesis ''Ergodic Theory of Random Series''. After receiving her degree, she worked as a research associate at Yale from 1959 until 1961, and as an assistant professor at the University of Pennsylvania from 1962 to 1964. From 1964 until 19 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithmic Information Theory
Algorithmic information theory (AIT) is a branch of theoretical computer science that concerns itself with the relationship between computation and information of computably generated objects (as opposed to stochastically generated), such as strings or any other data structure. In other words, it is shown within algorithmic information theory that computational incompressibility "mimics" (except for a constant that only depends on the chosen universal programming language) the relations or inequalities found in information theory. According to Gregory Chaitin, it is "the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously." Besides the formalization of a universal measure for irreducible information content of computably generated objects, some main achievements of AIT were to show that: in fact algorithmic complexity follows (in the self-delimited case) the same inequalities (except for a constant) tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Electronic Colloquium On Computational Complexity
The Electronic Colloquium on Computational Complexity (ECCC) is an electronic archive of research papers in computational complexity theory, a branch of computer science.... The intention of the ECCC is to provide a fast publication service intermediate in its level of peer review between preprint servers such as authors' web sites or arXiv (which release papers with little or no delay and filtering) and journals (which subject papers to a heavy editing process but, in computer science, may take months or years to publish a paper). Papers submitted to ECCC are screened by a board of experts, who review the submissions to ensure that they are on-topic, novel, interesting, and written according to the standards of the field. Any panelist may accept or reject any of the submissions; if no decision is made within two months, the submission is automatically rejected. In order to ensure the long-term stability of the archive, its contents are backed up by electronic media that are sent to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Effective Dimension
In mathematics, effective dimension is a modification of Hausdorff dimension and other fractal dimensions that places it in a computability theory setting. There are several variations (various notions of effective dimension) of which the most common is effective Hausdorff dimension. Dimension, in mathematics, is a particular way of describing the size of an object (contrasting with measure and other, different, notions of size). Hausdorff dimension generalizes the well-known integer dimensions assigned to points, lines, planes, etc. by allowing one to distinguish between objects of intermediate size between these integer-dimensional objects. For example, fractal subsets of the plane may have intermediate dimension between 1 and 2, as they are "larger" than lines or curves, and yet "smaller" than filled circles or rectangles. Effective dimension modifies Hausdorff dimension by requiring that objects with small effective dimension be not only small but also locatable (or partially lo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automata Theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word ''automata'' comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite-State Machine (FSM). The figure on the right illustrates a finite-state machine, which is a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the previous state and current input symbol as its arguments. Automata theo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
