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

• 1997
• 
  Jan Bosch:
  Delegating Compiler Objects: Modularity and Reusability in Language Engineering. Nord. J. Comput. 4(1): 66-92 (1997)
• 
  S. G. Efremidis, Khalid Azim Mughal, John H. Reppy, L. Søraas:
  AML: Attribute Grammars in ML. Nord. J. Comput. 4(1): 37-65 (1997)
• 
  M. Hakan Erdogmus:
  Architecture-Driven Verification of Concurrent Systems. Nord. J. Comput. 4(4): 380- (1997)
• 
  Giorgio Gambosi, Alberto Postiglione, Maurizio Talamo:
  On-Line Maintenance of an Approximate Bin-Packing Solution. Nord. J. Comput. 4(2): 151-166 (1997)
• 
  Tibor Gyimóthy, Tamás Horváth:
  Learning Semantic Functions of Attribute Grammars. Nord. J. Comput. 4(2): 287-302 (1997)
• 
  Görel Hedin:
  Attribute Extensions - a Technique for Enforcing Programming Conventions. Nord. J. Comput. 4(1): 93-122 (1997)
• 
  Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro:
  Time-Message Trade-Offs for the Weak Unison Problem. Nord. J. Comput. 4(4): 317-341 (1997)
• 
  Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
  An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. 4(2): 172-186 (1997)
• 
  Owen Kaser:
  Optimal Height Reduction Problems for Tree-Structured Hierarchies. Nord. J. Comput. 4(4): 357-379 (1997)
• 
  Kai Koskimies:
  Theme Issue on Programming Environments - Editor's Foreword. Nord. J. Comput. 4(1): 1-2 (1997)
• 
  Lars Lundberg, Håkan Lennerstad:
  Bounding the Gain of Changing the Number of Memory Modules in Shared Memory Multiprocessors. Nord. J. Comput. 4(2): 233-258 (1997)
• 
  Mehryar Mohri:
  String-Matching with Automata. Nord. J. Comput. 4(2): 217-231 (1997)
• 
  Asish Mukhopadhyay, Alok Aggrawal, Ravi Mohan Hosabettu:
  On the Ordinary Line Problem in Computational Geometry. Nord. J. Comput. 4(4): 330-341 (1997)
• 
  Jukka Paakki, Jussi Koskinen, Airi Salminen:
  From Relational Program Dependencies to Hypertextual Access Structures. Nord. J. Comput. 4(1): 3-36 (1997)
• 
  Madhumangal Pal, G. P. Bhattacharjee:
  An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs. Nord. J. Comput. 4(4): 342-356 (1997)
• 
  Jens Palsberg, Trevor Jim:
  Type Inference with Simple Selftypes is NP-complete. Nord. J. Comput. 4(2): 259-286 (1997)
• 
  Emmanuel Roche:
  Compact Factorization of Finite-State Transducers and Finite-State Automata. Nord. J. Comput. 4(2): 187-216 (1997)
• 
  Thomas Roos:
  New Upper Bounds on Voronoi Diagrams of Moving Points. Nord. J. Comput. 4(2): 167-171 (1997)
• 
  Dag I. K. Sjøberg, Ray Welland, Malcolm P. Atkinson, Paul Philbrow, Cathy Waite, S. Macneill:
  The Persistent Workshop - a Programming Environment for Napier88. Nord. J. Comput. 4(1): 123-149 (1997)
• 
  Atsuko Yamaguchi, Koji Nakano, Satoru Miyano:
  An Approximation Algorithm for the Minimum Common Supertree Problem. Nord. J. Comput. 4(2): 303-316 (1997)