The following pages link to Domenico Cantone (Q313071):
Displaying 50 items.
- \((m, n)\)-rationalizable choices (Q313072) (← links)
- Efficient string-matching allowing for non-overlapping inversions (Q390885) (← links)
- Further analysis of the remedian algorithm (Q391134) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Improved and self-tuned occurrence heuristics (Q405578) (← links)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- Text searching allowing for inversions and translocations of factors (Q496536) (← links)
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← links)
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
- (Q810488) (redirect page) (← links)
- Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators (Q810489) (← links)
- Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs (Q810491) (← links)
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux (Q877883) (← links)
- Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) (Q912082) (← links)
- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator (Q1096608) (← links)
- The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
- QuickHeapsort, an efficient mix of classical sorting algorithms (Q1608335) (← links)
- The automation of syllogistic. II: Optimization and complexity issues (Q1813824) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- Choice resolutions (Q2235096) (← links)
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate (Q2252530) (← links)
- The order-preserving pattern matching problem in practice (Q2295620) (← links)
- Web ontology representation and reasoning via fragments of set theory (Q2360184) (← links)
- Congruence relations on a choice space (Q2417402) (← links)
- Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates (Q2457362) (← links)
- Resolutions of convex geometries (Q2665967) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- A decidable theory involving addition of differentiable real functions (Q2699966) (← links)
- (Q2721193) (← links)
- (Q2728898) (← links)
- (Q2728905) (← links)
- Set theory for computing. From decision procedures to declarative programming with sets. Foreword by Jacob T. Schwartz (Q2740887) (← links)
- On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic (Q2841956) (← links)
- A graphical representation of relational formulae with complementation (Q2889180) (← links)
- Dual tableau-based decision procedures for relational logics with restricted composition operator (Q2901210) (← links)
- Pattern matching with swaps in practice (Q2909198) (← links)
- Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts (Q2909199) (← links)
- A decidable quantified fragment of set theory involving ordered pairs with applications to description logics (Q2915678) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- (Q3002400) (← links)
- Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions (Q3011868) (← links)
- Topological syllogistic with continuous and closed functions (Q3033355) (← links)
- Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
- (Q3342579) (← links)
- The quest for Diophantine finite-fold-ness (Q3383639) (← links)
