default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChenqi Mou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Rilun Xia
, Dongming Wang, Chenqi Mou:
Collision Detection Between Convex Objects Using Pseudodistance and Unconstrained Optimization. IEEE Trans. Robotics 41: 253-268 (2025)- 2024
- [c15]Chenqi Mou, Qiuye Song, Yutong Zhou:
DetGB: A Software Package for Computing Gröbner Bases of Determinantal Ideals. ICMS 2024: 354-364 - [c14]Zhaoxing Qi, Chenqi Mou:
Complexity Analysis of Triangular Decomposition over F_2 with Strongly Chordal Graphs. ISSAC 2024: 208-216 - [e1]François Boulier, Chenqi Mou, Timur M. Sadykov, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing - 26th International Workshop, CASC 2024, Rennes, France, September 2-6, 2024, Proceedings. Lecture Notes in Computer Science 14938, Springer 2024, ISBN 978-3-031-69069-3 [contents] - [i6]Chenqi Mou, Weifeng Shang:
Puzzle Ideals for Grassmannians. CoRR abs/2407.10927 (2024) - 2023
- [j11]Shaoshi Chen, Chenqi Mou:
Preface to the Special Topic on Computer Mathematics. J. Syst. Sci. Complex. 36(1): 1-2 (2023) - [j10]Chenqi Mou, Wenwen Ju:
Sparse Triangular Decomposition for Computing Equilibria of Biological Dynamic Systems Based on Chordal Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1667-1678 (2023) - [i5]Chenqi Mou, Qiuye Song:
On the Reduced Gröbner Bases of Blockwise Determinantal Ideals. CoRR abs/2309.15035 (2023) - 2022
- [c13]Mingyu Dong, Chenqi Mou:
Analyses and Implementations of Chordality-Preserving Top-Down Algorithms for Triangular Decomposition. CASC 2022: 124-142 - [c12]Weifeng Shang, Chenqi Mou, Deepak Kapur:
Algorithms for Testing Membership in Univariate Quadratic Modules over the Reals. ISSAC 2022: 429-437 - 2021
- [j9]Chenqi Mou, Yang Bai, Jiahua Lai:
Chordal graphs in triangular decomposition in top-down style. J. Symb. Comput. 102: 108-131 (2021) - [c11]Wenwen Ju, Chenqi Mou:
Exploiting Variable Sparsity in Computing Equilibria of Biological Dynamical Systems by Triangular Decomposition. AlCoB 2021: 29-41 - [c10]Rina Dong, Dong Lu, Chenqi Mou, Dongming Wang:
Comprehensive Characteristic Decomposition of Parametric Polynomial Systems. ISSAC 2021: 123-130 - 2020
- [j8]Dongming Wang, Rina Dong, Chenqi Mou:
Decomposition of polynomial sets into characteristic pairs. Math. Comput. 89(324): 1993-2015 (2020) - [c9]Chenqi Mou:
On the chordality of ordinary differential triangular decomposition in top-down style. ISSAC 2020: 364-371
2010 – 2019
- 2019
- [j7]Chenqi Mou, Dongming Wang:
Characteristic Decomposition: From Regular Sets to Normal Sets. J. Syst. Sci. Complex. 32(1): 37-46 (2019) - [c8]Rina Dong, Chenqi Mou:
On Characteristic Decomposition and Quasi-characteristic Decomposition. CASC 2019: 122-139 - [c7]Chenqi Mou, Xiaolin Fan:
On Berlekamp-Massey and Berlekamp-Massey-Sakata Algorithms. CASC 2019: 362-376 - [c6]Chenqi Mou, Jiahua Lai:
On the Chordality of Simple Decomposition in Top-Down Style. MACIS 2019: 138-152 - 2018
- [j6]Chenqi Mou, Dongming Wang:
On W-characteristic sets of lexicographic Gröbner bases. ACM Commun. Comput. Algebra 52(4): 142-144 (2018) - [c5]Pengcheng Peng, Chenqi Mou, Wei-Tek Tsai:
Game-Theoretic Analysis on the Number of Participants in the Software Crowdsourcing Contest. AISC 2018: 255-268 - [c4]Chenqi Mou:
Symbolic Detection of Steady States of Autonomous Differential Biological Systems by Transformation into Block Triangular Form. AlCoB 2018: 115-127 - [c3]Chenqi Mou, Yang Bai:
On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down Style. ISSAC 2018: 287-294 - [i4]Chenqi Mou, Yang Bai:
On the chordality of polynomial sets in triangular decomposition in top-down style. CoRR abs/1802.01752 (2018) - [i3]Chenqi Mou, Yang Bai, Jiahua Lai:
Chordal Graphs in Triangular Decomposition in Top-Down Style. CoRR abs/1811.11023 (2018) - 2017
- [j5]Jean-Charles Faugère, Chenqi Mou:
Sparse FGLM algorithms. J. Symb. Comput. 80: 538-569 (2017) - [c2]Rina Dong, Chenqi Mou:
Decomposing Polynomial Sets Simultaneously into Gröbner Bases and Normal Triangular Sets. CASC 2017: 77-92 - [i2]Dongming Wang, Rina Dong, Chenqi Mou:
Decomposition of polynomial sets into characteristic pairs. CoRR abs/1702.08664 (2017) - 2016
- [j4]Wei Niu, Jian Shi, Chenqi Mou:
Analysis of codimension 2 bifurcations for high-dimensional discrete systems using symbolic computation methods. Appl. Math. Comput. 273: 934-947 (2016) - 2013
- [b1]Chenqi Mou:
Solving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications. Pierre and Marie Curie University, Paris, France, 2013 - [j3]Chenqi Mou, Dongming Wang, Xiaoliang Li:
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case. Theor. Comput. Sci. 468: 102-113 (2013) - [i1]Jean-Charles Faugère, Chenqi Mou:
Sparse FGLM algorithms. CoRR abs/1304.1238 (2013) - 2011
- [j2]Xiaoliang Li, Chenqi Mou, Wei Niu, Dongming Wang:
Stability Analysis for Discrete Biological Models Using Algebraic Methods. Math. Comput. Sci. 5(3): 247-262 (2011) - [c1]Jean-Charles Faugère, Chenqi Mou:
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices. ISSAC 2011: 115-122 - 2010
- [j1]Xiaoliang Li, Chenqi Mou, Dongming Wang:
Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case. Comput. Math. Appl. 60(11): 2983-2997 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
