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.
SamplesortMerge sortSmoothsortHeapsortSelection sortRadix sortCubesortQuicksortBurstsortBulk synchronous parallelLoop splittingGnome sortBucket sortInsertion sortSort-merge joinGuided local searchParallel virtual machineData parallelismTimsortParallelizationBitap algorithmExternal sortingDynamic programmingInstruction-level parallelismConcurrent data structureSimhashJump searchBat algorithmBitwise operations in cMerkle treeDepth-first searchDivide-and-conquer algorithmParallel computingShor's algorithmPriority inheritanceSingle instruction, multiple dataBeegfsBitvectorParallelismQuickselectQsortMultilevel feedback queueTsortBit arrayOptimizerProtothreadPollard's rho algorithmParsecMaze-solving algorithmSchwartzian transformSingle program, multiple dataQuantum machine learningMultithreadingSimilarity learningPredictive parserBitstreamParallel breadth-first searchOpen addressingInlinerBitkeeperRound-robin schedulingTreiber stackLibtorrentTask parallelismBcachefsSympyKernelizationIsomapBittorrentComplete-linkage clusteringColumn generationPrecompilerMassively parallelPhase retrievalStrandMerge-insertion sortBitmap indexAcceleratorParallel programming modelAutomata-based programmingDynamic perfect hashingMurmurhashOrangefsJump point searchSuperscalar processorRe-order bufferTuple spaceConflict-driven clause learningGenetic algorithmLee algorithmMapreduceJava compilerAutoencoderElasticsearchBreadth-first searchSynchronizerConstrained shortest path firstMicrothreadCompare-and-swapData deduplication