%A Michael D. Alder
%T Representation of syntactic information by learning machines
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 1-11

%A Brian Cohen
%A Claude Sammut
%T Learning concepts in complex environments
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 13-23

%A Michael Georgeff
%T Strategic search
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 25-38

%A R.A. Jarvis
%T A mobile robot for computer vision research
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 39-51

%A J. Kay
%T Report of an heuristic program for the solution of a word puzzle
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 53-68

%A Mary O'Kane
%T New approaches to the acoustic-phonetic component
of a speech recognition system
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 69-83

%A David Poole
%T A taxonomy of control in production systems
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 85-95

%A Larry H. Reeker
%T An artificial intelligence approach to natural language teaching
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 97-106

%A S.J. Edwards
%A A.J. Hurst
%T Proposal for an intermediate language machine generating system
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 107-121

%A M. Ellison
%A A.J. Hurst
%T Extensibility and the structuring of computer systems
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 123-130

%A Leslie M. Goldschlager
%T Recursion in small storage
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 131-140

%A J.S. Rohl
%T The elimination of linear recursion: a tutorial
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 141-156

%A A.J. Gerber
%T Modelling the readers and writers problem with inhibitor nets
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 157-171

%A L. Goldschlager
%A A.D. Payne
%T Computer resource rationing in universities
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 173-184

%A J.B. Hext
%T A storage management laboratory
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 185-193

%A J.M. Robson
%T Beer's weight balanced trees do not have bounded balance
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 195-204

%A J.A. Shepherd
%A J.-L. Lassez
%T Opposing views on the use of software science measures
for automatic assessment of student programs
%J Proceedings of the Third Australian Computer Science Conference
%C Canberra, Australia
%D January 1980
%E Richard P. Brent
%E Ray A. Jarvis
%K acsc acsc3
%P 205-215

%A D. Abramson
%T Hardware management of a large virtual memory
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 1-13

%A C.J. Barter
%A D.A. Hodson
%T A screen based Pascal system
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 14-24

%A R.P. Brent
%T Efficient implementation of the first-fit strategy
for dynamic storage allocation
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 25-34

%A C.N.G. Dampney
%T The computon - an abstract mechanism
for analysing interaction in information systems
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 35-45

%A M. Georgeff
%T Higher-order functions in Pascal
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 46-56

%A I.T. Hawryskiewycz
%T Semantic levels for implementing data models
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 57-67

%A D. Herbison-Evans
%T A dancer among us
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 68-73

%A B.P. Kidman
%T The type concept in Ada
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 74-84

%A J.L. Lassez
%A V.L. Nguyen
%A E.A. Sonenberg
%T Fixed point theorems and semantics - a folk tale
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 85-94

%A G. Lee
%T Using DOPLs to define programming languages
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 95-105

%A B.J. Lings
%A E.J. Salzman
%T An exercise in language design for secure programming
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 106-116

%A K.J. McDonnell
%T The student's workbench
- a time-sharing system for tertiary education
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 117-125

%A V.L. Nguyen
%A J.L. Lassez
%T Implicit recursive definitions
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 126-131

%A G. Oulsnam
%T Removing unstructuredness from programs efficiently
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 132-142

%A P.C. Poole
%A W.E. Hollier
%T A forms description language
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 143-153

%A P. Pritchard
%T The wheel sieve stands up
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 154-161

%A J.M. Robson
%T Optimal storage allocation decisions require exponential time
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 162-172

%A J. Rosenberg
%A J.L. Keedy
%T Software management of a large virtual memory
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 173-181

%A R. Sacks-Davis
%A K. Ramamohanarao
%T A fast adder for decimal arithmetic
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 182-189

%A A. Sale
%T The definition and standardization of programming languages
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 190-200

%A J. Staples
%T A new technique for analysing parameter passing,
applied to the lambda calculus
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 201-210

%A A.L. Wendelborn
%T Implementing a Lucid-like programming language
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 211-221

%A M. Imori
%A H. Yamada
%T A noninjective mapping of periodic sequences by cellular automata
%J Proceedings of the Fourth Australian Computer Science Conference
%C Brisbane, Australia
%D May 1981
%K acsc acsc4
%P 222-250

%A B.J. Garner
%A N. Smith
%T Application of artificial intelligence techniques
in the automatic reorganisation of database systems
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 1-11

