Theory of Computing Content
https://cs.ucdavis.edu/
Theory of Computing Content for Computer ScienceenLuis Rademacher
https://cs.ucdavis.edu/directory/luis-rademacher
<h5>Theoretical computer science, data science, matrix computations, machine learning, convex geometry</h5>
<p> </p>
February 28, 2020 - 12:34pmEric Bloschhttps://cs.ucdavis.edu/directory/luis-rademacherJesus De Loera
https://cs.ucdavis.edu/directory/jesus-de-loera
<p>Professor Jesus A. De Loera works in discrete mathematics. He is particularly interested in applications of discrete <a href="http://en.wikipedia.org/wiki/Computational_geometry">computational geometry</a>, in topics such as algorithms, optimization, data science, statistics, and operation research. But he has also studied the combinatorial and topological structures arising from combinatorial and algebraic questions too.</p>February 21, 2020 - 1:05pmJoseph Menkehttps://cs.ucdavis.edu/directory/jesus-de-loeraJames P. Crutchfield
https://cs.ucdavis.edu/directory/james-crutchfield
<h4>Research Interests:</h4>
<p>Nonlinear dynamics, condensed matter physics, physics of computation, evolutionary dynamics, pattern discovery, dynamics of learning, and distributed robotics.</p>February 21, 2020 - 1:02pmJoseph Menkehttps://cs.ucdavis.edu/directory/james-crutchfieldGreg Kuperberg
https://cs.ucdavis.edu/directory/greg-kuperberg
<h5>Quantum computing, complexity theory, discrete mathematics</h5>
<p>Kuperberg is interested in finding new quantum algorithms or complexity barriers for candidate problems for quantum and classical algorithms, as well as geometric properties of quantum error correcting codes and quantum entanglement problems. My work has had applications to post-quantum cryptography, which is the effort to find and designate new standards of public key encryption that are resistant to quantum attacks.</p>
February 11, 2020 - 8:05amAnonymoushttps://cs.ucdavis.edu/directory/greg-kuperbergDan Gusfield
https://cs.ucdavis.edu/directory/dan-gusfield
<p>Dr. Gusfield's primary interests involve the efficiency of algorithms, particularly for problems in combinatorial optimization and graph theory. These algorithms have been applied to study data security, stable matching, network flow, matroid optimization, string/pattern matching problems, molecular sequence analysis and optimization problems in population-scale genomics. Currently, he am focused on string and combinatorial problems that arise in computational biology and bioinformatics. Dr.</p>February 05, 2020 - 10:42amAnonymoushttps://cs.ucdavis.edu/directory/dan-gusfieldDavid Doty
https://cs.ucdavis.edu/directory/david-doty
<h5>Molecular computing, DNA nanotechnology, distributed computing</h5>
<p>Doty is interested in DNA nanotechnology and molecular self-assembly. The Doty group focuses on theoretical models that elucidate the fundamental logical and physical limits to computation by such molecular systems. These efforts inform the design of nanoscale devices that compute, self-assemble and otherwise autonomously control themselves, with long-term application goals such as detection of extremely small concentrations of analytes, smart drug delivery and nanoscale transport robots.</p>
February 05, 2020 - 8:51amAnonymoushttps://cs.ucdavis.edu/directory/david-doty