Charles Jordan

According to our database1, Charles Jordan authored at least 19 papers between 2008 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
lrsarith: a small fixed/hybrid arithmetic C library.
CoRR, 2021

2018
mplrs: A scalable parallel vertex/facet enumeration code.
Math. Program. Comput., 2018

Parallel Enumeration of Triangulations.
Electron. J. Comb., 2018

2017
mts: a light framework for parallelizing tree search codes.
CoRR, 2017

2016
Machine Learning with Guarantees using Descriptive Complexity and SMT Solvers.
CoRR, 2016

A parallel framework for reverse search using mts.
CoRR, 2016

The Kahr-Moore-Wang Class Contains Untestable Properties.
Balt. J. Mod. Comput., 2016

Non-CNF QBF Solving with QCIR.
Proceedings of the Beyond NP, 2016

2015
Comparative computational results for some vertex and facet enumeration codes.
CoRR, 2015

2014
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games.
J. Satisf. Boolean Model. Comput., 2014

MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013
Experiments with Reduction Finding.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

2012
Testable and untestable classes of first-order formulae.
J. Comput. Syst. Sci., 2012

Experimental Descriptive Complexity.
Proceedings of the Logic and Program Semantics, 2012

2011
Untestable Properties in the Kahr-Moore-Wang Class.
Proceedings of the Logic, Language, Information and Computation, 2011

2010
A Note on the Testability of Ramsey's Class.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Untestable Properties Expressible with Four First-Order Quantifiers.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
Relational Properties Expressible with One Universal Quantifier Are Testable.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2008
Indistinguishability and First-Order Logic.
Proceedings of the Theory and Applications of Models of Computation, 2008


  Loading...