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.
Counting sortPerfect hash functionLocality-sensitive hashingIndex mappingDouble hashingAssociative arrayGeometric hashingMinhashHash treeCryptographic hash functionMin-max heapTabulation hashingReference countingCuckoo hashingArray data typeBinary search algorithmBucket sortLinear probingSelection algorithmArray data structureCache replacement policiesFibonacci search techniqueFractional cascadingReduction operatorProperty testingAlgorithmic efficiencyRange minimum querySequential consistencyTilingFractal tree indexBinary searchB-treeSelf-balancing binary search treeBinary space partitioningArray slicingMemoizationSorted arrayPartial applicationK-independent hashingIn-place matrix transpositionMethod of complementsMaximum subarray problemSuccinct data structureDerived unique key per transactionBrodal queuePermutation boxTreapCanonical huffman codePartitionOptimal binary search treeFeature hashingCartesian treeHash functionMedian of mediansKadane's algorithmEventual consistencyRadix treeHmacDynamic arrayInterpolation searchSymbol tableMultimapDisjoint-set data structureSearch data structureRead-copy-updateConstant-recursive sequenceApproximate string matchingBinary search treeRolling hashHuffman codingMerkle signature schemeQuantizationInteger complexityStabilityData stripingChainingAffine cipherRekeyingIncremental computingBlock cipherCubesortInvariantEuclidean divisionMagic squareString-searching algorithmKey sizeAnalysis of parallel algorithmsFusion treeAvl treeCollision resistanceKarp reductionMerkle treeSkip listCharacteristicKahan summation algorithmK-way merge algorithmSelection sortBinomial heapPartition of a setConsistent estimator