On the public citation graph

The Art of Computer Programming, Vol. 3: Sorting and Searching

0 signed · 901 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1096-987x(199912)20:16<1716::aid-jcc4>3.0.co;2-1openalex-snapshot
Molecular anharmonicity: A computer-aided treatment
inferred← citeshttps://doi.org/10.1002/047134608x.w4324openalex-snapshot
Searching
inferred← citeshttps://doi.org/10.1002/0471667196.ess1877.pub2openalex-snapshot
Ordering Procedures
inferred← citeshttps://doi.org/10.1002/9780470869048.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9780470932025.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781118033104.ch5openalex-snapshot
Directed Graphs
inferred← citeshttps://doi.org/10.1002/9781118445112.stat01726openalex-snapshot
Ordering Procedures
inferred← citeshttps://doi.org/10.1002/9781118600245.ch2openalex-snapshot
Randomized Complexity
inferred← citeshttps://doi.org/10.1002/9781119005216.ch2openalex-snapshot
Randomized Complexity
inferred← citeshttps://doi.org/10.1002/9781119262442.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781119384335.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781119967101.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781444343069.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9783527628025.ch17openalex-snapshot
QuickSort from an Information Theoretic View
inferred← citeshttps://doi.org/10.1002/asi.22829openalex-snapshot
TSDW : Two‐stage word sense disambiguation using Wikipedia
inferred← citeshttps://doi.org/10.1002/asi.4630270108openalex-snapshot
Prospects for Parallelism and the Computer Crunch
inferred← citeshttps://doi.org/10.1002/cpe.2970openalex-snapshot
Implementation and performance analysis of efficient index structures for DNA search algorithms in parallel platforms
inferred← citeshttps://doi.org/10.1002/cpe.638openalex-snapshot
Code generator for the HPF Library and Fortran 95 transformational functions
inferred← citeshttps://doi.org/10.1002/dac.505openalex-snapshot
IP router architectures: an overview
inferred← citeshttps://doi.org/10.1002/eqe.4290220205openalex-snapshot
An efficient, adaptive algorithm for large‐scale random vibration analysis
inferred← citeshttps://doi.org/10.1002/jgt.3190120106openalex-snapshot
Searching for an edge in a graph
inferred← citeshttps://doi.org/10.1002/nav.21728openalex-snapshot
Scheduling parallel machines with inclusive processing set restrictions and job rejection
inferred← citeshttps://doi.org/10.1002/nem.516openalex-snapshot
Managing routing tables for URL routers in content distribution networks
inferred← citeshttps://doi.org/10.1002/net.3230070103openalex-snapshot
Finding optimum branchings
inferred← citeshttps://doi.org/10.1002/net.3230100202openalex-snapshot
The k best spanning arborescences of a network
inferred← citeshttps://doi.org/10.1002/net.3230220106openalex-snapshot
The n‐line traveling salesman problem
inferred← citeshttps://doi.org/10.1002/nme.502openalex-snapshot
An augmented spatial digital tree algorithm for contact detection in computational mechanics
inferred← citeshttps://doi.org/10.1002/pds.1995openalex-snapshot
Linking a pharmaceutical claims database with a birth defects registry to investigate birth defect rates of suspected teratogens
inferred← citeshttps://doi.org/10.1002/rsa.20659openalex-snapshot
Dependence and phase changes in random m‐ary search trees
inferred← citeshttps://doi.org/10.1002/rsa.20737openalex-snapshot
On the average‐case complexity of Shellsort
inferred← citeshttps://doi.org/10.1002/rsa.3240030209openalex-snapshot
A note on the probabilistic analysis of patricia trees
inferred← citeshttps://doi.org/10.1002/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferred← citeshttps://doi.org/10.1002/rsa.3240040103openalex-snapshot
Randomized adaptive sorting
inferred← citeshttps://doi.org/10.1002/rsa.3240050205openalex-snapshot
On random cartesian trees
inferred← citeshttps://doi.org/10.1002/rsa.3240070203openalex-snapshot
Hypergeometrics and the cost structure of quadtrees
inferred← citeshttps://doi.org/10.1002/sapm199083131openalex-snapshot
Denert's Permutation Statistic Is Indeed Euler‐Mahonian
inferred← citeshttps://doi.org/10.1002/spe.1102openalex-snapshot
A high‐performance sorting algorithm for multicore single‐instruction multiple‐data processors
inferred← citeshttps://doi.org/10.1002/spe.4380111211openalex-snapshot
Sorting unsorted and partially sorted lists using the natural merge sort
inferred← citeshttps://doi.org/10.1002/spe.4380120708openalex-snapshot
Hash‐bucket search: A fast technique for searching an english spelling dictionary
inferred← citeshttps://doi.org/10.1002/spe.4380161203openalex-snapshot
Algorithms for BD trees
inferred← citeshttps://doi.org/10.1002/spe.4380180110openalex-snapshot
Performance analysis of partial‐match search algorithms for BD trees
inferred← citeshttps://doi.org/10.1002/spe.4380200207openalex-snapshot
Selecting a hashing algorithm
inferred← citeshttps://doi.org/10.1002/spe.4380211004openalex-snapshot
Implementing dynamic minimal‐prefix tries
inferred← citeshttps://doi.org/10.1002/spe.4380230103openalex-snapshot
Applications of finite automata representing large vocabularies
inferred← citeshttps://doi.org/10.1002/spe.4380230305openalex-snapshot
Bonsai: A compact representation of trees
inferred← citeshttps://doi.org/10.1002/spe.4380230403openalex-snapshot
An evaluation of self‐adjusting binary search tree techniques
inferred← citeshttps://doi.org/10.1002/spe.4380231106openalex-snapshot
ISA [k] trees: A class of binary search trees with minimal or near minimal internal path length
inferred← citeshttps://doi.org/10.1002/spe.4380240205openalex-snapshot
A faster scrabble move generation algorithm
inferred← citeshttps://doi.org/10.1002/spe.643openalex-snapshot
LZ trie and dictionary compression
inferred← citeshttps://doi.org/10.1002/wcm.127openalex-snapshot
Average case analysis‐based protocols to initialize packet radio networks
inferred← citeshttps://doi.org/10.1002/wcm.92openalex-snapshot
Complex field coded MIMO systems: performance, rate, and trade‐offs
inferred← citeshttps://doi.org/10.1006/inco.2000.3006openalex-snapshot
Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree
inferred← citeshttps://doi.org/10.1006/inco.2001.2934openalex-snapshot
Lower Bounds for Merging Networks
inferred← citeshttps://doi.org/10.1006/jagm.1997.0869openalex-snapshot
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
inferred← citeshttps://doi.org/10.1006/jagm.1997.0911openalex-snapshot
Transformations on Words
inferred← citeshttps://doi.org/10.1006/jagm.2001.1171openalex-snapshot
Deterministic Dictionaries
inferred← citeshttps://doi.org/10.1006/jcom.1998.0495openalex-snapshot
On-line Construction of Two-Dimensional Suffix Trees
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/jcph.1998.5904openalex-snapshot
Discontinuous Galerkin Finite Element Method with Anisotropic Local Grid Refinement for Inviscid Compressible Flows
inferred← citeshttps://doi.org/10.1006/jcss.1997.1470openalex-snapshot
Breaking theΘ(nlog2n) Barrier for Sorting with Faults
inferred← citeshttps://doi.org/10.1006/jcta.1998.2893openalex-snapshot
The Distribution of Descents in Fixed Conjugacy Classes of the Symmetric Groups
inferred← citeshttps://doi.org/10.1006/jcta.1999.2964openalex-snapshot
Descent Identities, Hessenberg Varieties, and the Weil Conjectures
inferred← citeshttps://doi.org/10.1006/jcta.2000.3113openalex-snapshot
Generalized Rook Polynomials
inferred← citeshttps://doi.org/10.1006/jcta.2001.3200openalex-snapshot
The Distributions of the Entries of Young Tableaux
inferred← citeshttps://doi.org/10.1006/jeth.1996.2233openalex-snapshot
The Probability of Condorcet Cycles and Super Majority Rules
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.1659openalex-snapshot
Fully Scalable Fault-Tolerant Simulations for BSP and CGM
inferred← citeshttps://doi.org/10.1007/11523468_47openalex-snapshot
Cache-Aware and Cache-Oblivious Adaptive Sorting
inferred← citeshttps://doi.org/10.1007/11602613_46openalex-snapshot
Uniformization of Discrete Data
inferred← citeshttps://doi.org/10.1007/3-540-07612-3_3openalex-snapshot
Data base research: A survey
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_169openalex-snapshot
How good is the adversary lower bound ?
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_5openalex-snapshot
Storage modification machines
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_25openalex-snapshot
On the weighted path length of binary search trees for unknown access probabilities
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_39openalex-snapshot
A uniform approach to balanced binary and multiway trees
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_15openalex-snapshot
Concurrent operations in large ordered indexes
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_25openalex-snapshot
Proving lower bounds for linear decision trees
inferred← citeshttps://doi.org/10.1007/3-540-11980-9_20openalex-snapshot
Effects of practical assumption in area complexity of VLSI computation
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_4openalex-snapshot
Efficient algorithms for finding maximal matching in graphs
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_67openalex-snapshot
Some further results on digital search trees
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_28openalex-snapshot
A comparative study of concurrency control methods in B-trees
inferred← citeshttps://doi.org/10.1007/3-540-16811-7_187openalex-snapshot
A general approach to sorting on 3-dimensionally mesh-connected arrays
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_46openalex-snapshot
Expedient stochastic move-to-front and optimal stochastic move-to-rear list organizing strategies
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_51openalex-snapshot
On optimal parallelization of sorting networks
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_12openalex-snapshot
Two hybrid methods for collision resolution in open addressing hashing
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_6openalex-snapshot
Extremal cost tree data structures
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_120openalex-snapshot
Random allocations and probabilistic languages
inferred← citeshttps://doi.org/10.1007/3-540-33213-8_6openalex-snapshot
Selective-Tap Adaptive Algorithms for Echo Cancellation
inferred← citeshttps://doi.org/10.1007/3-540-39757-4_14openalex-snapshot
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_11openalex-snapshot
Quantitative Observables and Averages in Probabilistic Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_12openalex-snapshot
Best Increments for the Average Case of Shellsort
inferred← citeshttps://doi.org/10.1007/3-540-44709-1_9openalex-snapshot
Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
inferred← citeshttps://doi.org/10.1007/3-540-45643-0_15openalex-snapshot
An Improvement on Tree Selection Sort
inferred← citeshttps://doi.org/10.1007/3-540-46146-9_92openalex-snapshot
Clustered Indexing Technique for Multidimensional Index Structures
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_38openalex-snapshot
A Note on Discrete Logarithms with Special Structure
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_53openalex-snapshot
On the complexity of computing class groups of algebraic number fields
inferred← citeshttps://doi.org/10.1007/3-540-51295-0_120openalex-snapshot
Duplicate detection and deletion in the extended NF2 data model
inferred← citeshttps://doi.org/10.1007/3-540-51295-0_121openalex-snapshot
Fast exchange sorts
inferred← citeshttps://doi.org/10.1007/3-540-51295-0_123openalex-snapshot
The path length of binary trees
inferred← citeshttps://doi.org/10.1007/3-540-51465-1_6openalex-snapshot
Sequence comparison: Some theory and some practice
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_85openalex-snapshot
Generalizing singly-linked list reorganizing heuristics for doubly-linked lists
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_42openalex-snapshot
The distribution of keys in a binary heap
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_11openalex-snapshot
Optimal constant space move-to-fear list organization
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_19openalex-snapshot
Local insertion sort revisited
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_88openalex-snapshot
Sorting shuffled monotone sequences
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-54029-6_153openalex-snapshot
Practical adaptive sorting
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_161openalex-snapshot
Balance in AVL trees
inferred← citeshttps://doi.org/10.1007/3-540-54414-3_38openalex-snapshot
Grow and post index trees: Role, techniques and future potential
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_38openalex-snapshot
A framework for adaptive sorting
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_57openalex-snapshot
Maintaining dictionaries: Space-saving modifications of B-trees
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_260openalex-snapshot
An index data structure for matrices, with applications to fast two-dimensional pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_22openalex-snapshot
Does transitivity help? On the complexity of poset properties
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_241openalex-snapshot
A framework for constructing heap-like structures in-place
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_13openalex-snapshot
Efficient reorganization of binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_177openalex-snapshot
Average cost to produce partial orders
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_191openalex-snapshot
Fast and efficient operations on Parallel Priority Queues
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_192openalex-snapshot
Heaps with bits
inferred← citeshttps://doi.org/10.1007/3-540-58430-7_33openalex-snapshot
Parallel heap construction using multiple selection
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_142openalex-snapshot
Foundations for faster external sorting
inferred← citeshttps://doi.org/10.1007/3-540-58795-0_53openalex-snapshot
A hybrid pointerless representation of quadtrees for efficient processing of window queries
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_30openalex-snapshot
Leapfrogging samplesort
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_59openalex-snapshot
Path balance heuristic for self-adjusting binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-60902-4_21openalex-snapshot
Highly parallel concentrated heterogeneous computing
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_47openalex-snapshot
Ranking and unranking trees using regular reductions
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_24openalex-snapshot
Analysis of two-dimensional approximate pattern matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-63174-7_6openalex-snapshot
Instruction computation in subset construction
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_17openalex-snapshot
On-line construction of two-dimensional suffix trees
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_12openalex-snapshot
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_739openalex-snapshot
B+-Tree
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-4471-3546-3_1openalex-snapshot
Towards Implementing Prolog on Massively Parallel Mixed Architecture Computers
inferred← citeshttps://doi.org/10.1007/978-1-4471-5079-4_16openalex-snapshot
Combinatorics
inferred← citeshttps://doi.org/10.1007/978-1-4471-5102-9_133-3openalex-snapshot
Randomized Methods for Control of Uncertain Systems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4808-8_36openalex-snapshot
Rotation Distance
inferred← citeshttps://doi.org/10.1007/978-1-4612-5144-6_3openalex-snapshot
The Equi-Join Operation on a Multiprocessor Database Machine: Algorithms and the Evaluation of their Performance
inferred← citeshttps://doi.org/10.1007/978-1-4612-5798-1_1openalex-snapshot
A Log Log N Search Algorithm for Nonuniform Distributions
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_31openalex-snapshot
A Study on Algorithms for Selecting r Best Elements from An Array
inferred← citeshttps://doi.org/10.1007/978-1-4613-1401-1_12openalex-snapshot
Placement-Related Problems in Shared Disk I/O
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_20openalex-snapshot
Space Partitioning and Its Application to Generalized Retrieval Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_25openalex-snapshot
A Method for Realistic Comparisons of Sorting Algorithms for VLSI
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_7openalex-snapshot
The Study of a Letter Oriented Minimal Perfect Hashing Scheme
inferred← citeshttps://doi.org/10.1007/978-1-4613-9883-7_1openalex-snapshot
A Survey of File Organizations and Performance
inferred← citeshttps://doi.org/10.1007/978-1-4615-2762-6_4openalex-snapshot
Exploring the Algorithmic Design Space using High Level Synthesis
inferred← citeshttps://doi.org/10.1007/978-1-4615-4036-6_7openalex-snapshot
A Sorter-Based Architecture for a Parallel Implementation of Communication Intensive Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4684-3384-5_10openalex-snapshot
An Axiomatic Data Base Theory
inferred← citeshttps://doi.org/10.1007/978-1-4684-6357-6_8openalex-snapshot
Ensemble Architectures and their Algorithms: An Overview
inferred← citeshttps://doi.org/10.1007/978-1-4684-6371-2_4openalex-snapshot
Sorting
inferred← citeshttps://doi.org/10.1007/978-1-4684-6371-2_5openalex-snapshot
The Hash Table Abstraction
inferred← citeshttps://doi.org/10.1007/978-1-4757-5210-6_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-84996-223-0_5openalex-snapshot
A Matter of Digital Materiality
inferred← citeshttps://doi.org/10.1007/978-3-031-31654-8_17openalex-snapshot
Mean Values: A Multicriterial Analysis
inferred← citeshttps://doi.org/10.1007/978-3-0348-0609-1_4openalex-snapshot
Algebra of Trees
inferred← citeshttps://doi.org/10.1007/978-3-0348-8405-1_1openalex-snapshot
Rawa Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-04708-9_5openalex-snapshot
Design Technique Based on Hierarchical and Parallel Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-63558-3_47openalex-snapshot
Fast Subsumption Between Rooted Labeled Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-98398-1_8openalex-snapshot
SIMD Vectorized Hashing for Grouped Aggregation
inferred← citeshttps://doi.org/10.1007/978-3-322-90612-0_1openalex-snapshot
Bilder, Fenster und Operatoren
inferred← citeshttps://doi.org/10.1007/978-3-540-24571-1_3openalex-snapshot
Index Clustering for High-Performance Sequential Index Access
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_10openalex-snapshot
Probabilistic Methods in State Space Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-30192-9_2openalex-snapshot
MIRA: Multilingual Information Processing on Relational Architecture
inferred← citeshttps://doi.org/10.1007/978-3-540-30502-6_35openalex-snapshot
On the BDD of a Random Boolean Function
inferred← citeshttps://doi.org/10.1007/978-3-540-36519-8_7openalex-snapshot
Record linkage methods for multidatabase data mining
inferred← citeshttps://doi.org/10.1007/978-3-540-72434-6_49openalex-snapshot
Adaptive Processing Scheme of Overflowed Buckets for Bucket Sort Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_55openalex-snapshot
Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_10openalex-snapshot
Introduction to Software Performance Engineering: Origins and Outstanding Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_59openalex-snapshot
Partial Solution and Entropy
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-27266-0_2openalex-snapshot
Algorithms and Data
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_4openalex-snapshot
Algorithmic Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_6openalex-snapshot
The Efficiency of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-32584-7_17openalex-snapshot
A Fast Algorithm for Frequent Itemset Mining Using Patricia* Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-32790-2_5openalex-snapshot
The Soundex Phonetic Algorithm Revisited for SMS Text Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-41431-2_14openalex-snapshot
Word Form Recognition in LA Morph
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_14openalex-snapshot
Gossip Protocols for Renaming and Sorting
inferred← citeshttps://doi.org/10.1007/978-3-642-68402-9_13openalex-snapshot
The VLSI Complexity of Sorting
inferred← citeshttps://doi.org/10.1007/978-3-642-69298-7_9openalex-snapshot
Partition Sorts for VLSI
inferred← citeshttps://doi.org/10.1007/978-3-642-71071-1_11openalex-snapshot
Bibliography on quadtrees and related hierarchical data structures
inferred← citeshttps://doi.org/10.1007/978-3-642-72557-9_104openalex-snapshot
On the use of Hypermatrices in Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-95321-7_5openalex-snapshot
A Portable Relational Interface for the Distributed DBMS POREL
inferred← citeshttps://doi.org/10.1007/978-3-642-95466-5_2openalex-snapshot
Beschreibungsmethodik
inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_14openalex-snapshot
Abstraction Mechanisms in CLU
inferred← citeshttps://doi.org/10.1007/978-3-662-54100-5_4openalex-snapshot
Dateiverwaltung
inferred← citeshttps://doi.org/10.1007/978-93-86279-52-1_4openalex-snapshot
Interpolation
inferred← citeshttps://doi.org/10.1007/978-94-007-1387-1_8openalex-snapshot
Efficient Trellis Sigma-Delta Modulation
inferred← citeshttps://doi.org/10.1007/978-981-15-9129-7_28openalex-snapshot
Multi-owner Encrypted Ranked Keyword Search Using Machine Learning Techniques
inferred← citeshttps://doi.org/10.1007/bf00123161openalex-snapshot
Efficient registration of stereo images by matching graph descriptions of edge segments
inferred← citeshttps://doi.org/10.1007/bf00140664openalex-snapshot
Random sampling from databases: a survey
inferred← citeshttps://doi.org/10.1007/bf00177657openalex-snapshot
Recognizing majority-rule equilibrium in spatial voting games
inferred← citeshttps://doi.org/10.1007/bf00245022openalex-snapshot
Mechanical certification of systolic algorithms
inferred← citeshttps://doi.org/10.1007/bf00263927openalex-snapshot
Storage utilization in B *-trees with a generalized overflow technique
inferred← citeshttps://doi.org/10.1007/bf00264229openalex-snapshot
An algorithm for merging heaps
inferred← citeshttps://doi.org/10.1007/bf00265991openalex-snapshot
Branching processes in the analysis of the heights of trees
inferred← citeshttps://doi.org/10.1007/bf00268499openalex-snapshot
Edge-disjoint spanning trees and depth-first search
inferred← citeshttps://doi.org/10.1007/bf00288534openalex-snapshot
An algorithmic and complexity analysis of interpolation search
inferred← citeshttps://doi.org/10.1007/bf00288643openalex-snapshot
Remarks on ?A Synthesis of Several Sorting Algorithms? by John Darlington
inferred← citeshttps://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferred← citeshttps://doi.org/10.1007/bf00288973openalex-snapshot
Concurrency and Trie Hashing
inferred← citeshttps://doi.org/10.1007/bf00289075openalex-snapshot
On random 2?3 trees
inferred← citeshttps://doi.org/10.1007/bf00289146openalex-snapshot
Expected behaviour of B+-trees under random insertions
inferred← citeshttps://doi.org/10.1007/bf00289147openalex-snapshot
Stable duplicate-key extraction with optimal time and space bounds
showing the first 200 of 901 · page through all 901
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.