Hoon Hong

Hong, H., & Yang, J. (2024, March 8). Parametric "non-nested" discriminants for multiplicities of univariate polynomials. SCIENCE CHINA-MATHEMATICS, Vol. 3. https://doi.org/10.1007/s11425-023-2143-3

Hong, H., Ovchinnikov, A., Pogudin, G., & Yap, C. (2023, September 22). Global Identifiability of Differential Models (vol 73, pg 1831, 2020). COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, Vol. 9. https://doi.org/10.1002/cpa.22163

Hong, H., Wang, D., & Yang, J. (2023). Improving Angular Speed Uniformity by Piecewise Radical Reparameterization. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, Vol. 398, pp. 165–178. https://doi.org/10.4204/EPTCS.398.19

Hong, H., & Yang, J. (2021). A condition for multiplicity structure of univariate polynomials. Journal of Symbolic Computation, 5, 15. https://doi.org/10.1016/j.jsc.2020.08.007

Hong, H., & Yang, J. (2021). A condition for multiplicity structure of univariate polynomials. Journal of Symbolic Computation, 104, 523–538. https://doi.org/https://doi.org/10.1016/j.jsc.2020.08.007

Al-Kateeb, A., Ambrosino, M., Hong, H., & Lee, E. (2021). Maximum gap in cyclotomic polynomials. JOURNAL OF NUMBER THEORY, 229, 1–15. https://doi.org/10.1016/j.jnt.2021.04.013

Hong, H., Ovchinnikov, A., Pogudin, G., & Yap, C. (2020). Global Identifiability of Differential Models. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 73(9), 1831–1879. https://doi.org/10.1002/cpa.21921

Hong, H., Ovchinnikov, A., Pogudin, G., & Yap, C. (2019). SIAN: a tool for assessing structural identifiability of parametric ODEs. ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 53(2), 37–40. https://doi.org/10.1145/3371991.3371993

Hong, H., Ovchinnikov, A., Pogudin, G., & Yap, C. (2019). SIAN: software for structural identifiability analysis of ODE models. BIOINFORMATICS, 35(16), 2873–2874. https://doi.org/10.1093/bioinformatics/bty1069

Herman, A., Hong, H., & Tsigaridas, E. (2018). Improving root separation bounds. JOURNAL OF SYMBOLIC COMPUTATION, 84, 25–56. https://doi.org/10.1016/j.jsc.2017.03.001

Coss, O., Hauenstein, J. D., Hong, H., & Molzahn, D. K. (2018). Locating and Counting Equilibria of the Kuramoto Model with Rank-One Coupling. SIAM JOURNAL ON APPLIED ALGEBRA AND GEOMETRY, 2(1), 45–71. https://doi.org/10.1137/17m1128198

Hong, H., & Rafael Sendra, J. (2018). Number of common roots and resultant of two tropical univariate polynomials. JOURNAL OF ALGEBRA, 511, 420–439. https://doi.org/10.1016/j.jalgebra.2018.06.027

Hong, H., & Sturm, T. (2018). 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). https://doi.org/10.1007/978-3-319-99639-4\_17

Hong, H., Hough, Z., & Kogan, I. A. (2017). Algorithm for computing mu-bases of univariate polynomials. JOURNAL OF SYMBOLIC COMPUTATION, 80, 844–874. https://doi.org/10.1016/j.jsc.2016.08.013

Han, J., Dai, L., Hong, H., & Xia, B. (2017). Open weak CAD and its applications. JOURNAL OF SYMBOLIC COMPUTATION, 80, 785–816. https://doi.org/10.1016/j.jsc.2016.07.032

Hong, H., Kim, Y., Scholten, G., & Sendra, J. R. (2017). Resultants over commutative idempotent semirings I: Algebraic aspect. JOURNAL OF SYMBOLIC COMPUTATION, 79, 285–308. https://doi.org/10.1016/j.jsc.2016.02.009

