scientific article

zbMath0727.68021MaRDI QIDQ3349963

Ivan Kramosil

Publication date: 1990

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Church's thesisTuring machinesprobability theorydata basescomplexity of probabilistic parallel search

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of verification techniques for parallel programs
• On the Herbrand-Kleene universe for nondeterministic computations
• An introduction to parallelism in combinatorial optimization
• A theory for nondeterminism, parallelism, communication, and concurrency
• On Synchronous Parallel Computations with Independent Probabilistic Choice
• Probabilistic Parallel Algorithms for Sorting and Selection
• Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks
• A probabilistic analysis of multiprocessor list scheduling: the erlang case
• Probabilistic analysis of optimum partitioning
• Parallel Algorithms for Depth-First Searches I. Planar Graphs
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Special relations in automated deduction
• Tight Comparison Bounds on the Complexity of Parallel Sorting
• Computational Complexity of Probabilistic Turing Machines

This page was built for publication: