IDA Dept. of Computer and Information science, Linköping University

IDA Technical Reports, 1989

Last updated: Tue, 02 Dec 1997 11:02:17


Ahrenberg, L. (1989). A Constraint-Based Model for Natural-Language Understanding and a Pilot Implementation. Technical Report LiTH-IDA-R-89-22, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Ahrenberg, L. (1989). A Formal Field Grammar. Technical Report LiTH-IDA-R-89-46, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Ahrenberg, L. (1989). On the Integration of Linguistic Knowledge and World Knowledge in Natural Language Understanding. Technical Report LiTH-IDA-R-89-23, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the Nordic Conference of Text Comprehension in Man and Machine, Sigtuna, Sweden, October 27-28, 1989, (bibtex).

Bilos, R. (1989). A Survey of Visibility Control Models. Technical Report LiTH-IDA-R-89-18, Department of Computer and Information Science, Linköping University, Sweden. (bibtex).

Bilos, R. and Fritzson, P. (1989). Experience from a Token Sequence Representation of Programs, Documents, and their Deltas. Technical Report LiTH-IDA-R-89-12, Department of Computer and Information Science, Linköping University, Sweden. Also presented at the International Workshop on Software Version and Configuration Control, Grassau, FRG, January 27-29, 1988, (abstract), (bibtex).

Dahlbäck, N. and Jönsson, A. (1989). Empirical Studies of Discourse Representations for Natural Language Interfaces. Technical Report LiTH-IDA-R-89-33, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 4th Conf. of the European Chapter of the Association for Computational Linguistics, Manchester, April, 1989, (abstract), (bibtex).

Dahlhaus, E., Karpinski, M., and Lingas, A. (1989). A Parallel Algorithm for Maximum Matching in Planar Graphs. Technical Report LiTH-IDA-R-89-10, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Djidjev, H. N., Lingas, A., and Sack, J.-R. (1989). An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. Technical Report LiTH-IDA-R-89-09, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 6th Symposium on Theoretical Aspects of Computer Science, Paderborn, Germany, February 1989, (abstract), (bibtex).

Drabent, W. and Martelli, M. (1989). Strict Completion of Logic Programs. Technical Report LiTH-IDA-R-89-28, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Fjällström, P.-O. (1989). Approximation of Polygonal Lines. Technical Report LiTH-IDA-R-89-30, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Fjällström, P.-O., Katajainen, J., Levcopoulos, C., and Petersson, O. (1989). A Sublogarithmic Parallel Algorithm for Finding the Convex Hull of Sorted Points. Technical Report LiTH-IDA-R-89-29, Department of Computer and Information Science, Linköping University, Sweden. Also in BIT 30(1990), 378-384, (abstract), (bibtex).

Fjellborg, B. (1989). A General Framework for Extraction of VLSI Pipeline Structures. Technical Report LiTH-IDA-R-89-36, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 15th Symposium on Microprocessing and Microprogramming, EUROMICRO'89, Short Notes Session, Cologne, West Germany, September 4-8, 1989, (abstract), (bibtex).

Fritzson, P. and Kroha, P. (1989). An Object-Oriented Database Approach to the Symbol Processing in an Incremental Compiler. Technical Report LiTH-IDA-R-89-27, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Hultman, J., Nyberg, A., and Svensson, M. (1989). A Software Architecture for Autonomous Systems. Technical Report LiTH-IDA-R-89-40, Department of Computer and Information Science, Linköping University, Sweden. Also presented at the First PROMETHEUS Scientific Workshop, Wolfsburg, 1989 and the Sixth International Symposium on Unmanned Untethered Submersible Technology, Ellicott City, Maryland, USA, 1989, (abstract), (bibtex).

Joas, K. (1989). Interprocess Communication Primitives for a Distributed Debugger under Unix. Technical Report LiTH-IDA-R-89-48, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Johansson, O. (1989). An Experiment with a Neural Network for Handwritten Character Recognition. Technical Report LiTH-IDA-R-89-44, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Jönsson, A. (1989). Application-Dependent Discourse Management for Natural Language Interfaces: An Empirical Investigation. Technical Report LiTH-IDA-R-89-34, Department of Computer and Information Science, Linköping University, Sweden. Also in Papers from the Seventh Scandinavian Conference of Computational Linguistics (Nordiska Datalingvistikdagarna), Reykjavik, Iceland, April, 1989, (abstract), (bibtex).

