• 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

• 2010
• 
  Krishnasamy Thiru Arasu, Alex J. Gutman:
  Circulant weighing matrices. Cryptogr. Commun. 2(2): 155-171 (2010)
• 
  José Andrés Armario:
  On an inequivalence criterion for cocyclic Hadamard matrices. Cryptogr. Commun. 2(2): 247-259 (2010)
• 
  Darcy Best, Hadi Kharaghani:
  Unbiased complex Hadamard matrices and bases. Cryptogr. Commun. 2(2): 199-209 (2010)
• 
  E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson:
  Asymptotic enumeration of correlation-immune boolean functions. Cryptogr. Commun. 2(1): 111-126 (2010)
• 
  Padraig Ó Catháin, Richard M. Stafford:
  On twin prime power Hadamard matrices. Cryptogr. Commun. 2(2): 261-269 (2010)
• 
  J. F. Dillon:
  Some REALLY beautiful Hadamard matrices. Cryptogr. Commun. 2(2): 271-292 (2010)
• 
  Dane L. Flannery, Kathy J. Horadam:
  Guest editorial for the special issue on design theory. Cryptogr. Commun. 2(2): 127-128 (2010)
• 
  Ruchi Gode, Sugata Gangopadhyay:
  Third-order nonlinearities of a subclass of Kasami functions. Cryptogr. Commun. 2(1): 69-83 (2010)
• 
  Tor Helleseth, Alexander Kholosha:
  x^2l+1+x+a and related affine polynomials over GF (2^k). Cryptogr. Commun. 2(1): 85-109 (2010)
• 
  Kathy J. Horadam:
  Hadamard matrices and their applications: Progress 2007-2010. Cryptogr. Commun. 2(2): 129-154 (2010)
• 
  Michael Huber:
  Combinatorial bounds and characterizations of splitting authentication codes. Cryptogr. Commun. 2(2): 173-185 (2010)
• 
  Philippe Jaming, Máté Matolcsi, Péter Móra:
  The problem of mutually unbiased bases in dimension 6. Cryptogr. Commun. 2(2): 211-220 (2010)
• 
  Aleksandar Kircanski, Amr M. Youssef:
  On the structural weakness of the GGHN stream cipher. Cryptogr. Commun. 2(1): 1-17 (2010)
• 
  Warwick de Launey, Daniel M. Gordon:
  On the density of the set of known Hadamard orders. Cryptogr. Commun. 2(2): 233-246 (2010)
• 
  Warwick de Launey, David A. Levin:
  A Fourier-analytic approach to counting partial Hadamard matrices. Cryptogr. Commun. 2(2): 307-334 (2010)
• 
  Alina Ostafe, Igor E. Shparlinski:
  Pseudorandom numbers and hash functions from iterations of multivariate polynomials. Cryptogr. Commun. 2(1): 49-67 (2010)
• 
  Mikko Pelto:
  New bounds for (r, <= 2)-identifying codes in the infinite king grid. Cryptogr. Commun. 2(1): 41-47 (2010)
• 
  Asha Rao, Diane M. Donovan, Joanne L. Hall:
  Mutually orthogonal Latin squares and mutually unbiased bases in dimensions of odd prime power - MOLS and MUBs in odd prime power dimensions. Cryptogr. Commun. 2(2): 221-231 (2010)
• 
  Robert Rolland:
  The second weight of generalized Reed-Muller codes in most cases. Cryptogr. Commun. 2(1): 19-40 (2010)
• 
  Jennifer Seberry, Marilena Mitrouli:
  Some remarks on Hadamard matrices. Cryptogr. Commun. 2(2): 293-306 (2010)
• 
  Ferenc Szöllösi:
  Exotic complex Hadamard matrices and their equivalence. Cryptogr. Commun. 2(2): 187-198 (2010)