Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Journal of Experimental Algorithmics, Volume 12
Volume 12, 2007
- Ulrik Brandes, Marco Gaertler
, Dorothea Wagner:
Engineering graph clustering: Models and experimental evaluation. 1.1:1-1.1:26 - Michael A. Maniscalco, Simon J. Puglisi:
An efficient, versatile approach to suffix sorting. 1.2:1-1.2:23 - Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah:
Symmetry breaking for pseudo-Boolean formulas. 1.3:1-1.3:14 - Marco Pellegrini, Giordano Fusco:
Efficient IP table lookup via adaptive stratified trees with selective reconstructions. 1.4:1-1.4:28
- Lars Arge, Giuseppe F. Italiano:
Preface. 2.1:1 - Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
Engineering a cache-oblivious sorting algorithm. 2.2:1-2.2:23 - Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt:
Sum-of-squares heuristics for bin packing and memory allocation. 2.3:1-2.3:19 - Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Efficient models for timetable information in public transportation systems. 2.4:1-2.4:39 - Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang:
Faster placement of hydrogens in protein structures by dynamic programming. 2.5:1-2.5:16
Volume 12, 2008
- Gonzalo Navarro, Nora Reyes:
Dynamic spatial approximation trees. 1.5:1-1.5:68 - Ioannis Krommidas, Christos D. Zaroliagis:
An experimental study of algorithms for fully dynamic transitive closure. 1.6:1-1.6:22 - Keqin Li:
Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks. 1.7:1-1.7:24 - Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg:
An experimental study of sorting and branch prediction. 1.8:1-1.8:39 - Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe:
Terracost: Computing least-cost-path surfaces for massive grid terrains. 1.9:1-1.9:31 - Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton:
A graph approach to the threshold all-against-all substring matching problem. 1.10:1-1.10:26 - Martin Dietzfelbinger, Martin Hühne, Christoph Weidling:
A dictionary implementation based on dynamic perfect hashing. 1.11:1-1.11:25
- Camil Demetrescu, Roberto Tamassia:
Papers from ALENEX 2005. 3.1:1 - Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the adaptiveness of Quicksort. 3.2:1-3.2:20 - Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
An experimental study of different approaches to solve the market equilibrium problem. 3.3:1-3.3:21 - Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
Better external memory suffix array construction. 3.4:1-3.4:24 - Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret:
Approximating the true evolutionary distance between two genomes. 3.5:1-3.5:17
a service of 
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.
last updated on 2024-04-22 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
