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

• 2000
• 
  Béla Bajnok:
  Spherical Designs and Generalized Sum-Free Sets in Abelian Groups. Des. Codes Cryptogr. 21(1/3): 11-18 (2000)
• 
  Ronald D. Baker, Jeremy M. Dover, Gary L. Ebert, Kenneth L. Wantz:
  Perfect Baer Subplane Partitions and Three-Dimensional Flag-Transitive Planes. Des. Codes Cryptogr. 21(1/3): 19-39 (2000)
• 
  Peter Beelen, Ruud Pellikaan:
  The Newton Polygon of Plane Curves with Many Rational Points. Des. Codes Cryptogr. 21(1/3): 41-67 (2000)
• 
  Aart Blokhuis, Willem H. Haemers:
  Preface. Des. Codes Cryptogr. 21(1/3): 5 (2000)
• 
  Andries E. Brouwer:
  Locally Paley Graphs. Des. Codes Cryptogr. 21(1/3): 69-76 (2000)
• 
  N. G. de Bruijn:
  Jaap Seidel 80. Des. Codes Cryptogr. 21(1/3): 7-10 (2000)
• 
  Frans C. Bussemaker, Willem H. Haemers, Edward Spence:
  The Search for Pseudo Orthogonal Latin Squares of Order Six. Des. Codes Cryptogr. 21(1/3): 77-82 (2000)
• 
  Frank De Clerck, Mario Delanote:
  Two-Weight Codes, Partial Geometries and Steiner Systems. Des. Codes Cryptogr. 21(1/3): 87-98 (2000)
• 
  Edwin R. van Dam:
  A Characterization of Association Schemes from Affine Spaces. Des. Codes Cryptogr. 21(1/3): 83-86 (2000)
• 
  Ralf Gramlich, Hendrik Van Maldeghem:
  Epimorphisms of Generalized Polygons Part 1: Geometrical Characterizations. Des. Codes Cryptogr. 21(1/3): 99-111 (2000)
• 
  Yury J. Ionin, Mohan S. Shrikhande:
  Strongly Regular Graphs and Designs with Three Intersection Numbers. Des. Codes Cryptogr. 21(1/3): 113-125 (2000)
• 
  Aleksandar Jurisic, Jack H. Koolen:
  A Local Approach to 1-Homogeneous Graphs. Des. Codes Cryptogr. 21(1/3): 127-147 (2000)
• 
  Jack H. Koolen, Monique Laurent, Alexander Schrijver:
  Equilateral Dimension of the Rectilinear Space. Des. Codes Cryptogr. 21(1/3): 149-164 (2000)
• 
  Johannes G. Maks, Juriaan Simonis:
  Optimal Subcodes of Second Order Reed-Muller Codes and Maximal Linear Spaces of Bivectors of Maximal Rank. Des. Codes Cryptogr. 21(1/3): 165-180 (2000)
• 
  William J. Martin:
  Minimum Distance Bounds for -Regular Codes. Des. Codes Cryptogr. 21(1/3): 181-187 (2000)
• 
  Bernhard Mühlherr:
  On Isomorphisms between Coxeter Groups. Des. Codes Cryptogr. 21(1/3): 189-189 (2000)
• 
  Leanne J. Rylands, Donald E. Taylor:
  Constructions for Octonion and Exceptional Jordan Algebras. Des. Codes Cryptogr. 21(1/3): 191-203 (2000)
• 
  Ákos Seress:
  Large Families of Cospectral Graphs. Des. Codes Cryptogr. 21(1/3): 205-208 (2000)
• 
  Ronald Shaw:
  Subsets of PG(n, 2) and Maximal Partial Spreads in PG(4, 2). Des. Codes Cryptogr. 21(1/3): 209-222 (2000)
• 
  Irfan Siap, Dwijendra K. Ray-Chaudhuri:
  New Linear Codes Over and and Improvements on Bounds. Des. Codes Cryptogr. 21(1/3): 223-233 (2000)
• 
  Leo Storme, Zsuzsa Weiner:
  On 1-Blocking Sets in PG(n, q), n >= 3. Des. Codes Cryptogr. 21(1/3): 235-251 (2000)