| 000 | 05574nam a22006615i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-68530-2 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132515.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1998 gw | s |||| 0|eng d | ||
| 020 |
_a9783540685302 _9978-3-540-68530-2 |
||
| 024 | 7 |
_a10.1007/3-540-68530-8 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aAlgorithms - ESA '98 _h[electronic resource] : _b6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings / _cedited by Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci. |
| 250 | _a1st ed. 1998. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1998. |
|
| 300 |
_aXII, 524 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1461 |
|
| 505 | 0 | _aInvited Lectures -- External Memory Algorithms -- Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper) -- Data Structures -- Car-Pooling as a Data Structuring Device: The Soft Heap -- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property -- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures -- Strings and Biology -- Augmenting Suffix Trees, with Applications -- Longest Common Subsequence from Fragments via Sparse Dynamic Programming -- Computing the Edit-Distance Between Unrooted Ordered Trees -- Analogs and Duals of the MAST Problem for Sequences and Trees -- Numerical Algorithms -- Complexity Estimates Depending on Condition and Round-Off Error -- Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting -- Fast Algorithms for Linear Algebra Modulo N -- A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers -- Geometry -- Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time -- A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract) -- Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result -- Two-Center Problems for a Convex Polygon (Extended Abstract) -- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice -- Randomized and On-Line Algorithms -- A Fast Random Greedy Algorithm for the Component Commonality Problem -- Maximizing Job Completions Online -- A Randomized Algorithm for Two Servers on the Line (Extended Abstract) -- Parallel and Distributed Algorithms I -- On Nonblocking Properties of the Beneš Network -- Adaptability and the Usefulness of Hints (Extended Abstract) -- Fault-Tolerant Broadcasting in Radio Networks (ExtendedAbstract) -- New Bounds for Oblivious Mesh Routing -- Evaluating Server-Assisted Cache Replacement in the Web -- Graph Algorithms -- Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights -- A Functional Approach to External Graph Algorithms -- Minimal Triangulations for Graphs with “Few” Minimal Separators -- Finding an Optimal Path without Growing the Tree -- An Experimental Study of Dynamic Algorithms for Directed Graphs -- Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme -- Parallel and Distributed Algorithms II -- ?-Stepping : A Parallel Single Source Shortest Path Algorithm -- Improved Deterministic Parallel Padded Sorting -- Analyzing an Infinite Parallel Job Allocation Process -- Nearest Neighbor Load Balancing on Graphs -- Optimization -- 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves -- Moving-Target TSP and Related Problems -- Fitting Points on the Real Line and Its Application to RH Mapping -- Approximate Coloring of Uniform Hypergraphs (Extended Abstract) -- Techniques for Scheduling with Rejection -- Computer-Aided Way to Prove Theorems in Scheduling. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aComputer networks . | |
| 650 | 0 |
_aArtificial intelligence _xData processing. |
|
| 650 | 0 | _aProbabilities. | |
| 650 | 1 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aData Science. |
| 650 | 2 | 4 | _aProbability Theory. |
| 700 | 1 |
_aBilardi, Gianfranco. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aItaliano, Giuseppe F. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aPietracaprina, Andrea. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aPucci, Geppino. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540648482 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662187746 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1461 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-68530-8 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c188511 _d188511 |
||