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

• 1983
• 
  Lloyd Allison:
  Programming Denotational Semantics. Comput. J. 26(2): 164-174 (1983)
• 
  Stuart Oliver Anderson, Roland Carl Backhouse, E. H. Bugge, C. P. Stirling:
  An Assessment of Locally Least-Cost Error Recovery. Comput. J. 26(1): 15-24 (1983)
• 
  Malcolm P. Atkinson, Peter J. Bailey, Kenneth Chisholm, W. Paul Cockshott, Ronald Morrison:
  An Approach to Persistent Programming. Comput. J. 26(4): 360-365 (1983)
• 
  R. H. Barlow, David J. Evans, J. Shanehchi:
  Parallel Multisection Applied to the Eigenvalue Problem. Comput. J. 26(1): 6-9 (1983)
• 
  C. G. Broyden:
  A Mark-Scaling Algorithm. Comput. J. 26(2): 109-112 (1983)
• 
  John C. Cavouras:
  Computer System Evaluation Through Supervisor Replication. Comput. J. 26(2): 134-141 (1983)
• 
  B. E. J. Clark, S. K. Robinson:
  A Graphically Interacting Program Monitor. Comput. J. 26(3): 235-238 (1983)
• 
  Peter A. Dearnley, Pam J. Mayhew:
  In Favour of System Prototypes and their Integration into the Systems Development Cycle. Comput. J. 26(1): 36-42 (1983)
• 
  Jitender S. Deogun:
  On Scheduling with Ready Times to Minimize Mean Flow Time. Comput. J. 26(4): 320-328 (1983)
• 
  M. C. Er:
  A Note on Generating Well-Formed Parenthesis Strings Lexicographically. Comput. J. 26(3): 205-207 (1983)
• 
  M. C. Er:
  A Fast Algorithm for Computing Order-K Fibonacci Numbers. Comput. J. 26(3): 224-227 (1983)
• 
  M. C. Er:
  A Parallel Computation Approach to Topological Sorting. Comput. J. 26(4): 293-295 (1983)
• 
  David J. Evans, F. Abdollahzadeh:
  Efficient Construction of Balanced Binary Trees. Comput. J. 26(3): 193-195 (1983)
• 
  Aviezri S. Fraenkel, Moshe Mor:
  Combinatorial Compression and Partitioning of Large Dictionaries. Comput. J. 26(4): 336-343 (1983)
• 
  Richard A. Frost:
  SCHEMAL: Yet Another Conceptual Schema Definition Language. Comput. J. 26(3): 228-234 (1983)
• 
  Richard A. Frost, S. Whittaker:
  A Step Towards the Automatic Maintenance of the Semantic Integrity of Databases. Comput. J. 26(2): 124-133 (1983)
• 
  Narain H. Gehani:
  High Level Form Definition in Office Information Systems. Comput. J. 26(1): 52-59 (1983)
• 
  Pijush K. Ghosh, Sudhir P. Mudur:
  Parametric Curves for Graphic Design Systems. Comput. J. 26(4): 312-319 (1983)
• 
  Gaston H. Gonnet, Henk J. Olivié, Derick Wood:
  Height-Ratio-Balanced Trees. Comput. J. 26(2): 106-108 (1983)
• 
  Ralph E. Griswold, Michael Novak:
  Programmer-Defined Control Operations. Comput. J. 26(2): 175-183 (1983)
• 
  Phalguni Gupta, G. P. Bhattacharjee:
  Parallel Generation of Permutations. Comput. J. 26(2): 97-105 (1983)
• 
  Eric C. R. Hehner, Brad A. Silverberg:
  Programming with Grammars: An Exercise in Methodology-Directed Language Design. Comput. J. 26(3): 277-281 (1983)
• 
  Ronald T. House:
  A Proposal for an Extended Form of Type Checking of Expressions. Comput. J. 26(4): 366-374 (1983)
• 
  D. G. N. Hunter, A. R. McKenzie:
  Experiments with Relaxation Algorithms for Breaking Simple Substitution Ciphers. Comput. J. 26(1): 68-71 (1983)
• 
  John G. Kollias:
  The Effect of Missing, Retroactive, Erroneous and/or Late Data in Designing Accounting Applications. Comput. J. 26(2): 117-123 (1983)
• 
  Philip Leith:
  Hierarchically Structured Production Rules. Comput. J. 26(1): 1-5 (1983)
• 
  Pierre Lescanne:
  Behavioural Categoricity of Abstract Data Type Specifications. Comput. J. 26(4): 289-292 (1983)
• 
  R. Lesuisse:
  Some Lessons Drawn from the History of the Binary Search Algorithm. Comput. J. 26(2): 154-163 (1983)
• 
  Clement H. C. Leung:
  Analysis of Disc Fragmentation Using Markov Chains. Comput. J. 26(2): 113-116 (1983)
• 
  Clement H. C. Leung:
  A Model for Disc Locality Referencing. Comput. J. 26(3): 196-198 (1983)

skipping 21 more matches