(Ph.D. and Ph.Lic. theses are also listed separately in Ch. 3.3.)
2. P. Floréen: A short introduction to neural associative memories. Bulletin of the European Association for Theoretical Computer Science, no. 51(1993): 236-245.
Processor architectures - other architecture styles -
neural nets (C.1.3)
3. P. Floréen, P. Myllymäki, P. Orponen, and H. Tirri: Compiling object declarations into connectionist networks. AI Communications 3(1990):4, 172-183.
4. P. Floréen, P. Myllymäki, P. Orponen, and H. Tirri: Neural representation of concepts for robust inference. In: Computational Intelligence, II. Proc. International Symposium, Milan, Italy, Sept. 25-27, 1989. Ed. by F. Gardin et al. North-Holland, 1990, pp. 89-98.
5. R. Morris, L. Rubin, and H. Tirri: A comparison of feedforward and self-organizing approaches to the font orientation problem. In: Proc. International Joint Conference on Neural Networks, IJCNN '89, Washington, DC, 1989. Vol. 2, pp. 291-298.
6. R. Morris, L. Rubin, and H. Tirri: Neural network techniques for object orientation detection: solution by optimal feedforward network and learning vector quantization approaches. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(1990):11, 1107-1115.
7. P. Myllymäki: Bayesian Reasoning by Stochastic Neural Networks. Ph.Lic. Thesis, Report C-1993-67, Department of Computer Science, University of Helsinki, 1993. 78 pp.
8. P. Myllymäki: Using Bayesian Networks for incorporating probabilistic a priori knowledge into Boltzmann machines. To appear in Proceedings of SOUTHCON'94 (Orlando, March 1994).
9. P. Myllymäki, H. Tirri, P. Floréen, and P. Orponen: Compiling high-level specifications into neural networks. In: International Joint Conference on Neural Networks, Washington, D.C., Jan. 15-19, 1990. Vol. 2, pp. 475-478.
10. P. Myllymäki and P. Orponen: Programming the Harmonium. In: International Joint Conference on Neural Networks, IJCNN-91, Singapore, Nov. 18-21, 1991. Vol. 1, pp. 671-677.
11. P. Orponen, P. Floréen, P. Myllymäki, and H. Tirri: A neural implementation of conceptual hierachies with Bayesian reasoning. In: International Joint Conference on Neural Networks, San Diego, CA, June 17-21, 1990. Vol. 1, pp. 297-303.
12. H. Tirri: Implementing expert system rule conditions by neural networks. New Generation Computing 10(1991):1, 55-71.
Computer-communication networks (C.2)
13. M. Tienari and D. Khakhar (eds.): Information Network and Data Communication. IV. Proc. IFIP TC6 International Conference, Espoo, Finland, 16-19 March, 1992. North-Holland, 1992. 482 pp. (IFIP Transactions C: Communication Systems vol. C-6).
Network architecture and design (C.2.1)
14. K.E.E. Raatikainen: A framework for evaluating the performance of IN services. In: Proc. International Workshop on Intelligent Networks, Lappeenranta, 1993, pp. 121-129.
15. S. Kesti and J. Paakki: Revised ASN.1: type compatibility, assignment compatibility, subtype compatibility, new syntactic notation. Nokia Research Center, 1991. 31 pp. (TEKES/COMPET report no. 11).
16. K. Lehtinen: Experiences in using Estelle in X.411/P1 protocol specification. Report A-1988-10, Department of Computer Science, University of Helsinki. 37+67 pp.
17. J. Paakki, K. Granö, A. Ahtiainen and S. Kesti: An implementation of ASN.1 (Abstract Syntax Notation One). In: Proc. 3rd Symposium on Programming Languages and Software Tools, Kääriku, Estonia, August 23-24, 1993. Ed. by M. Tombak. University of Tartu, Department of Computer Science, 1993, pp. 95-108.
18. M. Tienari (with 14 other members of COST 11 ter group on FDT/ABM): A framework for the taxonomy of synthesis and analysis activities in distributed system design. In: Research into Networks and Distributed Applications. European Teleinformatics Conference - EUTECO '88, Vienna, Austria, April 20-22, 1988. North-Holland, 1988, pp. 859-871.
19. M. Tienari et al.: PROTAN88 - a software tool for verifying communication protocols specified with an extended state transition model. Report A-1988-5, Department of Computer Science, University of Helsinki. 65 pp.
20. T. Alanko, J. Keskinen, P. Kutvonen, M. Mutka, and M. Tienari: The AHTO project - software technology for open distributed processing. Report A-1989-4, Department of Computer Science, University of Helsinki. 53+3 pp.
21. M. Hiltunen: A study of distributed applications and the AHTO system. Report C-1990-31, Department of Computer Science, University of Helsinki. 32 pp.
22. L. Kutvonen and P. Kutvonen: Broadening the user environment with implicit trading. In: Proceedings of the Second IFIP TC6/WG6.1 International Conference on Open Distributed Processing, Berlin, Germany, 1993, pp. 157-168.
23. P. Myllymäki and H. Tirri: Massively parallel case-based reasoning with probabilistic similarity metrics. In: Proc. EWCBR-93, First European Workshop on Case-Based Reasoning, Univ. Kaiserslautern, Nov. 1-5, 1993. Ed. by M.M. Richter et al. University of Kaiserslautern, 1993. (SEKI Report SR-93-12) (SFB 314). Vol. 1, pp. 48-53.
Object-oriented programming (D.1.5)
24. K. Koskimies and J. Vihavainen: The problem of unexpected subclasses. Journal of Object-Oriented Programming 5(1992):6, 53-59.
Software engineering - requirements/specifications (D.2.1)
25. J. Paakki: Design engineering case study with COLD - partial results. Nokia Research Center, 1990. 18 pp. (ESPRIT/ATMOSPHERE report R.2.1.2.2.2.1.1:1).
Software engineering - testing and debugging (D.2.5)
26. P. Kilpeläinen and H. Mannila: Generation of test cases for simple Prolog programs. Acta Cybernetica 9(1990):3, 235-246.
Software engineering - miscellaneous (D.2.m)
27. J. Paakki: A note on the speed of Prolog. SIGPLAN Notices 23(1988):8, 73-82.
Programming languages - language classifications (D.3.2)
28. J. Paakki: PROFIT: a system integrating logic programming and attribute grammars. In: Programming Language Implementation and Logic Programming. 3rd Int. Symp. PLILP'91, Passau, Germany, August 26-28, 1991. Ed. by J. Maluszynski et al. Springer-Verlag, Berlin, 1991, pp. 243-254. (Lecture Notes in Computer Science 528).
Language constructs and features (D.3.3)
29. J. Paakki, A. Karhinen, and T. Silander: Orthogonal type extensions and reductions. SIGPLAN Notices 25(1990):7, 28-38.
Processors - compilers (D.3.4)
30. P. Kilpeläinen, H. Mannila, J. Riivari, and E. Ukkonen: Prolog in Ada: an implementation and an embedding. In: Proc. AIDA'89, 5th Annual Conference on Artificial Intelligence & Ada. Ed. by J. Diaz-Herrera et al. George Mason University, USA, 1989, pp. 96-107.
31. K. Koskimies and J. Paakki: Automating language implementation: a pragmatic approach. Ellis Horwood, 1990. 253 pp.
32. K. Koskimies, O. Nurmi, J. Paakki, and S. Sippu: The design of a language processor generator. Software - Practice & Experience 18(1988):2, 107-135.
33. K. Koskimies and J. Paakki: High-level tools for language implementation. Journal of Systems and Software 15(1991):2, 115-131.
34. J. Paakki and K. Toppola: An error-recovering form of DCGs. Acta Cybernetica 9(1990):3, 211-221.
35. J. Paakki: A practical implementation of DCGs. In: Proc. of the 3rd Workshop on Compiler Compilers, Institute of Informatics and Computing Technique, Academy of Sciences of the GDR, Berlin, pp. 249-257. (Abstract in: Compiler Compilers. 3rd Int. Workshop, CC'90, Schwerin, FRG, October 1990. Ed. by D. Hammer. Springer-Verlag, Berlin, 1990. Lecture Notes in Computer Science 477, pp. 224-225).
36. J. Paakki: Prolog in practical compiler writing. Computer Journal 34(1991):1, 64-72.
37. J. Tarhio: A compiler generator for attribute evaluation during LR parsing. In: Compiler Compilers and High Speed Compilation. 2nd CCHSC Workshop, Berlin, GDR, Oct. 10-14, 1988. Ed. by D. Hammer. Springer-Verlag, Berlin, 1989, pp. 146-159. (Lecture Notes in Computer Science 371).
38. M. Tienari: Compiler compilers. In: Concise Encyclopedia of Software Engineering. Ed. by D. Morris et al. Pergamon Press, Oxford, 1992, pp. 57-59.
39. H. Tirri and G. Lindén: ALCHEMIST - an object-oriented tool to build transformations between heterogenous data representations. In: 27th Annual Hawaii International Conference on System Sciences (HICSS '94). Vol. 2, pp. 226-235.
File systems management (D.4.3)
40. T. Alanko and P. Kutvonen: The AHTO directory: a distributed directory designed for distributed usage. IEEE Distributed Processing Technical Committee Newsletter 14(1992):1, 13-20.
41. M. Hiltunen and R.D. Schlichting: An approach to constructing modular fault-tolerant protocols. Report TR-93-10, Department of Computer Science, University of Arizona. 17 pp.
42. K.E.E. Raatikainen: Approximating response time distributions. Performance Evaluation Review 17(1989):1, 190-199. (1989 ACM SIGMETRICS and PERFORMANCE '89 International Conference on Measurement and Modeling of Computer Systems, May 23-26, 1989, Berkeley, CA, USA).
43. K.E.E. Raatikainen: Cluster analysis and workload classification. Performance Evaluation Review 20(1993):4, 24-30.
44. K.E.E. Raatikainen: Experiences of hierachical workload modeling in capacity planning. In: Proc. CMG '89, International Conference on Management and Performance Evaluation of Computer Systems, Reno, Nevada, Dec. 11-15, 1989, pp. 284-293.
45. A.I. Verkamo: External quicksort. Performance Evaluation 8(1988):4, 271-288.
46. A.I. Verkamo: Performance comparison of distributive and mergesort as external sorting algorithms. Journal of Systems and Software 10(1989):3, 187-200.
47. O. Nurmi, E. Soisalon-Soininen, and D. Wood: Relaxed AVL trees, main-memory databases, and concurrency. Technical Report no. 351, Department of Computer Science, University of Western Ontario, 1993. 22 pp.
Data storage representations (E.2)
48. N. Holsti: Using formal procedure parameters to represent and transmit complex data structures. SIGPLAN Notices 23(1988):3, 83-92.
49. O. Nurmi and E. Soisalon-Soininen: Uncoupling updating and rebalancing in chromatic binary search trees. In: Proc. 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Denver, CO, May 29-31, 1991, pp. 192-198.
Coding and information theory (E.4)
50. H. Peltola and J. Tarhio: On syntactical data compression. In: Proc. 2nd Symposium on Programming Languages and Software Tools, Pirkkala, Finland, Aug. 21-23, 1991. Ed. by K. Koskimies et al. University of Tampere, pp. 205-214. (Report A-1991-5, Department of Computer Science, University of Tampere).
51. R. Klein, O. Nurmi, Th. Ottmann, D. Wood: A dynamic fixed windowing problem. Algorithmica 4(1989):4, 535-550.
Theory of computation - general (F.0)
52. O. Nurmi and E. Ukkonen (eds.): Algorithm Theory - SWAT '92, 3rd Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992. Springer-Verlag, Berlin, 1993. 433 pp. (Lecture Notes in Computer Science 621). Models of computation (F.1.1)
53. P. Floréen: An analysis of the convergence time of Hamming memory networks. In: IJCNN, International Joint Conference on Neural Networks, San Diego, CA, June 17-21, 1990. Vol. 1, pp. 867-872.
54. P. Floréen and P. Orponen: Attraction radii in binary Hopfield nets are hard to compute. Neural Computation 5(1993):5, 812-821.
55. P. Floréen: The convergence of Hamming memory networks. IEEE Transactions on Neural Networks 2(1991):4, 449-457.
56. P. Floréen and P. Orponen: Counting stable states and sizes of attraction domains in Hopfield nets is hard. In: International Joint Conference on Neural Networks, Washington, D.C., June 18-22, 1989. Vol. 1, pp. 395-399.
57. P. Floréen: A new neural associative memory model. International Journal of Intelligent Systems 7(1992):5, 455-467.
58. P. Floréen and P. Orponen: On the computational complexity of analyzing Hopfield nets. Complex Systems 3(1989):6, 577-587.
59. P. Floréen: Worst-case convergence times for Hopfield memories. IEEE Transactions on Neural Networks 2(1991):5, 533-535.
60. P. Floréen: Computational complexity problems in neural associative memories. Ph.D. Thesis, Report A-1992-5, Department of Computer Science, University of Helsinki, 1992, 128+8 pp.
61. P. Orponen: Neural networks and complexity theory. In: Mathematical Foundations of Computer Science 1992. 17th International Symposium, Prague, Czechoslavia, August 1992. Ed. by I.M. Havel et al. Springer-Verlag, Berlin, 1992, pp. 50-61. (Lecture Notes in Computer Science 629).
62. P. Orponen: On the computational power of discrete Hopfield nets. In: 20th Int. Colloq. on Automata, Languages, and Programming, Lund, Sweden, July 1993. Ed. by A. Lingas et al. Springer-Verlag, Berlin, 1993, pp. 215-226. (Lecture Notes in Computer Science 700). Complexity classes (F.1.3)
63. R. Book, P. Orponen, D. Russo, and O. Watanabe: Lowness properties of sets in the exponential-time hierarchy. SIAM Journal on Computing 17(1988):3, 504-516.
64. K. Ko, P. Orponen, U. Schöning, and O. Watanabe: Instance complexity. Report A-1990-6, Department of Computer Science, University of Helsinki. 24 pp. (To appear in: Journal of the Association for Computing Machinery).
65. P. Orponen: On the instance complexity of NP-hard problems. In: Proc. 5th Annual Structure in Complexity Theory Conference, July 8-11, 1990, Barcelona, pp. 20-27.
Nonnumerical algorithms and problems (F.2.2)
66. Th. Eiter, G. Gottlob, H. Mannila: Adding disjunction to Datalog. Proc. of the 13th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. Minneapolis, Mn. 1994, to appear.
67. Th. Eiter, P. Kilpeläinen and H. Mannila: Recognizing renamable generalized propositional Horn formulas is NP-complete. Report A-1992-3, Department of Computer Science, University of Helsinki. 11 pp.
68. V. Estivill-Castro, H. Mannila and D. Wood: Right invariant metrics and measures of presortedness. Discrete Applied Mathematics 42(1993):1, 1-16.
69. R.-H. Güting, O. Nurmi, and Th. Ottmann: Fast algorithms for direct enclosures and direct dominances. Journal of Algorithms 10(1989):2, 170-186.
70. P. Jokinen, J. Tarhio and E. Ukkonen: A comparison of approximate string matching algorithms. Report A-1991-7, Department of Computer Science, University of Helsinki. 23 pp.
71. P. Jokinen and E. Ukkonen: Two algorithms for approximate string matching in static texts. In: Mathematical Foundations of Computer Science 1991, 16th International Symposium, Kazimierz Dolny, Poland, Sept. 9-13, 1991. Ed. by A. Tarlecki. Springer-Verlag, Berlin, 1991, pp. 240-248. (Lecture Notes in Computer Science 520). 72. P. Kilpeläinen and H. Mannila: Grammatical tree matching. In: Combinatorial Pattern Matching, 3rd Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Ed. by A. Apostolico et al. Springer-Verlag, Berlin, 1992, pp. 162-174. (Lecture Notes in Computer Science 644). 73. P. Kilpeläinen and H. Mannila: Ordered and unordered tree inclusion. Report A-1991-4, Department of Computer Science, University of Helsinki. 22 pp. To appear in SIAM Journal on Computing.
74. P. Kilpeläinen and H. Mannila: The tree inclusion problem. In: TAPSOFT'91. Proc. Int. Joint Conf. on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991. Vol. 1: Colloquium on Trees in Algebra and Programming (CAAP'91). Ed. by S. Abramsky et al. Springer-Verlag, Berlin, 1991, pp. 202-214. (Lecture Notes in Computer Science 493).
75. H. Mannila and E. Ukkonen: Time parameter and arbitrary deunions in the set union problem. In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, 1988. Ed. by R. Karlsson et al. Springer-Verlag, Berlin, 1988, pp. 34-42. (Lecture Notes in Computer Science 318). 76. H. Mannila and E. Ukkonen: Unifications, deunifications, and their complexity. BIT 30(1990):4, 599-619.
77. H. Mannila and D. Wood: A note on the largest empty rectangle problem. BIT 28(1988):1, 179-183. 78. O. Nurmi and J.-R. Sack: Separating a polyhedron by one translation from a set of obstacles. In: Graph-Theoretic Concepts in Computer Science. International Workshop WG '88, Amsterdam, The Netherlands, June 15-17, 1988. Ed. by J. van Leeuwen. Springer-Verlag, Berlin, 1989, pp. 202-212. (Lecture Notes in Computer Science 344).
79. J. Tarhio and E. Ukkonen: Approximate Boyer-Moore string matching. SIAM Journal on Computing 22(1993):2, 243-260.
80. J. Tarhio: A Boyer-Moore approach for two-dimensional matching. Report UCB/UCD 93/784, Computer Science Division, University of California, Berkeley, 1993.
81. J. Tarhio and E. Ukkonen: Boyer-Moore approach to approximate string matching. In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, July 11-14, 1990. Ed. by J.R. Gilbert et al. Springer-Verlag, Berlin, 1990, pp. 348-359. (Lecture Notes in Computer Science 447).
82. J. Tarhio and E. Ukkonen: A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science 57(1988):1, 131-145.
83. E. Ukkonen: A linear-time algorithm for finding approximate shortest common superstrings. Algorithmica 5(1990):3, 313-323.
84. E. Ukkonen: Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science 92(1992):1, 191-211.
85. E. Ukkonen: Constructing suffix trees on-line in linear time. In: Information Processing 92. Proc. IFIP 12th World Computer Congress, Madrid, Spain, 7-11 Sept. 1992. Vol. 1: Algorithms, software, architecture. Ed. by J. van Leeuwen. North-Holland 1992, pp. 484-492. (IFIP Transactions A: Computer Science and Technology vol. A-12).
86. E. Ukkonen: Approximate string-matching and the q-gram distance. In: Sequences II. Methods in Communication, Security, and Computer Science. Ed. by R. Capocelli et al. Springer-Verlag, New York, NY, 1993, pp. 300-312.
87. E. Ukkonen: Approximate string-matching over suffix trees. In: Combinatorial Pattern Matching. 4th Annual Symposium, CPM 93, Padova, Italy, June 1993. Ed. by A. Apostolico et al. Springer-Verlag, Berlin, 1993, pp. 228-242. (Lecture Notes in Computer Science 684).
88. E. Ukkonen: On-line construction of suffix-trees. Report A-1993-1, Department of Computer Science, University of Helsinki. 15 pp.
89. E. Ukkonen and D. Wood: Approximate string matching with suffix automata. Algorithmica 10(1993):5, 353-364.
Specifying and verifying and reasoning about programs (F.3.1)
90. J. Eloranta: Minimizing the number of transitions with respect to observation equivalence. BIT 31(1991):4, 576-590.
91. J. Eloranta: Equivalence concepts and algorithms for CCS-like languages. Ph.Lic. Thesis, Report C-1991-2, Department of Computer Science, University of Helsinki.
92. J. Eloranta: Minimal transition systems with respect to divergence preserving behavioural equivalences. Ph.D. Thesis, Report A-1994-1, Department of Computer Science, University of Helsinki.
93. R. Kaivola and A. Valmari: Using truth-preserving reductions to improve the clarity of Kripke-models. In: CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991. Ed. by J.C.M. Baeten et al. Springer-Verlag, Berlin, 1991, pp. 361-375. (Lecture Notes in Computer Science 527).
94. R. Kaivola and A. Valmari: The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In: CONCUR '92, 3rd Int. Conf. on Concurrency Theory, Stony Brook, NY, USA, August 24-27, 1992. Ed. by W.R. Cleaveland. Springer-Verlag, Berlin, 1992, pp. 207-221. (Lecture Notes in Computer Science 630).
95. A. Valmari: Compositional state space generation. Report A-1991-5, Department of Computer Science, University of Helsinki. 30 pp.
96. A. Valmari: Alleviating state explosion during verification of behavioural equivalence. Report A-1992-4, Department of Computer Science, University of Helsinki. 57 pp.
97. A. Valmari and M. Tienari: An improved failures equivalence for finite-state systems with a reduction algorithm. In: Protocol Specification, Testing, and Verification, XI. Proc. IFIP WG 6.1 11th International Symposium, Stockholm, Sweden, June 18-20, 1991. Ed. by B. Jonsson et al. North-Holland, Amsterdam, 1991, pp. 1-18.
98. A. Valmari and M. Tienari: Compositional failure-based semantic models for Basic LOTOS. Internal Report 16, Tampere University of Technology, Software Systems Laboratory, July 1993. 25 pp.
Grammars and other rewriting systems (F.4.2)
99. R. op den Akker, B. Melichar, and J. Tarhio: The hierarchy of LR-attributed grammars. In: Attribute Grammars and their Applications. International Conference WAGA, Paris, France, Sept. 19-21, 1990. Ed. by P. Deransart et al. Springer-Verlag, Berlin, 1990, pp. 13-28. (Lecture Notes in Computer Science 461). 100. R. op den Akker, B. Melichar, and J. Tarhio: Attribute evaluation and parsing. In: Attribute Grammars, Applications and Systems. International Summer School SAGA, Prague, Czechoslovakia, June 4-13, 1991. Ed. by H. Alblas et al. Springer-Verlag, Berlin, 1991, pp. 187-214. (Lecture Notes in Computer Science 545).
101. J. Paakki: A logic-based modification of attribute grammars for practical compiler writing. In: Logic Programming. Proc. 7th International Conference, Jerusalem, Israel, June 18-20, 1990. Ed. by D.H.D. Warren et al. The MIT Press, 1990, pp. 203-217.
102. S. Sippu and E. Soisalon-Soininen: Parsing theory. Vol. 1: Languages and parsing. Springer-Verlag, Berlin, 1988. 228 pp. (EATCS Monographs on Theoretical Computer Science vol. 15).
103. S. Sippu and E. Soisalon-Soininen: Parsing theory. Vol. 2: LR(k) and LL(k) parsing. Springer-Verlag, Berlin, 1990. 426 pp. (EATCS Monographs on Theoretical Computer Science vol. 20).
104. E. Soisalon-Soininen and J. Tarhio: Looping LR parsers. Information Processing Letters 26(1988):5, 251-253.
105. J. Tarhio: ATTE, editor for attribute grammars. In: Symposium on Programming Languages and Software Tools. Proc. 1st Finnish-Hungarian Workshop, 8-11 August, 1989, Szeged, Hungary. Ed. by T. Gyimothy. Hungarian Academy of Sciences, 1989, pp. 58-64. 106. J. Tarhio: Uncle-attributed grammars. BIT 30(1990):2, 437-449.
Database management - logical design (H.2.1)
107. G. Grahne: Horn tables - an efficient tool for handling incomplete information in databases. In: Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, PA, 1989, pp. 75-82.
108. M. Kantola, H. Mannila, K.-J. Räihä, and H. Siirtola: Discovering functional and inclusion dependencies in relational databases. International Journal on Intelligent Systems 7(1992), 591-607.
109. H. Laine: YYY - a database design tool. Acta Cybernetica 9(1990):3, 270-280.
110. H. Mannila and K.-J. Räihä: Practical algorithms for finding prime attributes and testing normal forms. In: Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, PA, 1989, pp. 128-133. 111. H. Mannila and K.-J. Räihä: On query languages for the p-string data model. In: Information Modelling and Knowledge Bases. Ed. by H. Kangassalo et al. IOS Press, 1990, pp. 469-482.
112. H. Mannila and K.-J. Räihä: Algorithms for inferring functional dependencies. Data & Knowledge Engineering 12(1994), 83-99.
113. H. Mannila and K.-J. Räihä: The design of relational databases. Addison-Wesley, 1992. 318 pp.
114. H. Mannila and K.-J. Räihä: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40(1992):2, 237-243.
115. H. Mannila: View updates and multiple representations. In: Symposium on Programming Languages and Software Tools. Proc. 1st Finnish-Hungarian Workshop, 8-11 August, 1989, Szeged, Hungary. Ed. by T. Gyimothy. Hungarian Academy of Sciences, 1989, pp. 168-176. Database management - languages (H.2.3)
116. G. Grahne and A. Mendelzon: Updates and subjunctive queries. To appear in Information and Computation.
117. P. Kilpeläinen and H. Mannila: Retrieval from hierarchical texts by partial patterns. In: SIGIR '93. Proc. 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Pittsburgh, PA, June 27 - July 1, 1993. Ed. by R. Korfhage et al. ACM Press, 1993, pp. 214-222.
118. H. Mannila and K.-J. Räihä: Automatic generation of test data for relational queries. Journal of Computer and System Sciences 38(1989):2, 240-258.
Database management - systems (H.2.4)
119. S. Abiteboul, P.C. Kanellakis, and G. Grahne: On the representation and querying of sets of possible worlds. Theoretical Computer Science 78(1991):1, 159-187.
120. G. Grahne: The problem of incomplete information in relational databases. Springer-Verlag, Berlin, 1991. 156 pp. (Lecture Notes in Computer Science 554).
121. G. Grahne, M. Nykänen and E. Ukkonen: Reasoning about strings in datadases. Proc. of the 13th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. Minneapolis, Mn. 1994, to appear.
122. G. Grahne, S. Sippu, and E. Soisalon-Soininen: Efficient evaluation for a subset of recursive queries. Journal of Logic Programming 10(1991):3/4, 301-332.
123. P. Kilpeläinen, G. Lindén, H. Mannila, and E. Nikunen: A structured document database system. In: EP90, Proc. Int. Conf. Electronic Publishing, Document Manipulation & Typography. Ed. by R. Furuta. Cambridge University Press, 1990, pp. 139-151.
124. J. Kuittinen, O. Nurmi, S. Sippu, and E. Soisalon-Soininen: Efficient implementation of loops in bottom-up evaluation of logic queries. In: Proc. 16th International Conference on Very Large Data Bases, August 13-16, 1990, Brisbane, Australia (VLDB '90). Morgan Kaufmann (distr.), 1990, pp. 372-379.
125. G. Lausen and E. Soisalon-Soininen: Locking policies and predeclared transactions. In: MFDBS 89, 2nd Symposium on Mathematical Fundamentals of Database Systems, Visegrad, Hungary, June 26-30, 1989. Ed. by J. Demetrovics et al. Springer-Verlag, Berlin, 1989, pp. 317-336. (Lecture Notes in Computer Science 364). 126. G. Lausen, E. Soisalon-Soininen, and P. Widmayer: On the power of safe locking. Journal of Computer and System Sciences 40(1990):2, 269-288.
127. W. Litwin and H. Tirri: Flexible concurrency control using value dates. IEEE Distributed Processing Technical Committee Newsletter 10(1988):2, 42-49. (Also in: Integration of information systems: bridging heterogeneous information. Ed. by A. Gupta. IEEE Press, 1989).
128. J. Puustjärvi: Distributed management of transactions in heterogeneous distributed database systems. BIT 31(1991):3, 406-420.
129. S. Sippu and E. Soisalon-Soininen: An optimization strategy for recursive queries in logic databases. In: Proc. 4th International Conference on Data Engineering, Feb. 1-5, 1988, Los Angeles, CA, pp. 470-477.
130. S. Sippu and E. Soisalon-Soininen: A generalized transitive closure for relational queries. In: Proc. 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 21-23, 1988, Austin, TX, pp. 325-332.
131. S. Sippu and E. Soisalon-Soininen: Multiple SIP strategies and bottom-up adorning in logic query optimization. In: ICDT'90, 3rd International Conference on Database Theory, Paris, France. Dec. 12-14, 1990. Ed. by S. Abiteboul et al. Springer-Verlag, Berlin, 1990, pp. 485-498. (Lecture Notes in Computer Science 470).
132. S. Sippu and E. Soisalon-Soininen: An analysis of magic sets and related optimization strategies for logic queries. Technical report B82, Laboratory of Information Processing Science, Helsinki University of Technology, 1992.
133. H. Tirri (ed.): Interoperability of heterogenous information systems: final report of the COST 11 ter project. Report A-1989-2, Department of Computer Science, University of Helsinki. 110 pp.
134. H. Tirri, J. Srinivasan, and B. Bhargava: Integrating data sources using federated objects. In: International Workshop on Distributed Object Management, Edmonton, CA, 1992. (To appear).
135. H. Tirri, J. Srinivasan, and B. Bhargava: Transactions for fragmented composite objects. Report CSD-TR-91-083, Department of Computer Sciences, Purdue University. 23 pp. (Submitted to: Very Large Database Journal, 1992).
Content analysis and indexing (H.3.1)
136. J. Kivinen and H. Mannila: Approximate dependency inference from relations. In: Database Theory - ICDT '92, 4th International Conference, Berlin, Germany, Oct. 14-16, 1992. Ed. by J. Biskup et al. Springer-Verlag, Berlin, 1992, pp. 86-98. (Lecture Notes in Computer Science 646).
Information search and retrieval (H.3.3)
137. J. Kivinen and H. Mannila: The power of sampling in knowledge discovery. Report C-1993-66, Department of Computer Science, University of Helsinki. 18 pp. Proc. of the 13th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. Minneapolis, Mn. 1994, to appear.
138. H. Mannila, H. Toivonen and A.I. Verkamo: Improved methods for finding association rules. Report C-1993-65, Department of Computer Science, University of Helsinki. 16 pp.
139. N. Holsti: A session editor with incremental execution functions. Software - Practice and Experience 19(1989):4, 329-350.
140. N. Holsti: Transcript editing, a simple user interface tool. In: Programming Environments for High-Level Scientific Problem Solving. Proc. of the IFIP TC2/WG2.5 Working Conference, Karlsruhe, Germany, 23-27 Sept. 1991. Ed. by P.W. Gaffney et al. North-Holland, Amsterdam, 1992, pp. 321-329. (IFIP Transactions A: Computer Science and Technology vol. A-2).
Group and organization interfaces (H.5.3)
141. S. Eherer, H. Erkiö, H. Lewe, B. Ludwig, S. Myrseth, R. Popping, X. Tong: Information technology support for group knowledge development. Working document of COST 14 Co-Tech working group 1, Sept. 1992. 56 pp.
Deduction and theorem proving (I.2.3)
142. P. Orponen: Dempster's rule of combination is #P-complete. Artificial Intelligence 44(1990):1/2, 245-253.
Knowledge representation formalisms and methods (I.2.4)
143. P. Floréen, P. Myllymäki, P. Orponen, and H. Tirri: NEULA - a hybrid neural-symbolic expert system shell. Tietojenkäsittelytiede 3(1992): 11-18.
144. G. Grahne: Updates and counterfactuals. In: Principles of Knowledge Representation and Reasoning. Proc. 2nd Int. Conf. KR91. Ed. by J. Allen et al. Morgan Kaufmann, 1991, pp. 269-276.
145. G. Grahne, A.O. Mendelzon, and R. Reiter: On the semantics of belief revision systems. In: Theoretical Aspects of Reasoning About Knowledge. Proc. 4th Conf. (TARK 1992), March 22-25, 1992, Monterey, CA. Ed. by Y. Moses et al. Morgan Kaufmann, San Mateo, CA, 1992, pp. 132-142.
146. G. Grahne, A.O. Mendelzon, and P.Z. Revesz: Knowledgebase transformations. In: Proc. 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2-4, 1992, San Diego, CA, pp. 246-260.
147. P. Myllymäki, P. Orponen, T. Silander: Integrating symbolic reasoning with neurally represented background knowledge. In: Proc. of the Finnish AI Conference (Espoo, Finland, June 1992), Vol. 2. Finnish AI Society, Helsinki, 1992, pp. 231-240.
148. H. Tirri: Applying neural computing to expert system design: coping with complex sensory data and attribute selection. In: Proc. 3rd International Conference on Foundations of Data Organization and Algorithms (FODO '89), Paris, France, pp. 474-489.
149. H. Toivonen: High level integration of rule-based and procedural programming through unification of frames and classes. In: Proc. 5th Florida Artificial Intelligence Research Symposium, Ft. Lauderdale, Florida, April 7-10, 1992. Ed. by Mark B. Fishman. Florida AI Research Society, St. Petersburg, Florida, 1992, pp. 129-133.
150. H. Ahonen, H. Mannila, and E. Nikunen: Forming grammars for structured documents. In: Proc. AAAI-93 Workshop on Knowledge Discovery in Databases, Washington, D.C., July 11-12, 1993. Ed. by G. Piatetsky-Shapiro. AAAI, pp. 314-325.
151. T. Elomaa: Embedding automatically acquired concept descriptions into a production system. In: Proc. 4th Int. Symp. Knowledge Engineering. Rank Xerox, 1990. 8 pp.
152. T. Elomaa: Extending the learnability of decision trees. In: 3rd Int. Conference on Tools for Artificial Intelligence (TAI '91), Nov. 5-8, 1991, San Jose, CA, pp. 504-505.
153. T. Elomaa and N. Holsti: An experimental comparison of inducing decision trees and decision lists in noisy domains. In: EWSL-89. Proc. 4th European Working Session on Learning, 4-6 December 1989, Montpellier. Ed. by K. Morik. Pitman/Morgan Kaufmann, 1990, pp. 59-69.
154. T. Elomaa and J. Kivinen: On inducing topologically minimal decision trees. In: Proc. 2nd Int. IEEE Conference on Tools for Artificial Intelligence (TAI 90), Herndon, VA, Nov. 6-9, 1990, pp. 746-752.
155. T. Elomaa and J. Kivinen: Learning decision trees from noisy examples. Report A-1991-3, Department of Computer Science, University of Helsinki. 15 pp.
156. R. Kankkunen, H. Mannila, M. Rantamäki, and E. Ukkonen: Experience in inductive inference of a hyphenation algorithm for Finnish. In: STeP-90 Finnish Artificial Intelligence Symposium, University of Oulu, June 11-14, 1990. Ed. by M. Djupsund et al. Finnish Artificial Intelligence Society, 1990, pp. 183-193.
157. J. Kivinen: Reliable and useful learning. In: Proc. 2nd Annual Workshop on Computational Learning Theory, University of California, Santa Cruz, July 31 - August 2, 1989. Ed. by R. Rivest et al. Morgan Kaufmann, San Mateo, CA, 1989, pp. 365-380.
158. J. Kivinen: Reliable and useful learning with uniform probability distributions. In: Proc. 1st International Workshop on Algorithmic Learning Theory. Ed. by S. Arikawa et al. Japanese Society for Artificial Intelligence, 1990, pp. 209-222.
159. J. Kivinen, H. Mannila, and E. Ukkonen: Learning hierachical rule sets. In: Proc. 5th ACM Workshop on Computational Learning Theory, 1992, pp. 37-44.
160. J. Kivinen, H. Mannila, and E. Ukkonen: Learning rules with local exceptions. Pres. at: European Conference on Computational Learning Theory 1993. (To appear).
161. J. Kivinen and M.K. Warmuth: Using experts for predicting continuous outcomes. Pres. at: European Conference on Computational Learning Theory 1993. (To appear.)
162. P. Myllymäki and H. Tirri: Bayesian case-based reasoning with neural networks. In: 1993 IEEE International Conference on Neural Networks, San Francisco, CA, March 28 - April 1, 1993. Vol. 1, pp. 422-427.
163. P. Myllymäki and H. Tirri: Learning in neural networks with Bayesian prototypes. To appear in Proceedings of SOUTHCON'94 (Orlando, March 1994).
164. E. Nikunen and H. Mannila: Defining and inverting textual views of structured documents. In: Symposium on Programming Languages and Software Tools. Proc. 1st Finnish-Hungarian Workshop, 8-11 August, 1989, Szeged, Hungary. Ed. by T. Gyimothy. Hungarian Academy of Sciences, 1989, pp. 108-126.
165. H. Tirri: Concept randomness and neural networks. In: Proc. 1991 International Conference on Artificial Neural Networks (ICANN-91), Espoo, Finland, 24-28 June, 1991. Ed. by T. Kohonen et al. North-Holland, Amsterdam, 1991. Vol. 2, pp. 1367-1370.
166. H. Tirri: Learning with instance based encodings. Pres. at the 2nd Annual Workshop on Computational Learning Theory and Natural Learning Systems: Constraints and Prospects, Berkeley, CA, 1991. (To appear.)
Problem solving, control methods, and search (I.2.8)
167. R. Greiner and P. Orponen: Probably approximately optimal derivation strategies. In: Principles of Knowledge Representation and Reasoning. Proc. 2nd Int. Conf. (KR91), Cambridge, MA, April 22-25, 1991. Ed. by J. Allen et al. Morgan Kaufmann, 1991, pp. 277-288.
168. P. Orponen and R. Greiner: On the sample complexity of finding good search strategies. In: Proc. 3rd Annual Workshop on Computational Learning Theory, Rochester, NY, August 6-8, 1990. Ed. by M. Fulk et al. Morgan Kaufmann, 1990, pp. 352-358.
Simulation and modeling - general (I.6.0)
169. T. Kerola: Qsolver - a modular environment for solving queueing network models. In: Computer Performance Evaluation: Modelling Techniques and Tools. Proc. 5th Int. Conference, Torino, Italy, Feb. 13-15, 1991. Ed. by G. Balbo et al. Elsevier, 1992, pp. 427-438.
170. T. Kerola, P. Purovesi, and E. Hietalahti: Qsolver user guide. Report C-1990-32, Department of Computer Science, University of Helsinki. 44 pp.
Model validation and analysis (I.6.4)
171. K.E.E. Raatikainen: Validating percentiles of response times in queueing network simulation. In: Proc. 1988 Summer Computer Simulation Conference, Seattle, WA, pp. 134-141.
172. K.E.E. Raatikainen: Sequential procedure for simultaneous estimation of several percentiles. Transactions of the Society of Computer Simulation 7(1990):1, 21-44.
173. K.E.E. Raatikainen: Modeling service-time distributions for queueing network simulation. Communications in Statistics. B, Simulation and Computation 20(1991):1, 375-390.
174. K.E.E. Raatikainen: Modeling service distributions in queueing network simulation. Simulation 59(1992):2, 116-126.
Simulation output analysis (I.6.6)
175. K.E.E. Raatikainen: A sequential procedure for simultaneous estimation of several means. ACM Transactions on Modeling and Computer Simulation 3(1993):2, 108-133.
176. K.E.E. Raatikainen: Simulation estimation of dynamic properties in queueing systems. Report C-1993-26, University of Helsinki, Department of Computer Science. 19 pp.
Life and medical sciences (J.3)
177. J. Rinne, H. Lokki, and P. Saurola: Survival estimates of nestling recoveries: forbidden fruits of ringing? The Ring 13(1990):1/2, 255-270.
178. J. Rinne, H. Lokki, and P. Saurola: Extensive parameterisation of survival models for recovery data analysis. In: Marked Individuals in the Study of Bird Population. Ed. by J.D. Lebreton et al. Birkhäuser, 1993, pp. 65-75.
179. M. Tienari (ed.): The First Years of Computer Technology in Finland. A collection of articles. Suomen atk-kustannus Oy, Espoo, 1993. 518 pp. /In Finnish./
Computer uses in education (K.3.1)
180. L. Huovinen, L. Häkkinen, M. Mäkelä, and P. Nummelin: Using CAD software as a teacher's tool. In: EURIT 90, A European Conference on Technology and Education, 1990. (Full paper on disk, textfile: E018).
181. M. Mäkelä, L. Huovinen, and P. Nummelin: Computer uses in the university classroom. Education & Computing 6(1990):1/2, 191-197.
182. P. Nummelin, L. Huovinen, and M. Mäkelä: Experiences of the course "Computer Uses in Education". In: EURIT 90, A European Conference on Technology and Education, 1990. (Full paper on disk, textfile: E012).