On the public citation graph
Finding the maximum, merging and sorting in a parallel computation model
0 signed · 223 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1137/0207020openalex-snapshot
Parallel Computations in Graph Theory
inferredcites →https://doi.org/10.1137/1020096openalex-snapshot
A Survey of Parallel Algorithms in Numerical Linear Algebra
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/321906.321911openalex-snapshot
On the Parallel Evaluation of Certain Arithmetic Expressions
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/359576.359582openalex-snapshot
Fast parallel sorting algorithms
inferredcites →https://doi.org/10.1145/361020.361216openalex-snapshot
Merging with parallel processors
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19980440104openalex-snapshot
Quadrilaterizing an Orthogonal Polygon in Parallel
inferred← citeshttps://doi.org/10.1006/inco.2000.2914openalex-snapshot
How Hard Is Computing the Edit Distance?
inferred← citeshttps://doi.org/10.1006/jagm.1996.0001openalex-snapshot
Time-Randomness Trade-offs in Parallel Computation
inferred← citeshttps://doi.org/10.1006/jagm.1997.0905openalex-snapshot
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
inferred← citeshttps://doi.org/10.1006/jcom.1998.0496openalex-snapshot
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices
inferred← citeshttps://doi.org/10.1006/jcom.2001.0581openalex-snapshot
A Theory of Complexity for Continuous Time Systems
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1053openalex-snapshot
Parallel Algorithms for Dynamic Programming Recurrences with More Than O(1) Dependency
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1127openalex-snapshot
Fast and Efficient Simulations among CRCW PRAMs
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1128openalex-snapshot
Renaming and Dispersing: Techniques for Fast Load Balancing
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0067openalex-snapshot
A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_27openalex-snapshot
O(1) parallel time incremental graph algorithms
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_66openalex-snapshot
Input sensitive, optimal parallel randomized algorithms for addition and identification
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_90openalex-snapshot
Parallel machines and their communication theoretical limits
inferred← citeshttps://doi.org/10.1007/3-540-16470-7_1openalex-snapshot
A fast parallel merging algorithm for 2–3 trees
inferred← citeshttps://doi.org/10.1007/3-540-16811-7_194openalex-snapshot
Parallel dynamic programming algorithms
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_101openalex-snapshot
Efficient deterministic parallel algorithms for integer sorting
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_172openalex-snapshot
Fast and optimal simulations between CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_176openalex-snapshot
On the performance of networks with multiple busses
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_85openalex-snapshot
Efficient parallel algorithms on interval graphs
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_28openalex-snapshot
Merging and sorting strings in parallel
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_66openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_246openalex-snapshot
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_81openalex-snapshot
Computation models and function algebras
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_70openalex-snapshot
How hard is to compute the edit distance
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_713openalex-snapshot
Ultrafast randomized parallel construction and approximation algorithms for spanning forests in dense graphs
inferred← citeshttps://doi.org/10.1007/978-0-585-27330-3_6openalex-snapshot
Derivation of Randomized Sorting and Selection Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-585-27330-3_7openalex-snapshot
Time-Space Optimal Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_10openalex-snapshot
Parallel string matching algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_11openalex-snapshot
Randomized Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_18openalex-snapshot
Exact Learning of Multitrees and Almost-Trees Using Path Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-08010-9_46openalex-snapshot
Load-Balanced Breadth-First Search on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-642-33518-1_25openalex-snapshot
Efficient MPI Implementation of a Parallel, Stable Merge Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_28openalex-snapshot
A Faster CREW PRAM Algorithm for Computing Cartesian Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-03927-4_3openalex-snapshot
Relations to Other Computation Models
inferred← citeshttps://doi.org/10.1007/bf00264615openalex-snapshot
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
inferred← citeshttps://doi.org/10.1007/bf00991185openalex-snapshot
A parallel sorting scheme whose basic operation sortsN elements
inferred← citeshttps://doi.org/10.1007/bf01200429openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/bf01206355openalex-snapshot
Parallel comparison algorithms for approximation problems
inferred← citeshttps://doi.org/10.1007/bf01300373openalex-snapshot
O(log logn)-time integer geometry on the CRCW PRAM
inferred← citeshttps://doi.org/10.1007/bf01409745openalex-snapshot
Topological comparison of perfect shuffle and hypercube
inferred← citeshttps://doi.org/10.1007/bf01414463openalex-snapshot
An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
inferred← citeshttps://doi.org/10.1007/bf01758749openalex-snapshot
Optimal parallel algorithms for point-set and polygon problems
inferred← citeshttps://doi.org/10.1007/bf01758779openalex-snapshot
Expected parallel time and sequential space complexity of graph and digraph problems
inferred← citeshttps://doi.org/10.1007/bf01758856openalex-snapshot
Parallel methods for visibility and shortest-path problems in simple polygons
inferred← citeshttps://doi.org/10.1007/bf01762109openalex-snapshot
Simulations among concurrent-write PRAMs
inferred← citeshttps://doi.org/10.1007/bf01762122openalex-snapshot
Parallel construction of a suffix tree with applications
inferred← citeshttps://doi.org/10.1007/bf01931655openalex-snapshot
A sublogarithmic convex hull algorithm
inferred← citeshttps://doi.org/10.1007/bf01934690openalex-snapshot
Fast parallel graph searching with applications
inferred← citeshttps://doi.org/10.1007/bf01935049openalex-snapshot
Parallel algorithms for analyzing activity networks
inferred← citeshttps://doi.org/10.1007/bf01937485openalex-snapshot
A new parallel sorting algorithm based upon min-mid-max operations
inferred← citeshttps://doi.org/10.1007/bf02189329openalex-snapshot
Constructing arrangements optimally in parallel
inferred← citeshttps://doi.org/10.1007/bf02219230openalex-snapshot
The average performance of a parallel stable marriage algorithm
inferred← citeshttps://doi.org/10.1007/bf02243071openalex-snapshot
Optimal parallel algorithms for computing convex hulls and for sorting
inferred← citeshttps://doi.org/10.1007/bf02523192openalex-snapshot
Efficient parallel recognition of some circular arc graphs, II
inferred← citeshttps://doi.org/10.1007/bfb0012867openalex-snapshot
Optimal time bounds for parallel term matching
inferred← citeshttps://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferred← citeshttps://doi.org/10.1007/bfb0023822openalex-snapshot
Parallel complexity of heaps and min-max heaps
inferred← citeshttps://doi.org/10.1007/bfb0023830openalex-snapshot
Leaders election without conflict resolution rule
inferred← citeshttps://doi.org/10.1007/bfb0032070openalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1007/bfb0035754openalex-snapshot
Time lower bounds for CREW-PRAM computation of monotone functions
inferred← citeshttps://doi.org/10.1007/bfb0036901openalex-snapshot
Lower bounds for constant depth circuits for prefix problems
inferred← citeshttps://doi.org/10.1007/s00453-002-0966-5openalex-snapshot
Communication—Processor Tradeoffs in a Limited Resources PRAM
inferred← citeshttps://doi.org/10.1007/s11227-007-0141-5openalex-snapshot
Parallel merging with restriction
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90093-xopenalex-snapshot
Parallel computation and conflicts in memory access
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90041-8openalex-snapshot
A note on the ‘parallel computation thesis’
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90112-8openalex-snapshot
An improved simulation of space and reversal bounded deterministic turing machines by width and depth bounded uniform circuits
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90048-8openalex-snapshot
A linear-processor algorithm for depth-first search in planar graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90172-xopenalex-snapshot
A parallel algorithm for recognizing unordered depth-first search
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90066-5openalex-snapshot
Hybridsort revisited and parallelized
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90120-8openalex-snapshot
Parallel iterated bucket sort
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90138-5openalex-snapshot
Optimal merging and sorting on the EREW PRAM
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90026-topenalex-snapshot
An optimal parallel algorithm for linear programming in the plane
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90239-ropenalex-snapshot
Optimal parallel time bounds for the maximum clique problem on intervals
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00009-3openalex-snapshot
An optimal parallel algorithm for merging using multiselection
inferred← citeshttps://doi.org/10.1016/0020-0255(87)90039-9openalex-snapshot
Algorithms for some graph problems on a distributed computational model
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90028-sopenalex-snapshot
Parallel algorithms for merging and sorting
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00135-2openalex-snapshot
Algorithms for finding and updating minimum-depth spanning trees in parallel
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot
Routing, merging, and sorting on parallel models of computation
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90015-7openalex-snapshot
Unbounded fan-in circuits and associative functions
inferred← citeshttps://doi.org/10.1016/0165-6074(94)90012-4openalex-snapshot
Odd-even, compare-exchange parallel sorting
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90019-2openalex-snapshot
An optimal parallel connectivity algorithm
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90084-popenalex-snapshot
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0137-nopenalex-snapshot
Almost fully-parallel parentheses matching
inferred← citeshttps://doi.org/10.1016/0167-8191(87)90065-2openalex-snapshot
Some practical simulations of impractical parallel computers
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90081-1openalex-snapshot
A parallel algorithm for finding the maximum value
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90098-topenalex-snapshot
Optimal parallel merging and sorting algorithms using √N processors without memory contention
inferred← citeshttps://doi.org/10.1016/0167-8191(94)00102-gopenalex-snapshot
Highly parallelizable problems on sorted intervals
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90013-xopenalex-snapshot
An O(n2log n) parallel max-flow algorithm
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90033-0openalex-snapshot
Implementation of simultaneous memory address access in models that forbid it
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90032-1openalex-snapshot
Triangulating a polygon in parallel
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90010-vopenalex-snapshot
Parallel recognition of the consecutive ones property with applications
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90028-8openalex-snapshot
A parallel-design distributed-implementation (PDDI) general-purpose computer
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90058-2openalex-snapshot
On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00177-kopenalex-snapshot
Fast parallel string prefix-matching
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90075-qopenalex-snapshot
Tight complexity bounds for term matching problems
inferred← citeshttps://doi.org/10.1016/0898-1221(91)90179-8openalex-snapshot
Parallel algorithms for matrix polynomial division
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90002-vopenalex-snapshot
Parallel rectilinear shortest paths with rectangular obstacles
inferred← citeshttps://doi.org/10.1016/b978-0-12-047680-0.50013-1openalex-snapshot
Shared-Memory SIMD Computers
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50006-2openalex-snapshot
Optimal Parallel Algorithms for Selection, Sorting and Computing Convex Hulls
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.09.003openalex-snapshot
An improved reliability bound of a probabilistic parallel integer sorting algorithm
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.08.001openalex-snapshot
Relating the power of the Multiple Associative Computing (MASC) model to that of reconfigurable bus-based models
inferred← citeshttps://doi.org/10.1016/j.micpro.2018.09.013openalex-snapshot
Supporting concurrent memory access in TCF processor architectures
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.002openalex-snapshot
Efficient dynamic range minimum query
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80031-0openalex-snapshot
Optimal parallel algorithms for string matching
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80035-8openalex-snapshot
Lower time bounds for solving linear diophantine equations on several parallel computational models
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00015-xopenalex-snapshot
A faster parallel algorithm for k-connectivity
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00032-xopenalex-snapshot
Transforming comparison model lower bounds to the parallel-random-access-machine
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80002-9openalex-snapshot
Finding level-ancestors in trees
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80023-6openalex-snapshot
Parallel solutions to geometric problems in the scan model of computation
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80033-0openalex-snapshot
Computation Models and Function Algebras
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00104-6openalex-snapshot
Merging on the BSP model
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73240-7openalex-snapshot
Parallel Computer Models and Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00285-5openalex-snapshot
More general parallel tree contraction: Register allocation and broadcasting in a tree
inferred← citeshttps://doi.org/10.1016/s1383-7621(96)00074-4openalex-snapshot
Sub-optimal solutions to track detection problem using graph theoretic concepts
inferred← citeshttps://doi.org/10.1051/ita:2006010openalex-snapshot
String distances and intrusion detection: Bridging the gap between formal languages and computer security
inferred← citeshttps://doi.org/10.1080/00207168708803592openalex-snapshot
An 0(log n) parallel algorithm for strong connectivity augmentation problem
inferred← citeshttps://doi.org/10.1080/01495739808947365openalex-snapshot
PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
inferred← citeshttps://doi.org/10.1080/01495739908947372openalex-snapshot
ON THE POWER OF SOME PRAM MODELS
inferred← citeshttps://doi.org/10.1080/10637199608915567openalex-snapshot
FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL
inferred← citeshttps://doi.org/10.1109/12.123384openalex-snapshot
Sorting with linear speedup on a pipelined hypercube
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/5.92042openalex-snapshot
A comparison of shared and nonshared memory models of parallel computation
inferred← citeshttps://doi.org/10.1109/71.224218openalex-snapshot
Parallel median splitting and k-splitting with application to merging and sorting
inferred← citeshttps://doi.org/10.1109/71.674319openalex-snapshot
Work-time optimal k-merge algorithms on the PRAM
inferred← citeshttps://doi.org/10.1109/71.737693openalex-snapshot
Optimal parallel algorithms for finding proximate points, with applications
inferred← citeshttps://doi.org/10.1109/cmpsac.1988.17192openalex-snapshot
Optimal number of processors for finding the maximum value on multiprocessor systems
inferred← citeshttps://doi.org/10.1109/fscs.1990.89611openalex-snapshot
Some triply-logarithmic parallel algorithms
inferred← citeshttps://doi.org/10.1109/hipc.2016.042openalex-snapshot
Fast Parallel Operations on Search Trees
inferred← citeshttps://doi.org/10.1109/icci.1993.315344openalex-snapshot
A parallel algorithm for the Steiner tree problem
inferred← citeshttps://doi.org/10.1109/icpp.1993.115openalex-snapshot
Merging Multiple Lists in O(log n) Time
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.202openalex-snapshot
Merge Path - Parallel Merging Made Simple
inferred← citeshttps://doi.org/10.1109/ipps.1995.395933openalex-snapshot
Fast parallel algorithms for minimum and related problems with small integer inputs
inferred← citeshttps://doi.org/10.1109/ipps.1998.669913openalex-snapshot
An improved output-size sensitive parallel algorithm for hidden-surface removal for terrains
inferred← citeshttps://doi.org/10.1109/istcs.1995.377027openalex-snapshot
On the power of randomization for the common PRAM
inferred← citeshttps://doi.org/10.1109/sfcs.1983.77openalex-snapshot
Trade-offs between depth and width in parallel computation
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715901openalex-snapshot
On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication
inferred← citeshttps://doi.org/10.1109/sfcs.1985.9openalex-snapshot
An optimal parallel algorithm for integer sorting
inferred← citeshttps://doi.org/10.1109/sfcs.1987.12openalex-snapshot
Cascading divide-and-conquer: A technique for designing parallel algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63477openalex-snapshot
Sorting on a parallel pointer machine with applications to set expression evaluation
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63478openalex-snapshot
Recursive *-tree parallel data-structure
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366877openalex-snapshot
Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366880openalex-snapshot
Parallel computable higher type functionals
inferred← citeshttps://doi.org/10.1109/soac.1991.143874openalex-snapshot
k-way merging and k-ary sorts
inferred← citeshttps://doi.org/10.1109/spdp.1990.143551openalex-snapshot
An optimal parallel minimax tree algorithm
inferred← citeshttps://doi.org/10.1109/spdp.1990.143618openalex-snapshot
Using universe knowledge and arithmetic to get faster parallel algorithms
inferred← citeshttps://doi.org/10.1109/spdp.1991.218302openalex-snapshot
Fast load balancing on a PRAM
inferred← citeshttps://doi.org/10.1109/tc.1983.1676138openalex-snapshot
Searching, Merging, and Sorting in Parallel Computation
inferred← citeshttps://doi.org/10.1109/tc.1986.1676783openalex-snapshot
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
inferred← citeshttps://doi.org/10.1109/tc.1987.1676869openalex-snapshot
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
inferred← citeshttps://doi.org/10.1109/tc.1987.5009478openalex-snapshot
Optimal Parallel Merging and Sorting Without Memory Conflicts
inferred← citeshttps://doi.org/10.1109/tpds.2003.1239866openalex-snapshot
An O[1] time algorithm for the 3D euclidean distance transform on the CRCW PRAM model
inferred← citeshttps://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferred← citeshttps://doi.org/10.1137/0218014openalex-snapshot
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1137/0218041openalex-snapshot
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
inferred← citeshttps://doi.org/10.1137/0224051openalex-snapshot
Work-Preserving Speed-Up of Parallel Matrix Computations
inferred← citeshttps://doi.org/10.1142/s0129054107004796openalex-snapshot
PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
inferred← citeshttps://doi.org/10.1145/142675.142687openalex-snapshot
Optimal parallel algorithms for triangulated simple polygons
inferred← citeshttps://doi.org/10.1145/176979.176984openalex-snapshot
A survey of PRAM simulation techniques
inferred← citeshttps://doi.org/10.1145/195058.195202openalex-snapshot
Optimal parallel string algorithms
inferred← citeshttps://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferred← citeshttps://doi.org/10.1145/224164.224210openalex-snapshot
Parallelism in sequential functional languages
inferred← citeshttps://doi.org/10.1145/226643.226670openalex-snapshot
Sorting on a parallel pointer machine with applications to set expression evaluation
inferred← citeshttps://doi.org/10.1145/237502.237563openalex-snapshot
Finding minimum spanning forests in logarithmic time and linear work using random sampling
inferred← citeshttps://doi.org/10.1145/305619.305628openalex-snapshot
Communication-processor tradeoffs in limited resources PRAM
inferred← citeshttps://doi.org/10.1145/3323165.3323177openalex-snapshot
Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC
inferred← citeshttps://doi.org/10.1145/35078.35079openalex-snapshot
A practical parallel algorithm for solving band symmetric positive definite systems of linear equations
inferred← citeshttps://doi.org/10.1145/3816782.3819189openalex-snapshot
Cell-Probe Lower Bounds for Data Structures in CRCW PRAM
inferred← citeshttps://doi.org/10.1145/72935.72950openalex-snapshot
Intersecting line segments in parallel with an output-sensitive number of processors
inferred← citeshttps://doi.org/10.1145/7531.22944openalex-snapshot
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions
inferred← citeshttps://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
inferred← citeshttps://doi.org/10.1145/800057.808686openalex-snapshot
Randomized speed-ups in parallel computation
inferred← citeshttps://doi.org/10.1145/800057.808687openalex-snapshot
Optimal parallel algorithms for string matching
inferred← citeshttps://doi.org/10.1145/800061.808732openalex-snapshot
Unbounded fan-in circuits and associative functions
inferred← citeshttps://doi.org/10.1145/800070.802209openalex-snapshot
Routing, merging and sorting on parallel models of computation
inferred← citeshttps://doi.org/10.1145/800171.809607openalex-snapshot
Parallel algorithms for unification and other complete problems in p
inferred← citeshttps://doi.org/10.1145/800220.806703openalex-snapshot
On parallel searching (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/828.322439openalex-snapshot
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
inferred← citeshttps://doi.org/10.1146/annurev.cs.01.060186.001445openalex-snapshot
Type Architectures, Shared Memory, and the Corollary of Modest Potential
inferred← citeshttps://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation
inferred← citeshttps://doi.org/10.11606/d.45.1998.tde-20210729-014215openalex-snapshot
Algoritmos de seleção para máquinas paralelas com memória distribuída
inferred← citeshttps://doi.org/10.1162/neco_a_01113openalex-snapshot
Computing with Spikes: The Advantage of Fine-Grained Timing
inferred← citeshttps://doi.org/10.21236/ada288589openalex-snapshot
A Parallel Complexity Model for Functional Languages.
showing the first 200 of 212 · page through all 212
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.