scientific article; zbMATH DE number 4201596

MaRDI QIDQ3349963zbMATH OpenFDO

Authors Ivan Kramosil

Publication date 1990

Full work available at URL https://eudml.org/doc/27328

zbMATH Keywords

Church's thesiscomplexity of probabilistic parallel searchdata basesprobability theoryTuring machines

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Distributed algorithms (68W15)

Recommendations

• On Parallel Searching
• scientific article; zbMATH DE number 176084
• Parallel searching of multidimensional cubes
• Probabilistic Parallel Algorithms for Sorting and Selection
• scientific article; zbMATH DE number 4057020

Cites work

• A probabilistic analysis of multiprocessor list scheduling: the erlang case
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A survey of verification techniques for parallel programs
• A theory for nondeterminism, parallelism, communication, and concurrency
• An introduction to parallelism in combinatorial optimization
• Computational Complexity of Probabilistic Turing Machines
• scientific article; zbMATH DE number 4016186 (Why is no real title available?)
• scientific article; zbMATH DE number 3112238 (Why is no real title available?)
• scientific article; zbMATH DE number 3122413 (Why is no real title available?)
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3841275 (Why is no real title available?)
• scientific article; zbMATH DE number 3928341 (Why is no real title available?)
• scientific article; zbMATH DE number 3936519 (Why is no real title available?)
• scientific article; zbMATH DE number 3943020 (Why is no real title available?)
• scientific article; zbMATH DE number 3956401 (Why is no real title available?)
• scientific article; zbMATH DE number 4057020 (Why is no real title available?)
• scientific article; zbMATH DE number 4074508 (Why is no real title available?)
• scientific article; zbMATH DE number 3754084 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3519854 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 4667 (Why is no real title available?)
• scientific article; zbMATH DE number 3894500 (Why is no real title available?)
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• On Synchronous Parallel Computations with Independent Probabilistic Choice
• On the Herbrand-Kleene universe for nondeterministic computations
• Parallel Algorithms for Depth-First Searches I. Planar Graphs
• Probabilistic analysis of optimum partitioning
• Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks
• Probabilistic Parallel Algorithms for Sorting and Selection
• Special relations in automated deduction
• Tight Comparison Bounds on the Complexity of Parallel Sorting

Cited in

(8)

• The complexity of parallel search
• Average complexity of searching for identical objects in random nonuniform databases
• Unbounded Searching Algorithms
• Probabilistic Parallel Algorithms for Sorting and Selection
• On Parallel Searching
• scientific article; zbMATH DE number 4057020 (Why is no real title available?)
• scientific article; zbMATH DE number 176084 (Why is no real title available?)
• SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS

This page was built for publication:

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