Steven Skiena

Last updated
Steven Sol Skiena
Steven Skiena.jpg
Born (1961-01-30) January 30, 1961 (age 63)
NationalityAmerican
Alma mater University of Illinois at Urbana-Champaign
Scientific career
Fields Computer science
Institutions Stony Brook University (1988–present)
Doctoral advisor Herbert Edelsbrunner

Steven Sol Skiena (born January 30, 1961) is a Computer Scientist and Distinguished Teaching Professor of Computer Science at Stony Brook University. [1] He is also Director of AI Institute at Stony Brook.

Contents

He was co-founder of General Sentiment, a social media and news analytics company, and served as Chief Science Officer from 2009 until it shut down in 2015. [2] His research interests include algorithm design and its applications to biology. Skiena is the author of several popular books in the fields of algorithms, programming, and mathematics. The Algorithm Design Manual is widely used as an undergraduate text in algorithms and within the tech industry for job interview preparation. [3] In 2001, Skiena was awarded the IEEE Computer Science and Engineering Undergraduate Teaching Award "for outstanding contributions to undergraduate education in the areas of algorithms and discrete mathematics and for influential textbook and software." [4]

Skiena has worked on algorithmic problems in synthetic biology, and, in particular, issues of optimal gene design for a given protein under various constraints. In collaboration with virologist Eckard Wimmer, he has worked to computationally design synthetic viruses for use as attenuated vaccines. [5] Their Synthetic Attenuated Virus Engineering (SAVE) approach has been validated in flu [6] and experiments with other viruses are ongoing. A popular account of this work appears in Dennis Shasha and Cathy Lazare's Natural Computing. [7]

Skiena played a role in the conception of the Apple iPad. In 1988, Skiena and his team won a competition run by Apple to design the Computer of the Year 2000. [8] Their design, a tablet featuring a touch screen, GPS, and wireless communications was similar in many regards to the iPad as released by Apple in 2010. [9]

Bibliography

Related Research Articles

<span class="mw-page-title-main">Computer science</span> Study of computation

Computer science is the study of computation, information, and automation. Computer science spans theoretical disciplines to applied disciplines.

<span class="mw-page-title-main">Edsger W. Dijkstra</span> Dutch computer scientist (1930–2002)

Edsger Wybe Dijkstra was a Dutch computer scientist, programmer, software engineer, and science essayist.

Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation, such as the theory of computation, formal language theory, the lambda calculus and type theory.

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.

<span class="mw-page-title-main">Alexander Razborov</span> Russian mathematician

Aleksandr Aleksandrovich Razborov, sometimes known as Sasha Razborov, is a Soviet and Russian mathematician and computational theorist. He is Andrew McLeish Distinguished Service Professor at the University of Chicago.

ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.

In computational complexity, problems that are in the complexity class NP but are neither in the class P nor NP-complete are called NP-intermediate, and the class of such problems is called NPI. Ladner's theorem, shown in 1975 by Richard E. Ladner, is a result asserting that, if P ≠ NP, then NPI is not empty; that is, NP contains problems that are neither in P nor NP-complete. Since it is also true that if NPI problems exist, then P ≠ NP, it follows that P = NP if and only if NPI is empty.

<span class="mw-page-title-main">Ravindran Kannan</span>

Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.

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.

<span class="mw-page-title-main">Georg Gottlob</span> Austrian computer scientist

Georg Gottlob FRS is an Austrian-Italian computer scientist who works in the areas of database theory, logic, and artificial intelligence and is Professor of Informatics at the University of Calabria. He was Professor at the University of Oxford.

<span class="mw-page-title-main">Computing education</span> Pedagogy of computer science

Computer science education or computing education is the field of teaching and learning the discipline of computer science, and computational thinking. The field of computer science education encompasses a wide range of topics, from basic programming skills to advanced algorithm design and data analysis. It is a rapidly growing field that is essential to preparing students for careers in the technology industry and other fields that require computational skills.

<span class="mw-page-title-main">Joseph S. B. Mitchell</span> American computer scientist and mathematician

Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.

<span class="mw-page-title-main">Noam Nisan</span> Israeli computer scientist

Noam Nisan is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.