McCallum, S., & Hong, H. (2016). On using Lazard's projection in CAD construction. JOURNAL OF SYMBOLIC COMPUTATION, 72, 65–81. https://doi.org/10.1016/j.jsc.2015.02.001

Herman, A., & Hong, H. (2016). Quality of positive root bounds. JOURNAL OF SYMBOLIC COMPUTATION, 74, 592–602. https://doi.org/10.1016/j.jsc.2015.09.006

Erascu, M., & Hong, H. (2016). Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation). JOURNAL OF SYMBOLIC COMPUTATION, 75, 110–126. https://doi.org/10.1016/j.jsc.2015.11.010

Harlim, J., Hong, H., & Robbins, J. L. (2015). An algebraic method for constructing stable and consistent autoregressive filters. JOURNAL OF COMPUTATIONAL PHYSICS, 283, 241–257. https://doi.org/10.1016/j.jcp.2014.12.004

Hong, H., Lee, E., & Lee, H.-S. (2015). Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves. FINITE FIELDS AND THEIR APPLICATIONS, 34, 45–74. https://doi.org/10.1016/j.ffa.2014.12.007

Hong, H., Tang, X., & Xia, B. (2015). Special algorithm for stability analysis of multistable biological regulatory systems. JOURNAL OF SYMBOLIC COMPUTATION, 70, 112–135. https://doi.org/10.1016/j.jsc.2014.09.039

Yang, J., Wang, D., & Hong, H. (2014). ImUp: A Maple Package for Uniformity-Improved Reparameterization of Plane Curves. In Computer Mathematics (Vol. 10, pp. 437–451). https://doi.org/10.1007/978-3-662-43799-5_29

Hong, H., & Yap, C. (2014). 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). https://doi.org/10.1007/978-3-662-44199-2

Hong, H., & Yap, C. (Eds.). (2014). Mathematical software - ICMS 2014: 4th International Congress, Seoul, South Korea, August 5-9, 2014 : Proceedings. Heidelberg: Springer.

Chang, S., Hong, H., Lee, E., & Lee, H.-S. (2014). Pairing Inversion via Non-degenerate Auxiliary Pairings. In Pairing-Based Cryptography – Pairing 2013 (pp. 77–96). https://doi.org/10.1007/978-3-319-04873-4_5

Eraşcu, M., & Hong, H. (2014). 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). https://doi.org/10.1145/2608628.2608654

Hong, H., DongMing, W., & Jing, Y. (2013). A framework for improving uniformity of parameterizations of curves. SCIENCE CHINA-INFORMATION SCIENCES, 56(10). https://doi.org/10.1007/s11432-013-4924-4

Yang, J., Wang, D., & Hong, H. (2013). Improving Angular Speed Uniformity by C 1 Piecewise Reparameterization. In Automated Deduction in Geometry (pp. 33–47). https://doi.org/10.1007/978-3-642-40672-0_3

Yang, J., Wang, D., & Hong, H. (2013). Improving angular speed uniformity by reparameterization. Computer Aided Geometric Design, 30(7), 636–652. https://doi.org/10.1016/j.cagd.2013.04.001

Burdis, J. M., Kogan, I. A., & Hong, H. (2013). Object-Image Correspondence for Algebraic Curves under Projections. SYMMETRY INTEGRABILITY AND GEOMETRY-METHODS AND APPLICATIONS, 9. https://doi.org/10.3842/sigma.2013.023

Chang, S., Hong, H., Lee, E., & Lee, H.-S. (2013). 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). https://doi.org/10.1007/978-3-319-04873-4\_5

Chang, S., Hong, H., Lee, E., & Lee, H.-S. (2013). Reducing Pairing Inversion to Exponentiation Inversion using Non-degenerate
               Auxiliary Pairing. IACR Cryptol. EPrint Arch., 2013, 313. Retrieved from http://eprint.iacr.org/2013/313

