• 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

• 2005
• 
  Samson Abramsky:
  A structural approach to reversible computation. Theor. Comput. Sci. 347(3): 441-464 (2005)
• 
  Peter R. J. Asveld:
  Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars. Theor. Comput. Sci. 347(1-2): 167-190 (2005)
• 
  Peter R. J. Asveld:
  Fuzzy context-free languages - Part 2: Recognition and parsing algorithms. Theor. Comput. Sci. 347(1-2): 191-213 (2005)
• 
  Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
  Reconciling a gene tree to a species tree under the duplication cost model. Theor. Comput. Sci. 347(1-2): 36-53 (2005)
• 
  Sara Brunetti, Alain Daurat:
  Random generation of Q-convex sets. Theor. Comput. Sci. 347(1-2): 393-414 (2005)
• 
  Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi:
  Enumeration of L-convex polyominoes by rows and columns. Theor. Comput. Sci. 347(1-2): 336-352 (2005)
• 
  Jean-Marc Champarnaud, Fabien Coulon:
  Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]. Theor. Comput. Sci. 347(1-2): 437-440 (2005)
• 
  Victor Chepoi, Feodor F. Dragan, Chenyu Yan:
  Additive sparse spanners for graphs with bounded length of largest induced cycle. Theor. Comput. Sci. 347(1-2): 54-75 (2005)
• 
  Alain Daurat, Yan Gérard, Maurice Nivat:
  Some necessary clarifications about the chords' problem and the Partial Digest Problem. Theor. Comput. Sci. 347(1-2): 432-436 (2005)
• 
  Ivo Düntsch, Michael Winter:
  A representation theorem for Boolean contact algebras. Theor. Comput. Sci. 347(3): 498-512 (2005)
• 
  Feng Feng, Xianzhong Zhao, Young Bae Jun:
  *-μ-semirings and *-λ-semirings. Theor. Comput. Sci. 347(1-2): 423-431 (2005)
• 
  Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
  Sequential and indexed two-dimensional combinatorial template matching allowing rotations. Theor. Comput. Sci. 347(1-2): 239-275 (2005)
• 
  Andrea Frosini, Maurice Nivat, Laurent Vuillon:
  An introduction to periodical discrete sets from a tomographical perspective. Theor. Comput. Sci. 347(1-2): 370-392 (2005)
• 
  Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
  Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. 347(1-2): 276-287 (2005)
• 
  Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman:
  Efficient gossip and robust distributed computation. Theor. Comput. Sci. 347(1-2): 130-166 (2005)
• 
  Frank Gurski, Egon Wanke:
  On the relationship between NLC-width and linear NLC-width. Theor. Comput. Sci. 347(1-2): 76-89 (2005)
• 
  Tero Harju, Arto Lepistö, Dirk Nowotka:
  A characterization of periodicity of bi-infinite words. Theor. Comput. Sci. 347(1-2): 419-422 (2005)
• 
  H. K. Hsiao, Y. T. Yeh, S. S. Yu:
  Dependences related to strict binary relations. Theor. Comput. Sci. 347(1-2): 306-324 (2005)
• 
  Zurab Khasidashvili, John R. W. Glauert:
  The conflict-free Reduction Geometry. Theor. Comput. Sci. 347(3): 465-497 (2005)
• 
  Krzysztof C. Kiwiel:
  On Floyd and Rivest's SELECT algorithm. Theor. Comput. Sci. 347(1-2): 214-238 (2005)
• 
  Zhaohui Liu, T. C. Edwin Cheng:
  Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine. Theor. Comput. Sci. 347(1-2): 288-298 (2005)
• 
  Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
  On converting CNF to DNF. Theor. Comput. Sci. 347(1-2): 325-335 (2005)
• 
  Emanuele Munarini, Damiano Torri:
  Cayley continuants. Theor. Comput. Sci. 347(1-2): 353-369 (2005)
• 
  Tatjana Petkovic, Saeed Salehi:
  Positive varieties of tree languages. Theor. Comput. Sci. 347(1-2): 1-35 (2005)
• 
  Éric Schost:
  There is no efficient reverse derivation mode for discrete derivatives. Theor. Comput. Sci. 347(1-2): 299-305 (2005)
• 
  N. V. Vinodchandran:
  A note on the circuit complexity of PP. Theor. Comput. Sci. 347(1-2): 415-418 (2005)
• 
  Tomoyuki Yamakami, Toshio Suzuki:
  Resource bounded immunity and simplicity. Theor. Comput. Sci. 347(1-2): 90-129 (2005)