Back to Results
First PageMeta Content
Operations research / NP-complete problems / Dynamic programming / Equations / Systems engineering / Shortest path problem / Longest common subsequence problem / Graph / Catalan number / Mathematics / Theoretical computer science / Graph theory


An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT
Add to Reading List

Document Date: 2007-02-16 03:04:45

Open Document

File Size: 81,22 KB

Share Result on Facebook

City

Tucson / /

Currency

USD / /

Facility

University of Arizona / /

IndustryTerm

arbitrary alphabet algorithm / correction systems / faster algorithms / dynamic programming algorithm / output-sensitive algorithms / typical applications / linear space algorithm / file comparison tools / space algorithm / greedy algorithm / basic algorithm / earliest algorithms / /

OperatingSystem

UNIX / /

Organization

National Science Foundation / University of Arizona / /

Person

MAX FIGURE / EUGENE W. MYERS / /

Position

furthest reaching forward / /

ProvinceOrState

Arizona / /

Technology

greedy algorithm / detailed algorithm / arbitrary alphabet algorithm / Szymanski algorithm / dynamic programming algorithm / time algorithms / resulting algorithm / linear space algorithm / UNIX / SES algorithm / time algorithm / earliest algorithms / basic algorithm / B. The algorithm / /

SocialTag