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

DOI10.1016/S0096-0551(02)00004-8zbMATH Open1027.68038OpenAlexW2018331535MaRDI QIDQ1869983FDOQ1869983

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

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

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)

Cites Work

• Title not available (Why is that?)
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maintaining order in a generalized linked list
• The temporal precedence problem
• 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
• Title not available (Why is that?)
• The nearest common ancestor in a dynamic tree
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• Data structures for order-sensitive predicates in parallel nondeterministic systems
• Optimization schemas for parallel implementation of non-deterministic languages and systems
• Title not available (Why is that?)
• Parallel Logic Programming: A Sequel
• Data structures with dynamical random transitions
• Title not available (Why is that?)
• An optimal dynamic interval stabbing-MAX data structure?

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)