scientific article; zbMATH DE number 4066342

MaRDI QIDQ3799641zbMATH OpenFDO

Authors Srinivasan Sekar, Sanjeev B. Ahuja

Publication date 1987

zbMATH Keywords

heuristic searchparallel algorithmparallel processing languagesparallelismreducing the average time behaviour of search algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10) Algorithms in computer science (68W99)

Recommendations

• Erratum to: Kolmogorov complexity arguments in combinatorics
• Correction to ``Computational complexity of algebraic functions
• The truth about algorithmic problems in correspondence theory
• Corrigendum to: ``Complexity and approximability of the happy set problem
• Corrigendum: The complexity of counting graph homomorphisms
• Counterexamples revisited: principles, algorithms, applications

Cited in

(1)

• Corrigendum to: ``Complexity and approximability of the happy set problem

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 Q3799641)