Pages that link to "Item:Q2828175"

The following pages link to ACM Journal of Experimental Algorithmics (Q2828175):

Displaying 50 items.

• Locally Compressed Suffix Arrays (Q2828176) (← links)
• Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
• Efficient Matching for Column Intersection Graphs (Q2828179) (← links)
• Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions (Q2828180) (← links)
• Experiments on Density-Constrained Graph Clustering (Q2828182) (← links)
• An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
• Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
• On a Model of Virtual Address Translation (Q2828187) (← links)
• Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
• General Document Retrieval in Compact Space (Q2828189) (← links)
• Engineering Efficient Paging Algorithms (Q2828192) (← links)
• Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (Q2828194) (← links)
• Candidate Sets for Alternative Routes in Road Networks (Q2828197) (← links)
• An Experimental Study on Approximating <i>k</i> Shortest Simple Paths (Q2828199) (← links)
• User-Constrained Multimodal Route Planning (Q2828200) (← links)
• Upgrading Subgroup Triple-Product-Property Triples (Q2828201) (← links)
• Upward Planarity Testing in Practice (Q2828203) (← links)
• Degree Reduction in Labeled Graph Retrieval (Q2828204) (← links)
• Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates (Q2828206) (← links)
• On Computing the Gromov Hyperbolicity (Q2828207) (← links)
• Clique Counting in MapReduce (Q2828209) (← links)
• Fast string sorting using order-preserving compression (Q3507741) (← links)
• The datapath merging problem in reconfigurable systems (Q3507745) (← links)
• Implementing approximation algorithms for the single-source unsplittable flow problem (Q3507746) (← links)
• Improving the performance of multidimensional search using fingers (Q3507747) (← links)
• Combining speed-up techniques for shortest-path computations (Q3507749) (← links)
• Increased bit-parallelism for approximate and multiple string matching (Q3507750) (← links)
• In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes (Q3507751) (← links)
• Approximating interval coloring and max-coloring in chordal graphs (Q3507752) (← links)
• A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem (Q3507753) (← links)
• Using random sampling to build approximate tries for efficient string sorting (Q3507755) (← links)
• A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique (Q3507758) (← links)
• Multipattern string matching with <i>q</i> -grams (Q3507759) (← links)
• Cache-efficient string sorting using copying (Q3507761) (← links)
• Cache-Friendly implementations of transitive closure (Q3507763) (← links)
• Algorithms for dynamic multicast key distribution (Q3507764) (← links)
• Partitioning planar graphs with costs and weights (Q3507765) (← links)
• Heuristics for estimating contact area of supports in layered manufacturing (Q3507766) (← links)
• A dynamic topological sort algorithm for directed acyclic graphs (Q3507767) (← links)
• A framework for probabilistic numerical evaluation of sensor networks (Q3507770) (← links)
• GRASP with path relinking for the weighted MAXSAT problem (Q3507771) (← links)
• Algorithms for pure Nash equilibria in weighted congestion games (Q3507775) (← links)
• Partitioning graphs to speedup Dijkstra's algorithm (Q3507777) (← links)
• Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers (Q3507778) (← links)
• The “real” approximation factor of the MST heuristic for the minimum energy broadcasting (Q3507779) (← links)
• Engineering a cache-oblivious sorting algorithm (Q3507783) (← links)
• Sum-of-squares heuristics for bin packing and memory allocation (Q3507786) (← links)
• Efficient models for timetable information in public transportation systems (Q3507787) (← links)
• Faster placement of hydrogens in protein structures by dynamic programming (Q3507790) (← links)
• An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization (Q4555537) (← links)