Hoon Hong

A condition for multiplicity structure of univariate polynomials

Journal of Symbolic Computation, 5, 15.

A condition for multiplicity structure of univariate polynomials

Journal of Symbolic Computation, 104, 523–538.

Maximum gap in cyclotomic polynomials

JOURNAL OF NUMBER THEORY, 229, 1–15.

Global Identifiability of Differential Models

COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 73(9), 1831–1879.

SIAN: a tool for assessing structural identifiability of parametric ODEs

ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 53(2), 37–40.

SIAN: software for structural identifiability analysis of ODE models

BIOINFORMATICS, 35(16), 2873–2874.

Improving root separation bounds

JOURNAL OF SYMBOLIC COMPUTATION, 84, 25–56.

Locating and Counting Equilibria of the Kuramoto Model with Rank-One Coupling

SIAM JOURNAL ON APPLIED ALGEBRA AND GEOMETRY, 2(1), 45–71.

Number of common roots and resultant of two tropical univariate polynomials

JOURNAL OF ALGEBRA, 511, 420–439.

Positive Solutions of Systems of Signed Parametric Polynomial Inequalities

In V. P. Gerdt, W. Koepf, W. M. Seiler, & E. V. Vorozhtsov (Eds.), Computer Algebra in Scientific Computing - 20th International Workshop, CASC 2018, Lille, France, September 17-21, 2018, Proceedings (Vol. 11077, pp. 238–253).

Algorithm for computing mu-bases of univariate polynomials

JOURNAL OF SYMBOLIC COMPUTATION, 80, 844–874.

Open weak CAD and its applications

JOURNAL OF SYMBOLIC COMPUTATION, 80, 785–816.

Resultants over commutative idempotent semirings I: Algebraic aspect

JOURNAL OF SYMBOLIC COMPUTATION, 79, 285–308.

On using Lazard's projection in CAD construction

JOURNAL OF SYMBOLIC COMPUTATION, 72, 65–81.

Quality of positive root bounds

JOURNAL OF SYMBOLIC COMPUTATION, 74, 592–602.

Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation)

JOURNAL OF SYMBOLIC COMPUTATION, 75, 110–126.

An algebraic method for constructing stable and consistent autoregressive filters

JOURNAL OF COMPUTATIONAL PHYSICS, 283, 241–257.

Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves

FINITE FIELDS AND THEIR APPLICATIONS, 34, 45–74.

Special algorithm for stability analysis of multistable biological regulatory systems

JOURNAL OF SYMBOLIC COMPUTATION, 70, 112–135.

ImUp: A Maple Package for Uniformity-Improved Reparameterization of Plane Curves

In Computer Mathematics (Vol. 10, pp. 437–451).

Mathematical Software – ICMS 2014: 4th International Congress, Seoul, South Korea, August 5-9, 2014. Proceedings

In H. Hong & C. Yap (Eds.), Lecture Notes in Computer Science (Vol. 8592).

Mathematical software - ICMS 2014: 4th International Congress, Seoul, South Korea, August 5-9, 2014 : Proceedings

Heidelberg: Springer.

Pairing Inversion via Non-degenerate Auxiliary Pairings

In Pairing-Based Cryptography – Pairing 2013 (pp. 77–96).

Synthesis of Optimal Numerical Algorithms Using Real Quantifier Elimination (Case Study: Square Root Computation)

In K. Nabeshima, K. Nagasaka, F. Winkler, & Á. Szántó (Eds.), Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (pp. 162–169).

A framework for improving uniformity of parameterizations of curves

SCIENCE CHINA-INFORMATION SCIENCES, 56(10).

Improving Angular Speed Uniformity by C 1 Piecewise Reparameterization

In Automated Deduction in Geometry (pp. 33–47).

Improving angular speed uniformity by reparameterization

Computer Aided Geometric Design, 30(7), 636–652.

Object-Image Correspondence for Algebraic Curves under Projections

SYMMETRY INTEGRABILITY AND GEOMETRY-METHODS AND APPLICATIONS, 9.

Pairing Inversion via Non-degenerate Auxiliary Pairings

In Z. Cao & F. Zhang (Eds.), Pairing-Based Cryptography - Pairing 2013 - 6th International Conference, Beijing, China, November 22-24, 2013, Revised Selected Papers (Vol. 8365, pp. 77–96).

Reducing Pairing Inversion to Exponentiation Inversion using Non-degenerate Auxiliary Pairing

IACR Cryptol. EPrint Arch., 2013, 313. http://eprint.iacr.org/2013/313

Simple and exact formula for minimum loop length in Ate (i) pairing based on Brezing-Weng curves

DESIGNS CODES AND CRYPTOGRAPHY, 67(2), 271–292.

The Secant-Newton Map is Optimal Among Contracting Quadratic Maps for Square Root Computation

Reliab. Comput., 18, 73–81. http://interval.louisiana.edu/reliable-computing-journal/volume-18/reliable-computing-18-pp-073-081.pdf

