Experimental Algorithmics [[electronic resource] ] : From Algorithm Design to Robust and Efficient Software / / edited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XVIII, 286 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer science
Data structures (Computer science) Algorithms Numerical analysis Computer science—Mathematics Computer Science, general Data Structures Algorithm Analysis and Problem Complexity Numeric Computing Discrete Mathematics in Computer Science |
ISBN | 3-540-36383-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithm Engineering for Parallel Computation -- Visualization in Algorithm Engineering: Tools and Techniques -- Parameterized Complexity: The Main Ideas and Connections to Practical Computing -- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation -- Using Finite Experiments to Study Asymptotic Performance -- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms -- Algorithms and Heuristics in VLSI Design -- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics -- Presenting Data from Experiments in Algorithmics -- Distributed Algorithm Engineering -- Implementations and Experimental Studies of Dynamic Graph Algorithms. |
Record Nr. | UNISA-996465746003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Experimental Algorithmics : From Algorithm Design to Robust and Efficient Software / / edited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XVIII, 286 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer science
Data structures (Computer science) Algorithms Numerical analysis Computer science—Mathematics Computer Science, general Data Structures Algorithm Analysis and Problem Complexity Numeric Computing Discrete Mathematics in Computer Science |
ISBN | 3-540-36383-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithm Engineering for Parallel Computation -- Visualization in Algorithm Engineering: Tools and Techniques -- Parameterized Complexity: The Main Ideas and Connections to Practical Computing -- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation -- Using Finite Experiments to Study Asymptotic Performance -- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms -- Algorithms and Heuristics in VLSI Design -- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics -- Presenting Data from Experiments in Algorithmics -- Distributed Algorithm Engineering -- Implementations and Experimental Studies of Dynamic Graph Algorithms. |
Record Nr. | UNINA-9910143889403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|