SODA 1997 - PDF Preprint Papers

SODA 1997 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-1997 Paper

click to vote

SODA
1997
ACM

199views Algorithms» more SODA 1997»

Fast Algorithms for Sorting and Searching Strings

14 years 23 days ago

Download www.cs.princeton.edu

We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...

Jon Louis Bentley, Robert Sedgewick

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	199	Fast Algorithms for Sorting and Searching Strings	claim
2	171	A Practical Approximation Algorithm for the LMS Line Estimator	claim
3	169	Partial Matching of Planar Polylines Under Similarity Transformations	claim
4	144	Methods for Achieving Fast Query Times in Point Location Data Structures	claim
5	120	Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem	claim
6	119	Map Labeling and Its Generalizations	claim
7	115	Faster Construction of Planar Two-Centers	claim
8	115	On-Line Difference Maximization	claim
9	114	Better Approximation Guarantees for Job-shop Scheduling	claim
10	113	The Influence of Caches on the Performance of Sorting	claim
11	111	Approximation Schemes for Scheduling	claim
12	108	Coloring with Defect	claim
13	106	Runtime Prediction of Real Programs on Real Machines	claim
14	106	Optimal Bounds for Matching Routing on Trees	claim
15	98	The k-Client Problem	claim
16	98	Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes	claim
17	95	Randomly Sampling Molecules	claim
18	93	Fast Approximate Graph Partitioning Algorithms	claim
19	89	Optimal Point Placement for Mesh Smoothing	claim
20	83	Experimental Study of Minimum Cut Algorithms	claim
21	76	Markov Chains for Linear Extensions, the Two-Dimensional Case	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers