Set theory for computing: from decision procedures to declarative programming with sets D Cantone, E Omodeo, A Policriti Springer Science & Business Media, 2013 | 169 | 2013 |

Computable set theory D Cantone, A Ferro, E Omodeo Clarendon Press, 1989 | 139 | 1989 |

Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces D Cantone, A Ferro, A Pulvirenti, DR Recupero, D Shasha IEEE Transactions on Knowledge and Data Engineering 17 (4), 535-550, 2005 | 84 | 2005 |

**Fast-Search**: A New Efficient Variant of the Boyer-Moore String Matching AlgorithmD Cantone, S Faro International Workshop on Experimental and Efficient Algorithms, 47-58, 2003 | 65 | 2003 |

Computational logic and set theory: Applying formalized logic to analysis JT Schwartz, D Cantone, EG Omodeo Springer Science & Business Media, 2011 | 64 | 2011 |

An efficient algorithm for the approximate median selection problem S Battiato, D Cantone, D Catalano, G Cincotti, M Hofri Italian Conference on Algorithms and Complexity, 226-238, 2000 | 49 | 2000 |

The automation of syllogistic D Cantone, EG Omodeo, A Policriti Journal of Automated Reasoning 6 (2), 173-187, 1990 | 47 | 1990 |

A computerized referee EG Omodeo, D Cantone, A Policriti, JT Schwartz Reasoning, Action and Interaction in AI Theories and Systems, 117-139, 2006 | 36 | 2006 |

A new fast tableau-based decision procedure for an unquantified fragment of set theory D Cantone, CG Zarba International Workshop on First-Order Theorem Proving, 126-136, 1998 | 36 | 1998 |

Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators D Cantone Journal of Automated Reasoning 7 (2), 193-230, 1991 | 35 | 1991 |

Notes from the logbook of a proof-checker’s project D Cantone, EG Omodeo, JT Schwartz, P Ursino Verification: Theory and Practice, 182-207, 2003 | 31 | 2003 |

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach D Cantone, S Faro, E Giaquinta Annual Symposium on Combinatorial Pattern Matching, 288-298, 2010 | 29 | 2010 |

Fast-search algorithms: New efficient variants of the Boyer-Moore pattern-matching algorithm D Cantone, S Faro J. Autom. Lang. Comb. 10 (5/6), 589-608, 2005 | 29 | 2005 |

Efficient string-matching allowing for non-overlapping inversions. D Cantone, S Cristofaro, S Faro Theor. Comput. Sci. 483, 85-95, 2013 | 27 | 2013 |

Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm D Cantone, S Faro Electronic Notes in Discrete Mathematics 17, 81-86, 2004 | 27 | 2004 |

Set-theoretic reductions of Hilbert's tenth problem D Cantone, V Cutello, A Policriti International Workshop on Computer Science Logic, 65-75, 1989 | 27 | 1989 |

QuickHeapsort, an efficient mix of classical sorting algorithms D Cantone, G Cincotti Theoretical Computer Science 285 (1), 25-42, 2002 | 26 | 2002 |

An efficient algorithm for δ-approximate matching with α-bounded gaps in musical sequences D Cantone, S Cristofaro, S Faro International Workshop on Experimental and Efficient Algorithms, 428-439, 2005 | 25 | 2005 |

Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator D Cantone, A Ferro, JT Schwartz Journal of Computer and System Sciences 34 (1), 1-18, 1987 | 25 | 1987 |

Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(*x*)={{*y*}| *y* ϵ *x*}D Cantone, A Ferro, G Sorace, B Micale Communications on Pure and Applied Mathematics 40 (1), 37-77, 1987 | 24* | 1987 |