%A J.K. Debenham
%A G.M. McGrath
%T The description in logic of large commercial data bases:
a methodology put to the test
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 12-21

%A C.A. Lakos
%T Automated code generation
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 22-30

%A K.P. Mason
%T Dynamic template translators
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 31-39

%A D. Johnston
%A C. Malone
%A T. Segall
%A D. Thiele
%T Extending a parser generator to include
automatic generation of an abstract syntax tree
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 40-46

%A D. Abramson
%T A technique for enhancing processor architecture
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 47-57

%A J. Rosenberg
%A D.M. Rowe
%A J.L. Keedy
%T An overview of the Monads series III hardware architecture
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 58-67

%A E.F. Gehringer
%A J.L. Keedy
%A J.V. Thomson
%T Dynamic data structure management in Monads III
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 68-78

%A P. Eades
%T Two theorems on optimal trees
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 79-87

%A J.M. Robson
%T The asymptotic behaviour of the height of binary search trees
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 88-98

%A M.C. Er
%T The relations of the computation of Fibonacci numbers
with the polyphase sort
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 99-107

%A C.S. Wallace
%A P. Nankivell
%T A fortran-based package for discrete simulation
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 108-228

%A A. Sevagian
%A H.R. Hwa
%T A crossword puzzle generator
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 119-129

%A R.P. Brent
%T An idealist's view of semantics for integer and real types
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 130-140

%A R. Paterson
%T Universal objects and denotational semantics
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 141-151

%A B.P. Molinari
%T Aspects of an abstract Ada machine
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 152-162

%A A. Lister
%A B. Hicks
%T A distributed testbed for communication primitives
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 163-172

%A K. Raymond
%A A. Lister
%T Streams: an implementation of distributed mailboxes
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 173-181

%A P. County
%T An experimental distributed communication model and its specification
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 182-190

%A G.A. Rose
%T Notation for structured text
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 191-202

%A R.A. Jarvis
%T Polyhedra obstacle growing for collision-free path planning
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 203-213

%A A.J. Hurst
%A C.J. Lokan
%T Context sensitive computer architecture
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 214-221

%A K. Ramamohanarao
%A M. Briffa
%T A network file system for UNIX
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 222-232

%A A.L. Wendelborn
%T Reconfiguration in the process networks of Kahn and MacQueen
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 233-243

%A R. Orsanski
%T A CSP interpreter in the relational calculus
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 244-254

%A J.L.M. Verbyla
%A K.J. Maciunas
%T Concurrency and simulation
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 255-265

%A M.P. Georgeff
%T Evaluating typed lambda expressions using a stack machine
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 266-276

%A J. Staples
%T A new strategy for efficient lazy evaluation of lambda expressions
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 277-285

%A P.A. Bailes
%T An applicative language framework for data abstraction
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 286-296

%A T. Lock
%A L. Allison
%T A word-processor for the disabled
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 297-301

%A A. Marriott
%T When is a minim not a minim ?
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 302-312

%A L. Spyker
%T Design and building of a bit slice computer (for music synthesis)
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 313-322

%A D. Herbison-Evans
%A R.D. Green
%A A. Butt
%T Computer animation with NUDES in dance and physical education
%J Proceedings of the Fifth Australian Computer Science Conference
%C Perth, Australia
%D February 1982
%K acsc acsc5
%P 323-331

%A D. Abramson
%T The Monads II computer system
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 1-10

%A T. Dix
%T Towards a distributed Unix kernel
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 11-20

%A J. Kay
%A P.R.D. Lauder
%A C. Maltby
%A S. Tollasepp
%T The share charging and scheduling system
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 21-30

%A K.J. McDonnell
%T Programming language interfaces to database management systems
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 31-40

%A Z. Michalewicz
%T Improving security in a statistical database
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 41-56

%A P.D. Nicholson
%A C.P. Tsang
%T A multi-processor implementation of CSP
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 57-64

%A M.C. Er
%T Interpreting engineering drawings
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 65-70

%A G.K. Gupta
%T Building and evaluating numerical software
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 71-79

%A D. Herbison-Evans
%T Caterpillars and the inaccurate solution
of cubic and quartic equations
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 80-90

%A R.A. Jarvis
%T Implementing the Marr-Hildreth delta-squared-g
zero crossing edge detector
for colour imagery on a video stream processor
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 91-108

%A D.S. Richardson
%T Quaternion algebra
for three-dimensional computer graphics and modelling
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 109-120

