An optimal data structure to handle dynamic environments in non-deterministic computations

DOI10.1016/S0096-0551(02)00004-8zbMath1027.68038OpenAlexW2018331535MaRDI QIDQ1869983

A. Dal Palú, Enrico Pontelli, Desh Ranjan

Publication date: 4 May 2003

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-0551(02)00004-8

zbMATH Keywords

Logic programmingmachinesConstraint programmingComplexity analysisPointer

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Data structures (68P05) Logic programming (68N17)

Related Items (1)

Parallel Logic Programming: A Sequel

Uses Software

• Smalltalk
• SmallEiffel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Maintaining order in a generalized linked list
• The temporal precedence problem
• The nearest common ancestor in a dynamic tree
• Lower bounds for the union-find and the split-find problem on pointer machines
• Fast Algorithms for Finding Nearest Common Ancestors
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem

This page was built for publication: An optimal data structure to handle dynamic environments in non-deterministic computations