|
Yuri Petrovich Ofman
Yuri Petrovich Ofman (russian: Ю́рий Петро́вич Офман, born 1939) is a Russian mathematician who works in computational complexity theory. He obtained his Doctorate from Moscow State University, where he was advised by Andrey Kolmogorov. He did important early work on parallel algorithms for prefix sum In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers is a second sequence of numbers , the sums of prefixes ( running totals) of the input sequence: : : : :... For instance, the prefix sums ...s and their application in the design of Boolean circuits for addition. Publications * * Translated in * Anatolii A. Karatsuba and Yu. P. Ofman (1962), "Умножение многозначных чисел на автоматах" ("Multiplication of Many-Digital Numbers by Automatic Computers"), ''Doklady Akademii Nauk SSSR'', vol. 146, pages 293–294. (Published by A. N. Kolmogorov, with two separate result ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Russian People
, native_name_lang = ru , image = , caption = , population = , popplace = 118 million Russians in the Russian Federation (2002 ''Winkler Prins'' estimate) , region1 = , pop1 = approx. 7,500,000 (including Russian Jews and Russian Germans) , ref1 = , region2 = , pop2 = 7,170,000 (2018) ''including Crimea'' , ref2 = , region3 = , pop3 = 3,512,925 (2020) , ref3 = , region4 = , pop4 = 3,072,756 (2009)(including Russian Jews and Russian Germans) , ref4 = , region5 = , pop5 = 1,800,000 (2010)(Russian ancestry and Russian Germans and Jews) , ref5 = 35,000 (2018)(born in Russia) , region6 = , pop6 = 938,500 (2011)(including Russian Jews) , ref6 = , region7 = , pop7 = 809,530 (2019) , ref7 ... [...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] |
Computational Complexity Theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computationa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moscow State University
M. V. Lomonosov Moscow State University (MSU; russian: Московский государственный университет имени М. В. Ломоносова) is a public research university in Moscow, Russia and the most prestigious university in the country. The university includes 15 research institutes, 43 faculties, more than 300 departments, and six branches (including five foreign ones in the Commonwealth of Independent States countries). Alumni of the university include past leaders of the Soviet Union and other governments. As of 2019, 13 List of Nobel laureates, Nobel laureates, six Fields Medal winners, and one Turing Award winner had been affiliated with the university. The university was ranked 18th by ''The Three University Missions Ranking'' in 2022, and 76th by the ''QS World University Rankings'' in 2022, #293 in the world by the global ''Times Higher World University Rankings'', and #326 by ''U.S. News & World Report'' in 2022. It was the highest-ran ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrey Kolmogorov
Andrey Nikolaevich Kolmogorov ( rus, Андре́й Никола́евич Колмого́ров, p=ɐnˈdrʲej nʲɪkɐˈlajɪvʲɪtɕ kəlmɐˈɡorəf, a=Ru-Andrey Nikolaevich Kolmogorov.ogg, 25 April 1903 – 20 October 1987) was a Soviet mathematician who contributed to the mathematics of probability theory, topology, intuitionistic logic, turbulence, classical mechanics, algorithmic information theory and computational complexity. Biography Early life Andrey Kolmogorov was born in Tambov, about 500 kilometers south-southeast of Moscow, in 1903. His unmarried mother, Maria Y. Kolmogorova, died giving birth to him. Andrey was raised by two of his aunts in Tunoshna (near Yaroslavl) at the estate of his grandfather, a well-to-do nobleman. Little is known about Andrey's father. He was supposedly named Nikolai Matveevich Kataev and had been an agronomist. Kataev had been exiled from St. Petersburg to the Yaroslavl province after his participation in the revolutionary movem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MathSciNet
MathSciNet is a searchable online bibliographic database created by the American Mathematical Society in 1996. It contains all of the contents of the journal ''Mathematical Reviews'' (MR) since 1940 along with an extensive author database, links to other MR entries, citations, full journal entries, and links to original articles. It contains almost 3.6 million items and over 2.3 million links to original articles. Along with its parent publication ''Mathematical Reviews'', MathSciNet has become an essential tool for researchers in the mathematical sciences. Access to the database is by subscription only and is not generally available to individual researchers who are not affiliated with a larger subscribing institution. For the first 40 years of its existence, traditional typesetting was used to produce the Mathematical Reviews journal. Starting in 1980 bibliographic information and the reviews themselves were produced in both print and electronic form. This formed the basis of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parallel Algorithm
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can do multiple operations in a given time. It has been a tradition of computer science to describe serial algorithms in abstract machine models, often the one known as random-access machine. Similarly, many computer science researchers have used a so-called parallel random-access machine (PRAM) as a parallel abstract machine (shared-memory). Many parallel algorithms are executed concurrently – though in general concurrent algorithms are a distinct concept – and thus these concepts are often conflated, with which aspect of an algorithm is parallel and which is concurrent not being clearly distinguished. Further, non-parallel, non-concurrent algorithms are often referred to as "sequential algorithms", by contrast with concurrent algorithms. Parallelizability Algorithms vary significantly in how parallelizable they are, ranging from easily parallelizable to completely ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prefix Sum
In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers is a second sequence of numbers , the sums of prefixes ( running totals) of the input sequence: : : : :... For instance, the prefix sums of the natural numbers are the triangular numbers: : Prefix sums are trivial to compute in sequential models of computation, by using the formula to compute each output value in sequence order. However, despite their ease of computation, prefix sums are a useful primitive in certain algorithms such as counting sort,. and they form the basis of the scan higher-order function in functional programming languages. Prefix sums have also been much studied in parallel algorithms, both as a test problem to be solved and as a useful primitive to be used as a subroutine in other parallel algorithms.. Abstractly, a prefix sum requires only a binary associative operator ⊕, making it useful for many applications from calculating well-separated pai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adder (electronics)
An adder, or summer, is a digital circuit that performs addition of numbers. In many computers and other kinds of microprocessor, processors adders are used in the arithmetic logic units (ALUs). They are also used in other parts of the processor, where they are used to calculate address space, addresses, database index, table indices, increment and decrement operators and similar operations. Although adders can be constructed for many number representations, such as binary-coded decimal or excess-3, the most common adders operate on binary numbers. In cases where two's complement or ones' complement is being used to represent negative numbers, it is trivial to modify an adder into an adder–subtractor. Other signed number representations require more logic around the basic adder. Binary adders Half adder The half adder adds two single binary digits ''A'' and ''B''. It has two outputs, sum (''S'') and carry (''C''). The carry signal represents an Integer overflow, overflow int ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doklady Akademii Nauk SSSR
The ''Proceedings of the USSR Academy of Sciences'' (russian: Доклады Академии Наук СССР, ''Doklady Akademii Nauk SSSR'' (''DAN SSSR''), french: Comptes Rendus de l'Académie des Sciences de l'URSS) was a Soviet journal that was dedicated to publishing original, academic research papers in physics, mathematics, chemistry, geology, and biology. It was first published in 1933 and ended in 1992 with volume 322, issue 3. Today, it is continued by ''Doklady Akademii Nauk'' (russian: Доклады Академии Наук), which began publication in 1992. The journal is also known as the ''Proceedings of the Russian Academy of Sciences (RAS)''. ''Doklady'' has had a complicated publication and translation history. A number of translation journals exist which publish selected articles from the original by subject section; these are listed below. History The Russian Academy of Sciences dates from 1724, with a continuous series of variously named publications dat ... [...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] |
1939 Births
This year also marks the start of the Second World War, the largest and deadliest conflict in human history. Events Below, the events of World War II have the "WWII" prefix. January * January 1 ** Third Reich *** Jews are forbidden to work with Germans. *** The Youth Protection Act was passed on April 30, 1938 and the Working Hours Regulations came into effect. *** The Jews name change decree has gone into effect. ** The rest of the world *** In Spain, it becomes a duty of all young women under 25 to complete compulsory work service for one year. *** First edition of the Vienna New Year's Concert. *** The company of technology and manufacturing scientific instruments Hewlett-Packard, was founded in a garage in Palo Alto, California, by William (Bill) Hewlett and David Packard. This garage is now considered the birthplace of Silicon Valley. *** Sydney, in Australia, records temperature of 45 ˚C, the highest record for the city. *** Philipp Etter took over as Swi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> 1939 Births")