Technical Reports 1999 - School of Computer Science

Technical Reports 1999
Number	Title	Authors	Date	Download
TR-99-01	Rectangular Attribute Cardinality Map: A New Histogram-like Technique for Query Optimization	B. John Oommen & Murali Thiyagarajah	January 1999	TR-99-01.pdf
TR-99-02	Parallel Virtual Memory	Frank Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari	January 1999	TR-99-02.pdf
TR-99-03	Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms	Frank Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari	January 1999	TR-99-03.pdf
TR-99-04	Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs	P. Bose, A. Chan, Frank Dehne, M. Latzel	January 1999	TR-99-04.pdf
TR-99-05	The Case for the Rectangular Attribute Cardinality Map in Query Optimization: Modeling, Prototype Validation and Testing*	Murali Thiyagarajah & B. John Oommen	February 1999	TR-99-05.pdf
TR-99-06	Trapezoidal Atribute Cardinality Map: A New Histogram-like Technique for Query Optimization	B. John Oommen & Murali Thiyagarajah	February 1999	TR-99-06.pdf
TR-99-08	Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs	E. Caceres, A. Chan, Frank Dehne, G. Prencipe	November 1999	TR-99-08.pdf
TR-99-09	Load Balanced and Communication Efficient Partitioning Strategies for Parallel Data Cube Generation	Z. Chen, Frank Dehne, S. Hambrusch, A. Rau-Chaplin	November 1999	TR-99-09.pdf
TR-99-10	Approximation Algorithms for Geometric Shortest Path Problems	L. Aleksandrov, A. Maheshwari, J.R. Sack	October 1999	TR-99-10.pdf

Share: Twitter, Facebook
Short URL: https://carleton.ca/scs/?p=12244