Charles Jordan

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

mts: a light framework for parallelizing tree search codes.

David Avis, Charles Jordan

Optim. Methods Softw., 2021

lrsarith: a small fixed/hybrid arithmetic C library.

David Avis, Charles Jordan

CoRR, 2021

2018

mplrs: A scalable parallel vertex/facet enumeration code.

David Avis, Charles Jordan

Math. Program. Comput., 2018

Parallel Enumeration of Triangulations.

Charles Jordan, Michael Joswig, Lars Kastner

Electron. J. Comb., 2018

2016

Machine Learning with Guarantees using Descriptive Complexity and SMT Solvers.

Charles Jordan, Lukasz Kaiser

CoRR, 2016

A parallel framework for reverse search using mts.

David Avis, Charles Jordan

CoRR, 2016

The Kahr-Moore-Wang Class Contains Untestable Properties.

Charles Jordan, Thomas Zeugmann

Balt. J. Mod. Comput., 2016

Non-CNF QBF Solving with QCIR.

Charles Jordan, Will Klieber, Martina Seidl

Proceedings of the Beyond NP, 2016

2015

Comparative computational results for some vertex and facet enumeration codes.

David Avis, Charles Jordan

CoRR, 2015

2014

The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games.

Mikolas Janota, Charles Jordan, Will Klieber, Florian Lonsing, Martina Seidl, Allen Van Gelder

J. Satisf. Boolean Model. Comput., 2014

MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing.

Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013

Experiments with Reduction Finding.

Charles Jordan, Lukasz Kaiser

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

2012

Testable and untestable classes of first-order formulae.

Charles Jordan, Thomas Zeugmann

J. Comput. Syst. Sci., 2012

Experimental Descriptive Complexity.

Marco Carmosino, Neil Immerman, Charles Jordan

Proceedings of the Logic and Program Semantics, 2012

2011

Untestable Properties in the Kahr-Moore-Wang Class.

Charles Jordan, Thomas Zeugmann

Proceedings of the Logic, Language, Information and Computation, 2011

2010

A Note on the Testability of Ramsey's Class.

Charles Jordan, Thomas Zeugmann

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Untestable Properties Expressible with Four First-Order Quantifiers.

Charles Jordan, Thomas Zeugmann

Proceedings of the Language and Automata Theory and Applications, 2010

2009

Relational Properties Expressible with One Universal Quantifier Are Testable.

Charles Jordan, Thomas Zeugmann

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2008

Indistinguishability and First-Order Logic.

Skip Jordan, Thomas Zeugmann

Proceedings of the Theory and Applications of Models of Computation, 2008