Rui-Juan Jing

Orcid: 0000-0001-6932-8862

According to our database1, Rui-Juan Jing authored at least 21 papers between 2016 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Breaking the Data Barrier in Learning Symbolic Computation: A Case Study on Variable Ordering Suggestion for Cylindrical Algebraic Decomposition.
CoRR, January, 2026

Efficient detection of redundancies in systems of linear inequalities.
J. Symb. Comput., 2026

2025
A Sampling-Based Method to Estimate the Volume of Solution Space for Linear Arithmetic Constraints.
J. Syst. Sci. Complex., December, 2025

Integer Hulls, Z-Polyhedra and Presburger Arithmetic in Action.
ACM Commun. Comput. Algebra, September, 2025

Counting the number of integer points of non-parametric and parametric polytopes with the PolyhedralSets in Maple.
Maple Trans., 2025

Quantifier Elimination Over the Integers.
Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation, 2025

Synthesizing Loops from Linear Ranking Functions.
Proceedings of the Formal Methods and Software Engineering, 2025

2024
Efficient detection of redundancies in systems of linear inequalities✱.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

Counting the Integer Points of Parametric Polytopes: A Maple Implementation.
Proceedings of the Computer Algebra in Scientific Computing - 26th International Workshop, 2024

A Dataset for Suggesting Variable Orderings for Cylindrical Algebraic Decompositions.
Proceedings of the Computer Algebra in Scientific Computing - 26th International Workshop, 2024

2023
Distributed Algorithms for Boolean Equations Over Networks.
IEEE Trans. Autom. Control., November, 2023

2020
Distributedly Solving Boolean Equations over Networks.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

Complexity Estimates for Fourier-Motzkin Elimination.
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019
A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x].
Theor. Comput. Sci., 2019

The Z_Polyhedra Library in Maple.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

2017
A modular algorithm to compute the generalized Hermite normal form for Z[x]-lattices.
J. Symb. Comput., 2017

The polyhedra library in maple.
ACM Commun. Comput. Algebra, 2017

Computing the Integer Points of a Polyhedron.
Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation co-located with the 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), 2017

Computing the Integer Points of a Polyhedron, II: Complexity Estimates.
Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017

Computing the Integer Points of a Polyhedron, I: Algorithm.
Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017

2016
A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x].
CoRR, 2016


  Loading...