Data structures for order-sensitive predicates in parallel nondeterministic systems
From MaRDI portal
Publication:1581897
DOI10.1007/PL00013301zbMATH Open0957.68025OpenAlexW4240918857MaRDI QIDQ1581897FDOQ1581897
Authors: Desh Ranjan, Enrico Pontelli, Gopal Gupta 
Publication date: 10 October 2000
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00013301
Recommendations
- Ordered structures for parallel rule-based computations
- Towards a theory of parallel algorithms on concrete data structures
- scientific article; zbMATH DE number 1678390
- scientific article; zbMATH DE number 4119653
- An optimal data structure to handle dynamic environments in non-deterministic computations
- scientific article; zbMATH DE number 108280
- A datalog-based computational model for coordination-free, data-parallel systems
- Ordered sets in the calculus of data structures
- Efficient execution of nondeterministic parallel programs on asynchronous systems
Cited In (6)
- Ordered structures for parallel rule-based computations
- Optimization schemas for parallel implementation of non-deterministic languages and systems
- Title not available (Why is that?)
- Posetted trees and Baker-Campbell-Hausdorff product
- Sequential and parallel algorithms for the NCA problem on pure pointer machines
- An optimal data structure to handle dynamic environments in non-deterministic computations
Uses Software
This page was built for publication: Data structures for order-sensitive predicates in parallel nondeterministic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1581897)
