Conferences in DBLP
Gonzalo Navarro , Mathieu Raffinot Compact DFA Representation for Fast Regular Expression Search. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:1-12 [Conf ] Costas S. Iliopoulos , Laurent Mouchard , Yoan J. Pinzon The Max-Shift Algorithm for Approximate String Matching. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:13-25 [Conf ] Gianfranco Bilardi , Paolo D'Alberto , Alexandru Nicolau Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:26-38 [Conf ] Jyrki Katajainen , Bjarke Buur Mortensen Experiences with the Design and Implementation of Space-Efficient Deques. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:39-50 [Conf ] Hervé Brönnimann Designing and Implementing a General Purpose Halfedge Data Structure. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:51-66 [Conf ] Naila Rahman , Richard Cole , Rajeev Raman Optimised Predecessor Data Structures for Internal Memory. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:67-78 [Conf ] Susan Hert , Michael Hoffmann , Lutz Kettner , Sylvain Pion , Michael Seel An Adaptable and Extensible Geometry Kernel. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:79-90 [Conf ] Arne Andersson , Per Carlsson , Fredrik Ygge Efficient Resource Allocation with Noisy Functions. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:91-105 [Conf ] Boris Goldengorin , Diptesh Ghosh , Gerard Sierksma Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:106-117 [Conf ] Kazuo Iwama , Suguru Tamaki Exploiting Partial Knowledge of Satisfying Assignments. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:118-128 [Conf ] David A. Bader , Ajith K. Illendula , Bernard M. E. Moret , Nina R. Weisse-Bernstein Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:129-144 [Conf ] Eric J. Anderson , Joseph Hall , Jason D. Hartline , Michael Hobbs , Anna R. Karlin , Jared Saia , Ram Swaminathan , John Wilkes An Experimental Study of Data Migration Algorithms. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:145-158 [Conf ] Ioannis Chatzigiannakis , Sotiris E. Nikoletseas , Nearchos Paspallis , Paul G. Spirakis , Christos D. Zaroliagis An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:159-171 [Conf ] Christopher L. Barrett , Doug Cook , Gregory Hicks , Vance Faber , Achla Marathe , Madhav V. Marathe , Aravind Srinivasan , Yoram J. Sussmann , Heidi Thornquist Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:172-184 [Conf ] Matthias Müller-Hannemann , Karsten Weihe Pareto Shortest Paths is Often Feasible in Practice. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2001, pp:185-198 [Conf ]