%A E.Y.W. Wong
%A L.M. Goldschlager
%T The production of animated movies by a robot manipulator
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 121-133

%A A. Moffat
%T A greedy algorithm for the all shortest paths problem
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 134-143

%A H.A. Ngu
%A J. Morris
%T An experiment in program generation
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 144-155

%A J.S. Rohl
%A T.D. Gedeon
%T Four-tower Hanoi and beyond
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 156-162

%A S. Russell
%A A. Amin
%T An error-correcting LL(1) parser generator
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 163-165

%A R. Sacks-Davis
%A K. Ramamohanarao
%T Partial-match retrieval based on superimposed coding
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 166-176

%A C.J. Barter
%T Transaction processing in message passing systems
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 177-186

%A D.J.H. Brown
%A R.P. Worden
%T An architecture for software development management
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 187-194

%A R.J. Kummerfeld
%T Proposal for an Australian computer science network
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 195-199

%A I.A. Parkin
%A D.C.W. Phipps
%A J. Zic
%T An experimental system for low-cost satellite communication
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 200-201

%A B.D. Powell
%T A generalized network architecture
for user transparent distributed computing
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 202-213

%A K. Raymond
%T Counting the cost of communication primitives
for distributed computing
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 214-224

%A I. Balbin
%A P.C. Poole
%T A language for specifying forms
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 225-235

%A M.A. McRobbie
%A R.K. Meyer
%A P.B. Thistlewaite
%T Computer-aided investigations
into the decision problem for relevant logics:
the search for a free associative connective
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 236-267

%A J. Patrick
%T An information theoretic interpretation of scientific methodology
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 268-273

%A J.M. Potter
%A J.W. Sanders
%T Asymptotic posit frequencies of switchyard permutations
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 274-278

%A J.M. Robson
%T Is chess more complex than go ?
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 279-284

%A G.A. Rose
%T Structured text transformations
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 285-294

%A R.P. Brent
%A F.T. Luk
%T Computing the Cholesky factorization using a systolic architecture
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 295-302

%A P.A. Dunn
%T Tree-connected cellular crossbar switches
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 303-312

%A P. Lamb
%T An intermediate level language for VLSI design
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 313-322

%A R.L. Biddle
%T Relations in programming language data structuring
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 323-327

%A J.L. Keedy
%T On hierarchies and objects
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 328-333

%A I.G. Richards
%T Unifying software objects
%J Proceedings of the Sixth Australian Computer Science Conference
%C Sydney, Australia
%D February 1983
%E L.M. Goldschlager
%K acsc acsc6
%P 334-344

%A G. Farrall
%A K. Ramamohanarao
%T A cache for non-aligned accesses
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A P.J. Ashenden
%A C.J. Barter
%A D. Knight
%A K.J. Maciunas
%T The design of a high performance workstation computer
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A D. Abramson
%T A microcode emulator for undergraduate teaching
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A P.A. Collier
%A C.A. Lakos
%T A rigorous logic basis for the science of programming
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A C. Baker-Finch
%T Acceptable models of algebraic semantics
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A J. Staples
%T A fixed-point semantics for deterministic distributed systems
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A L.M. Goldschlager
%A R.P. Brent
%T A parallel algorithm for context-free parsing
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A R.B. Stanton
%T A model for non-chronological backtracking
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A A.L. Wendelborn
%T An operational semantics of a Lucid-like programming language
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A R. Paterson
%T Reasoning about functional programs
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A S.Y. Soon
%T On the definition of the Ada tasking system
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A M.J. Oudshoorn
%T User defined generic routines for Pascal
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A D.Q.M. Fay
%T Comparison of CSP and the programming language occam
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A B.P. Kidman
%A R. Morello
%T Inherent parallelism of data flow programs
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A S. Elhay
%A J. Kautsky
%T A method for computing quadratures of the Kronrod Patterson type
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A A.K. Burston
%A P.G. McCrea
%T A database backend processor
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A K.J. Han
%A W.L. Chung
%T The extended relational model for design databases
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A R.A. Jarvis
%T Robotic vision using 3D space cube solid modelling
derived from multiple image projections
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A P.E. Tischer
%A G.K. Gupta
%T Some new cyclic linear multistep formulas for stiff systems
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A J. Lions
%T An exercise in office automation
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A D. Carrington
%A K. Robinson
%A G. Whale
%T Give: a system for collecting and testing student assignments
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A P.J. McKerrow
%T Monitoring program execution with a hybrid measurement tool
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A T.I. Dix
%T A model of a distributed Unix kernel
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A K.J. Maciunas
%T A proposal for the composition of concurrent processes
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A J.K. Debenham
%T The storage allocation problem for logic systems
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A G.K. Gupta
%A K.J. McDonell
%T B-trees with deferred splitting
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A R. Sacks-Davis
%A K. Ramamoharanaro
%T Implementation of linear hashing schemes
%J Proceedings of the Seventh Australian Computer Science Conference
%C Adelaide, Australia
%D January 1984
%K acsc acsc7