Hong, H., Lee, E., Lee, H.-S., & Park, C.-M. (2013). 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. https://doi.org/10.1007/s10623-011-9605-y

Erascu, M., & Hong, H. (2013). The Secant-Newton Map is Optimal Among Contracting Quadratic Maps
               for Square Root Computation. Reliab. Comput., 18, 73–81. Retrieved from http://interval.louisiana.edu/reliable-computing-journal/volume-18/reliable-computing-18-pp-073-081.pdf

Yang, J., Wang, D., & Hong, H. (2012). Improving Angular Speed Uniformity by Optimal C 0 Piecewise Reparameterization. In Computer Algebra in Scientific Computing (pp. 349–360). https://doi.org/10.1007/978-3-642-32973-9_29

Yang, J., Wang, D., & Hong, H. (2012). 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). https://doi.org/10.1007/978-3-642-32973-9\_29

Hong, H., Lee, E., Lee, H.-S., & Park, C.-M. (2012). Maximum gap in (inverse) cyclotomic polynomial. JOURNAL OF NUMBER THEORY, 132(10), 2297–2315. https://doi.org/10.1016/j.jnt.2012.04.008

Zhao, T., Hong, H., Wang, D., & Aubry, P. (2012). 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). https://doi.org/10.1145/2245276.2245297

Hong, H., & Din, M. S. E. (2012). Variant quantifier elimination. Journal of Symbolic Computation, 47(7), 883–901. https://doi.org/10.1016/j.jsc.2011.05.014

Zhao, T., Wang, D., & Hong, H. (2011). Solution formulas for cubic equations without or with constraints. JOURNAL OF SYMBOLIC COMPUTATION, 46(8), 904–918. https://doi.org/10.1016/j.jsc.2011.02.001

Li, J., & Hong, H. (2011). WTHD optimization for single phase multilevel converters with step modulation. IECON 2011 - 37th Annual Conference of the IEEE Industrial Electronics Society. https://doi.org/10.1109/iecon.2011.6120043

Hong, H. (2010). 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). https://doi.org/10.1109/synasc.2010.91

Liu, Y., Hong, H., & Huang, A. Q. (2009). 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. https://doi.org/10.1109/TIE.2009.2015360

Liu, Y., Hong, H., & Huang, A. Q. (2009). Real-Time Calculation of Switching Angles Minimizing THD for Multilevel Inverters With Step Modulation. IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 56(2), 285–293. https://doi.org/10.1109/TIE.2008.918461

D’Andrea, C., Hong, H., Krick, T., & Szanto, A. (2009). Sylvester’s double sums: The general case. Journal of Symbolic Computation, 44(9), 1164–1175. https://doi.org/10.1016/j.jsc.2008.02.011

Hong, H., & Din, M. S. E. (2009). 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). https://doi.org/10.1145/1576702.1576729

Hong, H., & Perry, J. (2008). Are Buchberger's criteria necessary for the chain condition? (vol 42, pg 717, 2007). Journal of Symbolic Computation, Vol. 43, pp. 233–233.

Quinn, R., & Hong, H. (2008). Connectivity in semialgebraic sets (abstract only). ACM Commun. Comput. Algebra, 42(1-2), 86. https://doi.org/10.1145/1394042.1394094

Hong, H., & Perry, J. (2008). 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. https://doi.org/10.1016/j.jsc.2007.10.002

D'Andrea, C., Hong, H., Krick, T., & Szanto, A. (2007). An elementary proof of Sylvester's double sums for subresultants. JOURNAL OF SYMBOLIC COMPUTATION, 42(3), 290–297. https://doi.org/10.1016/j.jsc.2006.09.003

Hong, H., & Perry, J. (2007). Are Buchberger’s criteria necessary for the chain condition? Journal of Symbolic Computation, 42(7), 717–732. https://doi.org/10.1016/j.jsc.2007.02.002

Yap, C. K., & Hong, H. (2007). Foreword. Mathematics in Computer Science, 1(1), 3–7. https://doi.org/10.1007/s11786-007-0009-3

