On the public citation graph
Sorting inc logn parallel steps
0 signed · 492 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.1109/sfcs.1979.16openalex-snapshot
Explicit constructions of linear size superconcentrators
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1521-3870(200111)47:4<461::aid-malq461>3.0.co;2-bopenalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1002/jgt.3190190404openalex-snapshot
Oriented hamilton cycles in digraphs
inferred← citeshttps://doi.org/10.1002/net.10003openalex-snapshot
Area efficient layouts of the Batcher sorting networks
inferred← citeshttps://doi.org/10.1002/rsa.3240010401openalex-snapshot
Quasi‐random classes of hypergraphs
inferred← citeshttps://doi.org/10.1006/inco.1994.1053openalex-snapshot
A Guide for New Referees in Theoretical Computer Science
inferred← citeshttps://doi.org/10.1006/inco.2001.3053openalex-snapshot
Improved Fast Integer Sorting in Linear Space
inferred← citeshttps://doi.org/10.1006/jagm.1996.0820openalex-snapshot
Parallel Algorithms for Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1997.0892openalex-snapshot
Ultrafast Expected Time Parallel Algorithms
inferred← citeshttps://doi.org/10.1006/jcss.1995.1007openalex-snapshot
Load Sharing with Parallel Priority Queues
inferred← citeshttps://doi.org/10.1006/jcss.1996.0005openalex-snapshot
Self -Routing Superconcentrators
inferred← citeshttps://doi.org/10.1006/jcss.1997.1287openalex-snapshot
Better Lower Bounds for Monotone Threshold Formulas
inferred← citeshttps://doi.org/10.1006/jcss.1997.1291openalex-snapshot
Connected Components inO(log3/2n) Parallel Time for the CREW PRAM
inferred← citeshttps://doi.org/10.1006/jcss.1997.1470openalex-snapshot
Breaking theΘ(nlog2n) Barrier for Sorting with Faults
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1485openalex-snapshot
The New Class of g-Chain Periodic Sorters
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1627openalex-snapshot
Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS)
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1636openalex-snapshot
Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network
inferred← citeshttps://doi.org/10.1007/0-306-46964-2_7openalex-snapshot
Sorting and Selection Networks
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_2openalex-snapshot
Problems in Data Structures and Algorithms
inferred← citeshttps://doi.org/10.1007/11611257_32openalex-snapshot
Merging and Merge-Sort in a Single Hop Radio Network
inferred← citeshttps://doi.org/10.1007/11685654_5openalex-snapshot
Parceling the Butterfly and the Batcher Sorting Network
inferred← citeshttps://doi.org/10.1007/11821069_50openalex-snapshot
Sorting Long Sequences in a Single Hop Radio Network
inferred← citeshttps://doi.org/10.1007/11830924_38openalex-snapshot
Monotone Circuits for the Majority Function
inferred← citeshttps://doi.org/10.1007/11940128_47openalex-snapshot
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
inferred← citeshttps://doi.org/10.1007/3-540-18099-0_45openalex-snapshot
What can be parallelized in computational geometry?
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_79openalex-snapshot
Randomized parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-37437-x_10openalex-snapshot
Parallelisierung, Nebenläufigkeit und alternative Modelle
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_2openalex-snapshot
Essentially Every Unimodular Matrix Defines an Expander
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_62openalex-snapshot
Periodic Correction Networks
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_9openalex-snapshot
Labeling Points with Rectangles of Various Shapes
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_45openalex-snapshot
Fibonacci Correction Networks
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_13openalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1007/3-540-45506-x_8openalex-snapshot
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_22openalex-snapshot
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_20openalex-snapshot
On the Negation-Limited Circuit Complexity of Merging
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_45openalex-snapshot
Improving Parallel Computation with Fast Integer Sorting
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_78openalex-snapshot
An optimal parallel algorithm for sorting presorted files
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_102openalex-snapshot
On simultaneous realizations of boolean functions, with applications
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_110openalex-snapshot
Fast parallel algorithms and the complexity of parallelism (basic issues and recent advances)
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_41openalex-snapshot
Efficient parallel algorithms for optical computing with the DFT primitive
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-55895-0_452openalex-snapshot
Improved parallel sorting of presorted sequences
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_69openalex-snapshot
Selection networks with 8n log2 n size and O(log n) depth
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_81openalex-snapshot
Algorithms for determining the geometrical congruity in two and three dimensions
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_13openalex-snapshot
The role of randomness in the design of interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_259openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_58openalex-snapshot
On some communication complexity problems related to threshold functions
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_257openalex-snapshot
A probabilistic selection network with butterfly networks
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_142openalex-snapshot
Periodic constant depth sorting networks
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_103openalex-snapshot
A super-logarithmic lower bound for hypercubic sorting networks
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_91openalex-snapshot
On the theory of interconnection networks for parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_94openalex-snapshot
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_68openalex-snapshot
PRAM's towards realistic parallelism: BRAM's
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_31openalex-snapshot
The action of a few random permutations on r-tuples and an application to cryptography
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_42openalex-snapshot
Analysis of Shellsort and related algorithms
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_59openalex-snapshot
Parallel algorithms for partitioning sorted sets and related problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_1openalex-snapshot
A General-Purpose Shared-Memory Model for Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_3openalex-snapshot
Sparse Sets versus Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_14openalex-snapshot
Notes on the Complexity of Switching Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_9openalex-snapshot
Periodic Shifting Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_19openalex-snapshot
Paul Erdős’ Influence on Extremal Graph Theory
inferred← citeshttps://doi.org/10.1007/978-1-4615-7399-9_15openalex-snapshot
Combinatorial Problems Arising in Network Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_11openalex-snapshot
Randomized Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_8openalex-snapshot
Fast Parallel Algorithms for Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_10openalex-snapshot
Fragile Complexity of Adaptive Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-07689-3_30openalex-snapshot
A Linear-Time 2-Party Secure Merge Protocol
inferred← citeshttps://doi.org/10.1007/978-3-032-15621-1_9openalex-snapshot
Deterministic Integer Sorting on the Parallel External Memory Model
inferred← citeshttps://doi.org/10.1007/978-3-0348-8974-2_1openalex-snapshot
Randomness and Pseudo-Randomness in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-0348-9110-3_2openalex-snapshot
Transparent Proofs and Limits to Approximation
inferred← citeshttps://doi.org/10.1007/978-3-0348-9328-2_2openalex-snapshot
Transparent Proofs and Limits to Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_32openalex-snapshot
Secure Multi-party Shuffling
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_29openalex-snapshot
CS Unplugged—How Is It Used, and Does It Work?
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_24openalex-snapshot
Lower Bounds on Correction Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_13openalex-snapshot
Periodic Multisorting Comparator Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_14openalex-snapshot
Fast Periodic Correction Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_30openalex-snapshot
Improving the Average Delay of Sorting
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_19openalex-snapshot
Approximation by DNF: Examples and Counterexamples
inferred← citeshttps://doi.org/10.1007/978-3-540-85209-4_26openalex-snapshot
Ranking and Sorting in Unreliable Single Hop Radio Network
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_7openalex-snapshot
Bounds on the Size of Small Depth Circuits for Approximating Majority
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_21openalex-snapshot
Correcting Sorted Sequences in a Single Hop Radio Network
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_5openalex-snapshot
Exact Algorithms for the Bottleneck Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_20openalex-snapshot
Resource Oblivious Sorting on Multicores
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_23openalex-snapshot
Constructing Extended Formulations from Reflection Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-24316-5_17openalex-snapshot
Generic Constant-Round Oblivious Sorting Algorithm for MPC
inferred← citeshttps://doi.org/10.1007/978-3-642-24806-1_7openalex-snapshot
The Active Element Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_11openalex-snapshot
Oblivious RAM with O((logN)3) Worst-Case Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_10openalex-snapshot
Parallelism, Concurrency, and Alternative Models
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_26openalex-snapshot
More Efficient Parallel Integer Sorting
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8openalex-snapshot
Facets of Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_4openalex-snapshot
Constructing Extended Formulations from Reflection Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-39449-2_25openalex-snapshot
The Mathematics of Endre Szemerédi
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_18openalex-snapshot
On the Computational Complexity of Optimal Sorting Network Verification
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_75openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1007/bf00619508openalex-snapshot
Design trade-offs in optoelectronic parallel processing systems using smart-SLMs
inferred← citeshttps://doi.org/10.1007/bf01184936openalex-snapshot
A lower bound for sorting networks based on the shuffle permutation
inferred← citeshttps://doi.org/10.1007/bf01185406openalex-snapshot
Parallel integer sorting using small operations
inferred← citeshttps://doi.org/10.1007/bf01302963openalex-snapshot
Recursive construction for 3-regular expanders
inferred← citeshttps://doi.org/10.1007/bf01305311openalex-snapshot
Representing Shared Data on Distributed-Memory Parallel Computers
inferred← citeshttps://doi.org/10.1007/bf01371728openalex-snapshot
On the diameter and bisector size of Cayley graphs
inferred← citeshttps://doi.org/10.1007/bf01414464openalex-snapshot
An optimal parallel algorithm for triangulating a set of points in the plane
inferred← citeshttps://doi.org/10.1007/bf01758753openalex-snapshot
Optimal randomized parallel algorithms for computational geometry
inferred← citeshttps://doi.org/10.1007/bf01758833openalex-snapshot
Finding effective “force targets” for two-dimensional, multifinger frictional grips
inferred← citeshttps://doi.org/10.1007/bf01840378openalex-snapshot
Improved sorting networks withO(logN) depth
inferred← citeshttps://doi.org/10.1007/bf02090393openalex-snapshot
A computer-assisted optimal depth lower bound for nine-input sorting networks
inferred← citeshttps://doi.org/10.1007/bf02090402openalex-snapshot
Fast algorithms for bit-serial routing on a hypercube
inferred← citeshttps://doi.org/10.1007/bf02090767openalex-snapshot
Single-exception sorting networks and the computational complexity of optimal sorting network verification
inferred← citeshttps://doi.org/10.1007/bf02186483openalex-snapshot
Parallel computing in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferred← citeshttps://doi.org/10.1007/bf02579382openalex-snapshot
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
inferred← citeshttps://doi.org/10.1007/bf02779671openalex-snapshot
Graphs whose every transitive orientation contains almost every relation
inferred← citeshttps://doi.org/10.1007/bfb0002760openalex-snapshot
Parallel merge sort on concurrent-read owner-write PRAM
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
inferred← citeshttps://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferred← citeshttps://doi.org/10.1007/bfb0016251openalex-snapshot
A fast parallel algorithm for six-colouring of planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0020801openalex-snapshot
Polynomial size constant depth circuits with a limited number of negations
inferred← citeshttps://doi.org/10.1007/bfb0023843openalex-snapshot
Unambiguous simulations of auxiliary pushdown automata and circuits
inferred← citeshttps://doi.org/10.1007/bfb0024714openalex-snapshot
The queue-read queue-write asynchronous PRAM model
inferred← citeshttps://doi.org/10.1007/bfb0054308openalex-snapshot
Faster non-linear parametric search with applications to optimization and dynamic geometry
inferred← citeshttps://doi.org/10.1007/bfb0054364openalex-snapshot
Comparator networks for binary heap construction
inferred← citeshttps://doi.org/10.1007/bfb0058018openalex-snapshot
QSM: A general purpose shared-memory model for parallel computation
inferred← citeshttps://doi.org/10.1007/s00222-025-01328-xopenalex-snapshot
A random Hall-Paige conjecture
inferred← citeshttps://doi.org/10.1007/s00224-001-1026-2openalex-snapshot
On the Bisection Width and Expansion of Butterfly Networks
inferred← citeshttps://doi.org/10.1007/s002240000068openalex-snapshot
On Probabilistic Networks for Selection, Merging, and Sorting
inferred← citeshttps://doi.org/10.1007/s002240000071openalex-snapshot
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
inferred← citeshttps://doi.org/10.1007/s00373-021-02296-8openalex-snapshot
Recent Progress on Graphs with Fixed Smallest Adjacency Eigenvalue: A Survey
inferred← citeshttps://doi.org/10.1007/s00446-009-0087-3openalex-snapshot
The impact of randomization in smoothing networks
inferred← citeshttps://doi.org/10.1007/s00446-012-0168-6openalex-snapshot
A framework for automated distributed implementation of component-based models
inferred← citeshttps://doi.org/10.1007/s00453-001-0016-8openalex-snapshot
Geometry Helps in Bottleneck Matching and Related Problems
inferred← citeshttps://doi.org/10.1007/s00453-007-9025-6openalex-snapshot
Sorting Networks of Logarithmic Depth, Further Simplified
inferred← citeshttps://doi.org/10.1007/s00453-011-9553-yopenalex-snapshot
Exact Algorithms for the Bottleneck Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s00453-012-9696-5openalex-snapshot
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons
inferred← citeshttps://doi.org/10.1007/s004530010037openalex-snapshot
Parallel Algorithms for Partitioning Sorted Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/s00493-013-2405-4openalex-snapshot
Constraints, MMSNP and expander relational structures
inferred← citeshttps://doi.org/10.1007/s004930170007openalex-snapshot
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
inferred← citeshttps://doi.org/10.1007/s10107-014-0757-1openalex-snapshot
Smallest compact formulation for the permutahedron
inferred← citeshttps://doi.org/10.1007/s10559-010-9196-zopenalex-snapshot
Recursion and parallel algorithms in geometric modeling problems
inferred← citeshttps://doi.org/10.1007/s11390-006-0466-1openalex-snapshot
Scalable and Practical Nonblocking Switching Networks
inferred← citeshttps://doi.org/10.1016/0010-4655(87)90168-8openalex-snapshot
Static allocation in massively parallel computers
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90101-5openalex-snapshot
Dense expanders and pseudo-random bipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90173-fopenalex-snapshot
Bounds on the size of test sets for sorting and related networks
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90025-0openalex-snapshot
On efficient parallel strong orientation
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(89)90139-7openalex-snapshot
A note on adaptive parallel sorting
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90212-gopenalex-snapshot
Sorting roughly sorted sequences in parallel
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90177-jopenalex-snapshot
Randomized optimal algorithm for slope selection
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90179-lopenalex-snapshot
An optimal parallel adaptive sorting algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90249-uopenalex-snapshot
An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90234-zopenalex-snapshot
Optimal slope selection via expanders
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90267-dopenalex-snapshot
A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00044-1openalex-snapshot
On the relationship between the diameter and the size of a boundary of a directed graph
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00101-4openalex-snapshot
Multi-processor scheduling and expanders
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00115-9openalex-snapshot
Negation-limited circuit complexity of symmetric functions
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90043-vopenalex-snapshot
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
inferred← citeshttps://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90037-6openalex-snapshot
Broadcasting with random faults
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(88)90042-7openalex-snapshot
An optimal parallel algorithm for solving the maximal elements problem in the plane
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90046-copenalex-snapshot
Parallel algorithms for planar dominance counting
inferred← citeshttps://doi.org/10.1016/0167-8191(94)00104-iopenalex-snapshot
Data parallel geometric operations on lists
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90014-9openalex-snapshot
Better expanders and superconcentrators
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90016-6openalex-snapshot
Cubesort: A parallel algorithm for sorting N data items with S-sorters
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90153-2openalex-snapshot
Parallel ear decomposition search (EDS) and st-numbering in graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90177-4openalex-snapshot
An O(T log T) reduction from RAM computations to satisfiability
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90279-bopenalex-snapshot
Parallel comparison merging of many-ordered lists
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90163-5openalex-snapshot
Methods for message routing in parallel machines
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00256-1openalex-snapshot
Exploiting few inversions when sorting: Sequential and parallel algorithms
inferred← citeshttps://doi.org/10.1016/0743-7315(86)90011-0openalex-snapshot
Efficient parallel solutions to some geometric problems
inferred← citeshttps://doi.org/10.1016/0743-7315(89)90040-3openalex-snapshot
Parallel algorithms for maximum bipartite matchings and maximum 0–1 flows
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90012-eopenalex-snapshot
A hyperconcentrator switch for routing bit-serial messages
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90003-5openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50020-5openalex-snapshot
Communication Networks
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
showing the first 200 of 491 · page through all 491
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.