• 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 1,130 matches

• 1994
• 
  Massimo Ancona, Alessandro Paone:
  Table Merging by Compatible Partitions for LR Parsers is NP-complete. J. Inf. Process. Cybern. 30(3): 123-134 (1994)
• 
  David A. Basin:
  Generalized Rewriting in Type Theory. J. Inf. Process. Cybern. 30(5/6): 249-259 (1994)
• 
  Ulrike Baumann, Reinhard Pöschel, Irmgard Schmeichel:
  Power Graphs. J. Inf. Process. Cybern. 30(3): 135-142 (1994)
• 
  Bernd I. Dahn, Andreas Wolf:
  A Calculus Supporting Structured Proofs. J. Inf. Process. Cybern. 30(5/6): 261-276 (1994)
• 
  Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
  Separating Oblivious Linear Length MOD_p-Branching Program Classes. J. Inf. Process. Cybern. 30(2): 63-75 (1994)
• 
  Javier Esparza, Mogens Nielsen:
  Decidability Issues for Petri Nets - a survey. J. Inf. Process. Cybern. 30(3): 143-160 (1994)
• 
  Henning Fernau:
  Membership for 1-Limited ET0L Languages Is Not Decidable. J. Inf. Process. Cybern. 30(4): 191-211 (1994)
• 
  Zdzislaw Grodzki, Aleksander Wronski:
  Generalized de Bruijn graphs. J. Inf. Process. Cybern. 30(1): 5-17 (1994)
• 
  Armin Hemmerling:
  On Genuine Complexity and Kinds of Nondeterminism. J. Inf. Process. Cybern. 30(2): 77-96 (1994)
• 
  Xiaorong Huang, Manfred Kerber, Jörn Richts, Arthur Sehn:
  Planning Mathematical Proofs with Methods. J. Inf. Process. Cybern. 30(5/6): 277-291 (1994)
• 
  Cecilia Magdalena Ionescu, Octavian Procopiuc:
  Bounded Communication in Parallel Communicating Grammar Systems. J. Inf. Process. Cybern. 30(2): 97-110 (1994)
• 
  Ryszard Janicki, Maciej Koutny:
  Representations of Discrete Interval Orders and Semi-Orders. J. Inf. Process. Cybern. 30(3): 161-168 (1994)
• 
  Katja Landskron:
  On k-limited L Forms. J. Inf. Process. Cybern. 30(1): 19-27 (1994)
• 
  Andrew Lim, Sartaj Sahni:
  Segmented Winner Trees. J. Inf. Process. Cybern. 30(1): 29-43 (1994)
• 
  Valeria Mihalache:
  Extended Conditional Tabled Eco-Grammar Systems. J. Inf. Process. Cybern. 30(4): 213-229 (1994)
• 
  Gheorghe Paun:
  On the Generative Capacity of Hybrid CD Grammar Systems. J. Inf. Process. Cybern. 30(4): 231-244 (1994)
• 
  Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel:
  Tactics in KIV. J. Inf. Process. Cybern. 30(5/6): 293-310 (1994)
• 
  Guntram Scheithauer:
  On the MAXGAP Problem for Cutting Stock Problems. J. Inf. Process. Cybern. 30(2): 111-117 (1994)
• 
  Raimonds Simanovskis:
  Consistent and Conform Identification by Total Recursive Strategies. J. Inf. Process. Cybern. 30(1): 45-54 (1994)
• 
  Vu Dinh Hoa:
  On the Length of Maximal Dominating Cycle in 2-Connected Graphs. J. Inf. Process. Cybern. 30(1): 55-60 (1994)
• 
  Dietmar Wätjen:
  Regulation of Uniformly k-limited T0L Systems. J. Inf. Process. Cybern. 30(3): 169-187 (1994)
• 
  Andreas Wolf:
  Optimization and Translation of Tableau-Proofs into Resolution. J. Inf. Process. Cybern. 30(5/6): 311-325 (1994)
• 1993
• 
  Matthias Baaz, Christian G. Fermüller, Richard Zach:
  Elimination of Cuts in First-order Finite-valued Logics. J. Inf. Process. Cybern. 29(6): 333-355 (1993)
• 
  J. Brunner, Th. Drescher, Reinhard Pöschel, H. Seidel:
  Power algebras: clones and relations. J. Inf. Process. Cybern. 29(5): 293-302 (1993)
• 
  Henning Fernau:
  Adult Languages of Propagating Systems with Restricted Parallelism. J. Inf. Process. Cybern. 29(5): 249-267 (1993)
• 
  Rudolf Freund, Gheorghe Paun:
  One-dimensional matrix array grammars. J. Inf. Process. Cybern. 29(6): 357-374 (1993)
• 
  Gregor Fritz:
  Reachability in Random Transition Graphs. J. Inf. Process. Cybern. 29(5): 269-281 (1993)
• 
  Thomas Goldberg, Walter Harnau:
  On Pseudocirculant Graphs and their Automorphisms. J. Inf. Process. Cybern. 29(2): 79-85 (1993)
• 
  Ismo Hakala:
  Efficient Algorithms for Deciding the Morphism Equivalence Problem for Regular, Linear and Context-Free Languages. J. Inf. Process. Cybern. 29(4): 209-213 (1993)
• 
  Gisela Härtler, Hendrik Schäbe:
  Inequalities for Times Between Events Following a Nonhomogeneous Poisson Process. J. Inf. Process. Cybern. 29(1): 3-8 (1993)

skipping 1,100 more matches