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.
Cuckoo hashingLinear probingCollision attackIndex mappingHash collisionTabulation hashingHash functionHash treeMinhashCryptographic hash functionGeometric hashingLocality-sensitive hashingDouble dabbleCounting sortBinary search algorithmPrivate set intersectionMerkle signature schemeBinary space partitioningCache replacement policiesFibonacci search techniqueFractional cascadingHmacBinary searchReference countingChecksumPerfect hash functionBinary numeral systemMethod of complementsDynamic programmingDerived unique key per transactionBiclusteringKey derivation functionBinomial heapConsistent hashingLength extension attackBucket sortPreimage attackPbkdf2Key stretchingHirschberg's algorithmBlock sortParallel algorithmRam parityDouble countingCollision resistanceAnalysis of parallel algorithmsTilingHazard pointerIndexConcurrent computingInterpolation searchRecursionBubble sortMemoizationArrayMerkle treeProcedural generationLoop nest optimizationApproximate string matchingRolling hashDual ec drbgDuplicate codeKey exchangePartial evaluationCachePermutation boxCubesortInterleavingTreapMultimapData-driven programmingData stripingDatabase indexCall-by-referenceParallel arrayString-searching algorithmParallel processingBurst error-correcting codeIndirectionComposite data typeSelection sortBrute forceTail recursionHomomorphic secret sharingException handlingDouble dispatchRead-copy-updateMemory-level parallelismArray data structureArray slicingMutual recursionHierarchical clusteringPointer analysisRecursive data typeBitwise operationPartial applicationDifferential cryptanalysisBuffer overflowProxy re-encryptionDisjoint-set data structure