An optimal data structure to handle dynamic environments in non-deterministic computations
type: Item
instance of: scholarly article
title: An optimal data structure to handle dynamic environments in non-deterministic computations
zbMATH Open document ID: 1027.68038
DOI: 10.1016/S0096-0551(02)00004-8
author: A. Dal Palú
author: Enrico Pontelli
author: Desh Ranjan
published in: Computer Languages, Systems \& Structures
publication date: 2003-05-04T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68N19
zbMATH DE Number: 1903507
zbMATH Keywords: Logic programming
zbMATH Keywords: Constraint programming
zbMATH Keywords: Complexity analysis
zbMATH Keywords: Pointer
zbMATH Keywords: machines
describes a project that uses: Smalltalk
describes a project that uses: SmallEiffel
MaRDI profile type: Publication
cites work: Q4506393
cites work: Q3339245
cites work: Q4375198
cites work: Lower bounds for the union-find and the split-find problem on pointer machines
cites work: A class of algorithms which require nonlinear time to maintain disjoint sets
cites work: On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Q4508365
cites work: The nearest common ancestor in a dynamic tree
cites work: Q4252293
cites work: Q3044332
cites work: Maintaining order in a generalized linked list
cites work: The temporal precedence problem
cites work: Q3667910
full work available at URL: s0096-0551(02)00004-8
OpenAlex ID: W2018331535
description: scientific article; zbMATH DE number 1903507