Feifei Ma - Citegraph

Author Info

Name	Affiliation	Papers
FEIFEI MA	State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences, and Graduate University, Chinese Academy of Sciences,	37
Collaborators	Citations	PageRank
65	58	13.64
Referers	Referees	References
161	626	309

Search Limit

100626

Publications (37 rows)

Collaborators (65 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis	0	0.34	2022
AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis.	0	0.34	2022
Word Level Robustness Enhancement: Fight Perturbation with Perturbation.	0	0.34	2022
Solving multi-objective constrained minimum weighted bipartite assignment problem: a case study on energy-aware radio broadcast scheduling	0	0.34	2022
ε-weakened Robustness of Deep Neural Networks	0	0.34	2022
Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5	0	0.34	2021
Investigating the Existence of Costas Latin Squares via Satisfiability Testing	0	0.34	2021
A decomposition-based memetic algorithm using helper objectives for shortwave radio broadcast resource allocation problem in China	0	0.34	2020
Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks.	0	0.34	2020
Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring.	0	0.34	2019
SMT-based Multi-objective Optimization for Scheduling of MPSoC Applications	0	0.34	2019
Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing	0	0.34	2019
Approximating Integer Solution Counting via Space Quantification for Linear Constraints.	0	0.34	2019
On some matching problems under the color-spanning model	0	0.34	2019
VolCE: An Efficient Tool for Solving #SMT(LA) Problems.	0	0.34	2018
Computing and estimating the volume of the solution space of SMT(LA) constraints.	2	0.40	2018
Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing.	0	0.34	2018
A New Probabilistic Algorithm for Approximate Model Counting.	0	0.34	2018
A Community-Division Based Algorithm for Finding Relations Among Linear Constraints.	0	0.34	2018
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model.	1	0.36	2018
Integrating Ilp And Smt For Shortwave Radio Broadcast Resource Allocation And Frequency Assignment	0	0.34	2017
Weak QMV algebras and some ring-like structures.	0	0.34	2017
Generating Covering Arrays with Pseudo-Boolean Constraint Solving and Balancing Heuristic.	1	0.34	2016
Lightweight Method-Level Energy Consumption Estimation for Android Applications	1	0.36	2016
Optimizing Shortwave Radio Broadcast Resource Allocation Via Pseudo-Boolean Constraint Solving And Local Search	3	0.47	2016
SMT Solving for the Theory of Ordering Constraints.	0	0.34	2015
A Tool for Computing and Estimating the Volume of the Solution Space of SMT(LA)	0	0.34	2015
A Fast and Practical Method to Estimate Volumes of Convex Polytopes.	1	0.37	2014
Finding orthogonal latin squares using finite model searching tools	21	0.51	2013
Solving generalized optimization problems subject to SMT constraints	2	0.38	2012
Faulty interaction identification via constraint solving and optimization	6	0.44	2012
An Efficient Lazy SMT Solver for Nonlinear Numerical Constraints	0	0.34	2012
Constraint solving techniques for software testing and analysis	2	0.35	2010
Volume Computation for Boolean Combination of Linear Arithmetic Constraints	12	0.74	2009
Solving Global Unconstrained Optimization Problems by Symmetry-Breaking	2	0.37	2009
Finding Orthogonal Arrays Using Satisfiability Checkers and Symmetry Breaking Constraints	3	0.42	2008
Computer Search for Large Sets of Idempotent Quasigroups	1	0.36	2007