On the public citation graph

On parallel hashing and integer sorting

https://doi.org/10.1007/bfb0032070

0 signed · 61 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-18088-5_26openalex-snapshot

Parallel construction of a suffix tree

inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot

The Myriad Virtues of Subword Trees

inferredcites →https://doi.org/10.1007/bf00264615openalex-snapshot

Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot

Design and implementation of an efficient priority queue

inferredcites →https://doi.org/10.1007/bf01762122openalex-snapshot

Parallel construction of a suffix tree with applications

inferredcites →https://doi.org/10.1007/bf01786986openalex-snapshot

A priority queue in which initialization and queue operations takeO(loglogD) time

inferredcites →https://doi.org/10.1007/bfb0017146openalex-snapshot

Efficient simulations between concurrent-read concurrent-write pram models

inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot

Finding the maximum, merging and sorting in a parallel computation model

inferredcites →https://doi.org/10.1016/0020-0190(88)90233-5openalex-snapshot

On saving space in parallel computation

inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot

Finding the maximum, merging, and sorting in a parallel computation model

inferredcites →https://doi.org/10.1016/0304-3975(83)90023-3openalex-snapshot

Upper bounds for sorting integers on random access machines

inferredcites →https://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot

A complexity theory of efficient parallel algorithms

inferredcites →https://doi.org/10.1016/0885-064x(88)90008-8openalex-snapshot

Data structures and algorithms for approximate string matching

inferredcites →https://doi.org/10.1016/0890-5401(87)90062-9openalex-snapshot

Towards optimal parallel bucket sorting

inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot

Faster optimal parallel prefix sums and list ranking

inferredcites →https://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot

Improved deterministic parallel integer sorting

inferredcites →https://doi.org/10.1016/s0734-189x(88)80033-1openalex-snapshot

A survey of the hough transform

inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot

The Art of Computer Programming, Volume 3, Sorting and Searching

inferredcites →https://doi.org/10.1109/ccv.1988.589995openalex-snapshot

Geometric Hashing: A General And Efficient Model-based Recognition Scheme

inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot

Approximate and exact parallel scheduling with applications to list, tree and graph problems

inferredcites →https://doi.org/10.1109/sfcs.1986.41openalex-snapshot

Parallel merge sort

inferredcites →https://doi.org/10.1109/sfcs.1987.32openalex-snapshot

How to emulate shared memory

inferredcites →https://doi.org/10.1137/0217009openalex-snapshot

Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time

inferredcites →https://doi.org/10.1137/0217049openalex-snapshot

Parallel Merge Sort

inferredcites →https://doi.org/10.1137/0218041openalex-snapshot

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

inferredcites →https://doi.org/10.1145/12130.12146openalex-snapshot

Parallel hashing---an efficient implementation of shared memory

inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot

The Parallel Evaluation of General Arithmetic Expressions

inferredcites →https://doi.org/10.1145/72935.72974openalex-snapshot

An optimal parallel dictionary

inferredcites →https://doi.org/10.1145/800057.808687openalex-snapshot

Optimal parallel algorithms for string matching

inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot

An 0(n log n) sorting network

inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot

Storing a Sparse Table with 0 (1) Worst Case Access Time

inferredcites →https://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot

Parallel Algorithmic Techniques For Combinational Computation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1997.0873openalex-snapshot

A Reliable Randomized Algorithm for the Closest-Pair Problem

inferred← citeshttps://doi.org/10.1007/3-540-53487-3_42openalex-snapshot

The power of collision: Randomized parallel algorithms for chaining and 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-55706-7_3openalex-snapshot

Retrieval of scattered information by EREW, CREW and CRCW PRAMs

inferred← citeshttps://doi.org/10.1007/3-540-58201-0_72openalex-snapshot

Simple fast parallel hashing

inferred← citeshttps://doi.org/10.1007/bf01941685openalex-snapshot

Sweep Methods for Parallel Computational Geometry

inferred← citeshttps://doi.org/10.1007/bfb0023830openalex-snapshot

Leaders election without conflict resolution rule

inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot

On parallel hashing and integer sorting

inferred← citeshttps://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot

Improved deterministic parallel integer sorting

inferred← citeshttps://doi.org/10.1023/a:1015365901501openalex-snapshot

Parallel Self-Index Integer Sorting

inferred← citeshttps://doi.org/10.1109/fscs.1990.89611openalex-snapshot

Some triply-logarithmic parallel algorithms

inferred← citeshttps://doi.org/10.1109/hicss.1993.284101openalex-snapshot

Cost-optimal parallel algorithms for finitely inductive sequences

inferred← citeshttps://doi.org/10.1109/icos.2013.6735065openalex-snapshot

Hash match on GPU

inferred← citeshttps://doi.org/10.1109/saahpc.2012.25openalex-snapshot

Lock-free Hash Table on Graphics Processors

inferred← citeshttps://doi.org/10.1109/sfcs.1991.185438openalex-snapshot

Towards a theory of nearly constant time parallel algorithms

inferred← citeshttps://doi.org/10.1109/sfcs.1991.185439openalex-snapshot

Using approximation algorithms to design parallel algorithms that may ignore processor allocation

inferred← citeshttps://doi.org/10.1109/sfcs.1992.267787openalex-snapshot

The complexity of parallel prefix problems on small domains

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/spdp.1991.218302openalex-snapshot

Fast load balancing on a PRAM

inferred← citeshttps://doi.org/10.1145/103418.103453openalex-snapshot

Converting high probability into nearly-constant time---with applications to parallel hashing

inferred← citeshttps://doi.org/10.1145/113379.113385openalex-snapshot

Tight bounds for the chaining problem

inferred← citeshttps://doi.org/10.1145/1618452.1618500openalex-snapshot

Real-time parallel hashing on the GPU

inferred← citeshttps://doi.org/10.1145/165231.166115openalex-snapshot

Implementing the multiprefix operation on parallel and vector computers

inferred← citeshttps://doi.org/10.1145/237721.237797openalex-snapshot

A provably time-efficient parallel implementation of full speculation

inferred← citeshttps://doi.org/10.1145/97444.97695openalex-snapshot

Generalized sweep methods for parallel computational geometry

inferred← citeshttps://doi.org/10.17877/de290r-7870openalex-snapshot

Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen

inferred← citeshttps://doi.org/10.4208/cicp.110113.010813aopenalex-snapshot

A Survey on Parallel Computing and Its Applications in Data-Parallel Problems Using GPU Architectures

inferred← citeshttps://doi.org/10.5555/127787.127837openalex-snapshot

Fast hashing on a PRAM—designing by expectation

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.