Algorithms and Computation (Record no. 188548)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06425nam a22006255i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-36136-7 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423132517.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 121227s2002 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540361367 |
| -- | 978-3-540-36136-7 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/3-540-36136-7 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | T57-57.97 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | PBW |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | MAT003000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | PBW |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 519 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Algorithms and Computation |
| Medium | [electronic resource] : |
| Remainder of title | 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings / |
| Statement of responsibility, etc | edited by Prosenjit K. Bose, Pat Morin. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2002. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2002. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XIV, 662 p. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| International Standard Serial Number | 1611-3349 ; |
| Volume number/sequential designation | 2518 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Session 1A -- Biased Skip Lists -- Space-Efficient Data Structures for Flexible Text Retrieval Systems -- Key Independent Optimality -- On the Comparison-Addition Complexity of All-Pairs Shortest Paths -- On the Comparison-Addition Complexity of All-Pairs Shortest Paths -- On the Clique-Width of Graphs in Hereditary Classes -- On the Clique-Width of Graphs in Hereditary Classes -- The Probability of a Rendezvous Is Minimal in Complete Graphs -- The Probability of a Rendezvous Is Minimal in Complete Graphs -- On the Minimum Volume of a Perturbed Unit Cube -- On the Minimum Volume of a Perturbed Unit Cube -- Non-Delaunay-Based Curve Reconstruction -- Non-Delaunay-Based Curve Reconstruction -- Cutting a Country for Smallest Square Fit -- Cutting a Country for Smallest Square Fit -- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter -- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter -- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement -- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement -- Some Remarks on the L-Conjecture -- Some Remarks on the L-Conjecture -- Session 3A -- A Framework for Network Reliability Problems on Graphs of Bounded Treewidth -- A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation -- Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems -- Session 3B -- An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering -- Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint -- A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage -- Session 4A -- Queaps -- Funnel Heap-A Cache Oblivious Priority Queue -- Characterizing History Independent Data Structures -- Session4B -- Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set -- An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover -- Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs -- Session 5A -- Casting a Polyhedron with Directional Uncertainty -- Hierarchy of Surface Models and Irreducible Triangulation -- Algorithms and Complexity for Tetrahedralization Detections -- Session 5B -- Average-Case Communication-Optimal Parallel Parenthesis Matching -- Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks -- New Results for Energy-Efficient Broadcasting in Wireless Networks -- Session 6A -- An Improved Algorithm for the Minimum Manhattan Network Problem -- Approximate Distance Oracles Revisited -- Flat-State Connectivity of Linkages under Dihedral Motions -- Session 6B -- Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms -- Scheduling of Independent Dedicated Multiprocessor Tasks -- On the Approximability of Multiprocessor Task Scheduling Problems -- Session 7A -- Bounded-Degree Independent Sets in Planar Graphs -- Minimum Edge Ranking Spanning Trees of Threshold Graphs -- File Transfer Tree Problems -- Session 7B -- Approximation Algorithms for Some Parameterized Counting Problems -- Approximating MIN k-SAT -- Average-Case Competitive Analyses for Ski-Rental Problems -- Session 8A -- On the Clique Problem in Intersection Graphs of Ellipses -- A Geometric Approach to Boolean Matrix Multiplication -- The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing -- Session 8B -- Improved Distance Oracles for Avoiding Link-Failure -- Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks -- A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm -- Session 9A -- Crossing Minimization for Symmetries -- Simultaneous Embedding of a Planar Graph and Its Dual on the Grid -- Meaningful Information -- Session 9B -- Optimal Clearing of Supply/Demand Curves -- Partitioning Trees of Supply and Demand -- Maximizing a Voronoi Region: The Convex Case -- Invited Talks -- Random Tries -- Expected Acceptance Counts for Finite Automata with Almost Uniform Input -- Monotone Drawings of Planar Graphs. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer programming. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer networks . |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Artificial intelligence |
| General subdivision | Data processing. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Applications of Mathematics. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Programming Techniques. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Communication Networks. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data Science. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Bose, Prosenjit K. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Morin, Pat. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540001423 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783662207987 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 1611-3349 ; |
| Volume number/sequential designation | 2518 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/3-540-36136-7">https://doi.org/10.1007/3-540-36136-7</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 912 ## - | |
| -- | ZDB-2-BAE |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.