• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 18 matches

• 2023
• 
  Xavier Tannier, Perceval Wajsbürt, Alice Calliger, Basile Dura, Alexandre Mouchet, Martin Hilka, Romain Bey:
  Development and validation of a natural language processing algorithm to pseudonymize documents in the context of a clinical data warehouse. CoRR abs/2303.13451 (2023)
• 2021
• 
  Alexandre Calado, Vito Errico, Giovanni Saggio:
  Toward the Minimum Number of Wearables to Recognize Signer-Independent Italian Sign Language With Machine-Learning Algorithms. IEEE Trans. Instrum. Meas. 70: 1-9 (2021)
• 2014
• 
  Adam Lugowski:
  Scalable Graph Algorithms in a High-Level Language Using Primitives Inspired by Linear Algebra. University of California, Santa Barbara, USA, 2014
• 2012
• 
  Adam Pauls:
  Optimal Search Algorithms for Structured Problems in Natural Language Processing. University of California, Berkeley, USA, 2012
• 2008
• 
  Cristian S. Calude, Marius Zimand:
  Algorithmically Independent Sequences. Developments in Language Theory 2008: 183-195
• 2006
• 
  Leslie Lamport:
  The ⁺CAL Algorithm Language. FORTE 2006: 23
• 
  Leslie Lamport:
  The +CAL Algorithm Language. NCA 2006: 5
• 2005
• 
  Antonella Guzzo:
  Languages, algorithms and methods for modelling, reasoning on, and mining workflows. University of Calabria, Italy, 2005
• 2000
• 
  Sergey Berezin, Edmund M. Clarke, Somesh Jha, Will Marrero:
  Model checking algorithms for the µ-calculus. Proof, Language, and Interaction 2000: 309-338
• 1997
• 
  Deepak Goyal, Robert Paige:
  The formal reconstruction and speedup of the linear time fragment of Willard's relational calculus subset. Algorithmic Languages and Calculi 1997: 382-414
• 
  Theodore S. Norvell:
  Predicative semantics of loops. Algorithmic Languages and Calculi 1997: 415-437
• 1994
• 
  Eugeniusz Eberbach:
  Semal: a Cost Language Based on the Calculus of Self-Modifiable Algorithms. Int. J. Softw. Eng. Knowl. Eng. 4(3): 391-408 (1994)
• 1993
• 
  Cristian Calude:
  Borel Normality and Algorithmic Randomness. Developments in Language Theory 1993: 113-129
• 
  Cristian Calude, Arto Salomaa:
  Algorithmically Coding the Universe. Developments in Language Theory 1993: 472-492
• 
  Eugeniusz Eberbach:
  The Design and Specification of SEMAL - A Cost Language Based on the Calculus of Self-Modifiable Algorithms. SEKE 1993: 166-173
• 1990
• 
  Jean-Marc Boï, Antoine Rauzy:
  Two Algorithms for Constraint Systems Solving in Propositional Calculus and their Implementation in Constraint Programming Languages. AIMSA 1990: 139-148
• 1974
• 
  Ian Kirkland Livingstone:
  A λ-calculus interpreter and its relationship to algorithmic languages. Imperial College London, UK, 1974
• 1971
• 
  Calvin C. Elgot:
  Algebraic theories and program schemes. Symposium on Semantics of Algorithmic Languages 1971: 71-88