Jönsson, A. and Ahrenberg, L. (1989). Extensions of a Descriptor-Based Tagging System into a Tool for the Generation of Unification-Based Grammars. Technical Report LiTH-IDA-R-89-35, Department of Computer and Information Science, Linköping University, Sweden. Paper presented at the 16th International ALLC Conference and 9th ICCH Conference, Toronto, Canada, June, 1989, (abstract), (bibtex).

Kamkar, M., Shahmehri, N., and Fritzson, P. (1989). Affect-Chaining and Dependency Oriented Flow Analysis Applied to Queries of Programs. Technical Report LiTH-IDA-R-89-02, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Karlsson, R. G. (1989). Traversing a Maze with a Robot Arm. Technical Report LiTH-IDA-R-89-01, Department of Computer and Information Science, Linköping University, Sweden. (bibtex).

Katajainen, J., Levcopoulos, C., and Petersson, O. (1989). Local Insertion Sort Revisited. Technical Report LiTH-IDA-R-89-20, Department of Computer and Information Science, Linköping University, Sweden. Also presented at the International Symposium on Optimal Algorithms, Varna, Bulgaria, May 29 - June 2, 1989, (abstract), (bibtex).

Katajainen, J. and Mäkinen, E. (1989). Tree Compression and Optimization with Applications. Technical Report LiTH-IDA-R-89-47, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Kroha, P. (1989). An Extension of the Single Instruction Machine Idea. Technical Report LiTH-IDA-R-89-25, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Kroha, P. and Fritzson, P. (1989). A Compiler with Scheduling for a Specialized Synchronous Multiprocessor System. Technical Report LiTH-IDA-R-89-26, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Kuchcinski, K. and Peng, Z. (1989). Testability Analysis in a VLSI High-Level Synthesis System. Technical Report LiTH-IDA-R-89-42, Department of Computer and Information Science, Linköping University, Sweden. Also presented at the15th Symposium on Microprocessing and Microprogramming, EUROMICRO'89, Cologne, West Germany, September 4-8, 1989 and will be published in Microprocessing and Microprogramming, The EUROMICRO Journal, 1990, (abstract), (bibtex).

Larsson, T. (1989). Mixed Functional and Temporal Hardware Verification. Technical Report LiTH-IDA-R-89-53, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of Applied Formal Methods For Correct VLSI Design, 13-16 November 1989, Leuven, Belgium, (abstract), (bibtex).

Levcopoulos, C., Katajainen, J., and Lingas, A. (1989). An Optimal Expected-Time Parallel Algorithm for Voronoi Diagrams. Technical Report LiTH-IDA-R-89-08, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 1988, (abstract), (bibtex).

Levcopoulos, C. and Petersson, O. (1989). Heapsort - Adapted for Presorted Files. Technical Report LiTH-IDA-R-89-21, Department of Computer and Information Science, Linköping University, Sweden. Also presented at the 1989 Workshop on Data Structures and Algorithms, Ottawa, Canada, May 17-19, 1989, (abstract), (bibtex).

Levcopoulos, C. and Petersson, O. (1989). A Note on Adaptive Parallel Sorting. Technical Report LiTH-IDA-R-89-17, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Levcopoulos, C. and Petersson, O. (1989). An Optimal Parallel Algorithm for Sorting Presorted Files. Technical Report LiTH-IDA-R-89-16, Department of Computer and Information Science, Linköping University, Sweden. A previous version presented at the 8th Conference on Foundations of Software Technology and Theoretical Computer Science, Poona, India, Dec. 1988, (abstract), (bibtex).

