Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Howard Cheng
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
Skeletal Rigidity of Phylogenetic Trees
2012
Howard Cheng
Satyan L. Devadoss
Brian Li
Andrej Risteski
+
PDF
Chat
MODULAR COMPUTATION FOR MATRICES OF ORE POLYNOMIALS
2007
Howard Cheng
George Labahn
+
PDF
Chat
Time-and space-efficient evaluation of some hypergeometric constants
2007
Howard Cheng
Guillaume Hanrot
Emmanuel Thomé
Paul Zimmermann
Eugene V. Zima
+
PDF
Chat
Output-sensitive modular algorithms for polynomial matrix normal forms
2007
Howard Cheng
George Labahn
+
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
2007
Howard Cheng
Guillaume Hanrot
Emmanuel Thomé
Eugene V. Zima
Paul Zimmermann
+
Space-efficient evaluation of hypergeometric series
2005
Howard Cheng
Barry Gergel
Ethan Kim
Eugene V. Zima
+
Algorithms for normal forms for matrices of polynomials and ore polynomials
2003
George Labahn
Howard Cheng
Common Coauthors
Coauthor
Papers Together
George Labahn
3
Eugene V. Zima
3
Paul Zimmermann
2
Guillaume Hanrot
2
Emmanuel Thomé
2
Brian Li
1
Barry Gergel
1
Andrej Risteski
1
Ethan Kim
1
Satyan L. Devadoss
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
PDF
Chat
Fast Multiple-Precision Evaluation of Elementary Functions
1976
Richard P. Brent
3
+
PDF
Chat
A modular algorithm for computing greatest common right divisors of Ore polynomials
1997
Ziming Li
István Nemes
3
+
PDF
Chat
Sylvester’s identity and multistep integer-preserving Gaussian elimination
1968
E.H. Bareiss
3
+
Exact solution of linear equations
1971
S. Cabay
3
+
A subresultant theory for Ore polynomials with applications
1998
Ziming Li
2
+
PDF
Chat
Shifted normal forms of polynomial matrices
1999
Bernhard Beckermann
George Labahn
Gilles Villard
2
+
Algorithms for normal forms for matrices of polynomials and ore polynomials
2003
George Labahn
Howard Cheng
2
+
Recursiveness in matrix rational interpolation problems
1997
Bernhard Beckermann
George Labahn
2
+
Theory of Non-Commutative Polynomials
1933
Öystein Ore
2
+
PDF
Chat
Computational strategies for the Riemann zeta function
2000
Jonathan M. Borwein
David M. Bradley
Richard E. Crandall
2
+
PDF
Chat
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
1971
Warren S. Brown
2
+
Linear algebra for skew-polynomial matrices
2002
С. А. Абрамов
Manuel Bronstein
2
+
On solutions of linear functional systems
2001
С. А. Абрамов
Manuel Bronstein
2
+
Algorithms for matrix canonical forms
2000
Arne Storjohann
2
+
Normal forms for general polynomial matrices
2006
Bernhard Beckermann
George Labahn
Gilles Villard
2
+
PDF
Chat
Fatgraph models of proteins
2010
Robert Penner
Michael Knudsen
Carsten Wiuf
Jørgen Ellegaard Andersen
1
+
Factoring Modular Polynomials
1998
Joachim von zur Gathen
Silke Hartlieb
1
+
PDF
Chat
The Calculation of Multivariate Polynomial Resultants
1971
George E. Collins
1
+
Efficient accelero-summation of holonomic functions
2007
Joris van der Hoeven
1
+
Rational solutions of first order linear difference systems
1998
С. А. Абрамов
M. A. Barkatou
1
+
Greatest common divisor via generalized Sylvester and Bezout matrices
1978
Robert R. Bitmead
Sun‐Yuan Kung
Brian D. O. Anderson
T. Kailath
1
+
Computing Popov and Hermite forms of polynomial matrices
1996
Gilles Villard
1
+
Fast evaluation of holonomic functions
1999
Joris van der Hoeven
1
+
Free Rings and Their Relations.
1973
David J. Fieldhouse
P. M. Cohn
1
+
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
1989
Bruce W. Char
K. O. Geddes
Gastón H. Gonnet
1
+
PDF
Chat
Algorithm 767: a Fortran 77 package for column reduction of polynomial matrices
1997
A.J. Geurts
C. Praagman
1
+
PDF
Chat
Subresultants and Reduced Polynomial Remainder Sequences
1967
George E. Collins
1
+
Fast Evaluation of Holonomic Functions Near and in Regular Singularities
2001
Joris van der Hoeven
1
+
A new method for computing a column reduced polynomial matrix
1988
Th. Beelen
G.J. van den Hurk
C. Praagman
1
+
PDF
Chat
Hypergeometric Series Acceleration Via the WZ method
1996
Tewodros Amdeberhan
Doron Zeilberger
1
+
Computing greatest common divisors of polynomial matrices
1999
Cassidy Gentle
1
+
PDF
Chat
Output-sensitive modular algorithms for polynomial matrix normal forms
2007
Howard Cheng
George Labahn
1
+
Column reduction of polynomial matrices
1993
W.H.L. Neven
C. Praagman
1
+
PDF
Chat
Algebraic number theory
1999
Kazuya Katô
Nobushige Kurokawa
Takeshi Saito
1
+
Algebraic Number Theory
1994
Serge Lang
1
+
The Problem of the Angle-Bisectors
2005
Richard Philip Baker
1
+
PDF
Chat
Computing Valuation Popov Forms
2005
Mark Giesbrecht
George Labahn
Yang Zhang
1
+
Diagonalizing the genome I: navigation in tree spaces
2010
Satyan L. Devadoss
Jack Morava
1
+
Generalized Polynomial Remainder Sequences
1982
Rüdiger Loos
1
+
Introduction to Analytic and Probabilistic Number Theory
2015
Gérald Tenenbaum
1
+
PDF
Chat
The symplectic geometry of polygons in Euclidean space
1996
Michael Kapovich
John J. Millson
1
+
Schnelle Berechnung von Kettenbruchentwicklungen
1971
Arnold Schönhage
1
+
Fast multiprecision evaluation of series of rational numbers
1998
Bruno Haible
Thomas Papanikolaou
1
+
On the genericity of the modular polynomial GCD algorithm
1999
Erich Kaltofen
Michael Monagan
1
+
Non-commutative Elimination in Ore Algebras Proves Multivariate Identities
1998
Frédéric Chyzak
Bruno Salvy
1
+
Asymptotically Fast Triangularization of Matrices over Rings
1991
James Lee Hafner
Kevin S. McCurley
1
+
Maximal quotient rational reconstruction
2004
Michael Monagan
1
+
An efficient division algorithm for polynomial matrices
1986
Qing‐Guo Wang
Chunhui Zhou
1
+
An algorithm for the division of two polynomial matrices
1983
Shou-Yuan Zhang
Chi‐Tsong Chen
1
+
Geometry of the space of phylogenetic trees
2000
Louis J. Billera
Susan Holmes
Karen Vogtmann
1