next up previous contents
Next: Selection of Theses for Up: Accepted Theses Previous: Accepted Theses

Theses for Doctor of Philosophy

Seppo Linnainmaa: Analysis of Some Known Methods of Improving the Accuracy of Floating-Point Sums. BIT 14 (1974), 167-202.

Eljas Soisalon-Soininen: Characterization of LL(k) Languages by Restricted LR(k) Grammars. A-1977-3.

Esko Ukkonen: On the Effect of Rounding Errors on the Flow of Control in Numerical Processes. A-1977-7.

Ralph-Johan Back: On the Correctness of Refinement Steps in Program Development. A-1978-4.

V.-E. Juhani Virkkunen: A Unified Approach to Floating-Point Rounding with Applications to Multiple-Precision Summation. A-1980-1.

Hannu Erkiö: Studies on the Efficiency of Certain Internal Sort Algorithms. A-1980-4.

Seppo Sippu: Syntax Error Handling in Compilers. A-1981-1.

Kari-Jouko Räihä: A Space Management Technique for Multi-Pass Attribute Evaluators. A-1981-4.

Timo Alanko: Empirical Studies of Program Behaviour in Virtual Memory. A-1983-3.

Kai Koskimies: Extensions of One-Pass Attribute Grammars. A-1983-4.

Heikki Mannila: Instance Complexity for Sorting and NP-complete Problems. A-1985-1.

Ilkka Haikala: Program Behaviour in Memory Hierarchies. A-1986-2.

Pekka Orponen: The Structure of Polynomial Complexity Cores. A-1986-3.

A. Inkeri Verkamo: Sorting in Hierarchical Memories. A-1988-1.

Jorma Tarhio: Attribute Grammars for One-Pass Compilation. A-1988-11.

Gösta Grahne: The Problem of Incomplete Information in Relational Databases. A-1989-1.

Niklas Holsti: Script Editing for Recovery and Reversal in Textual User Interfaces. A-1989-5.

Kimmo Raatikainen: Modelling and Analysis Techniques for Capacity Planning. A-1989-6.

Jukka Paakki: Paradigms for Attribute-Grammar-Based Language Implementation. A-1991-1.

Jyrki Kivinen: Problems in Computational Learning Theory. A-1992-1.

Patrik Floréen: Computational Complexity Problems in Neural Associative Memories. A-1992-5.

Pekka Kilpeläinen: Tree Matching Problems with Applications to Structured Text Databases. A-1992-6.

Jaana Eloranta: Minimal Transition Systems with Respect to Divergence Preserving Behavioural Equivalences. A-1994-1.

Petri Myllymäki: Mapping Bayesian Networks to Stochastic Neural Networks: A Foundation for Hybrid Bayesian-Neural Systems. A-1995-1.

Roope Kaivola: Equivalences, Preorders and Compositional Verification for Linear Time Temporal Logic and Concurrent Systems. A-1996-1.

Tapio Elomaa: Tools and Techniques for Decision Tree Learning. A-1996-2.

Helena Ahonen: Generating Grammars for Structured Documents Using Grammatical Inference Methods. A-1996-4.

Hannu Toivonen: Discovery of Frequent Patterns in Large Data Collections. A-1996-5.

Henry Tirri: Plausible Prediction by Bayesian Inference. A-1997-1.

Greger Lindén: Structured Document Transformations. A-1997-2.

Matti Nykänen: Querying String Databases with Modal Logic. A-1997-3.


next up previous contents
Next: Selection of Theses for Up: Accepted Theses Previous: Accepted Theses