next up previous
Next: Faculty Up: Research Previous: Knowledge Representation and

Publications

Recent publications of the Department are listed below according to the ACM Computing Reviews (CR) classification system. The list contains selected publications in 1991-93 and new publications since January 1994.


    Introductory and Survey (A.1)

  1. H. Lokki, I. Haikala, S. Linnainmaa, K. Rönkä, and O. Susiluoto: Introduction to Data Processing (in Finnish). 3rd ed, Tietotekniikan liitto, 1992.



    Computer-Communication Networks - General (C.2.0)

  2. M. Tienari and D. Khakhar (eds.): Information Network and Data Communication. IV. Proc. IFIP TC6 International Conference, North-Holland, 1992.



    Network Architecture and Design (C.2.1)

  3. K. Granö, J. Harju, T. Järvinen, T. Karttunen, T. Larikka, and J. Paakki: Application of the protocol engineering language Kannel to IN service specification. In: Proc. 3rd Summer School on Telecommunications, Vol. I: IFIP TC-6 International Workshop on Intelligent Networks (ed. O. Martikainen and J. Harju). Lecture Notes LN-18, Lappeenranta University of Technology, 1994, 79-93.

  4. K. Granö, J. Harju, T. Järvinen, T. Karttunen, T. Larikka, and J. Paakki: IN service specification using the Kannel language. In: Intelligent Networks (ed. J. Harju et al.), Chapman & Hall, 1995, 77-96.

  5. J. Kiiskinen, M. Kojo, M. Liljeberg, and K. Raatikainen: Data channel service for wireless telephone links. To appear in Proc. 2nd International Mobile Computing Conference, Hsinchu, Taiwan, 1996.

  6. M. Kojo, K. Raatikainen, and T. Alanko: Connecting mobile workstations to the Internet over a digital cellular telephone network. In: Mobile Computing (ed. T. Imielinski and H. Korth), Kluwer Academic Publishers, 1996, 253-270.

  7. K. Raatikainen: Database Access in intelligent networks. In: Intelligent Networks (ed. J. Harju et al.), Chapman and Hall, 1995, 173-193.

  8. K. Raatikainen: Information aspects of services and service features in intelligent network capability set-1. Report C-1994-45, Department of Computer Science, University of Helsinki, 1994.

  9. K. Raatikainen, T. Karttunen, O. Martikainen, and J. Taina: Evaluation of database architectures for intelligent networks. In: Proc. TeleCom 95, ITU, 1995, Vol. 2, 549-553.

  10. K. Raatikainen and J. Taina: Design issues in database systems for telecommunication services. In: Proc. IFIP-TC6 Working Conference on Intelligent Networks, TeleDenmark, 1995, 71-81.

  11. J. Taina: Problem classes in intelligent network database design. In: Intelligent Networks (ed. J. Harju et al.), Chapman & Hall, 1995, 197-204.

  12. J. Taina and K. Raatikainen: Design issues and experimental database architecture for telecommunications. To appear in Proc.\ IFIP IN '95, Intelligent Networks and New Services (ed.\ W. Iversen et al.), Chapman and Hall, 1996.

  13. J. Taina, M. Rautila, and K. Raatikainen: An experimental database architecture for intelligent networks. In: Proc. IFIP TC6 Working Conference on Intelligent Networks, Copenhagen, 1995.

  14. J. Taina and H. Töhönen: On implementing a prototype IN database architecture. Report C-1995-42, Department of Computer Science, University of Helsinki, 1995.



    Network Protocols (C.2.2)

  15. K. Arvonen, K. Granö, J. Harju, and J. Paakki: Experiences with the integration of protocol software tools. To appear in Computer Communications.

  16. T. Järvinen, K. Granö, J. Harju, and J. Paakki: An integrated environment for protocol engineering. In: Proc. NWPER '94, 6th Nordic Workshop on Programming Environment Research (ed. B. Magnusson et al.), Report LU-CS-TR: 94-127, Department of Computer Science, Lund University, 1994, 177-193.

  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 (ed. M. Tombak), University of Tartu, Department of Computer Science, 1993, 95-108.



    Network Operations (C.2.3)

  18. K. Hätönen, M. Klemettinen, H. Mannila, P. Ronkainen, and H. Toivonen: Rule discovery in alarm databases. Report C-1996-7, Department of Computer Science, University of Helsinki, 1996.

  19. K. Hätönen, M. Klemettinen, H. Mannila, P. Ronkainen, and H. Toivonen: TASA: Telecommunication alarm sequence analyzer, or ``How to enjoy faults in your network''. In: Proc. NOMS '96, 1996 IEEE Network Operations and Management Symposium, Kyoto, Japan, IEEE, 1996, 520-529.

  20. K. Rossi and H. Toivonen: Q3E: Q3 emulator agent. In: Proc. NOMS '94, IEEE Network Operations and Management Symposium, Kissimmee, Florida, IEEE, 1994, 70-80.



    Distributed Systems (C.2.4)

  21. L. Kutvonen: Achieving interoperability through ODP Trading function. In: Proc. ISADS '95, Second International Symposium on Autonomous Decentralized systems, IEEE Computer Society, 1995, 63-69.

  22. L. Kutvonen: Comparison of the DRYAD trading system to ODP Trading function draft. Report C-1994-51, Department of Computer Science, University of Helsinki, 1994.

  23. L. Kutvonen: Federation transparency in ODP trading function. Report C-1994-32, Department of Computer Science, University of Helsinki, 1994.

  24. L. Kutvonen: Overview of the DRYAD trading system implementation. In: Proc. IFIP/IEEE International Conference on Distributed Platforms (ed. A. Schill et al.), Chapman & Hall, 1996, 314-326.

  25. L. Kutvonen: Supporting transition to open, heterogeneous computing environment. In: TINA '95, Integrating Telecommunications and Distributed Computing - from Concept to Reality, 1995, 55-66.

  26. L. Kutvonen and P. Kutvonen: Broadening the user environment with implicit trading. In: Proc. Second IFIP TC6/WG6.1 International Conference on Open Distributed Processing, Berlin, 1993, 157-168.

  27. P. Kutvonen and L. Kutvonen: Measured performance of a special-purpose database engine for distributed system software. In: Proc. First International Workshop on High Speed Networks and Open Distributed Platforms (ed. V. Tschammer and M. Smirnov), St. Petersburg, 1995. Also to appear in Computer Communications Journal.

  28. M. Liljeberg, T. Alanko, M. Kojo, H. Laamanen, and K. Raatikainen: Optimizing World-Wide Web for weakly-connected mobile workstations: an indirect approach. In: Proc. IEEE SDNE '95, 2nd International Workshop on Services in Distributed and Networked Environments, IEEE Computer Society Press, 1995, 132-139.

  29. M. Liljeberg, H. Helin, M. Kojo, and K. Raatikainen: Enhanced services for World-Wide Web in mobile WAN environment. To appear in Proc. IMAGE'COM 96, 3rd International Conference Communicating by Image and Multimedia, Bordeaux, France, 1996.

  30. K. Raatikainen: Experimental evaluation of a parallel spectral method for run length control in steady-state simulation. Report C-1994-55, Department of Computer Science, University of Helsinki, 1994.

  31. J. Taina: Evaluation of OMG, ODMG, X.500, and X.700 Data Models. Report C-1994-54, Department of Computer Science, University of Helsinki, 1994.



    Special-Purpose and Application-Based Systems (C.3)

  32. J. Taina: Requirements analysis for database services in telecommunications. Report C-1995-17, Department of Computer Science, University of Helsinki, 1995.



    Performance of Systems (C.4)

  33. T. Alanko, M. Kojo, H. Laamanen, M. Liljeberg, M. Moilanen, and K. Raatikainen: Measured performance of data transmission over cellular telephone networks. Computer Communications Review, 24, 5 (1994), 24-44.

  34. K. Raatikainen: Symptoms of self-similarity in measured arrival process of Ethernet packets to a file server. In: Proc. NTS-12, Nordic Teletraffic Seminar, VTT, 311-324.



    Object-Oriented Programming (D.1.5)

  35. K. Granö: Object-oriented implementation of communication protocols. In: Conceptual Modelling and Object-Oriented Programming (ed. A. Lehtola and J. Jokiniemi), Publications of the Finnish Artificial Intelligence Society, no. 11, 1993, 117-131.

  36. K. Koskimies and J. Vihavainen: The problem of unexpected subclasses. Journal of Object-Oriented Programming 5, 6 (1992), 53-59.



    Logic Programming (D.1.6)

  37. T. Eiter, G. Gottlob, and H. Mannila: On the expressive power of disjunctive logic programming over finite structures. Report CD-TR 96/90, Christian Doppler Laboratory for Expert Systems, TU Vienna, 1996.



    Software Engineering - Tools and Techniques (D.2.2)

  38. K. Arvonen, J. Harju, K. Granö, and J. Paakki: A Survey of software tools in protocol engineering. Technical Report TR-1, Lappeenranta University of Technology, 1993.

  39. K. Granö: A Case Study on the Application of Protocol Software Tools. In: Proc. 2nd Summer School on Telecommunications (ed. Jarmo Harju), Lecture Notes LN-17, Lappeenranta University of Technology, 1993, 117-142.

  40. G. Lindén, J. Manuel Quesada, and A. I. Verkamo. OCML to FND - CASE integration transformations, user's guide. Technical Report T444/DS/2, ESPRIT-II Project 5365 VITAL, April 1995.

  41. G. Lindén, L. Montero, J. Manuel Quesada, H. Tirri, and A. I. Verkamo. OCML to FND - CASE integration transformations, technical description. Technical Report T444/DS/1, ESPRIT-II Project 5365 VITAL, April 1995.

  42. G. Lindén and A. I. Verkamo. An interface between different software development environments. In: Proc. KBSE '95, Tenth Annual Knowledge Based Software Engineering Conference, IEEE Computer Society Press, 1995, 79-87.

  43. A. I. Verkamo: Cooperation of KBS development environments and CASE environments. In: Proc. SEKE '94, Sixth International Conference on Software Engineering and Knowledge Engineering, Knowledge Systems Institute, 1994, 358-365.

  44. A. I. Verkamo and G. Lindén: Case tool interface. Internal deliverable UH/T443/ID003, ESPRIT-II Project 5365 VITAL, May 1994.

  45. A. I. Verkamo and G. Lindén: Problems in interfacing tools of different development environments. In Proc. SEKE '95, Seventh International Conference on Software Engineering and Knowledge Engineering, 1995, 429-437.



    Software Engineering - Testing and Debugging (D.2.5)

  46. T. Gyimóthy and J. Paakki: Static slicing of logic programs. In: Proc. AADEBUG '95, 2nd International Workshop on Automated and Algorithmic Debugging (ed. M. Ducassé), IRISA-CNRS, 1995.



    Software Engineering - Distribution and Maintenance (D.2.7)

  47. J. Koskinen, J. Paakki, and J. Salminen: Program text as hypertext - using program dependences for transient linking. In: Proc. SEKE '94, Sixth International Conference on Software Engineering and Knowledge Engineering, Knowledge Systems Institute, 1994, 209-216.

  48. A. Salminen, J. Koskinen, and J. Paakki: HyperSoft: an environment for hypertextual software maintenance. In: Proc. NWPER '94, 6th Nordic Workshop on Programming Environment Research (ed. B. Magnusson et al.), Report LU-CS-TR: 94-127, Department of Computer Science, Lund University, 1994, 25-37.

  49. A. Salminen, J. Paakki, and J. Koskinen: Incorporating hypertext functionality into software maintenance environments. To appear in Proc. ECHT '94, Workshop on Incorporating Hypertext Functionality into Software Systems, New Jersey Institute of Technology.



    Software Engineering - Design (D.2.10)

  50. K. Granö, J. Harju, T. Järvinen, T. Larikka, and J. Paakki: Object-oriented protocol design and reuse in Kannel. In Proc. 21st Euromicro Conference on Design of Hardware/Software Systems, IEEE Computer Society Press, 1995, 465-472.



    Programming Languages - Language Classifications (D.3.2)

  51. K. Granö and J. Paakki: A language for specifying communication protocols. In: Proc. 7th Finnish Symposium on Computer Science (ed. M. Penttonen), Report A-1994-1, Department of Computer Science, University of Joensuu, 1994, 1-17.

  52. K. Granö, J. Harju, J. Paakki, and T. Järvinen: Proposal for a protocol engineering language. Technical Report TR-6, University of Jyväskylä, 1994.

  53. K. Granö, T. Järvinen, J. Paakki, J. Harju, and T. Larikka: Kannel - a language for tuning protocols. In: Proc. 4th Symposium on Programming Languages and Software Tools (ed. L. Varga). Department of General Computer Science, Eötvös Loránd University, 1995, 209-222.

  54. J. Paakki: PROFIT: a system integrating logic programming and attribute grammars. In: Proc. PLILP '91, Programming Language Implementation and Logic Programming. 3rd International Symp (ed. J. Maluszynski et al.) Lecture Notes in Computer Science 528, Springer-Verlag, Berlin, 1991, 243-254.



    Processors - Compilers (D.3.4)

  55. J. Boye, J. Paakki, and J. Maluszynski: Synthesis of directionality information for functional logic programs. In: Proc. WSA '93, 3rd International Workshop on Static Analysis, Lecture Notes in Computer Science 724, Springer-Verlag, 1993, 165-177.

  56. K. Koskimies and J. Paakki: High-level tools for language implementation. Journal of Systems and Software 15, 2 (1991), 115-131.

  57. G. Lindén and H. Tirri. ALCHEMIST - the handbook. Version 1.08. Technical Report T416/DS/2, ESPRIT-II Project 5365 VITAL, April 1995.

  58. G. Lindén, H. Tirri, and A. I. Verkamo. ALCHEMIST: a general purpose transformation generator. To appear in Software - Practice and Experience.

  59. G. Lindén, H. Tirri, and A. I. Verkamo. The VITAL transformation assistant. In: VITAL Project Final Report ( ed. Rouge) Deliverable SYSECA/DD71.5, ESPRIT Project P5365 VITAL, April 1995.

  60. J. Paakki: Multi-pass execution of functional logic programs. In: POPL '94, Conference Record 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, 1994, 361-374.

  61. J. Paakki: Prolog in practical compiler writing. Computer Journal 34, 1 (1991), 64-72.

  62. J. Paakki, T. Gyimóthy, and T. Horváth: Independent and-parallelization of logic programs using static slicing. In: Proc. 4th Symposium on Programming Languages and Software Tools (ed. L. Varga), Department of General Computer Science, Eötvös Loránd University, 1995, 302-311.

  63. M. Tienari: Compiler compilers. In: Concise Encyclopedia of Software Engineering (ed. D. Morris et al.), Pergamon Press, Oxford, 1992, 57-59.

  64. H. Tirri and G. Lindén: ALCHEMIST - an object-oriented tool to build transformations between heterogeneous data representations. In: Proc. HICSS '94, 27th Annual Hawaii International Conference on System Sciences, Vol. 2, 226-235.

  65. H. Tirri and G. Lindén. VITAL transformation approach. Deliverable UH/DD415, ESPRIT-II Project 5365 VITAL, 1994.



    File Systems Management (D.4.3)

  66. T. Alanko and P. Kutvonen: The AHTO directory: a distributed directory designed for distributed usage. IEEE Distributed Processing Technical Committee Newsletter 14, 1 (1992), 13-20.



    Performance (D.4.8)

  67. K. Raatikainen: Cluster analysis and workload classification. Performance Evaluation Review 20, 4 (1993), 24-30.



    Data Storage Representations (E.2)

  68. 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, 1991, 192-198.



    Coding and Information Theory (E.4)

  69. H. Peltola and J. Tarhio: On syntactical data compression. In: Proc. 2nd Symposium on Programming Languages and Software Tools (ed. K. Koskimies et al.), Report A-1991-5, Department of Computer Science, University of Tampere, 205-214.

  70. J. Tarhio: Context coding of parse trees. Proc. DCC '95, Data Compression Conference (ed. J. Storer and M. Cohn), IEEE Computer Society Press, Los Alamitos, California, 1995, p. 442.



    Theory of Computation - General (F.0)

  71. O. Nurmi and E. Ukkonen (eds.): Algorithm Theory - SWAT '92, 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 621, Springer-Verlag, Berlin, 1992.



    Models of Computation (F.1.1)

  72. P. Floréen and P. Orponen: Attraction radii in binary Hopfield nets are hard to compute. Neural Computation 5, 5 (1993), 812-821.

  73. P. Floréen and P. Orponen: Complexity issues in discrete Hopfield networks. Report A-1994-4, Department of Computer Science, University of Helsinki. To appear in The Computational and Learning Complexity of Neural Networks: Advanced Topics. (ed. I. Parberry), MIT Press, Cambridge, MA.

  74. P. Myllymäki: Mapping Bayesian networks to stochastic neural networks: a foundation for hybrid Bayesian-neural systems. Ph.D. Thesis, Report A-1995-1, Department of Computer Science, University of Helsinki, December 1995.

  75. P. Myllymäki: Mapping Bayesian networks to Boltzmann machines. In: Proc. Applied Decision Technologies 1995, London, 1995, 269-280.

  76. P. Myllymäki: Using Bayesian networks for incorporating probabilistic a priori knowledge into Boltzmann machines. In: Proc. SOUTHCON '94, Orlando, 1994, 97-102.

  77. P. Myllymäki and P. Orponen: Programming the Harmonium. In: Proc. IJCNN-91, International Joint Conference on Neural Networks, Singapore, 1991, Vol. 1, 671-677.

  78. P. Myllymäki and H. Tirri: Bayesian case-based reasoning with neural networks. In: Proc. IEEE International Conference on Neural Networks, San Francisco, 1993, 422-427.

  79. P. Myllymäki and H. Tirri: Massively parallel case-based reasoning with probabilistic similarity metrics. In: Topics in Case-Based Reasoning (ed. S. Wess et al.), Lecture Notes in Artificial Intelligence 837, Springer-Verlag, 1994, 144-154.

  80. P. Orponen: Computational complexity of neural networks: A survey. Nordic Journal of Computing 1, 1 (1994), 94-110.

  81. P. Orponen: On the computational power of continuous time neural networks. Project NeuroCOLT Report NC-TR-95-051, Royal Holloway College, Dept. of Computer Science, Univ. of London, 1995.

  82. P. Orponen: On the computational power of discrete Hopfield nets. In: Proc. 20th International Colloq. on Automata, Languages, and Programming (ed. A. Lingas et al.), Lecture Notes in Computer Science 700, Springer-Verlag, Berlin, 1993, 215-226.

  83. P. Orponen: The computational power of discrete Hopfield nets with hidden units. Neural Computation 8, 2 (1996), 403-415.

  84. P. Orponen: Computing with truly asynchronous threshold logic networks. To appear in Theoretical Computer Science 178 (1997).

  85. P. Orponen: Neural networks and complexity theory. In: Proc. Mathematical Foundations of Computer Science 1992, 17th International Symposium (ed. I. Havel et al.), Lecture Notes in Computer Science 629, Springer-Verlag, Berlin, 1992, 50-61.

  86. H. Tirri: Implementing expert system rule conditions by neural networks. New Generation Computing 10, 1 (1991), 55-71.



    Complexity Classes (F.1.3)

  87. H. Buhrman and P. Orponen: Random strings make hard instances. In: Proc. 9th Ann. Conference on Structure in Complexity Theory (ed. U. Schöning et al.), IEEE, New York, 1994, 217-222. Also to appear in J. Comput. System Sciences.

  88. P. Orponen, K. Ko, U. Schöning, and O. Watanabe: Instance complexity. J. Assoc. Comput. Mach. 41, 1 (1994), 96-121.



    Nonnumerical Algorithms and Problems (F.2.2)

  89. Z. Galil and E. Ukkonen (eds.): Combinatorial Pattern Matching - CPM 95, Proceedings of the Sixth Annual Symposium, Lecture Notes in Computer Science 937, Springer, 1995.

  90. T. Eiter and H. Mannila: Theory distance and similarity: measures and computation. To appear in Acta Informatica.

  91. T. Eiter, G. Gottlob, and H. Mannila: Expressive power and complexity of disjunctive datalog under the stable model semantics. In: Management and Processing of Complex Data Structures, Proc. Third Workshop on Information Systems and Artificial Intelligence (ed. K. van Luck and H. Marburger), Springer-Verlag 1994, p. 83-103.

  92. T. Eiter, G. Gottlob, and H. Mannila: Expressive power and complexity of disjunctive datalog. In: Proc. PODS '94, 1994 ACM SIGACT-SIGMOD-SIGACT Symposium on Principles of Database Theory, Minneapolis, MN, 1994, 267-278.

  93. T. Eiter, P. Kilpeläinen, and H. Mannila: Recognizing renamable generalized propositional Horn formulas is NP-complete. Discrete Applied Mathematics 59 (1995) 23-31.

  94. V. Estivill-Castro, H. Mannila, and D. Wood: Right invariant metrics and measures of presortedness. Discrete Applied Mathematics 42, 1 (1993), 1-16.

  95. N. Holsti and E. Sutinen: Approximate string matching using q-gram places. In: Proc. Seventh Finnish Symposium on Computer Science (ed. M. Penttonen), Report A-1994-1, Department of Computer Science, University of Joensuu, 1994, 23-32.

  96. P. Jokinen, E. Sutinen, and E. Ukkonen: Approximate string matching (in Finnish). Tietojenkäsittelytiede 3 (1992), 35-39.

  97. P. Jokinen, J. Tarhio, and E. Ukkonen: A comparison of approximate string matching algorithms. To appear in Software - Practice and Experience.

  98. P. Jokinen and E. Ukkonen: Two algorithms for approximate string matching in static texts. In: Proc. Mathematical Foundations of Computer Science 1991, 16th International Symposium (ed. A. Tarlecki), Lecture Notes in Computer Science 520, Springer-Verlag, Berlin, 1991, 240-248.

  99. R. Khardon, H. Mannila, and D. Roth: Reasoning with Examples: Propositional Formulae and Database Dependencies, Technical Report TR-15-95, Aiken Computation Lab., Harvard University, 1995.

  100. J. Kärkkäinen: Suffix cactus: a cross between suffix tree and suffix array. In: Proc. CPM '95, Combinatorial Pattern Matching, 6th Annual Symposium (ed. Z. Galil and E. Ukkonen), Lecture Notes in Computer Science 937, Springer, 1995, 191-204.

  101. J. Kärkkäinen and E. Sutinen: Lempel-Ziv index for q-grams. To appear in Proc. ESA '96, Fourth Annual European Symposium on Algorithms, Springer, 1996.

  102. J. Kärkkäinen and E. Ukkonen: Lempel-Ziv parsing and sublinear-size index structures for string matching. To appear in Proc. WSP '96, Third South American Workshop on String Processing.

  103. J. Kärkkäinen and E. Ukkonen: Sparse suffix trees. To appear in Proc. COCOON '96, 2nd Annual International Computing and Combinatorics Conference, Springer, 1996.

  104. J. Kärkkäinen and E. Ukkonen: Two dimensional pattern matching by static sampling. In: Proc. Seventh Finnish Symposium on Computer Science (ed. M. Penttonen), Report A-1994-1, Department of Computer Science, University of Joensuu, 1994, 79-90.

  105. J. Kärkkäinen and E. Ukkonen: Two and higher dimensional pattern matching in optimal expected time. In: Proc. SODA '94, 5th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1994, 715-723.

  106. P. Kilpeläinen and H. Mannila: Ordered and unordered tree inclusion. SIAM Journal on Computing 24, 2 (1995), 340-356.

  107. P. Kilpeläinen and H. Mannila: Query primitives for tree-structured data. In: Proc. CPM '94, 5th Annual Symposium on Combinatorial Pattern Matching (ed. M. Crochemore and D. Gusfield), Springer-Verlag, 1994, 213-225.

  108. P. Kilpeläinen and H. Mannila: Grammatical tree matching. In: Proc. CPM '92, 3rd Annual Symposium on Combinatorial Pattern Matching (ed. A. Apostolico et al.), Lecture Notes in Computer Science 644, Springer-Verlag, Berlin, 1992, 162-174.

  109. P. Kilpeläinen and H. Mannila: The tree inclusion problem. In: Proc. TAPSOFT '91, International Joint Conference on Theory and Practice of Software Development, Brighton, Vol. 1: Colloquium on Trees in Algebra and Programming, CAAP '91 (ed. S. Abramsky et al.), Lecture Notes in Computer Science 493, Springer-Verlag, Berlin, 1991, 202-214.

  110. O. Lehtinen, E. Sutinen and J. Tarhio: Experiments on block indexing. To appear in Proc. WSP '96, Third South American Workshop on String Processing.

  111. M. Nykänen and E. Ukkonen: Finding lowest common ancestors in arbitrarily directed trees. Information Processing Letters 50 (1994), 307-310.

  112. E. Sutinen: On average-case behaviour of the q-gram method. In: Proc. Seventh Finnish Symposium on Computer Science (ed. M. Penttonen), Report A-1994-1, Department of Computer Science, University of Joensuu, 1994, 133-138.

  113. E. Sutinen and J. Tarhio: Filtration with q-samples in approximate string matching. To appear in Proc. CPM '96, Seventh Symposium on Combinatorial Pattern Matching.

  114. E. Sutinen and J. Tarhio: On using q-gram locations in approximate string matching. In: Proc. ESA '95, Third Annual European Symposium on Algorithms (ed. P. Spirakis), Lecture Notes in Computer Science 979, Springer, Berlin, 1995, 327-340.

  115. J. Tarhio: A sublinear algorithm for two-dimensional string matching. To appear in Pattern Recognition Letters.

  116. J. Tarhio and H. Peltola: String matching in the DNA alphabet. Report C-1995-61, Department of Computer Science, University of Helsinki, 1995.

  117. J. Tarhio and E. Ukkonen: Approximate Boyer-Moore string matching. SIAM Journal on Computing 22, 2 (1993), 243-260.

  118. E. Ukkonen: Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science 92, 1 (1992), 191-211.

  119. E. Ukkonen: Approximate string-matching and the q-gram distance. In: Sequences II. Methods in Communication, Security, and Computer Science (ed. R. Capocelli et al.) Springer-Verlag, New York, NY, 1993, 300-312.

  120. E. Ukkonen: Approximate string-matching over suffix trees. In: Proc. CPM '93, 4th Annual Symposium on Combinatorial Pattern Matching (ed. A. Apostolico et al.), Lecture Notes in Computer Science 684, Springer-Verlag, Berlin, 1993, 228-242.

  121. E. Ukkonen: Constructing suffix trees on-line in linear time. In: Information Processing 92, Proc. IFIP 12th World Computer Congress, Vol. 1: Algorithms, software, architecture (ed. J. van Leeuwen), North-Holland, 1992, 484-492.

  122. E. Ukkonen: On-line construction of suffix-trees. Algorithmica 14 (1995), 249-260.

  123. E. Ukkonen and D. Wood: Approximate string matching with suffix automata. Algorithmica 10, 5 (1993), 353-364.



    Specifying and Verifying and Reasoning about Programs (F.3.1)

  124. 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, 1994.

  125. J. Eloranta: Minimizing the number of transitions with respect to observation equivalence. BIT 31, 4 (1991), 576-590.

  126. J. Eloranta, M. Tienari, and A. Valmari: Essential transitions to bisimulation equivalences. To appear in Theoretical Computer Science.

  127. R. Kaivola: Axiomatising extended computation tree logic. In: Proc. CAAP '96, Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 1059, Springer, Berlin, 1996, pp. 87-101.

  128. R. Kaivola: Axiomatising linear time mu-calculus. In: Proc. CONCUR '95, Concurrency theory, 6th International Conference (ed. I. Lee and S. Smolka), Lecture Notes in Computer Science 962, Springer-Verlag, Berlin, 1995, 423-437.

  129. R. Kaivola: Fixpoints for Rabin tree automata make complementation easy, To appear in Proc. ICALP '96, Springer, 1996.

  130. R. Kaivola: Compositional model checking for linear-time temporal logic. In: Proc. CAV '92, Computer Aided Verification, Fourth International Workshop, Lecture Notes in Computer Science 663, Springer-Verlag, Berlin, 1993, 248-259.

  131. R. Kaivola: Equivalences, preorders and compositional verification for linear time temporal logic and concurrent systems. Ph.D. Thesis, Report A-1996-1, Department of Computer Science, University of Helsinki, 1996.

  132. R. Kaivola: On modal mu-calculus and Büchi tree automata. Information Processing Letters 54 (1995), 17-22.

  133. R. Kaivola: A simple decision method for the linear time mu-calculus Proc. International Workshop on Structures in Concurrency Theory (STRICT) (ed. J. Desel), Springer-Verlag, Berlin 1995, 190-204.

  134. R. Kaivola and A. Valmari: Using truth-preserving reductions to improve the clarity of Kripke-models. In: Proc. CONCUR '91, 2nd International Conference on Concurrency Theory (ed. J. Baeten et al.), Lecture Notes in Computer Science 527, Springer-Verlag, Berlin, 1991, 361-375.

  135. R. Kaivola and A. Valmari: The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In: Proc. CONCUR '92, 3rd International Conference on Concurrency Theory (ed. W. Cleaveland), Lecture Notes in Computer Science 630, Springer-Verlag, Berlin, 1992, 207-221.

  136. A. Valmari and M. Tienari: Compositional failure-based semantic models for Basic LOTOS. Formal Aspects of Computing 7 (1995), 440-468.

  137. 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 (ed. B. Jonsson et al.), North-Holland, Amsterdam, 1991, 1-18.



    Grammars and Other Rewriting Systems (F.4.2)

  138. R. op den Akker, B. Melichar, and J. Tarhio: Attribute evaluation and parsing. In: Attribute Grammars, Applications and Systems, International Summer School SAGA (ed. H. Alblas et al.), Lecture Notes in Computer Science 545, Springer-Verlag, Berlin, 1991, 187-214.

  139. E. Ohlebusch and E. Ukkonen: On the equivalence problem for E-pattern languages. To appear in Proc. MFCS '96, Mathematical Foundations of Computer Science 1996.

  140. J. Paakki: Attribute grammar paradigms - a high-level methodology in language implementation. ACM Computing Surveys 27, 2 (1995), 196-255.



    Mathematics of Computing - Probability and Statistics (G.3)

  141. P. Kontkanen, P. Myllymäki, and H. Tirri: Comparing Bayesian model class selection criteria by discrete finite mixtures. To appear in Proc. of the ISIS (Information, Statistics and Induction in Science) Conference, Melbourne, Australia, 1996.

  142. P. Kontkanen, P. Myllymäki, and H. Tirri: Constructing Bayesian finite mixture models by the EM algorithm. Report C-1996-9, Department of Computer Science, University of Helsinki, 1996.

  143. P. Kontkanen, P. Myllymäki, and H. Tirri: Predictive data mining with finite mixtures. To appear in Proc. KDD-96, Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, 1996.

  144. P. Kontkanen, P. Myllymäki, and H. Tirri: Some experimental results with finite mixture models. To appear in Proc. First European Conference on Highly Structured Stochastic Systems, Denmark, 1996.

  145. J. Lahtinen, P. Myllymäki, T. Silander, and H. Tirri: Empirical comparison of stochastic algorithms in a graph optimization problem. To appear in Proc. Second Nordic Workshop on Genetic Algorithms, Vaasa, Finland, 1996.

  146. P. Myllymäki and H. Tirri: Constructing computationally efficient Bayesian models via unsupervised clustering. In: Probabilistic Reasoning and Bayesian Belief Networks, (ed. A. Gammerman). Alfred Waller Publishers, Suffolk 1995, 237-248



    Database Management - Logical Design (H.2.1)

  147. J. Kivinen and H. Mannila: Approximate dependency inference from relations. Theoretical Computer Science 149, 1 (1995), 129-149.

  148. J. Kivinen and H. Mannila: The power of sampling in knowledge discovery. In: Proc. 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM Press, New York, 1994, 77-85.

  149. 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.

  150. H. Mannila and K.-J. Räihä: Algorithms for inferring functional dependencies. Data & Knowledge Engineering 12 (1994), 83-99.

  151. H. Mannila and K.-J. Räihä: The Design of Relational Databases. Addison-Wesley, 1992, Reprinted 1994.

  152. H. Mannila and K.-J. Räihä: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40, 2 (1992), 237-243.



    Database Management - Languages (H.2.3)

  153. G. E. Blake, M. P. Consens, I. J. Davis, P. Kilpeläinen, E. Kuikka, P.-Å. Larson, T. Snider, and F.W. Tompa: Text/relational database management systems: Overview and proposed SQL extensions. Report CS-95-25, UW Centre for the New OED and Text Research, Department of Computer Science, University of Waterloo, 1995.

  154. G. E. Blake, M. P. Consens, P. Kilpeläinen, P.-Å. Larson, T. Snider, and F. W. Tompa: Text/relational database management systems: Harmonizing SQL and SGML. In: Proc. ADB-94, Applications of Databases, First International Conference (ed. W. Litwin and T. Risch), Springer-Verlag, 1994, 267-280.

  155. G. Grahne and A. O. Mendelzon. Updates and subjunctive queries. Information and Computation 116 (1995), 241-252.

  156. G. Grahne, A. O. Mendelzon, and P. Z. Revesz. Knowledgebase transformations. To appear in Journal of Computer and System Sciences.

  157. G. Grahne, M. Nykänen and E. Ukkonen: Reasoning about Strings in Databases. In: Proc. PODS '94, 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM Press, 1994, 292-300.

  158. P. Kilpeläinen and H. Mannila: Retrieval from hierarchical texts by partial patterns. In: Proc. SIGIR '93, 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (ed. R. Korfhage et al.), ACM Press, 1993, 214-222.



    Database Management - Systems (H.2.4)

  159. S. Abiteboul, P. C. Kanellakis, and G. Grahne: On the representation and querying of sets of possible worlds. Theoretical Computer Science 78, 1 (1991), 159-187.

  160. G. Grahne: The problem of Incomplete Information in Relational Databases. Lecture Notes in Computer Science 554. Springer-Verlag, Berlin, 1991.

  161. G. Grahne, S. Sippu, and E. Soisalon-Soininen: Efficient evaluation for a subset of recursive queries. Journal of Logic Programming 10, 3/4 (1991), 301-332.

  162. M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen: A perspective on databases and data mining. In: Proc. KDD '95, First International Conference on Knowledge Discovery and Data Mining, (ed. U. M. Fayyad and R. Uthurusamy), Montreal, Canada, AAAI Press, 1995, 150-155.

  163. H. Mannila: Data mining: machine learning, statistics, and databases. To appear in Scientific and Statistical Database Management 1996.

  164. J. Puustjärvi: Distributed management of transactions in heterogeneous distributed database systems. BIT 31, 3 (1991), 406-420.

  165. J. Puustjärvi, H. Tirri, and J. Veijalainen: Concurrency Control for Overlapping and Cooperative workflows. To appear in IEEE TCOS Bulletin.

  166. J. Puustjärvi, H. Tirri, and J. Veijalainen: Managing Overlapping Transactional Workflows. To appear in CAiSE 96.

  167. S. Sippu and E. Soisalon-Soininen: Avoiding redundant computations in evaluating linear queries. In: Proc. ADC '94, 5th Australasian Database Conference (ed. R. Sacks-Davis), 1994, 124-135.

  168. H. Tirri, J. Srinivasan and B. Bhargava: Integrating data sources using federated objects. In Distributed Object Management (ed. M. T. Özsu et al.), Morgan Kaufmann, 1994, 315-328.



    Heterogeneous Databases (H.2.5)

  169. A.-P. Tuovinen and J. Paakki: Translating SQL for database reengineering.ACM SIGPLAN Notices 31, 2 (1996), 21-26.



    Content Analysis and Indexing (H.3.1)

  170. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo: Fast discovery of association rules. In: Advances in knowledge discovery and data mining, (ed. U.M. Fayyad et al.), AAAI Press, Menlo Park, California, 1996, 307-328.

  171. H. Mannila and H. Toivonen: Discovering generalized episodes using minimal occurrences. To appear in Proc. KDD '96, Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, AAAI, 1996.

  172. H. Mannila, H. Toivonen, and A. I. Verkamo: Discovering frequent episodes in sequences. In: Proc. KDD '95, First International Conference on Knowledge Discovery and Data Mining (ed. U. M. Fayyad and R. Uthurusamy), AAAI Press, 1995, 210-215.

  173. H. Mannila, H. Toivonen, and A. I. Verkamo: Efficient algorithms for discovering association rules. In: Proc. KDD '94, Knowledge Discovery in Databases, (ed. U. M. Fayyad and R. Uthurusamy), AAAI Press, 1994, 181-192.

  174. H. Toivonen: Sampling large databases for finding frequent sets. To appear in Proc. VLDB '96, 22nd International Conference on Very Large Data Bases, Bombay, India, 1996.



    Information Search and Retrieval (H.3.3)

  175. K. Hätönen, M. Klemettinen, H. Mannila, P. Ronkainen, and H. Toivonen: Knowledge discovery from telecommunication network alarm databases. In: Proc. ICDE 96, 12th International Conference on Data Engineering, (ed. S. Su), IEEE Computer Society Press, 1996, 115-122.

  176. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo: Finding interesting rules from large sets of discovered association rules. In: Proc. CIKM '94, Third International Conference on Information and Knowledge Management, (ed. N.R. Adam et al.), ACM Press, 1994, 401-407.

  177. M. Klemettinen, H. Mannila, and H. Toivonen: Interactive exploration of discovered knowledge: A methodology for interaction, and usability studies. Report C-1996-3, Department of Computer Science, University of Helsinki, 1996.

  178. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila: Pruning and grouping discovered association rules. In: Proc. ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, (ed. Y. Kodratoff et al.), Heraklion, Greece, 1995, 47-52.



    User Interfaces (H.5.2)

  179. H. Erkiö: Model-based evaluation methods (in Finnish). In: Graafisen käyttöliittymän suunnittelu (toim. A. Kalimo), Suomen Atk-Kustannus Oy, Helsinki, 1996, 113-123.

  180. H. Erkiö: The purpose of evaluations, their benefits, and methods (in Finnish). In: Graafisen käyttöliittymän suunnittelu (toim. A. Kalimo), Suomen Atk-Kustannus Oy, Helsinki, 1996, 83-88.



    Group and Organization Interfaces (H.5.3)

  181. 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, 1992.



    Automatic Programming (I.2.2)

  182. J. Paakki, T. Gyimóthy, and T. Horváth: Effective algorithmic debugging for inductive logic programming. In: Proc. ILP-94, 4th International Workshop on Inductive Logic Programming (ed. S. Wrobel), GMD-Studien Nr. 237, Gesellschaft für Mathematik und Datenverarbeitung MbH, 1994, 175-194.



    Knowledge Representation Formalisms and Methods (I.2.4)

  183. G. Grahne: Updates and counterfactuals. In: Proc. KR '91, Principles of Knowledge Representation and Reasoning, 2nd International Conference (ed. J. Allen et al.), Morgan Kaufmann, 1991, 269-276.

  184. G. Grahne, A. O. Mendelzon, and R. Reiter: On the semantics of belief revision systems. In: Theoretical Aspects of Reasoning About Knowledge, Proc. 4th Conference (TARK 1992) (ed. Y. Moses et al.), Morgan Kaufmann, San Mateo, CA, 1992, 132-142.

  185. G. Grahne, A. O. Mendelzon and R. Reiter. On the semantics of belief revision systems. Technical Reports on Knowledge Representation and Reasoning, KRR-TR-95-1. Department of Computer Science, University of Toronto, 1995. Preliminary version also in Proc. 4th Conference on Theoretical Aspects of Reasoning about Knowledge. Asilomar, Ca. 1992, 132-142.

  186. G. Grahne. Updates and counterfactuals. To appear in Journal of Logic and Computation.

  187. G. Grahne, A. O. Mendelzon, and P. Z. Revesz: Knowledgebase transformations. In: Proc. 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM, San Diego, CA, 1992, 246-260.

  188. 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.

  189. P. Myllymäki, P. Orponen, T. Silander: Integrating symbolic reasoning with neurally represented background knowledge. In: Proc. of the Finnish AI Conference, Vol. 2., Finnish AI Society, Helsinki, 1992, 231-240.

  190. 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 (ed. M. Fishman), Florida AI Research Society, St. Petersburg, Florida, 1992, 129-133.



    Learning (I.2.6)

  191. H. Ahonen, Generating grammars for structured documents using grammatical inference methods. Ph.Lic. Thesis C-1994-65, Department of Computer Science, University of Helsinki, June 1994.

  192. H. Ahonen, H. Mannila, and E. Nikunen: Forming grammars for structured documents. In: Proc. AAAI-93 Workshop on Knowledge Discovery in Databases (ed. G. Piatetsky-Shapiro), AAAI, 1993, 314-325.

  193. H. Ahonen, H. Mannila, and E. Nikunen, Forming grammars for structured documents: an application of grammatical interference. In: Proc. Second International Colloquium on Grammatical Inference and Applications, (eds. R. S. Carrasco and J. Oncina), Lecture Notes in Artificial Intelligence 862, Springer-Verlag, 1994, 153-167.

  194. H. Ahonen, H. Mannila, and E. Nikunen: Generating grammars for SGML tagged texts lacking DTD. In: Proc. PODP '94, Workshop on Principles of Document Processing (eds. M. Murata and H. Gallaire), Darmstadt, 1994. To appear also in Mathematical and Computer Modelling.

  195. A. Brazma, I. Jonassen, E. Ukkonen, and J. Vilo: Discovering patterns and subfamilies in biosequences. To appear in Proc. ISMB '96, Fourth International Conference on Intelligent Systems for Molecular Biology.

  196. A. Brazma, E. Ukkonen, and J. Vilo: Finding a good collection of patterns covering a set of sequences. Report C-1995-60, Department of Computer Science, University of Helsinki, 1995.

  197. T. Elomaa: Extending the learnability of decision trees. In: Proc. TAI '91, 3rd International Conference on Tools for Artificial Intelligence, San Jose, CA, 1991, 504-505.

  198. T. Elomaa: In defense of C4.5: notes on learning one-level decision trees. In: Machine Learning: Proc. Eleventh International Conference (ed. W. Cohen and H. Hirsh), Morgan Kaufmann, 1994, 62-69.

  199. T. Elomaa: Tools and techniques for decision tree learning. Ph.D. Thesis, Report A-1996-2, University of Helsinki, Department of Computer Science, 1996.

  200. T. Elomaa, N. Holsti and I. Hyvärinen: TELA: a platform for experimenting with attribute-based learning programs. In: Proc. Fifth Scandinavian Conference on Artificial Intelligence (ed. A. Aamodt and J. Komorowski), Frontiers in Artificial Intelligence and Applications 28, IOS Press & Ohmsha Ltd., 1995, 391-395.

  201. T. Elomaa and J. Rousu: Finding optimal multi-splits for numerical attributes in decision tree learning. NeuroCOLT Technical Report NC-TR-96-041, Department of Computer Science, Royal Holloway, University of London, 1996.

  202. T. Elomaa and E. Ukkonen: A geometric approach to feature selection. In: Machine Learning: Proc. ECML-94, Seventh European Conference on Machine Learning (ed. F. Bergadano and L. De Raedt), Lecture Notes in Artificial Intelligence 784, Springer-Verlag, 1994, 351-354.

  203. D. Haussler, J. Kivinen, and M. K. Warmuth: Tight worst-case loss bounds for predicting with expert advice. In: Proc. EuroCOLT '95, Computational Learning Theory. Second European Conference (ed. P. Vitányi), Lecture Notes in Artificial Intelligence 904, Springer, Berlin, 1995, 69-83.

  204. D. Haussler, J. Kivinen, and M. K. Warmuth: Tight worst-case loss bounds for predicting with expert advice. Technical Report UCSC-CRL-94-36, University of California, Santa Cruz, Santa Cruz, California, 1994.

  205. D. P. Helmbold, J. Kivinen, and M. K. Warmuth: Worst-case loss bounds for single neurons. To appear inAdvances in Neural Information Processing Systems 8 (ed. D. S. Touretzky et al.), MIT Press, Cambridge, MA, 1996.

  206. M. Jaeger, H. Mannila, and E. Weydert: Data mining as selective theory extraction in probabilistic logic. To appear in SIGMOD '96 Data Mining Workshop 1996.

  207. P. Kilpeläinen, H. Mannila, and E. Ukkonen: MDL learning of unions of simple pattern languages from positive examples. Proc. EuroCOLT '95, Computational Learning Theory. Second European Conference (ed. P. Vitányi), Lecture Notes in Artificial Intelligence 904, Springer, 1995, 252-260.

  208. J. Kivinen: Learning reliably and with one-sided error. Mathematical Systems Theory 28, 2 (1995), 141-172.

  209. J. Kivinen, H. Mannila, and E. Ukkonen: Learning hierarchical rule sets. In: Proc. 5th ACM Workshop on Computational Learning Theory, 1992, 37-44.

  210. J. Kivinen, H. Mannila, and E. Ukkonen: Learning rules with local exceptions. In: Proc. EuroCOLT '93, Computational Learning Theory (ed. J. Shawe-Taylor and M. Anthony), Clarendon Press, Oxford, 1994, 35-46.

  211. J. Kivinen, H. Mannila, E. Ukkonen, and J. Vilo: An algorithm for learning hierarchical classifiers. In: Proc. ECML '94, Machine Learning (ed. F. Bergadano and L. De Raed), Springer, Berlin, 1994, 375-378.

  212. J. Kivinen and M. K. Warmuth: Additive versus exponentiated gradient updates for linear prediction. In: Proc. 27th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1995, 209-218.

  213. J. Kivinen and M. K. Warmuth: Exponentiated gradient versus gradient descent for linear predictors. Technical Report UCSC-CRL-94-16, University of California, Santa Cruz, Santa Cruz, California, 1994.

  214. J. Kivinen and M. K. Warmuth: The Perceptron algorithm versus Winnow: Linear versus logarithmic mistake bounds when few input variables are relevant. In: Proc. COLT '95, Eighth Annual Conference on Computational Learning Theory, ACM Press, New York, 1995, 289-296.

  215. J. Kivinen and M. K. Warmuth: Using experts for predicting continuous outcomes. In: Proc. EuroCOLT '93, Computational Learning Theory (ed. J. Shawe-Taylor and M. Anthony), Clarendon Press, Oxford, 1994, 109-120.

  216. H. Mannila: Data mining and machine learning. To appear in International Conference on Machine Learning 1996.

  217. H. Mannila and H. Toivonen: Multiple uses of frequent sets and condensed representations. To appear in Proc. KDD '96, Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, AAAI, 1996.

  218. P. Myllymäki and H. Tirri: Bayesian case-based reasoning with neural networks. In: Proc. 1993 IEEE International Conference on Neural Networks, San Francisco, CA, 1993. Vol. 1, 422-427.

  219. P. Myllymäki and H. Tirri: Learning Bayesian prototype trees by simulated annealing. In: Proc. Conference on Artificial Intelligence Research in Finland (ed. C. Carlsson, T. Järvi and T. Reponen). Finnish Artificial Intelligence Society, Helsinki, 1994, 32-37.

  220. P. Myllymäki and H. Tirri: Learning in neural networks with Bayesian prototypes. In: Proc. SOUTHCON '94, Orlando, 1994, 60-64.

  221. I. Sillitoe and T. Elomaa: Learning decision trees for mapping the local environment in mobile robot navigation. In: Proc. MLC-COLT Workshop on Robot Learning, 1994, 119-125.

  222. H. Tirri: Concept randomness and neural networks. In: Proc. ICANN-91, 1991 International Conference on Artificial Neural Networks (ed. T. Kohonen et al.), North-Holland, Amsterdam, 1991, Vol. 2, 1367-1370.

  223. H. Tirri: Learning with instance based encodings. In Computational Learning Theory and Natural Learning Systems II: Constraints and Prospects (ed. Hanson et al.), The MIT Press, 1994, 205-214.

  224. H. Tirri, P. Kontkanen, and P. Myllymäki: Probabilistic Instance-Based Learning. To appear in Machine Learning: Proc. Thirteenth International Conference (ed. L. Saitta). Morgan Kaufmann Publishers, San Francisco, CA, 1996.

  225. H. Tirri and P. Myllymäki: MDL learning of probabilistic neural networks for discrete problem domains. In: Proc. IEEE World Congress on Computational Intelligence, Orlando, 1994, 1493-1497.



    Problem Solving, Control Methods, and Search (I.2.8)

  226. R. Greiner and P. Orponen: Probably approximately optimal satisficing strategies. Artificial Intelligence 83.1 (1996), 1-24.

  227. H. Mannila and H. Toivonen: On an algorithm for finding all interesting sentences. In: Proc EMCSR '96, Thirteenth European Meeting on Cybernetics and Systems Research, Vienna, Austria, Austrian Society for Cybernetic Studies, 1996, 973-978.



    Image Processing - Enchancement (I.4.3)

  228. J. Tarhio, K. Lemström, and T. Takala: Color dithering with n-best algorithm. Proc. WSCG '96, Fourth International Conference in Central Europe on Computer Graphics and Visualization 96 (ed. N. Thalmann and V. Skala), University of West Bohemia, Department of Computer Science, 1996, 162-170.



    Pattern Recognition - Models (I.5.1)

  229. X. M. Song, H. Tirri, O. Aaltonen and A. Hase: A discrete radial basis function network for empirical modeling of soil extraction process. In: Proc. ECANN '95, International Conference on Engineering Applications of Neural Networks (ed. A. Bulsari and S. Kallio), Finnish Artificial Intelligence Society, 1995, 17-20.

  230. H. Tirri and S. Mallenius: Optimizing the hard address distribution for sparse distributed memories. In: Proc. ICNN '95, IEEE Conference on Neural Networks, 1995, 1966-1970.

  231. H. Tirri: Replacing the pattern matcher of an expert system with a neural network. In: Chapter 3: Intelligent Hybrid Systems (eds. S. Goonatilake and S. Khebbal), John Wiley & Sons, 1995, 47-62.



    Pattern Recognition - Clustering (I.5.3)

  232. O. Heinonen and H. Mannila: Attribute-oriented induction and conceptual clustering. Report C-1996-2, University of Helsinki, Department of Computer Science, 1996.



    Simulation and Modeling - General (I.6.0)

  233. T. Kerola: Qsolver - a modular environment for solving queueing network models. In: Computer Performance Evaluation: Modelling Techniques and Tools, Proc. 5th International Conference (ed. G. Balbo), Elsevier, 1992, 427-438.



    Model Validation and Analysis (I.6.4)

  234. K. Raatikainen: Modeling service-time distributions for queueing network simulation. Communications in Statistics. B, Simulation and Computation 20, 1 (1991), 375-390.

  235. K. Raatikainen: Modeling service distributions in queueing network simulation. Simulation 59, 2 (1992), 116-126.



    Simulation Output Analysis (I.6.6)

  236. K. Raatikainen: A sequential procedure for simultaneous estimation of several means. ACM Transactions on Modeling and Computer Simulation 3, 2 (1993), 108-133.

  237. K. Raatikainen: Accuracy of estimates for dynamic properties of queueing systems in interactive simulation. International Journal in Computer Simulation 5, 3 (1995), 305-326.

  238. K. Raatikainen: Controlling the precisions of estimates in interactive simulations. Annals of Operations Research 53 (1994), 485-505.

  239. K. Raatikainen: Run length control using parallel spectral methods. In: Proc. 1992 Winter Simulation Conference IEEE, 1992, 594-602.

  240. K. Raatikainen: Simulation-based estimation of proportions. Management Science 41, 7 (1995), 1202-1223.



    Simulation Support Systems (I.6.7)

  241. E. Arjas, H. Mannila, M. Salmenkivi, R. Suramo, and H. Toivonen: BASS: Bayesian analyzer of event sequences. To appear in Proc.\ COMPSTAT '96, XII Symposium on Computational Statistics, Barcelona, Spain, 1996.



    Life and Medical Sciences (J.3)

  242. M. Huttunen, E. Ukkonen, and B. Vehviläinen: Neural networks as a part of watershed-model in ice-reduction of discharge observations. To appear in Nordic Hydrological Conference 1996.

  243. 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. J. Lebreton et al.), Birkhäuser, 1993, 65-75.



    History of Computing (K.2)

  244. M. Tienari (ed.): The First Years of Computer Technology in Finland (in Finnish). Suomen atk-kustannus Oy, Espoo, 1993.



    Computer Uses in Education (K.3.1)

  245. S.-P. Lahtinen, E. Sutinen, A.-P. Tuovinen, and J. Tarhio: Learning and problem solving assisted with animated objects. In Abstracts of the European Conference on Educational Research in 1995 (ECER '95), p. 153. University of Bath, 1995.

  246. M. Mäkelä: Information technology - a tool and an obstacle in the future education. To appear in Proc. Second IFIP Working Conference on Information Techology in Educational Management, Hong Kong, 1996.

  247. M. Mäkelä: Experiences in computer uses in education (in Finnish). Peda-forum, Kevät 1/1996, 3-5.

  248. E. Sutinen: Computers and change in mission. International Review of Mission (World Council of Churches) LXXXIII, 331 (1994), 585-594.

  249. E. Sutinen: From enthusiasm and doubt to searching for new - pupils creating educational software (in Finnish). Opetushallituksen julkaisusarjat, Kehittämissarja 2/1992.

  250. M. Parkkinen, P. Parkkinen, and E. Sutinen: On the feasibility of multimedia in a Tanzanian context. To appear in Matematiikan ja luonnontieteiden opetuksen tutkimuspäivien esitykset (ed. V. Meisalo), Report Tutkimuksia 162, Department of Teacher Education, University of Helsinki, 1996.



    Computer and Information Science Education (K.3.2)

  251. S.-P. Lahtinen, T. Lamminjoki, V. Ollikainen, E. Sutinen, J. Tarhio, and A.-P. Tuovinen: Animation technology as a method of learning to write algorithms. To appear in Matematiikan ja luonnontieteiden opetuksen tutkimuspäivien esitykset (ed. V. Meisalo), Report Tutkimuksia 162, Department of Teacher Education, University of Helsinki, 1996.

  252. S.-P. Lahtinen, T. Lamminjoki, E. Sutinen, J. Tarhio, and A.-P. Tuovinen: Towards automated animation of algorithms. In: Proc. WSCG '96, Fourth International Conference in Central Europe on Computer Graphics and Visualization 96 (ed. N. Thalmann and V. Skala), Department of Computer Science, University of West Bohemia, 1996, 150-161.

  253. S.-P. Lahtinen, V. Meisalo, E. Sutinen, and J. Tarhio: Unified challenges of algorithm design and problem solving. To appear in Matematiikan ja luonnontieteiden opetuksen tutkimuspäivien esitykset (ed. V. Meisalo), Report Tutkimuksia 162, Department of Teacher Education, University of Helsinki, 1996.

  254. S.-P. Lahtinen, A. Porttikivi, E. Sutinen, and A.-P. Tuovinen: Algorithm animation as a method of learning. In: Uudet menetelmät ja mahdollisuudet matemaattis-luonnontieteellisten aineiden oppimisessa (ed. J. Enkenberg and K. Sormunen), University of Joensuu, 1994, 65-70.

  255. E. Sutinen and J. Tarhio: String matching animator. In: Proc. Third Symposium on Programming Languages and Software Tools (ed. M. Tombak), University of Tartu, 1993, 120-129.


next up previous
Next: Faculty Up: Research Previous: Knowledge Representation and