Back to Results
First PageMeta Content
Combinatorial optimization / Dynamic programming / Combinatorics / Operations research / Knapsack problem / Matching / Permutation / Pattern matching / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics


Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK
Add to Reading List

Document Date: 2010-09-02 11:50:35

Open Document

File Size: 129,20 KB

Share Result on Facebook

City

Philadelphia / New York / /

Company

W. H. Freeman and Co. / /

Country

United States / /

Facility

University of Bristol / /

IndustryTerm

deterministic solution / ratio algorithm / binary search tree / software maintenance / balanced binary search tree / online text / /

Organization

Society for Industrial and Applied Mathematics / University of Bristol / Department of Computer Science / /

Person

L. Erds / Benjamin Sach / Dina Sokol / Carmit Hazay / Moshe Lewenstein / Alberto Apostolico / /

Position

Corresponding author / /

PublishedMedium

the Theory of Computing / Theory of Computing / /

Technology

J. Algorithms / well known KnuthMorris-Pratt algorithm / polynomial time 1/2-approximation ratio algorithm / /

SocialTag