2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611972917

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Avoiding Communication in Numerical Linear Algebra

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.6 ◽

2011 ◽

pp. 59-59

Author(s):

James Demmel

Keyword(s):

Linear Algebra ◽

Numerical Linear Algebra

Download Full-text

Engineering a Topological Sorting Algorithm for Massive Graphs

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.14 ◽

2011 ◽

pp. 139-150

Author(s):

Deepak Ajwani ◽

Adan Cosgaya-Lozano ◽

Norbert Zeh

Keyword(s):

Sorting Algorithm ◽

Massive Graphs ◽

Topological Sorting

Download Full-text

A Closer Look at the Closest String and Closest Substring Problem

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.2 ◽

2011 ◽

pp. 13-24 ◽

Cited By ~ 18

Author(s):

Markus Chimani ◽

Matthias Woste ◽

Sebastian Böcker

Download Full-text

Exact Pattern Matching with Feed-Forward Bloom Filters

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.1 ◽

2011 ◽

pp. 1-12 ◽

Cited By ~ 6

Author(s):

Iulian Moraru ◽

David G. Andersen

Keyword(s):

Pattern Matching ◽

Bloom Filters ◽

Feed Forward

Download Full-text

An SDP Approach to Multi-level Crossing Minimization

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.12 ◽

2011 ◽

pp. 116-126 ◽

Cited By ~ 9

Author(s):

Markus Chimani ◽

Philipp Hungerländer ◽

Michael Jünger ◽

Petra Mutzel

Keyword(s):

Level Crossing ◽

Multi Level ◽

Crossing Minimization

Download Full-text

A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.5 ◽

2011 ◽

pp. 48-58 ◽

Cited By ~ 3

Author(s):

Guy E. Blelloch ◽

Julian Shun

Keyword(s):

Suffix Tree ◽

Tree Algorithm ◽

Tree Construction ◽

Cartesian Tree

Download Full-text

The Johnson-Lindenstrauss Transform: An Empirical Study

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.16 ◽

2011 ◽

pp. 164-173 ◽

Cited By ~ 14

Author(s):

Suresh Venkatasubramanian ◽

Qiushi Wang

Keyword(s):

Empirical Study

Download Full-text

Approximate Map Matching with respect to the Fréchet Distance

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.8 ◽

2011 ◽

pp. 75-83 ◽

Cited By ~ 14

Author(s):

Daniel Chen ◽

Anne Driemel ◽

Leonidas J. Guibas ◽

Andy Nguyen ◽

Carola Wenk

Keyword(s):

Map Matching ◽

Fréchet Distance ◽

Frechet Distance

Download Full-text

An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.4 ◽

2011 ◽

pp. 35-47 ◽

Cited By ~ 4

Author(s):

Eric Berberich ◽

Pavel Emeliyanenko ◽

Michael Sagraloff

Keyword(s):

Polynomial Systems ◽

Elimination Method ◽

Bivariate Polynomial

Download Full-text

Dependent Randomized Rounding: The Bipartite Case

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972917.10 ◽

2011 ◽

pp. 96-106 ◽

Cited By ~ 2

Author(s):

Benjamin Doerr ◽

Marvin Künnemann ◽

Magnus Wahlström

Keyword(s):

Randomized Rounding ◽

Bipartite Case

Download Full-text

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Avoiding Communication in Numerical Linear Algebra

Engineering a Topological Sorting Algorithm for Massive Graphs

A Closer Look at the Closest String and Closest Substring Problem

Exact Pattern Matching with Feed-Forward Bloom Filters

An SDP Approach to Multi-level Crossing Minimization

A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction

The Johnson-Lindenstrauss Transform: An Empirical Study

Approximate Map Matching with respect to the Fréchet Distance

An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks

Dependent Randomized Rounding: The Bipartite Case

2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Latest Publications