• 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 27 matches

• 2022
• 
  Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro:
  Calculating the Mind Change Complexity of Learning Algebraic Structures. CiE 2022: 1-12
• 
  Nikolay Bazhenov, Maxim V. Zubkov:
  Well-Orders Realized by C.E. Equivalence Relations. CiE 2022: 13-23
• 
  Ingo Blechschmidt, Peter Schuster:
  Maximal Ideals in Countable Rings, Constructively. CiE 2022: 24-38
• 
  Olivier Bournez:
  Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language. CiE 2022: 39-51
• 
  Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov:
  Enumerating Classes of Effective Quasi-Polish Spaces. CiE 2022: 88-102
• 
  Véronique Bruyère:
  A Game-Theoretic Approach for the Synthesis of Complex Systems. CiE 2022: 52-63
• 
  Merlin Carl:
  Lower Bounds on β (α ). CiE 2022: 64-73
• 
  Anupam Das, Avgerinos Delkos:
  Proof Complexity of Monotone Branching Programs. CiE 2022: 74-87
• 
  Vanja Doskoc, Timo Kötzing:
  Maps of Restrictions for Behaviourally Correct Learning. CiE 2022: 103-114
• 
  Makoto Fujiwara:
  An Extension of the Equivalence Between Brouwer's Fan Theorem and Weak König's Lemma with a Uniqueness Hypothesis. CiE 2022: 115-124
• 
  Lauri Hella, Miikka Vilander:
  Defining Long Words Succinctly in FO and MSO. CiE 2022: 125-138
• 
  María Dolores Jiménez-López:
  Processing Natural Language with Biomolecules: Where Linguistics, Biology and Computation Meet. CiE 2022: 139-150
• 
  Bjørn Kjos-Hanssen, David J. Webb:
  Strong Medvedev Reducibilities and the KL-Randomness Problem. CiE 2022: 151-161
• 
  Robert S. Lubarsky:
  On the Necessity of Some Topological Spaces. CiE 2022: 162-171
• 
  Samuele Maschio, Pietro Sabelli:
  On the Compatibility Between the Minimalist Foundation and Constructive Set Theory. CiE 2022: 172-185
• 
  Kitty Meeks:
  Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes. CiE 2022: 186-195
• 
  Juvenal Murwanashyaka:
  Hilbert's Tenth Problem for Term Algebras with a Substitution Operator. CiE 2022: 196-207
• 
  Juvenal Murwanashyaka:
  Weak Sequential Theories of Finite Full Binary Trees. CiE 2022: 208-219
• 
  Eike Neumann:
  On Envelopes and Backward Approximations. CiE 2022: 220-233
• 
  Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu:
  On Trees Without Hyperimmune Branches. CiE 2022: 234-245
• 
  Iosif Petrakis, Daniel Misselbeck-Wessel:
  Algebras of Complemented Subsets. CiE 2022: 246-258
• 
  Cécilia Pradic, Giovanni Soldà:
  On the Weihrauch Degree of the Additive Ramsey Theorem over the Rationals. CiE 2022: 259-271
• 
  Sam Sanders:
  Reverse Mathematics of the Uncountability of ℝ. CiE 2022: 272-286
• 
  Victor L. Selivanov:
  Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory. CiE 2022: 287-298
• 
  Svetlana Selivanova:
  Computational Complexity of Classical Solutions of Partial Differential Equations. CiE 2022: 299-312
• 
  William R. Stirton:
  Barendregt's Problem #26 and Combinatory Strong Reduction. CiE 2022: 313-326
• 
  Ulrich Berger, Johanna N. Y. Franklin, Florin Manea, Arno Pauly:
  Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings. Lecture Notes in Computer Science 13359, Springer 2022, ISBN 978-3-031-08739-4 [contents]