default search action
Charles Jordan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]David Avis, Charles Jordan:
Parallel Redundancy Removal in lrslib with Application to Projections. CoRR abs/2406.00065 (2024) - 2021
- [j6]David Avis, Charles Jordan:
mts: a light framework for parallelizing tree search codes. Optim. Methods Softw. 36(2-3): 279-300 (2021) - [i7]David Avis, Charles Jordan:
lrsarith: a small fixed/hybrid arithmetic C library. CoRR abs/2101.12425 (2021)
2010 – 2019
- 2018
- [j5]Charles Jordan, Michael Joswig, Lars Kastner
:
Parallel Enumeration of Triangulations. Electron. J. Comb. 25(3): 3 (2018) - [j4]David Avis, Charles Jordan:
mplrs: A scalable parallel vertex/facet enumeration code. Math. Program. Comput. 10(2): 267-302 (2018) - 2017
- [i6]Charles Jordan, Michael Joswig, Lars Kastner:
Parallel Enumeration of Triangulations. CoRR abs/1709.04746 (2017) - [i5]David Avis, Charles Jordan:
mts: a light framework for parallelizing tree search codes. CoRR abs/1709.07605 (2017) - 2016
- [j3]Charles Jordan, Thomas Zeugmann:
The Kahr-Moore-Wang Class Contains Untestable Properties. Balt. J. Mod. Comput. 4(4) (2016) - [c9]Charles Jordan, Will Klieber, Martina Seidl:
Non-CNF QBF Solving with QCIR. AAAI Workshop: Beyond NP 2016 - [i4]Charles Jordan, Lukasz Kaiser:
Machine Learning with Guarantees using Descriptive Complexity and SMT Solvers. CoRR abs/1609.02664 (2016) - [i3]David Avis, Charles Jordan:
A parallel framework for reverse search using mts. CoRR abs/1610.07735 (2016) - 2015
- [i2]David Avis, Charles Jordan:
Comparative computational results for some vertex and facet enumeration codes. CoRR abs/1510.02545 (2015) - [i1]David Avis, Charles Jordan:
mplrs: A scalable parallel vertex/facet enumeration code. CoRR abs/1511.06487 (2015) - 2014
- [j2]Mikolas Janota, Charles Jordan, Will Klieber, Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games. J. Satisf. Boolean Model. Comput. 9(1): 187-206 (2014) - [c8]Charles Jordan, Lukasz Kaiser, Florian Lonsing
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. SAT 2014: 430-437 - 2013
- [c7]Charles Jordan, Lukasz Kaiser:
Experiments with Reduction Finding. SAT 2013: 192-207 - 2012
- [j1]Charles Jordan, Thomas Zeugmann:
Testable and untestable classes of first-order formulae. J. Comput. Syst. Sci. 78(5): 1557-1578 (2012) - [c6]Marco Carmosino, Neil Immerman, Charles Jordan:
Experimental Descriptive Complexity. Logic and Program Semantics 2012: 24-34 - 2011
- [c5]Charles Jordan, Thomas Zeugmann:
Untestable Properties in the Kahr-Moore-Wang Class. WoLLIC 2011: 176-186 - 2010
- [c4]Charles Jordan, Thomas Zeugmann:
Untestable Properties Expressible with Four First-Order Quantifiers. LATA 2010: 333-343 - [c3]Charles Jordan, Thomas Zeugmann:
A Note on the Testability of Ramsey's Class. TAMC 2010: 296-307
2000 – 2009
- 2009
- [c2]Charles Jordan, Thomas Zeugmann:
Relational Properties Expressible with One Universal Quantifier Are Testable. SAGA 2009: 141-155 - 2008
- [c1]Skip Jordan, Thomas Zeugmann:
Indistinguishability and First-Order Logic. TAMC 2008: 94-104
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-07-25 19:32 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: