|
Symposium On Discrete Algorithms
The Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) is an academic conference in the fields of algorithm design and discrete mathematics. It is considered to be one of the top conferences for research in algorithms. SODA has been organized annually since 1990, typically in January. SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory ( SIGACT) and the SIAM Activity Group on Discrete Mathematics, and in format is more similar to a theoretical computer science computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the ... conference than to a mathematics conference.. Distributed by Howard Karloff with thcall for papers for SODA 1998 History The first Symposium on Discrete Algorithms was held in 1990 at San Francisco, organized by David Johnson. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Academic Conference
An academic conference or scientific conference (also congress, symposium, workshop, or meeting) is an event for researchers (not necessarily academics) to present and discuss their scholarly work. Together with academic or scientific journals and Preprint archives such as arXiv, conferences provide an important channel for exchange of information between researchers. Further benefits of participating in academic conferences include learning effects in terms of presentation skills and “academic habitus”, receiving feedback from peers for one’s own research, the possibility to engage in informal communication with peers about work opportunities and collaborations, and getting an overview of current research in one or more disciplines. Overview Conferences usually encompass various presentations. They tend to be short and concise, with a time span of about 10 to 30 minutes; presentations are usually followed by a . The work may be bundled in written form as acad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clifford Stein
Clifford Seth Stein (born December 14, 1965), a computer scientist, is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science. Stein is chair of the Industrial Engineering and Operations Research Department at Columbia University. Prior to joining Columbia, Stein was a professor at Dartmouth College in New Hampshire. Stein's research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Stein has published many influential papers in the leading conferences and journals in his fields of research, and has occupied a variety of editorial positions including in the journals ''ACM Transactions on Algorithms'', ''Mathematical Programming'', ''Journal of Algorithms'', ''SIAM Journal on Discrete Mathematics'' and ''Operations Research ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Timothy M
Timothy is a masculine name. It comes from the Greek name ( Timόtheos) meaning "honouring God", "in God's honour", or "honoured by God". Timothy (and its variations) is a common name in several countries. People Given name * Timothy (given name), including a list of people with the name * Tim (given name) * Timmy * Timo * Timotheus * Timothée Surname * Christopher Timothy (born 1940), Welsh actor. * Miriam Timothy (1879–1950), British harpist. * Nick Timothy (born 1980), British political adviser. Mononym * Saint Timothy, a companion and co-worker of Paul the Apostle * Timothy I (Nestorian patriarch) Education * Timothy Christian School (Illinois), a school system in Elmhurst, Illinois * Timothy Christian School (New Jersey), a school in Piscataway, New Jersey Arts and entertainment * "Timothy" (song), a 1970 song by The Buoys * '' Timothy Goes to School'', a Canadian-Chinese children's animated series * ''Timothy'' (TV film), a 2014 Australian television c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Daniel Král
Daniel is a masculine given name and a surname of Hebrew origin. It means "God is my judge"Hanks, Hardcastle and Hodges, ''Oxford Dictionary of First Names'', Oxford University Press, 2nd edition, , p. 68. (cf. Gabriel—"God is my strength"), and derives from two early biblical figures, primary among them Daniel from the Book of Daniel. It is a common given name for males, and is also used as a surname. It is also the basis for various derived given names and surnames. Background The name evolved into over 100 different spellings in countries around the world. Nicknames ( Dan, Danny) are common in both English and Hebrew; "Dan" may also be a complete given name rather than a nickname. The name "Daniil" (Даниил) is common in Russia. Feminine versions (Danielle, Danièle, Daniela, Daniella, Dani, Danitza) are prevalent as well. It has been particularly well-used in Ireland. The Dutch names "Daan" and "Daniël" are also variations of Daniel. A related surname deve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pavol Hell
Pavol Hell is a Canadian mathematician and computer scientist, born in Czechoslovakia. He is a professor of computing science at Simon Fraser University. Hell started his mathematical studies at Charles University in Prague, and moved to Canada in August 1968 after the Warsaw Pact invasion of Czechoslovakia. He obtained his MSc from McMaster University in Hamilton, under the joint supervision of Gert Sabidussi and Alex Rosa, and his PhD at the Universite de Montreal, with Gert Sabidussi. In his PhD research he pioneered, on the suggestion of Gert Sabidussi, the study of graph retracts. He describes his area of interest as "computational combinatorics", including algorithmic graph theory and complexity of graph problems. His current focus is on nicely structured graph classes, and on the complexity of various versions of graph homomorphism problems. Hell has written the book ''Graph and Homomorphisms'' with his long-term collaborator Jaroslav Nešetřil, and many highly cited pa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Piotr Indyk
Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Academic biography Indyk received the Magister (MA) degree from the University of Warsaw in 1995 and a PhD in computer science from Stanford University in 2000 under the supervision of Rajeev Motwani. In 2000, Indyk joined MIT where he currently holds the title of Thomas D. and Virginia W. Cabot Professor in the Department of Electrical Engineering and Computer Science. Research Indyk's research focuses primarily on computational geometry in high-dimensions, streaming algorithms, and computational learning theory. He has made a range of contributions to these fields, particularly in the study of low-distortion embeddings, algorithmic coding theory, and geometric and combinatorial pattern matching. He has also made contributions to the theory of compressed sensing. His work on algor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cliff Stein
Clifford Seth Stein (born December 14, 1965), a computer scientist, is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science. Stein is chair of the Industrial Engineering and Operations Research Department at Columbia University. Prior to joining Columbia, Stein was a professor at Dartmouth College in New Hampshire. Stein's research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Stein has published many influential papers in the leading conferences and journals in his fields of research, and has occupied a variety of editorial positions including in the journals ''ACM Transactions on Algorithms'', ''Mathematical Programming'', ''Journal of Algorithms'', ''SIAM Journal on Discrete Mathematics'' and ''Operations Resea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Angelika Steger
Angelika Steger (born 1962) is a mathematician and computer scientist whose research interests include graph theory, randomized algorithms, and approximation algorithms. She is a professor at ETH Zurich.Faculty profile ETHZ, retrieved 2016-07-03. Education and career After earlier studies at the and , Steger earned a master's degree from Stony Brook University in 1985.[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sanjeev Khanna
Sanjeev Khanna is an Indian-American computer scientist. He is currently a Henry Salvatori professor of Computer and Information Science at the University of Pennsylvania. His research interests include approximation algorithms, hardness of approximation, combinatorial optimization, and sublinear algorithms. Career Khanna received his undergraduate degrees in computer science and economics from Birla Institute of Technology and Science, Pilani, India in 1990, his M.S. degree in computer science from University of Illinois at Urbana-Champaign in 1992, and his doctoral degree in computer science from Stanford University, California, US in 1996. He joined University of Pennsylvania in 1999 after spending three years as a member of the Mathematical Sciences Research center at Bell Laboratories. Research contribution and awards Khanna's primary research contributions are to the fields of approximation algorithms, hardness of approximation, combinatorial optimization, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prasad Tetali
Prasad V. Tetali is an Indian-American mathematician and computer scientist who works as a professor at the Georgia Institute of Technology, with a joint appointment in mathematics and the College of Computing.Curriculum vitae retrieved 2015-01-14. His research concerns , discrete mathematics, and approximation algorithms. Tetali was born in |
Mike Molloy
Michael Molloy (born 22 December 1940) is a British author and former newspaper editor and cartoonist. Biography Born in Hertfordshire, Molloy studied at Ealing Junior School and the Ealing School of Art before working at the ''Sunday Pictorial'' followed by the ''Daily Sketch'', where he began drawing cartoons. In 1962, he joined the ''Daily Mirror'', where he rose through the ranks until in 1975 he became editor. In 1985, Robert Maxwell appointed Molloy Editor-in-Chief of the ''Daily Mirror'', ''Sunday Mirror'' and ''The People'', where he introduced colour printing. From 1986 to 1988, he additionally edited the ''Sunday Mirror''. From 1985 to 1995, Molloy wrote seven crime fiction books set in England, four featuring Sarah Keane and three featuring Lewis Home. In 1990, Molloy left the Mirror Group, and in 1996 he bought ''Punch'' on behalf of Mohammed Al Fayed. He became its deputy editor, but left after six issues. After retiring from the newspaper industry, he began wr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dana Randall
Dana Randall is an American computer scientist. She works as the ADVANCE Professor of Computing, and adjunct professor of mathematics at the Georgia Institute of Technology. She is also an External Professor of the Santa Fe Institute. Previously she was executive director of the Georgia Tech Institute of Data Engineering and Science (IDEaS) that she co-founded, and director of the Algorithms and Randomness Center. Her research include combinatorics, computational aspects of statistical mechanics, Monte Carlo stimulation of Markov chains, and randomized algorithms. Education Randall was born in Queens, New York. She graduated from New York City's Stuyvesant High School in 1984. She received her A.B. in Mathematics from Harvard University in 1988 and her Ph.D. in Computer Science from the University of California, Berkeley in 1994 under the supervision of Alistair Sinclair. Her sister is theoretical physicist Lisa Randall. Research Her primary research interest is analyzing al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
