|
|
|
|
| LEADER |
03768nam a22005535i 4500 |
| 001 |
978-3-642-02011-7 |
| 003 |
DE-He213 |
| 005 |
20151204164842.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642020117
|9 978-3-642-02011-7
|
| 024 |
7 |
|
|a 10.1007/978-3-642-02011-7
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a UYAM
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a MAT003000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Experimental Algorithms
|h [electronic resource] :
|b 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings /
|c edited by Jan Vahrenhold.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
| 300 |
|
|
|a X, 293 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5526
|
| 505 |
0 |
|
|a Parallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algorithms -- From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering -- Experimental Comparisons of Derivative Free Optimization Algorithms -- On Computational Models for Flash Memory Devices -- Competitive Buffer Management with Stochastic Packet Arrivals -- Fast and Accurate Bounds on Linear Programs -- Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study -- Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy -- psort, Yet Another Fast Stable Sorting Software -- A Heuristic for Fair Correlation-Aware Resource Placement -- Measuring the Similarity of Geometric Graphs -- A Heuristic Strong Connectivity Algorithm for Large Graphs -- Pareto Paths with SHARC -- An Application of Self-organizing Data Structures to Compression -- Scheduling Additional Trains on Dense Corridors -- Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays -- Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games -- Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching -- Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow -- Univariate Algebraic Kernel and Application to Arrangements -- Fast Algorithm for Graph Isomorphism Testing -- Algorithms and Experiments for Clique Relaxations—Finding Maximum s-Plexes -- A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs -- Multi-level Algorithms for Modularity Clustering -- Bulk-Insertion Sort: Towards Composite Measures of Presortedness -- Computing Elevation Maxima by Searching the Gauss Sphere.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Mathematical models.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Mathematical Modeling and Industrial Mathematics.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Data Structures, Cryptology and Information Theory.
|
| 700 |
1 |
|
|a Vahrenhold, Jan.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642020100
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5526
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-02011-7
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
