New Added

Algorithm engineering : 5th international workshop, WAE 2001, Aarhus, Denmark, August 28-31, 2001 : proceedings

Like Score+4241

Algorithm engineering : 5th international workshop, WAE 2001, Aarhus, Denmark, August 28-31, 2001 : proceedings
Original Title Algorithm engineering : 5th international workshop, WAE 2001, Aarhus, Denmark, August 28-31, 2001 : proceedings
Author WAE 2001 (2001 : Aarhus, Denmark), Brodal, Gerth Stølting, 1969-, Frigioni, Daniele, 1968-, Marchetti-Spaccamela, Alberto
Publication date

Topics Computer algorithms, Software engineering, génie logiciel, structure donnée, algorithme discret, algorithmique, Algorithmes, Génie logiciel, Algoritmen, Algorithmus, Datenstruktur, Effizienter Algorithmus, Kongress, Suchverfahren, Datenstruktur, Effizienter Algorithmus, Kongress, Suchverfahren, algorithme discret, algorithmique, génie logiciel, structure donnée, Algorithmus, Datenstruktur, Effizienter Algorithmus, Suchverfahren
Publisher Berlin , New York : Springer
Collection folkscanomy_miscellaneous, folkscanomy, additional_collections
Language English
Book Type EBook
Material Type Book
File Type PDF
Downloadable Yes
Support Mobile, Desktop, Tablet
Scan Quality: Best No watermark
PDF Quality: Good
Availability Yes
Price 0.00
Submitted By
Sketch the Cow
Submit Date
Algorithm Engineering: 5th International Workshop, WAE 2001 Århus, Denmark, August 28–31, 2001 ProceedingsAuthor: Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela Published by Springer Berlin Heidelberg ISBN: 978-3-540-42500-7 DOI: 10.1007/3-540-44688-5Table of Contents:Compact DFA Representation for Fast Regular Expression Search
The Max-Shift Algorithm for Approximate String Matching
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance
Experiences with the Design and Implementation of Space-Efficient Deques
Designing and Implementing a General Purpose Halfedge Data Structure
Optimised Predecessor Data Structures for Internal Memory
An Adaptable and Extensible Geometry Kernel
Efficient Resource Allocation with Noisy Functions
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem
Exploiting Partial Knowledge of Satisfying Assignments
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
An Experimental Study of Data Migration Algorithms
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry
Pareto Shortest Paths is Often Feasible in PracticeIncludes bibliographical references and indexCompact DFA Representation for Fast Regular Expression Search / Gonzalo Navarro and Mathieu Raffinot — The Max-Shift Algorithm for Approximate String Matching / Costas S. Iliopoulos, Laurent Mouchard and Yoan J. Pinzon — Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance / Gianfranco Bilardi, Paolo D’Alberto and Alex Nicolau — Experiences with the Design and Implementation of Space-Efficient Deques / Jyrki Katajainen and Bjarke Buur Mortensen — Designing and Implementing a General Purpose Halfedge Data Structure / Herve Bronnimann — Optimised Predecessor Data Structures for Internal Memory / Naila Rahman, Richard Cole and Rajeev Raman — An Adaptable and Extensible Geometry Kernel / Susan Hert, Michael Hoffmann and Lutz Kettner / [et al.] — Efficient Resource Allocation with Noisy Functions / Arne Andersson, Per Carlsson and Fredrik Ygge — Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem / Boris Goldengorin, Diptesh Ghosh and Gerard Sierksma — Exploiting Partial Knowledge of Satisfying Assignments / Kazuo Iwama and Suguru Tamaki — Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture / David A. Boder, Ajith K. Illendula and Bernard M. E. Moret / [et al.] — An Experimental Study of Data Migration Algorithms / Eric Anderson, Joe Hall and Jason Hartline / [et al.] — An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks / Ioannis Chatzigiannakis, Sotiris Nikoletseas and Nearchos Paspallis / [et al.] — Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry / Chris Barrett, Doug Cook and Gregory Hicks / [et al.] — Pareto Shortest Paths is Often Feasible in Practice / Matthias Muller-Hannemann and Karsten Weihe
We will be happy to hear your thoughts

Leave a reply

eBookmela
Logo
Register New Account
Reset Password
Compare items
  • Total (0)
Compare
0