Calculating with acyclic and cyclic lists

  • We use a relational model of pointer structures to calculate a number of standard algorithms on singly linked lists, both acyclic and cyclic. This shows that our techniques are not just useful for tree-like structures, but apply to general pointer structures as well.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Bernhard MöllerGND
URN:urn:nbn:de:bvb:384-opus4-541941
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/54194
ISSN:0020-0255OPAC
Parent Title (English):Information Sciences
Publisher:Elsevier BV
Type:Article
Language:English
Year of first Publication:1999
Publishing Institution:Universität Augsburg
Release Date:2019/05/21
Tag:Control and Systems Engineering; Theoretical Computer Science; Software; Information Systems and Management; Artificial Intelligence; Computer Science Applications
Volume:119
Issue:3-4
First Page:135
Last Page:154
DOI:https://doi.org/10.1016/s0020-0255(99)00011-0
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):CC-BY-NC-ND 4.0: Creative Commons: Namensnennung - Nicht kommerziell - Keine Bearbeitung (mit Print on Demand)

OPUS4 Logo