Result 21 to 40 of 115 total
Cache-friendly implementations of transitive closure. (English)
ACM J. Exp. Algorithm. 11, Article 1.3, 25 p., electronic only (2006).
21
Cache-efficient string sorting using copying. (English)
ACM J. Exp. Algorithm. 11, Article 1.2, 32 p., electronic only (2006).
22
Multipattern string matching with $q$-grams. (English)
ACM J. Exp. Algorithm. 11, Article 1.1, 19 p., electronic only (2006).
23
A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.11, 18 p., electronic only (2005).
24
Using random sampling to build approximate tries for efficient string sorting. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.10, 18 p., electronic only (2005).
25
A tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.9, 15 p., electronic only (2005).
26
Approximating interval coloring and max-coloring in chordal graphs. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.8, 19 p., electronic only (2005).
27
In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.7, 27 p., electronic only (2005).
28
Increased bit-parallelism for approximate and multiple string matching. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.6, 27 p., electronic only (2005).
29
Combining speed-up techniques for shortest-path computations. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.5, 18 p., electronic only (2005).
30
Improving the performance of multidimensional search using fingers. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.4, 23 p., electronic only (2005).
31
Implementing approximation algorithms for the single-source unsplittable flow problem. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.3, 21 p., electronic only (2005).
32
The datapath merging problem in reconfigurable systems: complexity, dual bounds and heuristic evaluation. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., Article 2.2, 19 p., electronic only (2005).
33
Selected papers from the 3rd workshop on efficient and experimental algorithms, Rio di Janiero, Brazil, May 2004. (English)
ACM J. Exp. Algorithm. 10, Spec. Iss., electronic only (2005).
34
Fast string sorting using order-preserving compression. (English)
ACM J. Exp. Algorithm. 10, Article 1.4, 12 p., electronic only (2005).
35
New heuristic and interactive approaches to 2D rectangular strip packing. (English)
ACM J. Exp. Algorithm. 10, Article 1.3, 18 p., electronic only (2005).
36
Geometric containers for efficient shortest-path computation. (English)
ACM J. Exp. Algorithm. 10, Article 1.2, 30 p., electronic only (2005).
37
Adaptive data structures for IP lookups. (English)
ACM J. Exp. Algorithm. 10, Article 1.1, 24 p., electronic only (2005).
38
Average-optimal single and multiple approximate string matching. (English)
ACM J. Exp. Algorithm. 9, Article 1.4, 47 p., electronic only (2004).
39
Cache-conscious sorting of large sets of strings with dynamic tries. (English)
ACM J. Exp. Algorithm. 9, Article 1.5, 31 p., electronic only (2004).
40
Result 21 to 40 of 115 total
Start
Contact
Print
General Help
