scientific article; zbMATH DE number 432842
From MaRDI portal
Publication:3138976
zbMATH Open0800.68453MaRDI QIDQ3138976FDOQ3138976
Mikhail J. Atallah, S. R. Kosaraju
Publication date: 20 October 1993
Title of this publication is not available (Why is that?)
Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Basic linear algebra (15A99) Distributed algorithms (68W15)
Cited In (7)
- Computing the all-pairs longest chains in the plane
- Parallel methods for visibility and shortest-path problems in simple polygons
- On parallel rectilinear obstacle-avoiding paths
- A faster parallel algorithm for a matrix searching problem
- Finding a closet visible vertex pair between two polygons
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
- A faster parallel algorithm for a matrix searching 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 Q3138976)