scientific article
From MaRDI portal
Publication:4038731
zbMath0766.68051MaRDI QIDQ4038731
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Theory of data (68P99) Distributed algorithms (68W15)
Related Items
Almost fully-parallel parentheses matching, An O(log log n) algorithm to compute the kernel of a polygon, Retrieval of scattered information by EREW, CREW and CRCW PRAMs, Fast and optimal simulations between CRCW PRAMs, The log-star revolution, Coloring k-colorable graphs in constant expected parallel time, Optimal parallel algorithms for Prefix Matching, Linear-size constant-depth polylog-threshold circuits, Fast randomized parallel methods for planar convex hull construction, On a compaction theorem of Ragde, Randomized range-maxima in nearly-constant parallel time