Hong, H., & Wang, D. (2006). 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). https://doi.org/10.1007/11615798

Hong, H., Kapur, D., Paule, P., & Winkler, F. (2006). Bruno Buchberger - A life devoted to symbolic computation. JOURNAL OF SYMBOLIC COMPUTATION, Vol. 41, pp. 255–258. https://doi.org/10.1016/j.jsc.2005.09.005

Hong, H., Li, L., Liang, T., & Wang, D. (2006). Solving Dynamic Geometric Constraints Involving Inequalities. In Artificial Intelligence and Symbolic Computation (pp. 181–195). https://doi.org/10.1007/11856290_17

Hong, H., Li, L., Liang, T., & Wang, D. (2006). 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.

Hong, H. (2004). Note on Jacobi's method for approximating dominant roots. JOURNAL OF SYMBOLIC COMPUTATION, 37(4), 449–453. https://doi.org/10.1016/j.jsc.2003.07.003

Hong, H., & Minimair, M. (2002). Sparse resultant of composed polynomials I* mixed-unmixed case. JOURNAL OF SYMBOLIC COMPUTATION, 33(4), 447–465. https://doi.org/10.1006/jsco.2001.0516

Hong, H. (2001). Ore principal subresultant coefficients in solutions. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 11(3), 227–237. https://doi.org/10.1007/s002000000041

Hong, H. (2001). Ore subresultant coefficients in solutions. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 12(5), 421–428. https://doi.org/10.1007/s002000100082

Hong, H. (2000). Editorial. J. Symb. Comput., 29(1), 3–4. https://doi.org/10.1006/jsco.2000.0345

Hong, H., & Schicho, J. (1998). Algorithms for trigonometric curves (simplification, implicitization, parameterization). JOURNAL OF SYMBOLIC COMPUTATION, 26(3), 279–300. https://doi.org/10.1006/jsco.1998.0212

Hong, H. (1998). An Improvement of the Projection Operator in Cylindrical Algebraic Decomposition. In Texts and Monographs in Symbolic Computation (pp. 166–173). https://doi.org/10.1007/978-3-7091-9459-1_8

Hong, H. (1998). Bounds for Absolute Positiveness of Multivariate Polynomials. J. Symb. Comput., 25(5), 571–585. https://doi.org/10.1006/jsco.1997.0189

Hong, H., & Sendra, J. R. (1998). 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. (1998). Mathematics and Computers in Simulation. https://doi.org/10.1016/s0378-4754(97)00119-5

Hong, H. (1998). Groebner Basis Under Composition I. Journal of Symbolic Computation, 25(5), 643–663. https://doi.org/10.1006/jsco.1997.0192

Hong, H., & Jakuš, D. (1998). Testing Positiveness of Polynomials. Journal of Automated Reasoning, 21(1), 23–38. https://doi.org/10.1023/A:1005983105493

Hong, H. (1997). Comparison of Several Decision Algorithms for the Existential Theory of the Reals. 5.

Hong, H. (1997). Heuristic Search and Pruning in Polynomial Constraints Satisfaction. Ann. Math. Artif. Intell., 19(3-4), 319–334. https://doi.org/10.1023/A:1018911907086

HONG, H. O. O. N. (1997). Implicitization of Nested Circular Curves. Journal of Symbolic Computation, 23(2-3), 177–189. https://doi.org/10.1006/jsco.1996.0082

Hong, H. (1997). Multivariate Resultants Under Composition. 4.

Hong, H., Kaltofen, E., & Hitz, M. A. (Eds.). (1997). Proceedings of the 2nd International Workshop on Parallel Symbolic
               Computation, PASCO 1997, July 20-22, 1997, Kihei, Hawaii, USA. ACM.

Hong, H., & Liska, R. (1997). Special Issue on Application of Quantifier Elimination. Foreword of the Guest Editors. Journal of Symbolic Computation, 24(2), 123. https://doi.org/10.1006/jsco.1997.0117

