000 | 05601nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-44968-3 | ||
003 | DE-He213 | ||
005 | 20160624101955.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2000 gw | s |||| 0|eng d | ||
020 |
_a9783540449683 _9978-3-540-44968-3 |
||
024 | 7 |
_a10.1007/3-540-44968-X _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aComputing and Combinatorics _h[electronic resource] : _b6th Annual International Conference, COCOON 2000 Sydney, Australia, July 26–28, 2000 Proceedings / _cedited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000. |
|
300 |
_aXII, 478 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, _x0302-9743 ; _v1858 |
|
505 | 0 | _aInvited Talks -- Theoretical Problems Related to the Internet -- Recent Progress and Prospects for Integer Factorisation Algorithms -- Hao Wang Award Paper -- Approximating Uniform Triangular Meshes in Polygons -- The Best Young Researcher Paper -- Maximum Induced Matchings of Random Cubic Graphs -- Computational Geometry 1 -- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems -- On Local Transformation of Polygons with Visibility Properties -- Graph Drawing -- Embedding Problems for Paths with Direction Constrained Edges -- Characterization of Level Non-planar Graphs by Minimal Patterns -- Rectangular Drawings of Plane Graphs Without Designated Corners -- Computing Optimal Embeddings for Planar Graphs -- Graph Theory and Algorithms 1 -- Approximation Algorithms for Independent Sets in Map Graphs -- Hierarchical Topological Inference on Planar Disc Maps -- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs -- Complexity, Discrete Mathematics, and Number Theory -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties -- Some Results on Tries with Adaptive Branching -- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound -- Closure Properties of Real Number Classes under Limits and Computable Operators -- Graph Theory and Algorithms 2 -- A Characterization of Graphs with Vertex Cover Six -- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree -- Online Algorithms -- Online Independent Sets -- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items -- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem -- Ordinal On-Line Scheduling on Two Uniform Machines -- Parallel and Distributed Computing -- Agents, Distributed Algorithms, and Stabilization -- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications -- Efficient List Ranking Algorithms on Reconfigurable Mesh -- Computational Geometry 2 -- Tripods Do Not Pack Densely -- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line -- Tetrahedralization of Two Nested Convex Polyhedra -- Efficient Algorithms for Two-Center Problems for a Convex Polygon -- Combinatorial Optimization -- On Computation of Arbitrage for Markets with Friction -- On Some Optimization Problems in Obnoxious Facility Location -- Generating Necklaces and Strings with Forbidden Substrings -- Optimal Labelling of Point Features in the Slider Model -- Data Structures and Computational Biology -- Mappings for Conflict-Free Access of Paths in Elementary Data Structures -- Theory of Trinomial Heaps -- Polyhedral Aspects of the Consecutive Ones Problem -- The Complexity of Physical Mapping with Strict Chimerism -- Learning and Cryptography -- Logical Analysis of Data with Decomposable Structures -- Learning from Approximate Data -- A Combinatorial Approach to Asymmetric Traitor Tracing -- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs -- Automata and Quantum Computing -- One-Way Probabilistic Reversible and Quantum One-Counter Automata -- Similarity Enrichment in Image Compression through Weighted Finite Automata -- On the Power of Input-Synchronized Alternating Finite Automata -- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aData Structures. |
700 | 1 |
_aDu, Ding-Zhu. _eeditor. |
|
700 | 1 |
_aEades, Peter. _eeditor. |
|
700 | 1 |
_aEstivill-Castro, Vladimir. _eeditor. |
|
700 | 1 |
_aLin, Xuemin. _eeditor. |
|
700 | 1 |
_aSharma, Arun. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540677871 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1858 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-44968-X |
942 |
_2EBK5097 _cEBK |
||
999 |
_c34391 _d34391 |