Browse

ftp://ftp.cit.gu.edu.au (81)

	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-05-abs.ps.Z, 19950627 Finding Extremal Sets of A Normal Family of Sets in O( N2 log2 N ) Time and O( N2 log3 N ) Space Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 20, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-24.ps.Z, 19950627
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-12.ps.Z, 19950627 METAL: An Object Oriented Metalogic Language Christopher P. Higgins School of Computing and Information Technology, Griffith University, Nathan, Qld 4111, Australia. email: chris@cit.gu.edu.au Research Report CIT-94-12 June 1994
	ftp://ftp.cit.gu.edu.au/pub/reports/dobbie93-1.ps.Z, 19950627 A model for inheritance and overriding in deductive object-oriented systems (Extended abstract) Gillian Dobbie Department of Computer Science The University of Melbourne Parkville, Vic. 3052 gill@cs.mu.oz.au Rodney Topor School of Computing and Information Technology Griffith University Nathan, Qld 4111
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-09-abs.ps.Z, 19950627 Parallel Algorithms for Fully Dynamic Maintenance of Extremal Sets in O(log N) Time Using O( N log N ) CREW Processors Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 27, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/73.ps.Z, 19950627 - 1 - practical problems exhibit this property, and hence we look for approximate algorithms to solve such problems. An approximate solution to the MDST problem has applications in the computation of spanning trees in dynamic networks for non-critical broadcast. Previous work on the broadcast problem
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-14.ps.Z, 19950627 Emergent Behaviour in Slime Mould Environments Roger Stevens and Rok Sosic School of Computing and Information Technology, Griffith University, Nathan, QLD 4111, Australia E-mail: {roger,sosic}@cit.gu.edu.au Research Report: CIT-95-14
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-10-abs.ps.Z, 19950627 Value chain analysis as an enabling technology for optimal application of software engineering standards to business processes in software development organisations Liisa von Hellens Research Report CIT-95-10 April 1995 School of Computing and Information Technology, Griffith University, faculty of
	ftp://ftp.cit.gu.edu.au/pub/reports/dart93-1.ps.Z, 19950627 Types, Terms, Trees, and Tuple-distributivity Philip Dart Rodney Topory Justin Zobelz March 21, 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/dobbie93-2.ps.Z, 19950627 Representing inheritance and overriding in Datalog Gill Dobbie Rodney Topory
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-18.ps.Z, 19950627
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-15-abs.ps.Z, 19950627 - 1 - Parallel algorithms for the most vital edge problem with respect to a minimum spanning tree of a graph Francis Suraweera and Piyush Maheshwari Research Report CIT-95-15 School of Computing and Information Technology Griffith University Nathan, Brisbane, Qld., Australia 4111 {francis,
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-18.ps.Z, 19950627 Reflective-Folding Data Mapping onto a Parallel Mesh of Processors Peter Chodyra and Binh Pham School of Computing and Information Technology, Griffith University Nathan, Brisbane, 4111, Australia
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-09.ps.Z, 19950627 Parallel Algorithms for Fully Dynamic Maintenance of Extremal Sets in O(log N) Time Using O( N log N ) CREW Processors Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 27, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-12-abs.ps.Z, 19950627 A Parallel Interior Point Method and its Application to Facility Location Problems Amal de Silva / School of Computing and Information Technology, Griffith University, Nathan, QLD 4111, AUSTRALIA; Email amal@cit.gu.edu.au David Abramson / School of Computing and Information Technology, Griffith
	ftp://ftp.cit.gu.edu.au/pub/reports/76.ps.Z, 19950627 An Improved Selection-Based Parallel Range-Join Algorithm in Hypercubes Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia October 1, 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/77.ps.Z, 19950627 DL(e) is Sound Page 1 DL(e) is Sound Rachel Fordyce rfordyce@cit.gu.edu.au School of Computing and Information Technology, Griffith University, Nathan, Brisbane, Queensland, 4111, Australia.
	ftp://ftp.cit.gu.edu.au/pub/reports/68.ps.Z, 19950627 An Improved Hash-based Join Algorithm in the Presence of Double Skew on a Hypercube Computer Shao Dong Chen Hong Shen Rodney Topor School of Computing and information Technology Griffith University Nathan, Queensland 4111, AUSTRALIA Email: fschen, hong, rwtg@cit.gu.edu.au September 6, 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-11-abs.ps.Z, 19950627 1 The Co-invariant Generator: an aid in Deriving Loop Bodies David Billington and R. Geoff. Dromey School of Computing and Information Technology, Griffith University, Nathan, Brisbane, Queensland, 4111, Australia. e-mail: db@cit.gu.edu.au facsimile: +61 7 3875 5051 telephone: +61 7 3875 5017 Research
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-02-abs.ps.Z, 19950627 Efficient Enumeration of All Minimal Separators in A Graph Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au Weifa Liang Department of Computer Science Australian National University Canberra, ACT 0200, Australia
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-01-abs.ps.Z, 19950627 Fault-Tolerant Multicast with Traffic-Balancing in Hypercubes Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia February 17, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/67.ps.Z, 19950627 Divide-and-Conquer Minimal-Cut Bisectioning of Task Graphs Sam Lor Hong Shen Piyush Maheshwari School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia fsam, hong, piyushg@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-3.ps.Z, 19950627 A Parallel Search Algorithm for the N-Queens Problem Rok Sosi<=c School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia E-mail: sosic@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-17.ps.Z, 19950627 Computational Properties of Self-Reproducing Growing Automata Rok Sosi<=c and Robert R. Johnson School of Computing and Information Technology Department of Computer Science Griffith University University of Utah Nathan, QLD 4111, Australia Salt Lake City, UT 84112, USA sosic@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/dong92-1.ps.Z, 19950627 Incremental Evaluation of Datalog Queries Guozhu Dong Department of Computer Science The University of Melbourne Parkville, Vic. 3052, Australia Rodney Topor School of Computing and Information Technology Griffith University Nathan, Qld 4111, Australia
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-23.ps.Z, 19950627 Introduction Our Bachelor of Information Technology degree programme aims to produce graduates who have a range of knowledge, understanding, and skills in both the hardware and software technologies of computing and information systems. Going through the programme is a crucial experience for our
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-19.ps.Z, 19950627
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-14-abs.ps.Z, 19950627 Emergent Behaviour in Slime Mould Environments Roger Stevens and Rok Sosic School of Computing and Information Technology, Griffith University, Nathan, QLD 4111, Australia E-mail: {roger,sosic}@cit.gu.edu.au Research Report: CIT-95-14
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-11.ps.Z, 19950627 On the Declarative and Procedural Semantics of Definite Metalogic Programs Christopher P. Higgins School of Computing and Information Technology, Griffith University, Nathan, Qld 4111, Australia. email: chris@cit.gu.edu.au Research Report CIT-94-11 June 1994
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-07-abs.ps.Z, 19950627 A fast bitwise algorithm for computing the subset partial order Paul Pritchard P.Pritchard@cit.gu.edu.au Technical Report CIT-95-07 School of Computing and Information Technology Griffith University Queensland, Australia 4111 March 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-28.ps.Z, 19950627 1 A Debugging Tool for Software Evolution D. Abramson R. Sosic School of Computing and Information Technology Griffith University Kessels Rd, Brisbane, Queensland, 4111 {davida, sosic}@cit.gu.edu.au Phone: +61-7-875 5049 Fax: +61-7-875 5051
	ftp://ftp.cit.gu.edu.au/pub/reports/dong93.ps.Z, 19950627 First-Order Incremental Evaluation of Datalog Queries Guozhu Dongy Department of Computer Science The University of Melbourne Parkville, Vic. 3052, Australia Jianwen Suz Department of Computer Science University of California Santa Barbara, CA 93106 USA Rodney Topor School of Computing and Information
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-13.ps.Z, 19950627 Relative Debugging: A New Debugging Paradigm David Abramson and Rok Sosi<=c School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia E-mail: fdavida,sosicg@cit.gu.edu.au Technical Report CIT-94-13
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-17-abs.ps.Z, 19950627 Efficient Algorithms for Constructing Hamiltonian Paths on Meshes Shao Dong Chen Hong Shen Rodney Topor School of Computing and Information Technology Griffith University Nathan, Queensland 4111, AUSTRALIA Email: fschen,hong,rwtg@cit.gu.edu.au May 23, 1995 CIT-95-17
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-22.ps.Z, 19950627 Aholistic approach to simulation of ligand- receptor binding process 1. Introduction Ligand-receptor binding is one of the most important types of biological interaction. A ligand can be anymolecule which may bind to the surface of a receptor by forces other than electron sharing1.Areceptor is a
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-2.ps.Z, 19950627 Dynascope: User's Manual version 1.9 - June 1993 Rok Sosi<=c School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia E-mail: sosic@cit.gu.edu.au 1 Introduction The Dynascope programming environment supports directing in traditional, compiled languages.
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-08.ps.Z, 19950627 Fully Dynamic Algorithms for Maintaining Extremal Sets in A Family of Sets Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 27, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-06-abs.ps.Z, 19950627 Fast Parallel Algorithms for Finding Extremal Sets Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 20, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-26.ps.Z, 19950627 REDESCRIPTION, INFORMATION AND ACCESS TERRY DARTNALL Griffith University Over the past two decades Annette Karmiloff-Smith has developed a theory of cognition that depicts the mind as dynamic and changing rather than static and fixed (e. g. Karmiloff-Smith, 1986, 1990, 1991, 1992, this volume). It
	ftp://ftp.cit.gu.edu.au/pub/reports/69.ps.Z, 19950627 An Efficient Permutation-Based Parallel Algorithm for Range-Join in Hypercubes Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia September 10, 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-5.ps.Z, 19950627 A Procedural Interface for Program Directing 1 Rok Sosi<=c School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia E-mail: sosic@cit.gu.edu.au 1 Summary Debugging and performance measurement tools are becoming more important in the development and
	ftp://ftp.cit.gu.edu.au/pub/reports/dobbie93-3.ps.Z, 19950627 A Model for Sets and Multiple Inheritance in Deductive Object-Oriented Systems Gillian Dobbie Department of Computer Science The University of Melbourne Parkville, Vic. 3052 Australia gill@cs.mu.oz.au Rodney Topor School of Computing and Information Technology Griffith University Nathan, Qld 4111
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-19.ps.Z, 19950627 Efficient Parallel Permutation-Based Range-Join Algorithms on Mesh-Connected Computers Shao Dong Chen Hong Shen Rodney Topor School of Computing and Information Technology Griffith University Nathan, Queensland 4111, AUSTRALIA Email: fschen,hong,rwtg@cit.gu.edu.au August 19, 1994
	ftp://ftp.cit.gu.edu.au/pub/reports/lefebvre93-2.ps.Z, 19950627 Implementing an Object-Oriented Database System Using a Deductive Database System Alexandre Lefebvre School of Computing and Information Technology Griffith University, Nathan QLD 4111, Australia ajl@cit.gu.edu.au April 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/lawley93-3.ps.Z, 19950627 A Query Language for EER Schemas Michael Lawley Rodney Topor CRC for Distributed Systems Technology and School of Computing and Information Technology Griffith University Nathan, Queensland, Australia 4111 flawley,rwtg@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/lawley93-1.ps.Z, 19950627 Using Weakest Preconditions to Simplify Integrity Constraint Checking Michael Lawley Rodney Topor School of Computing and Information Technology Griffith University, Nathan, Qld 4111, Australia and Mark Wallace European Computer-Industry Research Centre Arabellastrasse 17, W-8000 M unchen 81, Germany
	ftp://ftp.cit.gu.edu.au/pub/reports/71.ps.Z, 19950627 Selection-Based Parallel Range-Join in Hypercubes Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia September 20, 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-4.ps.Z, 19950627 A Parallel Interior Point Method for Stochastic Linear Programs Amal de Silva, School of Computing and Information Technology, Griffith University, Nathan, QLD 4111, AUSTRALIA; Email amal@cit.gu.edu.au David Abramson, School of Computing and Information Technology, Griffith University, Nathan, QLD 4111,
	ftp://ftp.cit.gu.edu.au/pub/reports/75.ps.Z, 19950627 Efficient Parallel k-Set Chain Range-Join in Hypercubes Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia September 24, 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-03-abs.ps.Z, 19950627 On Computing the Subset Graph of a Collection of Sets1 Paul Pritchard School of Computing and Information Technology Griffith University Queensland Australia 4111 P.Pritchard@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-03.ps.Z, 19950627 On Computing the Subset Graph of a Collection of Sets1 Paul Pritchard School of Computing and Information Technology Griffith University
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-12.ps.Z, 19950627 A Parallel Interior Point Method and its Application to Facility Location Problems Amal de Silva / School of Computing and Information Technology, Griffith University, Nathan, QLD 4111, AUSTRALIA; Email amal@cit.gu.edu.au David Abramson / School of Computing and Information Technology, Griffith
	ftp://ftp.cit.gu.edu.au/pub/reports/lefebvre92-1.ps.Z, 19950627 Query Transformation for Accessing Heterogeneous Databases Alexandre Lefebvre Peter Bernus Rodney W. Topor School of Computing and Information Technology Griffith University Nathan QLD 4111, Australia fajl,bernus,rwtg@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-1.ps.Z, 19950627 Dynamic Visualization of Object Execution Rok Sosi<=c School of Computing and Information Technology Griffith University Nathan, Queensland 4111 Australia E-mail: sosic@kurango.cit.gu.edu.au Keywords: dynamic visualization, reflective programming, software environments, concurrent programming
	ftp://ftp.cit.gu.edu.au/pub/reports/74.ps.Z, 19950627 - 1 - degree spanning tree (MDST) problem and is known to be NP-hard . The decision version of this problem is as follows: given the graph G and an integer k, does there exist a spanning tree of G whose maximum degree is at most k This decision problem is NP- complete . Since the MDST is an
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-04-abs.ps.Z, 19950627 A simple sub-quadratic algorithm for computing the subset partial order Paul Pritchard P.Pritchard@cit.gu.edu.au Technical Report CIT-95-04 School of Computing and Information Technology Griffith University Queensland, Australia 4111 March 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-18-abs.ps.Z, 19950627 Improving the Quality of Learning Programming Languages in Computer Science Piyush Maheshwari Research Report CIT-95-18 School of Computing and Information Technology Griffith University Nathan, Brisbane, Qld., Australia 4111 E-mail: P.Maheshwari@cit.gu.edu.au May 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-27.ps.Z, 19950627 Redescription without Re-representation: Redescription through Correlation Corey Venour and Alex Young School of Computing & Information Technology Griffith University Nathan, Brisbane, Qld. 4111 Australia Internet: fcvenour, ayoungg@cit.gu.edu.au December 13, 1994
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-15.ps.Z, 19950627 Parallel k-Set Mutual Range-Join with Least Comparisons in Hypercubes Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia July 8, 1994
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-22-abstract.ps.Z, 19950627 Aholistic approach to ligand-receptor binding process K. Geppert, B. Pham , R.J. Quinn School of Computing and Information Technology, karlg@cit.gu.edu.au binh@cit.gu.edu.au Queensland Pharmaceutical Research Institute fax07849 1292 Grif th University,Queensland, 4111, Australia
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-06.ps.Z, 19950627 Fast Parallel Algorithms for Finding Extremal Sets Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 20, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-21.ps.Z, 19950627 Guard: A Relative Debugger Rok Sosi<=c and David Abramson fsosic, davidag@cit.gu.edu.au School of Computing and Information Technology Griffith University Brisbane, QLD 4111 Australia Technical Report CIT-94-21 October, 1994
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-16.ps.Z, 19950627 Using the Quality-Time Tradeoff in Local Optimization Rok Sosi<=c and Gregory D Wilby School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia E-mail: fsosic,gwilbyg@cit.gu.edu.au Technical Report CIT-94-14
	ftp://ftp.cit.gu.edu.au/pub/reports/72.ps.Z, 19950627 - 1 - G. The weight of a spanning tree is the sum of the weights of the edges belonging to that tree. A minimum spanning tree, TG is a spanning tree of G whose weight is a minimum. There are occasions when we have to add or delete edges from the graph under consideration. This may be due to the addition
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-25.ps.Z, 19950627 1 X-Cube: A Variation of Cube-Connected-Cycles Network With Lower Average Routing Steps Darryl Gee and Hong Shen School of Computing and Information technology Griffith University Nathan, Qld 4111, Australia {dgee, hong}@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/70.ps.Z, 19950627 Divide-and-Conquer Mapping of Parallel Programs onto Hypercube Computers Sam Lor Hong Shen Piyush Maheshwari School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia fsam, hong, piyushg@cit.gu.edu.au September 17, 1993
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-08-abs.ps.Z, 19950627 Fully Dynamic Algorithms for Maintaining Extremal Sets in A Family of Sets Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 27, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/lefebvre93-1.ps.Z, 19950627 Querying Heterogeneous Databases: A Case Study Alexandre Lefebvre Peter Bernus Rodney W. Topor School of Computing and Information Technology Griffith University, Nathan QLD 4111, Australia fajl,bernus,rwtg@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-05.ps.Z, 19950627 Finding Extremal Sets of A Normal Family of Sets in O( N2 log2 N ) Time and O( N2 log3 N ) Space Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia hong@cit.gu.edu.au March 20, 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-10.ps.Z, 19950627 Liisa von Hellens 30.3.1995 Page: 1 Value chain analysis as an enabling technology for optimal application of software engineering standards to business processes in software development organisations Liisa von Hellens Research Report CIT-95-10 April 1995 School of Computing and Information Technology,
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-20-abs.ps.Z, 19950627 Efficient Multiple Multicasting in Hypercubes Hong Shen School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-8.ps.Z, 19950627 COGNITION, CONTENT AND THE INNER CODE TERRY DARTNALL Griffith University A proposition may be thought, and again it may be true; never confuse these things. (Frege, 1967) What is it for a system to have thoughts, or to know or believe something, or to be in some other cognitive state A common answer in
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-7.ps.Z, 19950627 Implementation of Directing for Compiled Programs 1 Rok Sosi<=c School of Computing and Information Technology Griffith University Nathan, Queensland 4111, Australia E-mail: sosic@cit.gu.edu.au
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-16-abs.ps.Z, 19950627 Permutation-Based Range-Join Algorithms on N -Dimensional Meshes Shao Dong Chen Hong Shen Rodney Topor School of Computing and Information Technology Griffith University Nathan, Queensland 4111, AUSTRALIA Email: fschen,hong,rwtg@cit.gu.edu.au December 21, 1994 CIT-95-16
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-19-abs.ps.Z, 19950627 Assessing the Quality of Programming Assignments and Understanding Students Learning Difficulties Piyush Maheshwari Research Report CIT-95-19 School of Computing and Information Technology Griffith University Nathan, Brisbane, Qld., Australia 4111 E-mail: P.Maheshwari@cit.gu.edu.au May 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/topor91.ps.Z, 19950627 Safe Database Queries with Arithmetic Relations Rodney Topor Department of Computer Science The University of Melbourne
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-04.ps.Z, 19950627 A simple sub-quadratic algorithm for computing the subset partial order Paul Pritchard P.Pritchard@cit.gu.edu.au Technical Report CIT-95-04 School of Computing and Information Technology Griffith University Queensland, Australia 4111 March 1995
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-6.ps.Z, 19950627 Partitioning of Parallel Programs - 11 - schedule on the APG in our algorithm results in a completion time of 16 against 21 by declustering algorithm. We have also applied our algorithm to APGs given in : For the APG for two-processor schedule our algorithm produces a completion time of 6,
	ftp://ftp.cit.gu.edu.au/pub/reports/lawley93-2.ps.Z, 19950627 A Prolog Interpreter for F-Logic Michael Lawley School of Computing and Information Technology Griffith University Nathan, Queensland, Australia 4111 lawley@cit.gu.edu.au April 15, 1993 1 Introduction The Frame Logic or F-logic of Kifer, Lausen and Wu is currently the most developed and complete
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-94-14.ps.Z, 19950627 Efficient Computation of the Number of Good Shortest Paths in A Grid with Faulty Edges Hong Shen and Paul Pritchard School of Computing and Information Technology Griffith University Nathan, QLD 4111, Australia July 7, 1994
	ftp://ftp.cit.gu.edu.au/pub/reports/CIT-95-07.ps.Z, 19950627 A fast bitwise algorithm for computing the subset partial order Paul Pritchard P.Pritchard@cit.gu.edu.au Technical Report CIT-95-07 School of Computing and Information Technology Griffith University Queensland, Australia 4111 March 1995