NEW
This page is no longer being maintained (Feb 2004).
My active page is here.
This page serves as a reference to the past and present members of the
Symbolic Solutions Group research team. Following the
links of current and past members will reveal a small description detailing
each of the members research interests and a link to their respective
home pages if one exists.
John Abbott
John received his PhD on the factorization of polynomials (from Bath,
England) in 1989. He visited Rensselaer Polytechnic Institute from
1987 to 1989 as a visiting assistant professor,
and maintains links with the SSG. His interests include
modular algorithms, solution of polynomial systems, and symbolic
integration.
Peter has an A.B. from Washington University in St. Louis (1991)
and an A.M. from Brown University (1996), both in mathematics.
He is working toward a PhD at North Carolina State University
with Michael Singer as advisor. He is interested in computations
related to differential Galois theory and algebraic groups.
Angel received his B.S. degree in Computer in 1991
and his M.S. degree in Computer Science in 1993,
and his Ph.D. degree in Computer Science in 1997, all from Rensselaer
Polytechnic Institute.
His M.S. and Ph.D. adviser is Erich Kaltofen.
His special fields of interest include parallel methods in symbolic
computation. He has developed
FoxBox a
parallel system for manipulating multivariate polynomials and rational
functions in black box representation (Factorization, GCD, Numerator and
Denominator Seperation, Sparse Interpolation).
This is also the subject of his
thesis.
He was a Rensselaer Polytechnic Institute Graduate Fellow from 1991 - 1992,
received support from the National Science Foundation Fellowship Program
in 1992, and has been the the recipient of the GTE Fellowship Program
since 1993.
He is also a member of Upsilon Pi Epsilon national computer science
honor society and ACM - SIGSAM.
Since February 1997 Angel works at the IBM T. J. Watson Research Center
in Yorktown Heights, New York.
Wayne Eberly
Wayne is a sabbatical visitor from the University of Calgary.
Úlfar Erlingsson
Ulfar worked as a graduate student in computer science with Erich Kaltofen.
Loek Helminck got his PhD. from the University of Utrecht in the Netherlands
in 1985. After a 2 year postdoc at the University of Michigan he became
a faculty member at North Carolina State University.
Loek Helminck's current interests include developing a computer algebra package
for reductive
symmetric spaces.
Sabrina Hessinger
Sabrina is an assistant professor in the
mathematics department at
Armstrong Atlantic State University in Savannah, Georgia.
Sabrina graduated from NCSU in 1997; her
thesis was directed by Michael Singer.
Markus received his Diploma in Mathematics from the
University of Zurich (Switzerland) in 1980, and
the M.S. degree in Computer Science from
Rensselaer Polytechnic Institute in 1988.
He was teaching Mathematics and Physics on the
highschool level for several years, and worked
as project engineer for a telecommunication
company. His special fields of
interest include residue number systems and
algebraic computing.
He completed his Ph.D.
thesis
on ``Efficient Algorithms for Computing the Nearest
Polynomial With a Constraint Root''
at Rensselaer in April 1998.
He is now at North George College and State University in
Dahlonega, Georgia.
He is a member of Pi Mu Epsilon.
Hoon has joined the group as faculty in January 1998.
Erich received both his M.S. degree in Computer Science
in 1979 and his Ph.D. degree in Computer Science
in 1982 from Rensselaer Polytechnic Institute.
He was an Assistant Professor of Computer Science
at the University of Toronto and an
Assistant, Associate and full Professor at Rensselaer
Polytechnic Institute. He is now a Professor
at North Carolina State University.
His current interests are in computational algebra
and number theory, design and analysis of
sequential and parallel algorithms, and
symbolic manipulation systems and languages.
Kaltofen was the Chair of
ACM's Special Interest Group on Symbolic & Algebraic
Manipulation 1993 - 95. He serves as associate editor on several
journals on symbolic computation.
From 1985 - 87 he held an IBM Faculty Development
Award. From 1990 - 91 he was an ACM National Lecturer.
Lakshman Y. N.
Lakshman wrote a Ph.D. thesis in computer science
entitled ``On the complexity of computing
Gröbner bases for zero dimensional ideals'' with Erich Kaltofen
as his adviser.
Lakshman is now
a Member of Technical Staff,
Computing Sciences Research,
Bell Labs, Murray Hill, New Jersey.
Previously, he was
an associate professor in the
Department for Mathematics and Computer Science at Drexel University.
Darren Lim
Darren worked as a graduate student in computer science with Erich Kaltofen.
Wen-shin obtained her B.S. in mathematics from
the National Taiwan University in 1994.
She received her PhD in 2001 at North Carolina State University working
with Erich Kaltofen as advisor and is now a postdoctoral fellow
at the University of Waterloo.
Austin Lobo
Austin (BSEE '81, MS ECSE '83, MS CSci '93, PhD CSci '95,
all Rensselaer Polytechnic Institute) was an
NSF postdoctoral fellow at the University of Delaware.
He is now an Assistant Professor at Washington College in Maryland.
He has worked for several years as an electrical engineer.
His interests are computational algebra; the design and
implementation of algorithms; and distributed and parallel
aspects of symbolic computation.
John P May
BA '98, MA '99 both University of Oregon.
Manfred obtained his M.S. in industrial mathematics from
the Joh. Kepler University in Linz, Austria in 1997.
Claudine Mitschi
Jack obtained his
B.S. in mathematics and mathematics education
from Marymount University in 1993 and
his M.S. in mathematics from
Northern Arizona University in 1995.
Mehrdad Samadani
Mehrdad is a Ph.D. student in computer science working with Erich Kaltofen.
Michael received his B.A. degree in Mathematics from NYU in 1970 and his
M.S. and Ph.D. degrees in Mathematics from the University of California at
Berkeley in 1972 and 1974 respectively. He was an Instructor in the
Mathematics Department at the State University of New York at Stony Brook and
in 1976 he joined the Mathematics Department faculty at North Carolina State
University where he is now a full Professor. He has held visiting positions
at
the Institute for Advanced Study, Princeton University, Johannes Kepler
University (Linz), University of Bonn, Louis Pasteur University (Strasbourg),
University of Rennes and the University of Lille. His current interests are in
differential algebra and computational algebra. He is an associate editor of
the Journal of Symbolic Computation and Applicable Algebra in Engineering,
Communication and Computing.
Assistant Professor, Ph.D., Cornell University, 1999.
Symbolic computation, computational algebraic geometry, differential
algebra.
Will received his B.S. degree in Mathematics and Physics in 1994 and his M.S.
degree in Applied Mathematics in 1996 from Iowa State University. He received
his PhD in 2002 at
North Carolina State University working with Erich Kaltofen as
advisor and is now at Wabash College.
Felix Ulmer
Tom Valente
Tom wrote a thesis Ph.D. thesis in computer science
entitled
``A distributed approach to proving large numbers prime''
with Erich Kaltofen as his advisor.
Tom is now an
assistant professor in the department for mathematics and
computer science at Hampden-Sydney College in Virginia.
C. Ryan Vinroot
Ryan is an undergraduate math student at NCSU doing
research with
Erich Kaltofen.
George received his undergraduate degree from Virginia Polytechnic Institute.
More about the People Page