MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Dynamic perfect hashingHash tableHash treeDouble hashingHash array mapped trieCuckoo hashingLocality-sensitive hashingLookup tableQuadratic probingConcurrent hash tableHash listIndex mappingLinear probingCounting sortFractional cascadingHash-based cryptographyDisjoint-set data structureMerge sortObject compositionFunction compositionMerge algorithmFibonacci heapComposite data typeTrieCoinductionSymbol tableHash collisionFunctional programmingArray programmingSearch algorithmParallel arraySkip listMerkle signature schemeRelational operatorHigh-throughput computingHigher-order abstract syntaxSearch data structureRainbow tableReduction operatorSearch treeMultiple instruction, single dataAssociative arrayTreapDistributed hash tableShunting yard algorithmEmbedded sqlEvolutionary computationHash joinCanonical huffman codeLinked data structureB-treeRadix treeHamming codeTreeBranch tableSolid compressionAnalysis of parallel algorithmsHomomorphic secret sharingHomomorphic encryptionComputer programmingDispatch tableUniversal turing machineString-searching algorithmFractal tree indexMatching wildcardsConstraint programmingMerkle treeTransactional memoryDoubly linked listListSymbolic executionFormal specificationComputer architectureArray data structureMultimapBinary translationPermutation boxPiece tableTask parallelismList decodingSegment treeAnalysis of algorithmsData structureSearch-based software engineeringRecursive data typeCryptographic hash functionGene expression programmingPattern matchingParallel algorithmK-way merge algorithmConcatenationProgram synthesisMin-max heapSchemaMonte carlo tree searchFusion treeData typeSoftware transactional memoryContraction hierarchiesDistributed shared memory