The following pages link to James A. Storer (Q205212):
Displaying 22 items.
- On-line versus off-line computation in dynamic text compression (Q671415) (← links)
- Toward an abstract theory of data compression (Q794162) (← links)
- On the complexity of chess (Q1054641) (← links)
- On finding minimal length superstrings (Q1140992) (← links)
- Constructing full spanning trees for cubic graphs (Q1162518) (← links)
- Edit distance with block deletions (Q1736478) (← links)
- Edit distance with move operations (Q2457310) (← links)
- On minimal-node-cost planar embeddings (Q3338119) (← links)
- (Q3688300) (← links)
- Parallel algorithms for data compression (Q3771595) (← links)
- (Q3798232) (← links)
- Data compression via textual substitution (Q3951542) (← links)
- Shortest paths in the plane with polygonal obstacles (Q4323731) (← links)
- A single-exponential upper bound for finding shortest paths in three dimensions (Q4323732) (← links)
- Error-Resilient Optimal Data Compression (Q4376167) (← links)
- (Q4737692) (← links)
- (Q4791457) (← links)
- (Q4858434) (← links)
- The macro model for data compression (Extended Abstract) (Q5402538) (← links)
- String Processing and Information Retrieval (Q5897144) (← links)
- Optimal encoding of non-stationary sources (Q5944439) (← links)
- \(LZ\)-based image compression (Q5944440) (← links)