default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCunjing Ge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Cunjing Ge
:
Approximate Integer Solution Counts over Linear Arithmetic Constraints. AAAI 2024: 8022-8029- [c13]Cunjing Ge, Armin Biere:
Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints. CP 2024: 13:1-13:17 - 2023
- [i6]Cunjing Ge:
Approximate Integer Solution Counts over Linear Arithmetic Constraints. CoRR abs/2312.08776 (2023) - 2021
- [c12]Cunjing Ge, Armin Biere:
Decomposition Strategies to Count Integer Solutions over Linear Constraints. IJCAI 2021: 1389-1395 - [c11]Jiwei Jin, Yiqi Lv, Cunjing Ge, Feifei Ma, Jian Zhang:
Investigating the Existence of Costas Latin Squares via Satisfiability Testing. SAT 2021: 270-279 - 2020
- [i5]Jian Zhang, Cunjing Ge, Feifei Ma:
Counting the Number of Solutions to Constraints. CoRR abs/2012.14366 (2020)
2010 – 2019
- 2019
- [c10]Martin Aleksandrov, Cunjing Ge, Toby Walsh:
Fair Division Minimizing Inequality. EPIA (2) 2019: 593-605 - [c9]Cunjing Ge, Feifei Ma, Xutong Ma, Fan Zhang, Pei Huang, Jian Zhang:
Approximating Integer Solution Counting via Space Quantification for Linear Constraints. IJCAI 2019: 1697-1703 - [c8]Pei Huang, Minghao Liu, Cunjing Ge, Feifei Ma, Jian Zhang:
Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing. ISSAC 2019: 203-210 - 2018
- [j1]Cunjing Ge, Feifei Ma, Peng Zhang, Jian Zhang:
Computing and estimating the volume of the solution space of SMT(LA) constraints. Theor. Comput. Sci. 743: 110-129 (2018) - [c7]Cunjing Ge, Feifei Ma, Jian Zhang:
VolCE: An Efficient Tool for Solving #SMT(LA) Problems. PRUV@IJCAR 2018 - [c6]Cunjing Ge, Feifei Ma, Tian Liu, Jian Zhang, Xutong Ma:
A New Probabilistic Algorithm for Approximate Model Counting. PRUV@IJCAR 2018 - [c5]Cunjing Ge, Feifei Ma, Tian Liu, Jian Zhang, Xutong Ma:
A New Probabilistic Algorithm for Approximate Model Counting. IJCAR 2018: 312-328 - [c4]Pei Huang, Feifei Ma, Cunjing Ge, Jian Zhang, Hantao Zhang:
Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing. IJCAR 2018: 354-369 - [c3]Cunjing Ge, Jiwei Yan, Jun Yan, Jian Zhang:
Checking Activity Transition Systems with Back Transitions Against Assertions. ICFEM 2018: 388-403 - [i4]Martin Aleksandrov, Cunjing Ge, Toby Walsh:
Fair Division Minimizing Inequality. CoRR abs/1810.04259 (2018) - 2017
- [i3]Cunjing Ge, Feifei Ma, Tian Liu, Jian Zhang:
A New Probabilistic Algorithm for Approximate Model Counting. CoRR abs/1706.03906 (2017) - 2015
- [c2]Cunjing Ge, Feifei Ma:
A Fast and Practical Method to Estimate Volumes of Convex Polytopes. FAW 2015: 52-65 - [c1]Cunjing Ge, Feifei Ma, Jeff Huang, Jian Zhang:
SMT Solving for the Theory of Ordering Constraints. LCPC 2015: 287-302 - [i2]Cunjing Ge, Feifei Ma, Jian Zhang:
A Tool for Computing and Estimating the Volume of the Solution Space of SMT(LA). CoRR abs/1507.00142 (2015) - 2014
- [i1]Cunjing Ge, Feifei Ma, Jian Zhang:
A Fast and Practical Method to Estimate Volumes of Convex Polytopes. CoRR abs/1401.0120 (2014)
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 2024-10-07 21:26 CEST 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:
