• 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

• 2001
• 
  Anna Bernasconi:
  On a hierarchy of Boolean functions hard to compute in constant depth. Discret. Math. Theor. Comput. Sci. 4(2): 79-90 (2001)
• 
  Eugene Curtin:
  Cubic Cayley graphs with small diameter. Discret. Math. Theor. Comput. Sci. 4(2): 123-132 (2001)
• 
  Jessica H. Fong, Martin Strauss:
  An Approximate Lp Difference Algorithm for Massive Data Streams. Discret. Math. Theor. Comput. Sci. 4(2): 301-322 (2001)
• 
  Anna E. Frid:
  Overlap-free symmetric D0L words. Discret. Math. Theor. Comput. Sci. 4(2): 357-362 (2001)
• 
  Johannes Grassberger, Günther Hörmann:
  A note on representations of the finite Heisenberg group and sums of greatest common divisors. Discret. Math. Theor. Comput. Sci. 4(2): 91-100 (2001)
• 
  Vince Grolmusz:
  A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. Discret. Math. Theor. Comput. Sci. 4(2): 247-254 (2001)
• 
  Gabrielle Assunta Grün:
  An Efficient Algorithm for the Maximum Distance Problem. Discret. Math. Theor. Comput. Sci. 4(2): 323-350 (2001)
• 
  Michel Habib, Christophe Paul, Laurent Viennot:
  Linear time recognition of P4-indifference graphs. Discret. Math. Theor. Comput. Sci. 4(2): 173-178 (2001)
• 
  Chính T. Hoàng, Van Bang Le:
  P4-Colorings and P4-Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 4(2): 109-122 (2001)
• 
  Pascal Koiran:
  The topological entropy of iterated piecewise affine maps is uncomputable. Discret. Math. Theor. Comput. Sci. 4(2): 351-356 (2001)
• 
  David W. Krumme, Paraskevi Fragopoulou:
  Minimum Eccentricity Multicast Trees. Discret. Math. Theor. Comput. Sci. 4(2): 157-172 (2001)
• 
  Damien Magoni, Jean-Jacques Pansiot:
  Oriented multicast routing algorithm applied to network-level agent search. Discret. Math. Theor. Comput. Sci. 4(2): 255-272 (2001)
• 
  Roberto Mantaci, Fanja Rakotondrajao:
  A permutations representation that knows what "Eulerian" means. Discret. Math. Theor. Comput. Sci. 4(2): 101-108 (2001)
• 
  Ján Manuch:
  Defect Effect of Bi-infinite Words in the Two-element Case. Discret. Math. Theor. Comput. Sci. 4(2): 273-290 (2001)
• 
  Nir Menakerman, Raphael Rom:
  Analysis of Transmissions Scheduling with Packet Fragmentation. Discret. Math. Theor. Comput. Sci. 4(2): 139-156 (2001)
• 
  Lawrence S. Moss:
  Simple Equational Specifications of Rational Arithmetic. Discret. Math. Theor. Comput. Sci. 4(2): 291-300 (2001)
• 
  Martin Müller, Joachim Niehren, Ralf Treinen:
  The first-order theory of ordering constraints over feature trees. Discret. Math. Theor. Comput. Sci. 4(2): 193-234 (2001)
• 
  Timo Peichl, Heribert Vollmer:
  Finite Automata with Generalized Acceptance Criteria. Discret. Math. Theor. Comput. Sci. 4(2): 179-192 (2001)
• 
  C. D. Randazzo, Henrique Pacca Loureiro Luna, P. Mahey:
  Benders decomposition for local access network design with two technologies. Discret. Math. Theor. Comput. Sci. 4(2): 235-246 (2001)
• 
  Werner Schachinger:
  Asymptotic normality of recursive algorithms via martingale difference arrays. Discret. Math. Theor. Comput. Sci. 4(2): 363-398 (2001)
• 
  C. R. Subramanian:
  Paths of specified length in random k-partite graphs. Discret. Math. Theor. Comput. Sci. 4(2): 133-138 (2001)
• 2000
• 
  Jean-Paul Allouche, Jeffrey O. Shallit:
  Sums of Digits, Overlaps, and Palindromes. Discret. Math. Theor. Comput. Sci. 4(1): 1-10 (2000)
• 
  Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
  Permutations avoiding an increasing number of length-increasing forbidden subsequences. Discret. Math. Theor. Comput. Sci. 4(1): 31-44 (2000)
• 
  Alexandre Boudet:
  Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories. Discret. Math. Theor. Comput. Sci. 4(1): 11-30 (2000)
• 
  Klaus Dohmen:
  Improved inclusion-exclusion identities via closure operators. Discret. Math. Theor. Comput. Sci. 4(1): 61-66 (2000)
• 
  Toufik Mansour, Alek Vainshtein:
  Avoiding maximal parabolic subgroups of S_k. Discret. Math. Theor. Comput. Sci. 4(1): 81-90 (2000)
• 
  Ross M. McConnell, Jeremy P. Spinrad:
  Ordered Vertex Partitioning. Discret. Math. Theor. Comput. Sci. 4(1): 45-60 (2000)