%A C. McDonald
%T The production of large documents under Unix
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A D.A. Price
%T On an automated approach to testing
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A P.J. McKerrow
%A A. Zelinsky
%T Developing a robotics educational library
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A R.A. Jarvis
%A R.R. Ewin
%T A VAX-based robotics vision laboratory
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A D. Johnston
%T Left to right syntactic and semantic analysis
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A B.P. Kidman
%A P.E.C. Jones
%A R. Morello
%T Code generation from expressions in a data flow language
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A L. Van\ Eckert
%T Translation of textbook Lisp problems into Lisp programs
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A D.A. Abramson
%A J. Rosenberg
%T A vertical user interface to horizontal microcode
via a retargetable microassembler
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A S.K. Singh
%A P.G. McCrea
%A M. Schulz
%T FIDEL: a finite state machine design tool
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A J. Patrick
%T The CABER system: the capture and analysis of behavioural events
in real time
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A M. Ho
%A J. Patrick
%T MARTIN - a generator of real-time parsers for LR(1) grammars
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A K.N. Chong
%A E.K. Chew
%A K.J. McDonell
%T A name validation procedure
for hierarchically distributed directory system database
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A J.K. Debenham
%T Knowledge base engineering
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A L.M. Goldschlager
%T A model of associative computation
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A R.B. Stanton
%T Propositional rule systems with assumptions
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A A. Payne
%T Hybrid error control schemes for satellite networks
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A R.P. Brent
%T The most-recently-used strategy for dynamic storage allocation
on a computer with virtual memory
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A R.S. Francis
%T An alias free pointer type
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A C.D. Marlin
%A M. Oudshoorn
%T Using abstract data types in a model
of the data control aspect of programming languages
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A R.G. Dromey
%T A discipline for program development
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A A.S. Tanenbaum
%A R. van\ Renesse
%T A survey of current research on distributed operating systems
%J Proceedings of the Eighth Australian Computer Science Conference
%C Melbourne, Australia
%D January 1985
%K acsc acsc8

%A W.P. Beaumont
%A Peter J. Cassidy
%T Asynchronous coroutine transfers in VAX/VMS Modula-2
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 1-10
%K concurrent programming structures, run-time environments,
process management

%A Peter J. Cassidy
%A Peter J. Ashenden
%A Chris D. Marlin
%T An implementation of Modula-2 for embedded systems development
for NS32000
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 11-21
%K compilers, concurrency, run-time display

%A Roland Yap
%A John Rosenberg
%A David Abramson
%T A C compiler for a capability-based processor
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 23-33
%K capabilities, protection, Monads architecture, Monads-PC

%A Malcolm P. Atkinson
%A Ronald Morrison
%A Graham D. Pratten
%T A persistent information space architecture
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 35-46
%K programming languages and environments, controlling complexity,
orthogonal persistence, controlled system evolution, data protection,
concurrent computation

%A Norman Y. Foo
%T Final structure in logic programs
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 47-50
%K equivalence relations, negation, sufficient completeness,
final models, greatest fixed point

%A John Staples
%T Predicate logic for practical deductive reasoning
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 51-61
%K proof editor/checker, reasoning assistant,
interactive theorem prover, automated logic,
mechanised logic, automated deduction

%A Graham J. Williams
%T Deficiencies of expert systems and attempts at improvement: a survey
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 63-72
%K artificial intelligence, knowledge representation, frames

%A Wray Bruntine
%T Towards a practical theory of Horn clause induction
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 73-82
%K generalisation, inductive inference, subsumption, logic programming

%A Brad Broom
%A Jim Wlesh
%T Detail compression techniques for interactive program display
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 83-93
%K detail suppression, program formatting

