Operations on sets of intervals - an exercise for data structures or algorithms

Authors:
B. P. Weems
Affiliations:
Department of Computer Science Engineering, The University of Texas at Arlington, P.O. Box 19015, Arlington, TX
Venue:
SIGCSE '89 Proceedings of the twentieth SIGCSE technical symposium on Computer science education
Year:
1989

Citing 6
Cited 1

Fundamentals of data structures in PASCAL

Fundamentals of data structures in PASCAL
Algorithms (2nd ed.)

Algorithms (2nd ed.)
Principles of Database Systems

Principles of Database Systems
A Discipline of Programming

A Discipline of Programming
Data Structures and Algorithms

Data Structures and Algorithms
Computational Aspects of VLSI

Computational Aspects of VLSI

Synchronizing AMS Assertions with AMS Simulation: From Theory to Practice

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ordered linked lists are introduced in data structures courses and are frequently encountered in the study of algorithms. Set operations (e.g. union, intersection) on sets of real intervals provide a non-trivial exercise in developing correct algorithms for manipulating lists.