| The communication complexity of multiparty set disjointness under product distributions | 0 | 0.34 | 2021 |
| Fast Search with Poor OCR | 0 | 0.34 | 2020 |
| Transcription Alignment for Highly Fragmentary Historical Manuscripts: The Dead Sea Scrolls | 0 | 0.34 | 2020 |
| Computability and Stability for Hybrid Algorithms. | 0 | 0.34 | 2019 |
| Drags: A compositional algebraic framework for graph rewriting | 0 | 0.34 | 2019 |
| Semantic Characteristics of Schizophrenic Speech. | 0 | 0.34 | 2019 |
| Well-Founded Unions. | 0 | 0.34 | 2018 |
| A Method for Segmentation, Matching and Alignment of Dead Sea Scrolls | 0 | 0.34 | 2018 |
| Graph Path Orderings. | 0 | 0.34 | 2018 |
| OCR Error Correction Using Character Correction and Feature-Based Word Classification | 4 | 0.48 | 2016 |
| 1700 Forests. | 0 | 0.34 | 2016 |
| Active Congruency-Based Reranking. | 0 | 0.34 | 2016 |
| A Hackathon for Classical Tibetan. | 0 | 0.34 | 2016 |
| Axiomatizing Analog Algorithms | 2 | 0.39 | 2016 |
| On the parallel computation thesis. | 0 | 0.34 | 2016 |
| Cayley′s Formula: A Page From The Book | 1 | 0.40 | 2016 |
| Improving OCR for an under-resourced script using unsupervised word-spotting | 2 | 0.36 | 2015 |
| Where is my Other Half? | 0 | 0.34 | 2014 |
| Yaacov Choueka: A Profile. | 0 | 0.34 | 2014 |
| Finding Inexact Quotations Within a Tibetan Buddhist Corpus. | 0 | 0.34 | 2014 |
| Inferring Paraphrases for a Highly Inflected Language from a Monolingual Corpus | 2 | 0.38 | 2014 |
| Canonical Ground Horn Theories. | 0 | 0.34 | 2013 |
| Res Publica: The Universal Model of Computation (Invited Talk). | 0 | 0.34 | 2013 |
| Modulo intervals: a proposed notation | 0 | 0.34 | 2012 |
| Language Classification and Segmentation of Noisy Documents in Hebrew Scripts. | 0 | 0.34 | 2012 |
| Jumping and escaping: Modular termination and the abstract path ordering | 2 | 0.36 | 2012 |
| Estimating the Distinctiveness of Graphemes and Allographs in Palaeographic Classification. | 0 | 0.34 | 2012 |
| From Total Assignment Enumeration to Modern SAT Solver | 0 | 0.34 | 2011 |
| Unsupervised decomposition of a document into authorial components | 15 | 1.04 | 2011 |
| A Formalization And Proof Of The Extended Church-Turing Thesis | 5 | 0.45 | 2011 |
| Computerized Paleography: Tools For Historical Manuscripts | 3 | 0.42 | 2011 |
| Identifying Join Candidates in the Cairo Genizah | 19 | 1.30 | 2011 |
| Automatic Extraction of Catalog Data from Genizah Fragments' Images. | 0 | 0.34 | 2011 |
| Exact exploration and hanging algorithms | 7 | 0.58 | 2010 |
| Unconventional Computation, 8th International Conference, UC 2009, Ponta Delgada, Azores, Portugal, September 7-11, 2009. Proceedings | 31 | 4.63 | 2009 |
| On Lazy Commutation | 1 | 0.43 | 2009 |
| More Patterns in Trees: Up and Down, Young and Old, Odd and Even | 1 | 0.35 | 2009 |
| The church-turing thesis over arbitrary domains | 13 | 0.71 | 2008 |
| Bit Inference | 0 | 0.34 | 2008 |
| Pillars of computer science: essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday | 37 | 4.14 | 2008 |
| A Natural Axiomatization of Computability and Proof of Church's Thesis | 32 | 1.60 | 2008 |
| Complexity of propositional proofs under a promise | 0 | 0.34 | 2007 |
| Leanest quasi-orderings | 0 | 0.34 | 2007 |
| Towards a better understanding of the functionality of a conflict-driven SAT solver | 6 | 0.58 | 2007 |
| Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings | 37 | 2.16 | 2007 |
| Enumeration Problems Related to Ground Horn Theories | 1 | 0.34 | 2006 |
| A hypercomputational alien | 2 | 0.52 | 2006 |
| Abstract Effective Models | 4 | 0.46 | 2006 |
| Boolean rings for intersection-based satisfiability | 1 | 0.38 | 2006 |
| Open. Closed. Open | 3 | 0.40 | 2005 |
