|
David Steurer
David Steurer is a German theoretical computer scientist, working in approximation algorithms, hardness of approximation, sum of squares, and high-dimensional statistics. He is an associate professor of computer science at ETH Zurich. Biography David Steurer studied for a bachelor's degree at the University of Saarland (2003–2006), and went on to study at Princeton University, where he obtained his PhD under the supervision of Sanjeev Arora at 2010. He then spend two years as a postdoc at Microsoft Research New England, before joining Cornell University. In 2017 he moved to ETH Zurich, where he became an associate professor in 2020. Work Steurer's work focuses on optimization using the sum of squares technique, giving an invited talk on the topic at the 2018 ICM, together with Prasad Raghavendra. Together with Prasad Raghavendra, he developed the small set expansion hypothesis, for which they won the Michael and Shiela Held Prize. Together with James Lee and Prasad Rag ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heilbronn
Heilbronn () is a List of cities and towns in Germany, city in northern Baden-Württemberg, Germany, surrounded by Heilbronn (district), Heilbronn District. With over 126,000 residents, it is the sixth-largest city in the state. From the late Middle Ages, it developed into an important trading centre. At the beginning of the 19th century, Heilbronn became one of the centres of early industrialisation in Württemberg. Heilbronn's old town was completely destroyed during the air raid of 4 December 1944 and rebuilt in the 1950s. Today Heilbronn is the economic centre of the Heilbronn-Franconia, Heilbronn-Franken region. Heilbronn is known for its wine industry and is nicknamed ''Käthchenstadt'', after Heinrich von Kleist's ''Das Käthchen von Heilbronn''. Geography Heilbronn is located in the northern corner of the Neckar Sedimentary basin, basin at the bottom of the Wartberg (Heilbronn), Wartberg (308 m). It occupies both banks of the Neckar, and the highest spot inside city limit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Congress Of Mathematicians
The International Congress of Mathematicians (ICM) is the largest conference for the topic of mathematics. It meets once every four years, hosted by the International Mathematical Union (IMU). The Fields Medals, the Nevanlinna Prize (to be renamed as the IMU Abacus Medal), the Carl Friedrich Gauss Prize, Gauss Prize, and the Chern Medal are awarded during the congress's opening ceremony. Each congress is memorialized by a printed set of Proceedings recording academic papers based on invited talks intended to be relevant to current topics of general interest. Being List of International Congresses of Mathematicians Plenary and Invited Speakers, invited to talk at the ICM has been called "the equivalent ... of an induction to a hall of fame". History Felix Klein and Georg Cantor are credited with putting forward the idea of an international congress of mathematicians in the 1890s.A. John Coleman"Mathematics without borders": a book review ''CMS Notes'', vol 31, no. 3, April 1999 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of California, Berkeley Faculty
A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, the designation is reserved for colleges that have a graduate school. The word ''university'' is derived from the Latin ''universitas magistrorum et scholarium'', which roughly means "community of teachers and scholars". The first universities were created in Europe by Catholic Church monks. The University of Bologna (''Università di Bologna''), founded in 1088, is the first university in the sense of: *Being a high degree-awarding institute. *Having independence from the ecclesiastic schools, although conducted by both clergy and non-clergy. *Using the word ''universitas'' (which was coined at its foundation). *Issuing secular and non-secular degrees: grammar, rhetoric, logic, theology, canon law, notarial law.Hunt Janin: "The university i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
21st-century American Mathematicians
The 1st century was the century spanning AD 1 ( I) through AD 100 ( C) according to the Julian calendar. It is often written as the or to distinguish it from the 1st century BC (or BCE) which preceded it. The 1st century is considered part of the Classical era, epoch, or historical period. The 1st century also saw the appearance of Christianity. During this period, Europe, North Africa and the Near East fell under increasing domination by the Roman Empire, which continued expanding, most notably conquering Britain under the emperor Claudius ( AD 43). The reforms introduced by Augustus during his long reign stabilized the empire after the turmoil of the previous century's civil wars. Later in the century the Julio-Claudian dynasty, which had been founded by Augustus, came to an end with the suicide of Nero in AD 68. There followed the famous Year of Four Emperors, a brief period of civil war and instability, which was finally brought to an end by Vespasian, ninth Roman empero ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Washington Alumni
A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, the designation is reserved for colleges that have a graduate school. The word ''university'' is derived from the Latin ''universitas magistrorum et scholarium'', which roughly means "community of teachers and scholars". The first universities were created in Europe by Catholic Church monks. The University of Bologna (''Università di Bologna''), founded in 1088, is the first university in the sense of: *Being a high degree-awarding institute. *Having independence from the ecclesiastic schools, although conducted by both clergy and non-clergy. *Using the word ''universitas'' (which was coined at its foundation). *Issuing secular and non-secular degrees: grammar, rhetoric, logic, theology, canon law, notarial law.Hunt Janin: "The university i ... [...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] |
Indian Mathematicians
chronology of Indian mathematicians spans from the Indus Valley civilisation and the Vedas to Modern India. Indian mathematicians have made a number of contributions to mathematics that have significantly influenced scientists and mathematicians in the modern era. Hindu-Arabic numerals predominantly used today and likely into the future. Ancient * Baudhayana sutras (fl. c. 900 BCE) *Yajnavalkya (700 BCE) *Manava (fl. 750–650 BCE) *Apastamba Dharmasutra (c. 600 BCE) *''Pāṇini'' (c. 520–460 BCE) * Kātyāyana (fl. c. 300 BCE) * Akspada Gautama(c. 600 BCE–200 CE) * Bharata Muni (200 BCE-200 CE) *Pingala (c. 3rd/2nd century BCE) Classical Post-Vedic Sanskrit to Pala period mathematicians (2nd century BCE to 11th century CE) Medieval Period (1200–1800) Kerala School of Mathematics and Astronomy * Madhava of Sangamagrama * Parameshvara (1360–1455), discovered drk-ganita, a mode of astronomy based on observations * Nilakantha Somayaji (1444–1545), mathematician a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Indian Computer Scientists
Indian or Indians may refer to: Peoples South Asia * Indian people, people of Indian nationality, or people who have an Indian ancestor ** Non-resident Indian, a citizen of India who has temporarily emigrated to another country * South Asian ethnic groups, referring to people of the Indian subcontinent, as well as the greater South Asia region prior to the 1947 partition of India * Anglo-Indians, people with mixed Indian and British ancestry, or people of British descent born or living in the Indian subcontinent * East Indians, a Christian community in India Europe * British Indians, British people of Indian origin The Americas * Indo-Canadians, Canadian people of Indian origin * Indian Americans, American people of Indian origin * Indigenous peoples of the Americas, the pre-Columbian inhabitants of the Americas and their descendants ** Plains Indians, the common name for the Native Americans who lived on the Great Plains of North America ** Native Americans in the U ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irit Dinur
Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is professor of computer science at the Weizmann Institute of Science. Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation. Biography Irit Dinur earned her doctorate in 2002 from the school of computer science in Tel Aviv University, advised by Shmuel Safra; her thesis was entitled ''On the Hardness of Approximating the Minimum Vertex Cover and The Closest Vector in a Lattice''. She joined the Weizmann Institute after visiting the Institute for Advanced Study in Princeton, New Jersey, NEC, and the University of California, Berkeley. Dinur published in 2006 a new proof of the PCP theorem that was significantly simpler than previous proofs of the same result. Awards and recognition In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv. She was a plenary speaker at t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semidefinite Programming
Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize) over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron. Semidefinite programming is a relatively new field of optimization which is of growing interest for several reasons. Many practical problems in operations research and combinatorial optimization can be modeled or approximated as semidefinite programming problems. In automatic control theory, SDPs are used in the context of linear matrix inequalities. SDPs are in fact a special case of cone programming and can be efficiently solved by interior point methods. All linear programs and (convex) quadratic programs can be expressed as SDPs, and via hierarchies of SDPs the solutions of polynomial optimization problems can be approximated. Semidefinite programming has been use ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Small Set Expansion Hypothesis
The small set expansion hypothesis or small set expansion conjecture in computational complexity theory is an unproven computational hardness assumption. Under the small set expansion hypothesis it is assumed to be computationally infeasible to distinguish between a certain class of expander graphs called "small set expanders" and other graphs that are very far from being small set expanders. This assumption implies the hardness of several other computational problems, and the optimality of certain known approximation algorithms. The small set expansion hypothesis is related to the unique games conjecture, another unproven computational hardness assumption according to which accurately approximating the value of certain games is computationally infeasible. If the small set expansion hypothesis is true, then so is the unique games conjecture. Background The ''edge expansion'' of a set X of vertices in a graph G is defined as \frac, where the vertical bars denote the number of el ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
_-_09.JPG "Click for more on -> University Of California, Berkeley Faculty")