<span class="mw-page-title-main">Tal Rabin</span> American cryptographer (born 1962)

Tal Rabin is a computer scientist and Professor of Computer and Information Science at the University of Pennsylvania. She was previously the head of research at the Algorand Foundation and the head of the cryptography research group at IBM's Thomas J. Watson Research Center.

<span class="mw-page-title-main">Amit Sahai</span> American cryptographer (born 1974)

Amit Sahai is an Indian-American computer scientist. He is a professor of computer science at UCLA and the director of the Center for Encrypted Functionalities.

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 conference than to a mathematics conference.

<span class="mw-page-title-main">Tamal Dey</span> Indian mathematician and computer scientist (born 1964)

Tamal Krishna Dey is an Indian mathematician and computer scientist specializing in computational geometry and computational topology. He is a professor at Purdue University.

In mathematics and computer science, an algorithmic technique is a general approach for implementing a process or computation.

<span class="mw-page-title-main">Alan Selman</span> American complexity theorist (1941–2021)

Alan Louis Selman was a mathematician and theoretical computer scientist known for his research on structural complexity theory, the study of computational complexity in terms of the relation between complexity classes rather than individual algorithmic problems.

Ryan O'Donnell is a Canadian theoretical computer scientist and a professor at Carnegie Mellon University. He is known for his work on the analysis of Boolean functions and for authoring the textbook on this subject. He is also known for his work on computational learning theory, hardness of approximation, property testing, quantum computation and quantum information.

References

  1. ↑ Distinguished Teaching Professor Award: Steven Skiena Archived 2017-10-04 at the Wayback Machine , Stony Brook CS, accessed 2017-10-03.
  2. ↑ General Sentiment personnel page Archived 2012-06-11 at the Wayback Machine .
  3. ↑ Steve Yegge's blog
  4. ↑ Steven Skiena: 2001 Computer Science and Engineering Undergraduate Teaching Award, IEEE Computer Society, accessed 2017-10-03.
  5. ↑ Coleman; et al. (2008). "Virus attenuation by genome-scale changes in codon pair bias". Science. 320 (5884): 1784–7. Bibcode:2008Sci...320.1784C. doi:10.1126/science.1155761. PMC   2754401 . PMID   18583614.
  6. ↑ Mueller; et al. (2010). "Live attenuated influenza virus vaccines by computer-aided rational design". Nature Biotechnology. 28 (7): 723–6. doi:10.1038/nbt.1636. PMC   2902615 . PMID   20543832.
  7. ↑ Natural Computing; Dennis Shasha and Cathy Lazare, W. W. Norton & Company, 2010.
  8. ↑ Bartlett W. Mel; Stephen M. Omohundro; Arch D. Robison; Steven S. Skiena; Kurt H. Thearling; Luke T. Young; Stephen Wolfram (June 1988). "Tablet: Personal Computer in the Year 2000" (PDF). Communications of the ACM . 31 (6): 638–648. doi:10.1145/62959.62960. hdl: 2142/74389 . S2CID   18112498.
  9. ↑ James Barron (Jan 28, 2010). "Apple's New Device Looks Like a Winner. From 1988" . New York Times.
  10. ↑ Reviews of Where Historical Figures Really Rank: Ernest Davis (2014), SIAM News ; Nicholas Mattei (2014), ACM SIGACT News 45 (2): 40–42, doi : 10.1145/2636805.2636817.
  11. ↑ Review of The Algorithm Design Manual: Neelakantan Kartha (2011), ACM SIGACT News 42 (4): 29–31, doi : 10.1145/2078162.2078169.
  12. ↑ Review of Programming Challenges: A. M. Tenenbaum (2003), ACM Computing Reviews .
  13. ↑ Reviews of Calculated Bets: Michael Ward (2002), Math. Gaz. 86 (507): 565–566, doi : 10.2307/3621199; James H. Albert (2002), American Statistician 56 (4): 329–330, doi : 10.1198/tas.2002.s252, JSTOR   3087358; Steven Byrnes (2007), Math. Horizons 14 (3): 28, JSTOR   25678674.
  14. ↑ Review of Computational Discrete Mathematics: Martha Patricia Niño Mojica (2005), Leonardo .
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.