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

• 2020
• 
  Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly:
  Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. Comput. 9(3-4): 167-168 (2020)
• 
  Matthew de Brecht, Arno Pauly, Matthias Schröder:
  Overt choice. Comput. 9(3-4): 169-191 (2020)
• 
  Cristian S. Calude, Monica Dumitrescu:
  A statistical anytime algorithm for the Halting Problem. Comput. 9(2): 155-166 (2020)
• 
  Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski:
  New bounds on the strength of some restrictions of Hindman's Theorem. Comput. 9(2): 139-153 (2020)
• 
  Peter A. Cholak, Damir D. Dzhafarov, Denis R. Hirschfeldt, Ludovic Patey:
  Some results concerning the SRT22 vs. COH problem. Comput. 9(3-4): 193-217 (2020)
• 
  Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud:
  Degrees of categoricity above limit ordinals. Comput. 9(2): 127-137 (2020)
• 
  Caleb Davis, Denis R. Hirschfeldt, Jeffry L. Hirst, Jake Pardo, Arno Pauly, Keita Yokoyama:
  Combinatorial principles equivalent to weak induction. Comput. 9(3-4): 219-229 (2020)
• 
  Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt, Ludovic Patey, Arno Pauly:
  Ramsey's theorem and products in the Weihrauch degrees. Comput. 9(2): 85-110 (2020)
• 
  Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
  Diminishable parameterized problems and strict polynomial kernelization. Comput. 9(1): 1-24 (2020)
• 
  Peter Gerdes:
  An ω-REA set forming a minimal pair with 0~′. Comput. 9(1): 37-50 (2020)
• 
  Jun Le Goh:
  Compositions of multivalued functions. Comput. 9(3-4): 231-247 (2020)
• 
  Peter Hertling:
  Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations. Comput. 9(3-4): 249-307 (2020)
• 
  Jeffry L. Hirst:
  Leaf management. Comput. 9(3-4): 309-314 (2020)
• 
  Reese Johnston:
  Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory. Comput. 9(2): 111-125 (2020)
• 
  Pietro Milici:
  A differential extension of Descartes' foundational approach: A new balance between symbolic and analog computation. Comput. 9(1): 51-83 (2020)
• 
  Takako Nemoto:
  A constructive proof of the dense existence of nowhere-differentiable functions in C[0, 1]. Comput. 9(3-4): 315-326 (2020)
• 
  Victor L. Selivanov:
  Q-Wadge degrees as free structures. Comput. 9(3-4): 327-341 (2020)
• 
  Paul Shafer:
  The strength of compactness for countable complete linear orders. Comput. 9(1): 25-36 (2020)
• 2019
• 
  Uri Andrews, Andrea Sorbi:
  Joins and meets in the structure of ceers. Comput. 8(3-4): 193-241 (2019)
• 
  Mark Armstrong, Jeffery I. Zucker:
  Notions of semicomputability in topological algebras over the reals. Comput. 8(1): 1-26 (2019)
• 
  Eric P. Astor, Denis R. Hirschfeldt:
  Dense computability, upper cones, and minimal pairs. Comput. 8(2): 155-177 (2019)
• 
  Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
  Feasible set functions have small circuits. Comput. 8(1): 67-98 (2019)
• 
  Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp:
  Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. Comput. 8(3-4): 191 (2019)
• 
  Ellen Chih, Rod Downey:
  Splitting theorems and low degrees. Comput. 8(3-4): 243-252 (2019)
• 
  Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
  The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Comput. 8(3-4): 253-263 (2019)
• 
  Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
  Measuring the complexity of reductions between equivalence relations. Comput. 8(3-4): 265-280 (2019)
• 
  Guido Gherardi, Alberto Marcone, Arno Pauly:
  Projection operators in the Weihrauch lattice. Comput. 8(3-4): 281-304 (2019)
• 
  Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
  Surjective H-colouring: New hardness results. Comput. 8(1): 27-42 (2019)
• 
  Noam Greenberg, Rutger Kuyper, Dan Turetsky:
  Cardinal invariants, non-lowness classes, and Weihrauch reducibility. Comput. 8(3-4): 305-346 (2019)
• 
  Matthew Harrison-Trainor:
  A first-order theory of Ulm type. Comput. 8(3-4): 347-358 (2019)

skipping 95 more matches