Birkett Huber

Cornell University — United States

Computer Science · Physical Sciences

10h-index938citations15works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Polynomial and algebraic computation(10), Advanced Numerical Analysis Techniques(6), Commutative Algebra and Its Applications(6), Algebraic Geometry and Number Theory(2), Computer Graphics and Visualization Techniques(2)

Publications15 total

Fractionally spaced CMA equalizers under periodic and correlated inputs
2002· 12 citedOpen Access
A Family of Sparse Polynomial Systems Arising in Chemical Reaction Systems
Journal of Symbolic Computation·2002· 86 cited
The Cayley Trick, lifting subdivisions and the Bohne–Dress theorem on zonotopal tilings
Journal of the European Mathematical Society·2000· 95 citedOpen Access
Computing gröbner fans of toric ideals
ACM SIGSAM Bulletin·2000Open Access
Pieri Homotopies for Problems in Enumerative Geometry Applied to Pole Placement in Linear Systems Control
SIAM Journal on Control and Optimization·2000· 39 cited
Computing Gröbner Fans of Toric Ideals
Experimental Mathematics·2000· 22 cited
<title>Geometric hashing and object recognition</title>
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE·1999· 1 cited
<title>Invariant geometric hashing</title>
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE·1999· 1 cited
Numerical Schubert Calculus
Journal of Symbolic Computation·1998· 80 cited
Polyhedral end games for polynomial continuation
Numerical Algorithms·1998· 53 cited
<title>Geometric-content-based indexing</title>
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE·1998· 1 cited
Numerical Schubert calculus
arXiv (Cornell University)·1997Open Access
Bernstein’s theorem in affine space
Discrete & Computational Geometry·1997· 58 citedOpen Access
A Polyhedral Method for Solving Sparse Polynomial Systems
Mathematics of Computation·1995· 290 cited
A polyhedral method for solving sparse polynomial systems
Mathematics of Computation·1995· 200 citedOpen Access

Frequent Co-authors

Bernd Sturmfels(5), Peter F. Stiller(3), Frank Sottile(2), Jan Verschelde(2), Charles S. Wan(2), Jörg Rambau(1), Francisco Santos(1), Karin Gatermann(1), Rekha R. Thomas(1), J. P. F. LeBlanc(1), Inbar Fijalkow(1), C.R. Johnson(1), Tejas N. Shah(1)