The following pages link to Domenico Cantone (Q313071):
Displaying 50 items.
- (Q3384163) (← links)
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM (Q3421840) (← links)
- (Q3437734) (← links)
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133) (← links)
- (Q3475242) (← links)
- (Q3489978) (← links)
- (Q3491017) (← links)
- ON SOME COMBINATORIAL PROBLEMS CONCERNING THE HARMONIC STRUCTURE OF MUSICAL CHORD SEQUENCES (Q3532143) (← links)
- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach (Q3575255) (← links)
- (Q3594047) (← links)
- Pattern Matching with Swaps for Short Patterns in Linear Time (Q3599078) (← links)
- Pattern Matching for Control Chart Monitoring (Q3618237) (← links)
- (Q3645585) (← links)
- A New Algorithm for Efficient Pattern Matching with Swaps (Q3651549) (← links)
- NEW EFFICIENT BIT-PARALLEL ALGORITHMS FOR THE (δ, α)-MATCHING PROBLEM WITH APPLICATIONS IN MUSIC INFORMATION RETRIEVAL (Q3655539) (← links)
- Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator (Q3705420) (← links)
- Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx} (Q3726080) (← links)
- Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae (Q3787974) (← links)
- Decision algorithms for some fragments of analysis and related areas (Q3803084) (← links)
- (Q3819041) (← links)
- (Q3999861) (← links)
- (Q4234182) (← links)
- (Q4263009) (← links)
- (Q4268492) (← links)
- Decision problems for Tarski and Presburger arithmetics extended with sets (Q4281682) (← links)
- Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness, and cardinality comparison (Q4313220) (← links)
- (Q4426344) (← links)
- (Q4503905) (← links)
- (Q4503906) (← links)
- An Introduction to the Technique of Formative Processes in Set Theory (Q4571911) (← links)
- Herbrand-satisfiability of a Quantified Set-theoretic Fragment* (Q4589601) (← links)
- A fast saturation strategy for set-theoretic tableaux (Q4610319) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- (Q4867922) (← links)
- Techniques of computable set theory with applications to proof verification (Q4884662) (← links)
- (Q4913613) (← links)
- A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions1 1This research has been partially supported by MURST Grant prot. 2001017741 under project “Ragionamento su aggregati e numeri a supporto del (Q4916221) (← links)
- (Q4986517) (← links)
- A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,× (Q4988948) (← links)
- An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆ (Q4991928) (← links)
- A Set-Theoretic Approach to ABox Reasoning Services (Q5086207) (← links)
- (Q5087788) (← links)
- (Q5087790) (← links)
- Yet Another Proof Without Words of the Pythagorean Theorem (Q5137098) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- Computational Logic and Set Theory (Q5198513) (← links)
- A Decision Procedure for Monotone Functions over Bounded and Complete Lattices (Q5302032) (← links)
- Verification: Theory and Practice (Q5305641) (← links)
- (Q5446121) (← links)
- An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces (Q5470203) (← links)
