Algorithms and Data Structures

@inproceedings{Wirth1989AlgorithmsAD,
  title={Algorithms and Data Structures},
  author={Niklaus Wirth},
  booktitle={Lecture Notes in Computer Science},
  year={1989}
}
  • N. Wirth
  • Published in
    Lecture Notes in Computer…
    1989
  • Computer Science
The book reflects the development of the use of computers and sophisticated algorithms to prepare and automatically typeset documents. It develops programs in step-wise fashion and express them in a well structured, detailed presentation. The book stresses the importance of performance analysis and demonstrates how algorithm selection and refinement are used most effectively in program design. Presents tested programs 
The Help System
This chapter describes the context-dependent help system provided with the package, and in so doing describes various useful features. The topics here are trees, generic data, random access to files,
Graphical environment for enhancement of learning data structures
TLDR
An environment to support efficient learning of data structures problematic among students of Faculty of Management Science and Informatics of University of Zilina is proposed and allows students not only to learn data structures but also to realize how principles of OOP can be practically applied in development of big software solutions.
Using i* to Describe Data Structures
This paper explores the use of the i* language as a notation to describe data structures to be used in classical imperative programs written in e.g. Java or C#. Data structures are described at two
CONTEXT HELP SEARCHING FOR wxHASKELL GRAPHIC LIBRARY
TLDR
This paper deals with two different approaches in programming sphere, and joins them in one entity through its practical part, functional graphic library wxHaskell that is designed and implemented within Eclipse development environment through the plug-in extension.
DYNAMIC STRUCTURES IN RELATIONAL DATABASES
TLDR
This paper is devoted to generation and a manipulation data structures in relational databases whose components in programming languages are connected by explicit indexes and considers a specific, rather simple data structure.
A History of Distribution-Sensitive Data Structures
TLDR
The history of distribution-sensitive data structures is surveyed, open problems in the area are outlined, and some new results are offered.
Access Methods and Query Processing Techniques
TLDR
The performance of a database management system (DBMS) is fundamentally dependent on the access methods and query processing techniques available to the system, andObject-oriented and object-relational systems have also adopted these structures to a great extend.
Efficient Searching in Large Inheritance Hierarchies
TLDR
The updatable approach employs the multi-dimensional data structures to indexing inheritance hierarchies and effective searching in the data to present a novel approach to efficient searching in large Inheritance hierarchies.
DEVELOPMENT OF FULL-TEXT DOCUMENTS USED IN THE ACTIVITIES OF UNIVERSITIES WITHOUT DICTIONARY ALGORITHMS FOR CONTROLLING SPELLING ERRORS.
TLDR
The main approaches, principles and methods of building an information processing system for monitoring and correcting errors in electronic texts in natural languages, as well as the development of methods for assessing and analyzing probabilistic and quantitative indicators of the effectiveness of the system under study are defined.
...
1
2
3
4
5
...

References

SHOWING 1-3 OF 3 REFERENCES
Program development by stepwise refinement
TLDR
The process of successive refinement of specifications is illustrated by a short but nontrivial example, from which a number of conclusions are drawn regarding the art and the instruction of programming.
A fast string searching algorithm
TLDR
The algorithm has the unusual property that, in most cases, not all of the first <italic>i</italic) characters of a character string, “<italic>.” in another string, are inspected.
Fast pa tern matching in strings
  • Comm . ACM
  • 1974