![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
ALENEX 2011: San Francisco, California, USA
- Matthias Müller-Hannemann
, Renato Fonseca F. Werneck:
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011. SIAM 2011, ISBN 978-1-61197-291-7 - Iulian Moraru, David G. Andersen:
Exact Pattern Matching with Feed-Forward Bloom Filters. 1-12 - Markus Chimani, Matthias Woste, Sebastian Böcker:
A Closer Look at the Closest String and Closest Substring Problem. 13-24 - Simon Gog, Enno Ohlebusch:
Fast and Lightweight LCP-Array Construction Algorithms. 25-34 - Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff:
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. 35-47 - Guy E. Blelloch, Julian Shun:
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. 48-58 - James Demmel:
Avoiding Communication in Numerical Linear Algebra. 59 - Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Disjoint-Path Facility Location: Theory and Practice. 60-74 - Daniel Chen, Anne Driemel
, Leonidas J. Guibas, Andy Nguyen, Carola Wenk
:
Approximate Map Matching with respect to the Fréchet Distance. 75-83 - Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt:
Algorithms for Matching and Predicting Trajectories. 84-95 - Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
:
Dependent Randomized Rounding: The Bipartite Case. 96-106 - Torsten J. Gellert, Felix G. König:
1D Vehicle Scheduling with Conflicts. 107-115 - Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
:
An SDP Approach to Multi-level Crossing Minimization. 116-126 - Pedro Machado Manhães de Castro, Olivier Devillers:
Simple and Efficient Distribution-Sensitive Point Location, in Triangulations. 127-138 - Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh:
Engineering a Topological Sorting Algorithm for Massive Graphs. 139-150 - Isabelle Stanton, Ali Pinar:
Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. 151-163 - Suresh Venkatasubramanian
, Qiushi Wang:
The Johnson-Lindenstrauss Transform: An Empirical Study. 164-173
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.