Lingas, A. (1989). An Efficient Parallel Algorithm for Planar Directed Reachability. Technical Report LiTH-IDA-R-89-11, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Lingas, A. (1989). Greedy Triangulation can be Efficiently Implemented in the Average Case. Technical Report LiTH-IDA-R-89-06, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science, Amsterdam, The Netherlands, June 1988, (abstract), (bibtex).

Lingas, A. (1989). Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in NC. Technical Report LiTH-IDA-R-89-07, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of 1988 International Conference on Parallel Processing, Chicago, USA, August 1988, (abstract), (bibtex).

Lingas, A. (1989). Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. Technical Report LiTH-IDA-R-89-04, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Lingas, A. and Syslo, M. M. (1989). A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. Technical Report LiTH-IDA-R-89-05, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the 15th International Qolloquium on Automata, Languages and Programming, Tampere, Finland, July 1988, (abstract), (bibtex).

Löwgren, J. (1989). An Architecture for Expert System User Interface Design and Management. Technical Report LiTH-IDA-R-89-50, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of ACM SIGGRAPH Symposium on User Interface Software Technology (VIST'89), Williamsburg, Virginia, November 13-15, 1989, (abstract), (bibtex).

Löwgren, J., Nordqvist, T., and Löf, S. (1989). Knowledge-Based Support for User Interface Evaluation in User Interface Management Systems. Technical Report LiTH-IDA-R-89-32, Department of Computer and Information Science, Linköping University, Sweden. (bibtex).

Maluszynski, J. and Näslund, T. (1989). Fail Substitutions for Negation as Failure. Technical Report LiTH-IDA-R-89-03, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the North American Conference on Logic Programming 89, Cleveland, Ohio, USA, (bibtex).

Peng, Z. and Kuchcinski, K. (1989). A Multi-Level Optimization Strategy for Behavior-Entry Synthesis. Technical Report LiTH-IDA-R-89-41, Department of Computer and Information Science, Linköping University, Sweden. Also presented at the Fourth International Workshop on High-Level Synthesis, Kennebunkport, Maine, USA, October 15-18, 1989, (abstract), (bibtex).

Pettersson, M. (1989). Generating Interpreters from Denotational Definitions using C++ as a Meta-language. Technical Report LiTH-IDA-R-89-52, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Sandewall, E. (1989). Combining Logic and Differential Equations for Describing Real-World Systems. Technical Report LiTH-IDA-R-89-38, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the Conf. on Representation and Reasoning about Knowledge, Toronto, Canada, 1989, (abstract), (bibtex).

Sandewall, E. (1989). A Decision Procedure for A Theory of Actions and Plans. Technical Report LiTH-IDA-R-89-39, Department of Computer and Information Science, Linköping University, Sweden. Also published in Z. Ras et al. (eds), Methodologies for Intelligent Systems, 1989, (abstract), (bibtex).

Sandewall, E. (1989). Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds. Technical Report LiTH-IDA-R-89-37, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the International Joint Conference on Artificial Intelligence, Detroit, USA, 1989, (abstract), (bibtex).

Sandewall, E. et al. (1989). Department of Computer and Information Science Annual Research Report 1988. Technical Report LiTH-IDA-R-89-45, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Santi, Ö. (1989). Retargeting of an Incremental Code Generator to MC68020. Technical Report LiTH-IDA-R-89-13, Department of Computer and Information Science, Linköping University, Sweden. (abstract), (bibtex).

Shahmehri, N. and Fritzson, P. (1989). Algorithmic Debugging for Imperatives for Languages with Side-effects. Technical Report LiTH-IDA-R-89-49, Department of Computer and Information Science, Linköping University, Sweden. Also presented at The 3rd International Workshop on Compiler Compilers, Schwerin, Germany. October 22-24, 1990. The proceedings will be published by Springer Verlag in the LNCS series, (abstract), (bibtex).

Wire'n, M. (1989). Interactive Incremental Chart Parsing. Technical Report LiTH-IDA-R-89-24, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of the Fourth Conference of the European Chapter of the Association for Computational Linguistics, Manchester, England, April 10-12, 1989, (bibtex).


Goto (at Linköping University):
CS Dept TR Overview
Maintained by webmaster