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

• 1997
• 
  Samson Abramsky:
  Game Semantics for Programming Languages (Abstract). MFCS 1997: 3-4
• 
  Foto N. Afrati, Irène Guessarian, Michel de Rougemont:
  The Expressiveness of Datalog Circuits (DAC). MFCS 1997: 119-128
• 
  László Babai:
  Communication Complexity. MFCS 1997: 5-18
• 
  Béatrice Bérard, Claudine Picaronny:
  Accepting Zeno Words Without Making Time Stand Still. MFCS 1997: 149-158
• 
  Luca Bernardinello, Lucia Pomello:
  A Category of Transition Systems and Its Relations with Orthomodular Posets. MFCS 1997: 139-148
• 
  Hans L. Bodlaender:
  Treewidth: Algorithmic Techniques and Results. MFCS 1997: 19-36
• 
  Beate Bollig, Ingo Wegener:
  Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. MFCS 1997: 159-168
• 
  Marcello M. Bonsangue, Joost N. Kok:
  Specifying Computations Using Hyper Transition Systems. MFCS 1997: 169-178
• 
  Gianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer:
  A Shift-Invariant Metric on S^zz Inducing a Non-trivial Tolology. MFCS 1997: 179-188
• 
  Gang Chen:
  Subtyping Calculus of Construction (Extended Abstract). MFCS 1997: 189-198
• 
  Christian Choffrut, Giovanni Pighizzini:
  Distances Between Languages and Reflexivity of Relations. MFCS 1997: 199-208
• 
  Nachum Dershowitz:
  When are Two Rewrite Systems More than None? MFCS 1997: 37-43
• 
  Frank Drewes:
  On the Generation of Trees by Hyperedge Replacement. MFCS 1997: 229-238
• 
  Cynthia Dwork:
  Positive Applications of Lattices to Cryptography. MFCS 1997: 44-51
• 
  Henning Fernau, Ralf Stiebe:
  Regulations by Valences. MFCS 1997: 239-248
• 
  Gian-Luigi Ferrari, Ugo Montanari:
  A Tile-Based Coordination View of Asynchronous pi-Calculus. MFCS 1997: 52-70
• 
  Wan J. Fokkink, Jaco van de Pol:
  Simulation as a Correct Transformation of Rewrite Systems. MFCS 1997: 249-258
• 
  Cyril Gavoille:
  On the Dilation of Interval Routing. MFCS 1997: 259-268
• 
  Andreas Goerdt:
  The Giant Component Threshold for Random Regular Graphs with Edge Faults. MFCS 1997: 279-288
• 
  Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Corradini:
  Integrating the Specification Techniques of Graph Transformation and Temporal Logic. MFCS 1997: 219-228
• 
  Bernhard Heinemann:
  A Topological Generalization of Propositional Linear Time Temporal Logic. MFCS 1997: 289-297
• 
  Markus Holzer:
  Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. MFCS 1997: 299-308
• 
  Juraj Hromkovic, Georg Schnitger:
  Communication Complexity and Sequential Compuation. MFCS 1997: 71-84
• 
  Kazuo Iwama:
  Complexity of Finding Short Resolution Proofs. MFCS 1997: 309-318
• 
  Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
  On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. MFCS 1997: 319-326
• 
  Georg Karner, Werner Kuich:
  A Characterization of Abstract Families of Algebraic Power Series. MFCS 1997: 327-336
• 
  Zurab Khasidashvili, John R. W. Glauert:
  Relating Conflict-Free Stable Transition and Event Models (Extended Abstract). MFCS 1997: 269-278
• 
  Yuji Kobayashi, Friedrich Otto:
  Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. MFCS 1997: 337-346
• 
  Roman M. Kolpakov, Gregory Kucherov:
  Minimal Letter Frequency in n-th Power-Free Binary Words. MFCS 1997: 347-357
• 
  Ivan Korec:
  Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States. MFCS 1997: 358-367

skipping 22 more matches