%A Rhys Francis
%A Ian Mathieson
%T Language tools for exploring concurrency
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 95-105
%K concurrent programming, language constructs

%A Derek Kiong
%A Jim Welsh
%T An incremental parser for language based editors
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 107-118
%K program editors

%A Barry Dwyer
%T Using selective substitution to evaluate nullable non-terminals
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 119-127
%K parser generators, syntax, grammars, complexity, depth-first search

%A A.W. Bojanczyk
%A Richard P. Brent
%T A systolic algorithm for extended GCD computation
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 129-137
%K greatest common divisor, Euclidean algorithm, systolic array,
parallel algorithm, linear-time algorithm

%A B.B. Zhou
%T Efficient use of cut-set localization rules for systolic arrays
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 139-147
%K semi-systolic arrays, signal-flow graph SFG networks, time-scaling,
delay transfer, optimal localization algorithm, non-rescaling cut-set,
linear convolution, matrix multiplication, VLSI

%A Richard P. Brent
%T Some integer factorization algorithms using elliptic curves
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 149-163
%K Monte Carlo algorithm, elliptic curve algorithm, complexity analysis

%A J.M. Robson
%T Deterministic simulation of a single tape Turing machine
by a random access machine in sub-linear time
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 165-175
%K relations amongst complexity measures,
relations among modes of computation

%A Peter A. Bailes
%T A basis for applicative data type definition and abstraction
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 177-187
%K applicative/functional programming, data abstraction

%A Peter Kearney
%T Fully sorted algebras and maximal typing
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 189-199
%K abstract data types, strong typing

%A Claude Sammut
%A John Pollaers
%T A frame based knowledge representation system for Prolog
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 201-208
%K artificial intelligence, databases, frames, Prolog, logic programming

%A Robert Edmondson
%T Toward a logic for non-Horn prolog
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 209-219
%K logic programming, Prolog, negation, completeness

%A G.K. Gupta
%A C.W. Gear
%A B. Leimkuhler
%T Error estimation and control
in solving differential algebraic equations
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 221-229
%K multistate methods, mathematical software

%A Geoff Whale
%T Detection of plagiarism in student programs
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 231-241
%K metrics, subsequences

%A David Carrington
%T The performance of an inverted hash index for phrase matching
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 243-249
%K on-line help facility, hashing, EMBOS

%A Beng C. Ooi
%A B. Srinivasan
%T Query processing in distributed database using semijoin
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 251-262
%K communications, distributed query processing, heuristics,
optimization, restriction, projection

%A P.A. Collier
%T RFP - an implementation of typed fP with relational primitives
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 263-273
%K functional programming, relational database query

%A A. Wendelborn
%T A hybrid data and demand driven implementation
of a functional language
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 275-285
%K data flow, Lucid

%A P.E.C. Jones
%A B.P. Kidman
%T Common subexpression detection
in conditional expressions in a dataflow language
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 287-297
%K conditional expression, functional programming language

%A Ian Hayes
%T Weakest pre-specifications: weakest pre-conditions for procedures
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 299-308
%K weakest post-specification

%A J. Weadon
%T Subdividing non-directed graphs with cutline sets of size two
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 309-325
%K line cut sets, partitioning an undirected graph, algorithms

%A Peter Eades
%A Brendan D. McKay
%A Nicholas C. Wormald
%T On an edge crossing problem
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 327-334
%K graphs, bipartite graphs, algorithms, NP-complete

%A Peter J. Ashendon
%A Chris J. Barter
%A Chris D. Marlin
%T A high performance workstation design
employing multiple processors and coherent caching
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 335-345
%K closely coupled architectures, Leopard, L-Bus

%A Murray W. Allen
%A Jayasooriay
%A Robert M. Colomb
%T Attached index machine: a new form of processor
and its application to partial match retrieval
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 347-355
%K associative memory, information retrieval,
virtual memory, superimposed coding

%A Chris S. Wallace
%T An improved algorithm for classification
%J Proceedings of the Ninth Australian Computer Science Conference
%C Canberra, Australia
%D January 1986
%E George W. Gerrity
%K acsc acsc9
%P 257-366
%K inductive inference, taxonomy, information theory

%A Ka K. Chan
%A B. Srinivasan
%T An implementation model
using query optimization strategies for integrity enforcement
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 1-13

%A Leszek A. Maciaszek
%T Access path selection in network database systems
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 14-24