Hong, H. (1997). Subresultants Under Composition. Journal of Symbolic Computation, 23(4), 355–365. https://doi.org/10.1006/jsco.1996.0093

HONG, H. O. O. N., LISKA, R. I. C. H. A. R. D., & STEINBERG, S. T. A. N. L. Y. (1997). Testing Stability by Quantifier Elimination. Journal of Symbolic Computation, 24(2), 161–187. https://doi.org/10.1006/jsco.1997.0121

Hong, H. (1996). An efficient method for analyzing the topology of plane real algebraic curves. Mathematics and Computers in Simulation, 42(4-6), 571–582. https://doi.org/10.1016/s0378-4754(96)00034-1

Hong, H. (1996). 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). https://doi.org/10.1145/236869.236906

Hong, H. (1996). The exact region of stability for MacCormack scheme. Computing, 56(4), 371–383. https://doi.org/10.1007/bf02253461

Hong, H. (1996). The exact stability region of the MacCormack scheme for the scalar advection equation. Applied Mathematics Letters, 9(4), 99–101. https://doi.org/10.1016/0893-9659(96)00059-6

Hong, H., & Stahl, V. (1995). Bernstein form is inclusion monotone. Computing, 55(1), 43–53. https://doi.org/10.1007/bf02238236

Hong, H. (1995). 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). https://doi.org/10.1007/3-540-60114-7\_21

Hong, H., Wang, D., & Winkler, F. (1995). Preface. Annals of Mathematics and Artificial Intelligence, 13(1-2), I-II. https://doi.org/10.1007/bf01531320

Hong, H., Neubacher, A., & Schreiner, W. (1995). The Design of the SACLIB/PACLIB Kernels. Journal of Symbolic Computation, 19(1-3), 111–132. https://doi.org/10.1006/jsco.1995.1007

Hong, H., & Loidl, H.-W. (1994). 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). https://doi.org/10.1007/3-540-58430-7\_29

Hong, H. (1994). 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). https://doi.org/10.1007/3-540-58216-9\_32

Hong, H., & Stahl, V. (1994). Safe starting regions by fixed points and tightening. Computing, 53(3-4), 323–335. https://doi.org/10.1007/bf02307383

Schreiner, W., & Hong, H. (1993). 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.

Hong, H. (1993). 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). https://doi.org/10.1007/3-540-56686-4\_42

Hong, H. (1993). Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants. The Computer Journal, 36(5), 439–449. https://doi.org/10.1093/comjnl/36.5.439

Hong, H. (1993). 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). https://doi.org/10.1145/164081.164140

Hong, H. (1993). 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.

Hong, H. (1993). Special Issue Editorial: Computational Quantifier Elimination. Comput. J., 36(5), 399. https://doi.org/10.1093/comjnl/36.5.399

Schreiner, W., & Hong, H. (1993). 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). https://doi.org/10.1007/3-540-57314-3\_17

Hong, H., Neubacher, A., & Schreiner, W. (1993). 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). https://doi.org/10.1007/BFb0013184

Hong, H. (1992). 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). https://doi.org/10.1007/3-540-57322-4\_10

Hong, H. (1992). 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). https://doi.org/10.1007/BFb0013827

Hong, H., & Schreiner, W. (1992). Programming in PACLIB. SIGSAM Bull., 26(4), 1–6. https://doi.org/10.1145/147105.147108

Hong, H. (1992). 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). https://doi.org/10.1145/143242.143306

Collins, G. E., & Hong, H. (1991). Partial Cylindrical Algebraic Decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3), 299–328. https://doi.org/10.1016/s0747-7171(08)80152-6

Hong, H. (1990). An improvement of the projection operator in cylindrical algebraic decomposition. Proceedings of the international symposium on Symbolic and algebraic computation  - ISSAC '90. https://doi.org/10.1145/96877.96943