Stop the war!
Остановите войну!
for scientists:
default search action
ACM Journal of Experimental Algorithmics, Volume 15
Volume 15, March 2010
- Tobias Jacobs:
An experimental study of recent hotlink assignment algorithms. - Ivor T. A. Spence:
sgen1: A generator of small but difficult satisfiability benchmarks. - Johannes Langguth, Fredrik Manne, Peter Sanders:
Heuristic initialization for bipartite matching problems. - François Delbot, Christian Laforest:
Analytical and experimental comparison of six algorithms for the vertex cover problem. - Diego Arroyuelo, Gonzalo Navarro:
Practical approaches to reduce the space requirement of lempel-ziv-based compressed text indices. - Julian R. Ullmann:
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. - Nikolas Askitis, Justin Zobel:
Redesigning the string hash table, burst trie, and BST to exploit cache.
- Catherine C. McGeoch:
Preface. - Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Layer-free upward crossing minimization. - Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. - Nicholas Nash, David Gregg:
Comparing integer data structures for 32- and 64-bit keys. - Ranjan Sinha, Anthony Wirth:
Engineering burstsort: Toward fast in-place string sorting.
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.