EDBT 2026 Demo / reviewers in the wild / expert
Guoce Xin
dblp:68/5792
· DBLP profile ↗
5ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 2 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A fast algorithm for denumerants with three variables
Feihu Liu, Guoce Xin |
J. Symb. Comput. | 2 |
| 2025 | Fast evaluation of generalized Todd polynomials: Applications to MacMahon's partition analysis and integer programming
Guoce Xin, Yingrui Zhang |
J. Symb. Comput. | 1 |
| 2023 | On magic distinct labellings of simple graphs
Guoce Xin, Chen Zhang 0040, Yueming Zhong |
J. Symb. Comput. | 1 |
| 2015 | Hankel Determinant Solutions to Several Discrete Integrable Systems and the Laurent PropertyabstractMany discrete integrable systems exhibit the Laurent phenomenon. In this paper, we investigate three integrable systems: the Somos-4 recurrence, the Somos-5 recurrence, and a system related to so-called $A_1$ $Q$-system, whose general solutions are derived in terms of Hankel determinant. As a result, we directly confirm that they satisfy the Laurent property. Additionally, it is shown that the Somos-5 recurrence can be viewed as a specified Bäcklund transformation of the Somos-4 recurrence. Related topics about Somos polynomials are also studied. Xiang-Ke Chang, Xing-Biao Hu, Guoce Xin |
SIAM J. Discret. Math. | 3 |
| 2013 | Hermite reduction and creative telescoping for hyperexponential functionsabstractWe present a new reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition that allows to decide hyperexponential integrability. Based on this reduction algorithm, we design a new algorithm to compute minimal telescopers for bivariate hyperexponential functions. One of its main features is that it can avoid the costly computation of certificates. Its implementation outperforms Maple's function DEtools[Zeilberger]. We also derive an order bound on minimal telescopers that is tighter than the known ones. Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li 0002, Guoce Xin |
ISSAC | 5 |