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.
Huffman codingPerfect hash functionLehmer codeCanonical formPattern languageCartesian treeLow-density parity-check codeModel of computationOne-way compression functionBinary-coded decimalConcatenated error correction codePolynomial codeShannon codingAlgorithmic information theorySequential compactnessLinear codeShannon's source coding theoremComputability theoryIndex setAlgorithmSystematic codeSuccinct data structureEntropy codingHash treeCanonicalizationConstructible universeData compressionCounting sortCode rateProgramming language theoryAlgorithmic efficiencyKarp reductionBlock cipherTheory of computationCircuit complexityData compression ratioRadix treeBinary space partitioningComputable functionSearch problemError correction codeParity-check matrixBarker codeSuffix treeComposite data typeSoft-decision decoderHmacRelatively compact subspaceSearch data structureData typeKolmogorov complexityHammingInformation theoryPermutation patternChurch-turing thesisCompressed sensingRandom binary treeRegular expressionReductionCompact convergenceBinary treeType theoryProperty testingGraphSpecial number field sieveRecursive languageTime complexityTabulation hashingCanonical quantizationMinhashBoolean circuitLalr parserDigital dataBinary decoderDiscrete-time fourier transformTrieSyntaxPurely functional programmingBinary golay codeIndex calculus algorithmBch codeCodeSet-builder notationFormal specificationCryptographic hash functionTree decompositionBurst error-correcting codeOptimal substructureGeometric hashingFinite-state machineFibonacci search techniqueProbabilistically checkable proofSelection algorithmEigendecomposition of a matrixContext-free grammarDiscrete wavelet transformStrong np-completenessSearch algorithmParsing expression grammarMin-max heap