%A C.M.R. Leung
%A G.M. Nijssen
%T From a NIAM conceptual schema into the optimal SQL relational schema
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 25-36
%K intuitionistic modal logic

%A Trevor I. Dix
%A Dorota H. Kieronska
%T Tree pruning in restriction site mapping
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 37-45

%A V.K. Murthy
%T Lazy functional stream-oriented programming
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 46-55

%A Robin B. Stanton
%A Hugh G. Mackenzie
%T A graphics oriented deductive planning system (abstract only)
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 56

%A A.H.H. Ngu
%T Data modelling through quasi-natural language
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 57-67

%A P.N. Creasy
%T A class of more powerful queries in SQL
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 68-78

%A A.J. Hurst
%T A context sensitive addressing model
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 79-95

%A Graham Farr
%T Graph colouring and language separability
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 96-106

%A Anthony J. Maeder
%A Peter E. Tischer
%T A structured code for solving initial value problems
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 107-115

%A Brad Broom
%T A distributed syntax-directed editor
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 116-125
%K blit

%A Derek King
%A Jim Welsh
%T Incremental semantic analysis
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 126-136

%A Colin J. Fidge
%T Reproducible tests in CSP (abstract only)
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 137

%A R. Ghosh-Roy
%T Conjunctional polymorphism
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 138-160

%A A.S.M. Sajeev
%T Separation of functional, synchronizing and scheduling aspects of processes
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 161-172

%A Rhys Francis
%A Ian Mathieson
%T A threaded programming environment
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 173-183

%A Charles Lakos
%T An expriment in cooperative programming languages
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 184-192

%A R.A. Jarvis
%T Configuration space collision-free path planning for robotic manipulators
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 193-204

%A Mark Nelson
%T Automatic error recovery for adaptive robots
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 205-213

%A John Alan Fulcher
%A Phillip John McKerrow
%T A monitoring tool for the Cambridge ring local area network
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 214-226

%A R. Geoff Dromey
%T Derivation of sorting algorithms
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 227-239

%A Barry Dwyer
%A Ali Mili
%T Issues on program specification: toward a discipline of structured specifying
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 240-253

%A Alistair Moffat
%T Predictive text compression based on the future rather than the past
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 254-261

%A Peter Tischer
%T A modified Lempel-Ziv-Welch data compression scheme
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 262-272

%A Richard P. Brent
%T A linear algorithm for data compression (abstract only)
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 273

%A J.S. Rohl
%T Jacaranda - a computer-based examination system
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 274-281

%A B.D. McKay
%A C.W. Johnson
%A V. Sharma
%T Further methods for detecting plagiarism in student programs
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 282-293

%A George Politis
%A Don Herbison-Evans
%T Computer animation by choreography
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 294-303

%A Bob Buckley
%T Relaxing a rightmost-first restriction
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 304-311

%A Dan Johnston
%T Use of semantic information in generated parsers
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 312-319

%A K.P. Mason
%T Parse table generation for dynamic template translators
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 320-329

%A Ronald Rose
%A M. Anderson
%A C.S. Wallace
%T Implementation of a tighly-coupled multiprocessor
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 330-340

%A Phillip John McKerrow
%A Paul Charles Bunn
%A Richard Hartley
%A Michael James Milway
%T A VSLI node controller for a Cambridge ring local area network
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 341-354

%A Heiko Schroder
%T VLSI-sorting under the linear model
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 355-365

%A Robert Edmondson
%T Implementing sound, flounder-free, negation as failure
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 366-370

%A Peter Kearney
%A John Staples
%T An extension of Kahn's data flow semantics to model nondeterminism
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 371-381

%A R. Conybeare
%A L. Goldschlager
%T Investigation of some variants of an associative memory model
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 382-396

%A Paul Glasziuo
%T Evaluating expert systems
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 397-406

%A Michael C. Hickey
%T Principles of the ANALOGEN model
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 407-416

%A Graham J. Williams
%T Some experiments in decision tree induction (abstract only)
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 417

%A W.H. Wilson
%T Context tracking for natural language processing
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 418-428

%A R. Duke
%A D. Johnston
%A G. Rose
%T Specifying static semantics of block structured languages (abstract only)
%J Proceedings of the Tenth Australian Computer Science Conference
%C Geelong, Australia
%D February 1987
%E J.D. Patrick
%K acsc acsc10
%P 429