Improving Angular Speed Uniformity by Optimal C 0 Piecewise Reparameterization

In Computer Algebra in Scientific Computing (pp. 349–360).

Improving Angular Speed Uniformity by Optimal C 0 Piecewise Reparameterization

In V. P. Gerdt, W. Koepf, E. W. Mayr, & E. V. Vorozhtsov (Eds.), Computer Algebra in Scientific Computing - 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings (Vol. 7442, pp. 349–360).

Maximum gap in (inverse) cyclotomic polynomial

JOURNAL OF NUMBER THEORY, 132(10), 2297–2315.

Real solution formulas of cubic and quartic equations applied to generate dynamic diagrams with inequality constraints

In S. Ossowski & P. Lecca (Eds.), Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12 (pp. 94–101).

Variant quantifier elimination

Journal of Symbolic Computation, 47(7), 883–901.

Solution formulas for cubic equations without or with constraints

JOURNAL OF SYMBOLIC COMPUTATION, 46(8), 904–918.

WTHD optimization for single phase multilevel converters with step modulation

IECON 2011 - 37th Annual Conference of the IEEE Industrial Electronics Society.

Connectivity in Semi-algebraic Sets

In T. Ida, V. Negru, T. Jebelean, D. Petcu, S. M. Watt, & D. Zaharie (Eds.), 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (pp. 4–7).

Real-Time Algorithm for Minimizing THD in Multilevel Inverters With Unequal or Varying Voltage Steps Under Staircase Modulation

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 56(6), 2249–2258.

Real-Time Calculation of Switching Angles Minimizing THD for Multilevel Inverters With Step Modulation

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 56(2), 285–293.

Sylvester’s double sums: The general case

Journal of Symbolic Computation, 44(9), 1164–1175.

Variant real quantifier elimination

In J. R. Johnson, H. Park, & E. Kaltofen (Eds.), Proceedings of the 2009 international symposium on Symbolic and algebraic computation - ISSAC '09 (pp. 183–190).

Are Buchberger's criteria necessary for the chain condition? (vol 42, pg 717, 2007)

Journal of Symbolic Computation, Vol. 43, pp. 233–233.

Connectivity in semialgebraic sets (abstract only)

ACM Commun. Comput. Algebra, 42(1-2), 86.

Corrigendum to “Are Buchberger’s criteria necessary for the chain condition?” [J. Symbolic Comput. 42 (2007) 717–732]

Journal of Symbolic Computation, 43(3), 233.

An elementary proof of Sylvester's double sums for subresultants

JOURNAL OF SYMBOLIC COMPUTATION, 42(3), 290–297.

Are Buchberger’s criteria necessary for the chain condition?

Journal of Symbolic Computation, 42(7), 717–732.

Foreword

Mathematics in Computer Science, 1(1), 3–7.

Automated Deduction in Geometry, 5th International Workshop, ADG 2004, Gainesville, FL, USA, September 16-18, 2004, Revised Papers

In H. Hong & D. Wang (Eds.), Springer Berlin Heidelberg (Vol. 3763).

Bruno Buchberger - A life devoted to symbolic computation

JOURNAL OF SYMBOLIC COMPUTATION, Vol. 41, pp. 255–258.

Solving Dynamic Geometric Constraints Involving Inequalities

In J. Calmet, T. Ida, & D. Wang (Eds.), Artificial Intelligence and Symbolic Computation (pp. 181–195). Berlin, Heidelberg: Springer Berlin Heidelberg.

Solving Dynamic Geometric Constraints Involving Inequalities

In Artificial Intelligence and Symbolic Computation (pp. 181–195).

Note on Jacobi's method for approximating dominant roots

JOURNAL OF SYMBOLIC COMPUTATION, 37(4), 449–453.

Sparse resultant of composed polynomials I* mixed-unmixed case

JOURNAL OF SYMBOLIC COMPUTATION, 33(4), 447–465.

Ore principal subresultant coefficients in solutions

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 11(3), 227–237.

Ore subresultant coefficients in solutions

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 12(5), 421–428.

Editorial

J. Symb. Comput., 29(1), 3–4.

Algorithms for trigonometric curves (simplification, implicitization, parameterization)

JOURNAL OF SYMBOLIC COMPUTATION, 26(3), 279–300.

An Improvement of the Projection Operator in Cylindrical Algebraic Decomposition

In Texts and Monographs in Symbolic Computation (pp. 166–173).

Bounds for Absolute Positiveness of Multivariate Polynomials

J. Symb. Comput., 25(5), 571–585.

Computation of Variant Resultants

In B. F. Caviness & J. R. Johnson (Eds.), Quantifier Elimination and Cylindrical Algebraic Decomposition (pp. 327–340). Vienna: Springer Vienna.

Editorial

Mathematics and Computers in Simulation.

Groebner Basis Under Composition I

Journal of Symbolic Computation, 25(5), 643–663.

Testing Positiveness of Polynomials

