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

DOI10.1016/S0096-0551(02)00004-8MaRDI QIDQ1869983zbMATHOpenAlexFDO

Authors 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

machinesComplexity analysisLogic programmingConstraint programmingPointer

Mathematics Subject Classification ID

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

Recommendations

• Data structures for order-sensitive predicates in parallel nondeterministic systems
• Optimization schemas for parallel implementation of non-deterministic languages and systems
• Nondeterminism with Referential Transparency in Functional Programming Languages
• Safe nondeterminism in a deterministic-by-default parallel language
• Nondeterministic dynamic programming on a parallel coprocessing system

Cites work

• scientific article; zbMATH DE number 2086234 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3821076 (Why is no real title available?)
• scientific article; zbMATH DE number 1305412 (Why is no real title available?)
• scientific article; zbMATH DE number 1110837 (Why is no real title available?)
• scientific article; zbMATH DE number 1508929 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Fast Algorithms for Finding Nearest Common Ancestors
• Lower bounds for the union-find and the split-find problem on pointer machines
• Maintaining order in a generalized linked list
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• The nearest common ancestor in a dynamic tree
• The temporal precedence problem

Cited in

(8)

• An optimal dynamic interval stabbing-MAX data structure?
• Data structures for order-sensitive predicates in parallel nondeterministic systems
• Data structures with dynamical random transitions
• scientific article; zbMATH DE number 37729 (Why is no real title available?)
• Parallel Logic Programming: A Sequel
• Optimization schemas for parallel implementation of non-deterministic languages and systems
• scientific article; zbMATH DE number 17540 (Why is no real title available?)
• scientific article; zbMATH DE number 6538681 (Why is no real title available?)

Describes a project that uses

Uses Software

• Smalltalk
• SmallEiffel

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869983)