|
|
|
|
| LEADER |
03343nam a22005655i 4500 |
| 001 |
978-3-642-15781-3 |
| 003 |
DE-He213 |
| 005 |
20151204145618.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100901s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642157813
|9 978-3-642-15781-3
|
| 024 |
7 |
|
|a 10.1007/978-3-642-15781-3
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 245 |
1 |
0 |
|a Algorithms – ESA 2010
|h [electronic resource] :
|b 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II /
|c edited by Mark de Berg, Ulrich Meyer.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
|
|
|a XVII, 245 p. 28 illus.
|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 6347
|
| 505 |
0 |
|
|a Invited Talk -- Data Structures: Time, I/Os, Entropy, Joules! -- Session 8a -- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness -- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games -- Combinatorial Auctions with Verification Are Tractable -- How to Allocate Goods in an Online Market? -- Session 8b -- Fréchet Distance of Surfaces: Some Simple Hard Cases -- Geometric Algorithms for Private-Cache Chip Multiprocessors -- Volume in General Metric Spaces -- Shortest Cut Graph of a Surface with Prescribed Vertex Set -- Session 9a -- Induced Matchings in Subcubic Planar Graphs -- Robust Matchings and Matroid Intersections -- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties -- Strongly Stable Assignment -- Session 9b -- Data Structures for Storing Small Sets in the Bitprobe Model -- On Space Efficient Two Dimensional Range Minimum Data Structures -- Pairing Heaps with Costless Meld -- Top-k Ranked Document Search in General Text Databases -- Best-Paper Session -- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time -- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings -- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computer Graphics.
|
| 650 |
2 |
4 |
|a Numeric Computing.
|
| 700 |
1 |
|
|a Berg, Mark de.
|e editor.
|
| 700 |
1 |
|
|a Meyer, Ulrich.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642157806
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6347
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-15781-3
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
