SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS

DOI10.1080/03081079608945133zbMATH Open0873.68043OpenAlexW2015409220MaRDI QIDQ4337484FDOQ4337484

Ivan Kramosil

Publication date: 19 May 1997

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079608945133

Recommendations

• scientific article
• scientific article
• Sorting numbers using limited systolic coprocessors
• On the design of some systolic algorithms

zbMATH Keywords

computational complexityeffectively solvable searching problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15) Stochastic learning and adaptive control (93E35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory for nondeterminism, parallelism, communication, and concurrency
• Title not available (Why is that?)
• Computational Complexity of Probabilistic Turing Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Synchronous Parallel Computations with Independent Probabilistic Choice
• Theories of computational complexity
• Probabilistic Parallel Algorithms for Sorting and Selection

Cited In (4)

• SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution
• Search in an Ordered Array Having Variable Probe Cost
• Title not available (Why is that?)
• Memory-Efficient Algorithms for Finding Needles in Haystacks

This page was built for publication: SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS

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