Journal of Automated Reasoning, 21(1), 23–38.

Comparison of Several Decision Algorithms for the Existential Theory of the Reals

5.

Heuristic Search and Pruning in Polynomial Constraints Satisfaction.

Ann. Math. Artif. Intell., 19(3-4), 319–334.

Implicitization of Nested Circular Curves

Journal of Symbolic Computation, 23(2-3), 177–189.

Multivariate Resultants Under Composition

4.

Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, PASCO 1997, July 20-22, 1997, Kihei, Hawaii, USA

ACM.

Special Issue on Application of Quantifier Elimination. Foreword of the Guest Editors

Journal of Symbolic Computation, 24(2), 123.

Subresultants Under Composition

Journal of Symbolic Computation, 23(4), 355–365.

Testing Stability by Quantifier Elimination

Journal of Symbolic Computation, 24(2), 161–187.

An efficient method for analyzing the topology of plane real algebraic curves

Mathematics and Computers in Simulation, 42(4-6), 571–582.

Groebner basis under composition II

In E. Engeler, B. F. Caviness, & Y. N. Lakshman (Eds.), Proceedings of the 1996 international symposium on Symbolic and algebraic computation - ISSAC '96 (pp. 79–85).

The exact region of stability for MacCormack scheme

Computing, 56(4), 371–383.

The exact stability region of the MacCormack scheme for the scalar advection equation

Applied Mathematics Letters, 9(4), 99–101.

Bernstein form is inclusion monotone

Computing, 55(1), 43–53.

Implicitization of Curves Parameterized by Generalized Trigonometric Polynomials

In G. D. Cohen, M. Giusti, & T. Mora (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings (Vol. 948, pp. 285–296).

Preface

Annals of Mathematics and Artificial Intelligence, 13(1-2), I-II.

The Design of the SACLIB/PACLIB Kernels

Journal of Symbolic Computation, 19(1-3), 111–132.

Parallel Computation of Modular Multivariate Polynominal Resultants on a Shared Memory Machine

In B. Buchberger & J. Volkert (Eds.), Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings (Vol. 854, pp. 325–336).

RISC-CLP(CF) Constraint Logic Programming over Complex Functions

In F. Pfenning (Ed.), Logic Programming and Automated Reasoning, 5th International Conference, LPAR'94, Kiev, Ukraine, July 16-22, 1994, Proceedings (Vol. 822, pp. 99–113).

Safe starting regions by fixed points and tightening

Computing, 53(3-4), 323–335.

A New Library for Parallel Algebraic Computation

In R. F. Sincovec, D. E. Keyes, M. R. Leuze, L. R. Petzold, & D. A. Reed (Eds.), Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, PPSC 1993, Norfolk, Virginia, USA, March 22-24, 1993 (pp. 776–783). SIAM.

Parallelization of Quantifier Elimination on a Workstation Network

In G. D. Cohen, T. Mora, & O. Moreno (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993, Proceedings (Vol. 673, pp. 170–179).

Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants

The Computer Journal, 36(5), 439–449.

Quantifier elimination for formulas constrained by quadratic equations

In M. Bronstein (Ed.), Proceedings of the 1993 international symposium on Symbolic and algebraic computation - ISSAC '93 (pp. 264–274).

RISC-CLP (Real): Logic Programming with Non-Linear Constraints over the Reals

In Constraint Logic Programming: Selected Research (pp. 133–159). Cambridge, MA, USA: MIT Press.

Special Issue Editorial: Computational Quantifier Elimination

Comput. J., 36(5), 399.

The Design of the PACLIB Kernel for Parallel Algebraic Computation

In J. Volkert (Ed.), Parallel Computation, Second International ACPC Conference, Gmunden, Austria, October 4-6, 1993, Proceedings (Vol. 734, pp. 204–218).

The Design of the SACLIB/PACLIB Kernels

In A. Miola (Ed.), Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO '93, Gmunden, Austria, September 15-17, 1993, Proceedings (Vol. 722, pp. 288–302).

Heuristic Search Strategies for Cylindrical Algebraic Decomposion

In J. Calmet & J. A. Campbell (Eds.), Artificial Intelligence and Symbolic Mathematical Computation, International Conference, AISMC-1, Karlsruhe, Germany, August 3-6, 1992, Proceedings (Vol. 737, pp. 152–165).

Non-linear Real Constraints in Constraint Logic Programming

In H. Kirchner & G. Levi (Eds.), Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings (Vol. 632, pp. 201–212).

Programming in PACLIB

SIGSAM Bull., 26(4), 1–6.

Simple Solution Formula Construction in Cylindrical Algebraic Decomposition Based Quantifier Elimination

In P. S. Wang (Ed.), Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC '92, Berkeley, CA, USA, July 27-29, 1992 (pp. 177–188).

Partial Cylindrical Algebraic Decomposition for quantifier elimination

Journal of Symbolic Computation, 12(3), 299–328.

An improvement of the projection operator in cylindrical algebraic decomposition

Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '90.