000 | 03965nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-642-02011-7 | ||
003 | DE-He213 | ||
005 | 20240423125552.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2009 gw | s |||| 0|eng d | ||
020 |
_a9783642020117 _9978-3-642-02011-7 |
||
024 | 7 |
_a10.1007/978-3-642-02011-7 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aExperimental Algorithms _h[electronic resource] : _b8th International Symposium SEA 2009, Dortmund, Germany, June 4-6, 2009, Proceedings / _cedited by Jan Vahrenhold. |
250 | _a1st ed. 2009. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009. |
|
300 |
_aX, 293 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5526 |
|
505 | 0 | _aParallelism 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 |
_aComputer science _xMathematics. |
|
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 0 | _aMathematical models. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 1 | 4 | _aMathematics of Computing. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aMathematical Modeling and Industrial Mathematics. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aData Structures and Information Theory. |
700 | 1 |
_aVahrenhold, Jan. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642020100 |
776 | 0 | 8 |
_iPrinted edition: _z9783642020124 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5526 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-02011-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c179389 _d179389 |