📄 http:^^intrepid.mcs.kent.edu^~sitharam^
字号:
Date: Thu, 21 Nov 1996 19:10:14 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Fri, 15 Nov 1996 23:27:58 GMTContent-length: 7535<HEAD><TITLE>Meera Sitharam</TITLE></HEAD><BODY><P> <!WA0><A NAME=97 HREF=http://www.mcs.kent.edu/mcsinfo/csbrochure/ruttan.html><!WA1><IMG SRC="http://www.mcs.kent.edu/figs/previous_motif_yb.gif"></A> <!WA2><A NAME=99 HREF=http://www.mcs.kent.edu/mcsinfo/csbrochure/faclist.html> <!WA3><IMG SRC="http://www.mcs.kent.edu/figs/up_motif_yb.gif"></A> <!WA4><A NAME=95 HREF=http://nimitz.mcs.kent.edu/~pwang/index.html><!WA5><IMG SRC="http://www.mcs.kent.edu/figs/next_motif_yb.gif"></A> <!WA6><A NAME=1 HREF="http://www.mcs.kent.edu/mcsinfo/csbrochure/contents.html"><!WA7><IMG SRC="http://www.mcs.kent.edu/figs/contents_motif_yb.gif"></a><br><b>Previous:</b><!WA8><A NAME=98 HREF=http://www.mcs.kent.edu/mcsinfo/csbrochure/ruttan.html>Arden Ruttan</A> <b>Up:</b> <!WA9><A NAME=100 HREF=http://www.mcs.kent.edu/mcsinfo/csbrochure/faclist.html>Computer Science Faculty</A> <b>Next:</b> <!WA10><A NAME=96 HREF=http://nimitz.mcs.kent.edu/~pwang/index.html>Paul S. Wang</A> <P> <hr><H2>Meera Sitharam</H2>Associate Professor<!WA11><img src="http://www.mcs.kent.edu/mcsinfo/csbrochure/gifs/sitharam1.gif"><P><b> Email:</b> sitharam@mcs.kent.edu<P><P>Dr. Sitharam received a B. Tech. from the Indian Institute ofTechnology, Madras, India, in 1984 and a Ph.D. in Computer Science in1990 from the University of Wisconsin, Madison, in 1990. She joinedthe faculty of the Department of Mathematics and Computer Science atKent State University in 1990, and served as a Humboldt Fellowat the University of Bonn in 1990-1991. <P><DT><b>Research interests</b><P>Complexity in any guise: Computational (Boolean and Algebraic), Learning, Descriptive (using Logicand Finite Structures), Kolmogorov (Information Theoretic), Communication; <br>Approximation Theory, Splines, and related algorithms;<br>Discrete algorithms-Theory and Implementation;<br>Discrete and Algorithmic modelling of real-world situations.<P><DL><P><DD> <P><DL><P> </DL><P><DT>Professional Experience<DD> <DL><P><DT><DD> Kent StateUniversity, 1990--present ( associate professor from 1996),<DT><DD> Humboldt Fellow, University of Bonn, 1990-1991.<P> </DL><P><DT> <b> Selected Publications </b>on Representative topics<DD> <P> <OL><P><LI> <!WA12><A HREF = http://www.cs.purdue.edu/people/jorg>J. Peters</A>, M. Sitharam, ``Stability of <!WA13><IMG ALIGN=TOP ALT="" SRC="http://intrepid.mcs.kent.edu/~sitharam/tex2html_wrap51.1.xbm"> cubics at the vertices ofan underlying triangulation,'' SIAM J. Numerical analysis, Vol. 29,No. 2, pp. 528-533, 1992<P><LI>A. Cavaretta, M. Sitharam, ``Variational properties of tensor productBernstein Bezi er operators,'' Journal of Approximation theory, Vol.72, No. 1, pp. 34-39, 1993<P><LI>J. Peters, M. Sitharam, ``Interpolation from <!WA14><IMG ALIGN=TOP ALT="" SRC="http://intrepid.mcs.kent.edu/~sitharam/tex2html_wrap51.1.xbm">cubics at thevertices of an underlying triangulation,''SIAM conference on Discrete Mathematics, Atlanta, June 1990.<P><LI> D. Joseph, M. Sitharam, ``Kolmogorov complexity, restrictednondeterminism and generalized spectra,'' Symposium on the TheoreticalAspects of CS, Lecture Notes in CS 415, Rouen, France, C. Choffrut andT. Lengauer, eds. pp. 152-164, Feb. 1990<P><LI> M. Sitharam, ``Generalized bounded query hierarchies,'' Ph.D thesis,University of Wisconsin Tech. report, 1990.<P><LI>M. Sitharam, ``Pseudorandom generators and learning algorithms for<i> AC</i><!WA15><IMG ALIGN=TOP ALT="" SRC="http://intrepid.mcs.kent.edu/~sitharam/tex2html_wrap57.1.xbm">,'' Proceedings of ACM symposium on Theory of Computing,May 1994, pp. 478-488, to appear in Computational Complexity Journal<P><LI>M.Sitharam, ``Evaluating spectral norms for functions computed byconstant depth circuit with symmetric gates'' Computational Complexity Journal, vol. 5, 167-189, 1995.<P> </DL><P><DT>Recently completed work. <DD> <OL><P><LI>Per Enflo, M. Sitharam, ``Stable bases and complexity lower bounds.''<!WA16><A HREF= http://intrepid.mcs.kent.edu/~sitharam/~sitharam/stablebasis.ps> Preprint </A> ECCC report.<P><LI>M. Sitharam, ``Approximation from linear spaces and applications to complexity,''<!WA17><A HREF= http://intrepid.mcs.kent.edu/~sitharam/~sitharam/linapprox.ps> Preprint </A> ECCC report.<P> </DL><P><DT>Ongoing projects.<DD> <DL><P><LI>Partly with Per Enflo ``Lower bounds for weighted thresholds of various bases.''<P><LI>Partly with <!WA18><A HREF= http://nimitz.mcs.kent.edu/~banderso>Bruce Anderson </A>, ``Special classes of problems in the existential and universal theory of the reals: complexity issues, applications and practical algorithms.''<P><LI>With Tim Straney,``Derandomizing learning and other algorithms based on approximationfrom linear spaces.''<P><LI>With Andrew Lomonosov,``Combinatorial problems in geometric constraint solving,''<P><DT> Undergraduate research projects in progress.<DD> <P><LI>with Luke Hannah (NSF REU):``Purely combinatorial switching lemmas''<P><LI>with Dawn Hines ( <!WA19><A HREF = http://www.cs.wisc.edu/~condon/mentor.html> NSF/CRA Mentor project </A>):``Algebraic aspects of distance constraint problems''<P><LI>with Karen Mcevoy (NSF REU):``A graphics tool for visualizing algebraic and geometric manipulationof bi-variate polynomials''<P><LI>with <!WA20><A HREF =http://hws3.hws.edu:9000/~robitail/www/index.html>Lynn Robitaille </A>(NSF/CRA Mentor project):``Lengths of curves, relation to fractal dimension, and subdivisionmethods for generation''<!WA21><A HREF = http://intrepid.mcs.kent.edu/~sitharam/~sitharam/fractals.ps>Preprint</A><P></OL><P><DT>Grants, and Awards<DD> <P><P><DL><DT><DD> NSF Research Initiation Award for 3 years starting September 1994<DT><DD> Research and Creativity summer grant for summer 1993awarded by Kent State University<DT><DD> Humboldt Fellowship, 1990-1991awarded by the Alexander von Humboldt Foundation, W. Germany<DT><P> </DL><P><DT>Courses Taught<DD> <P> <DL><DT><DD> Automata and formal languages<DT><DD> Complexity theory<DT><DD> Theory of Computation<DT><DD> Discrete Mathematics<DT><DD> Algorithms (Intro and Advanced)<DT><DD> Data Structures<DT><DD> Computational Geometry<P> </DL><P></OL><P> </DL><P> </DL><H1> Research Resources </H1><DL><DD><!WA22><a href="http://glimpse.cs.arizona.edu:1994/bib/"><I>CS Bibliography Search</I></a><DD><!WA23><a href="http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/GI//Ankuendigungen.html#2"><I>Call For Papers and Deadlines for Conferences</I></a><DD><!WA24><a href="telnet://database.carl.org/"><I>Journal Article Search.</I></a><DD><!WA25><a href="gopher://peg.cwis.uci.edu:7000/11/gopher.welcome/peg/LIBRARIES/five"><I>Journal Article Search + Help.</I></a><DD><!WA26><a href="http://www.iao.fhg.de/Library/conferences/"><I>Theory virtual library of conferences</I></a><DD><!WA27><a href="http://www.ams.org/mathscinet/"><I>Math reviews</I></a><DD><!WA28><a href="http://www.informatik.uni-trier.de/~bern/GI/"><I>Complexity info</I></a><DD><!WA29><a href=" http://www.eccc.uni-trier.de/eccc/"><I>ECCC</I></a><DD><!WA30><a href=" http://glimpse.cs.arizona.edu:1994/bib/"><I>Glimpse</I></a></DL></DL><p><H1> Courses (Fall 96)</H1><p><!WA31><A HREF = http://nimitz.mcs.kent.edu/~sitharam/data.html>Data Structures</A><p><!WA32><A HREF = http://nimitz.mcs.kent.edu/~sitharam/algo.html>Advanced Algorithms</A> <hr><!WA33><A HREF="http://www.mcs.kent.edu/cshome.html"><!WA34><IMG align=middle SRC="http://intrepid.mcs.kent.edu/figs/cshome-icon.gif"></A><!WA35><A HREF="http://www.mcs.kent.edu/index.html"><!WA36><IMG align=middle SRC="http://intrepid.mcs.kent.edu/figs/mcshome-icon.gif"></A><!WA37><A HREF="http://www.kent.edu/"><!WA38><IMG align=middle SRC="http://intrepid.mcs.kent.edu/figs/home-icon.gif"></A><!WA39><A HREF="http://www.kent.edu/Kent/homepage.html"><!WA40><IMG align=middle SRC="http://intrepid.mcs.kent.edu/figs/cwis-icon.gif"></A><hr></BODY><P><ADDRESS><I>sitharam@mcs.kent.edu</I></ADDRESS>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -