Algorithms and Computation (Registro nro. 203403)

MARC details
000 -LÍDER
fixed length control field 06467nam a22005655i 4500
001 - NÚMERO DE CONTROL
control field u375523
003 - IDENTIFICADOR DEL NÚMERO DE CONTROL
control field SIRSI
005 - FECHA Y HORA DE LA ULTIMA TRANSACCIÓN
control field 20160812084328.0
007 - CAMPO FIJO DE DESCRIPCIÓN FIJA--INFORMACIÓN GENERAL
fixed length control field cr nn 008mamaa
008 - ELEMENTOS DE LONGITUD FIJA -- INFORMACIÓN GENERAL
fixed length control field 101203s2010 gw | s |||| 0|eng d
020 ## - NÚMERO INTERNACIONAL NORMALIZADO PARA LIBROS
International Standard Book Number 9783642175176
-- 978-3-642-17517-6
040 ## - FUENTE DE CATALOGACIÓN
Transcribing agency MX-MeUAM
050 #4 - SIGNATURA TOPOGRÁFICA DE LA BIBLIOTECA DEL CONGRESO
Classification number QA76.9.A43
082 04 - NÚMERO DE CLASIFICACIÓN DECIMAL DEWEY
Classification number 005.1
Edition number 23
100 1# - ASIENTO PRINCIPAL--NOMBRE PERSONAL
Personal name Cheong, Otfried.
Relator term editor.
245 10 - MENCIÓN DE TITULO
Title Algorithms and Computation
Medium [recurso electrónico] :
Remainder of title 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I /
Statement of responsibility, etc. edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg,
Date of production, publication, distribution, manufacture, or copyright notice 2010.
300 ## - DESCRIPCIÓN FÍSICA
Extent XVIII, 465p. 66 illus.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - MENCIÓN DE SERIE
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume/sequential designation 6506
505 0# - NOTA DE CONTENIDO
Formatted contents note Invited Talks -- Regular Labelings and Geometric Structures -- Algorithmic Aspects of Secure Computation and Communication -- Session 1A. Approximation Algorithm I -- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament -- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 -- Approximate Periodicity -- Approximating the Average Stretch Factor of Geometric Graphs -- Session 1B. Complexity I -- Satisfiability with Index Dependency -- Anonymous Fuzzy Identity-Based Encryption for Similarity Search -- Improved Randomized Algorithms for 3-SAT -- Quantum Counterfeit Coin Problems -- Session 2A. Data Structure and Algorithm I -- Priority Range Trees -- Should Static Search Trees Ever Be Unbalanced? -- Levelwise Mesh Sparsification for Shortest Path Queries -- Unit-Time Predecessor Queries on Massive Data Sets -- Session 2B. Combinatorial Optimization -- Popularity at Minimum Cost -- Structural and Complexity Aspects of Line Systems of Graphs -- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra -- Generating Trees on Multisets -- Session 3A. Graph Algorithm I -- Seidel Minor, Permutation Graphs and Combinatorial Properties -- Simultaneous Interval Graphs -- Unbalanced Graph Partitioning -- On the Intersection of Tolerance and Cocomparability Graphs -- Flows in One-Crossing-Minor-Free Graphs -- Session 3B. Complexity II -- From Holant to #CSP and Back: Dichotomy for Holant c Problems -- Computing Sparse Multiples of Polynomials -- Fractal Parallelism: Solving SAT in Bounded Space and Time -- Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity -- New Upper Bounds on the Average PTF Density of Boolean Functions -- Session 4A. Computational Geometry I -- An Optimal Algorithm for Computing Angle-Constrained Spanners -- Approximating Minimum Bending Energy Path in a Simple Corridor -- Session 4B. Graph Coloring I -- Analysis of an Iterated Local Search Algorithm for Vertex Coloring -- Bounded Max-colorings of Graphs -- Session 5A. Fixed Parameter Tractability -- Parameterized Algorithms for Boxicity -- On Tractable Cases of Target Set Selection -- Combining Two Worlds: Parameterised Approximation for Vertex Cover -- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time -- Session 5B. Optimization -- Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles -- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut -- An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems -- A Faster Algorithm for the Maximum Even Factor Problem.
520 ## - NOTA DE RESUMEN, ETC.
Summary, etc. This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15–17, 2010. Past editions have been held in Tokyo, Taipei, Nagoya,HongKong,Beijing,Cairns,Osaka,Singapore,Taejon,Chennai,Taipei, Christchurch, Vancouver, Kyoto, Hong Kong, Hainan, Kolkata, Sendai, Gold Coast, and Hawaii over the years 1990-2009. ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to the call for papers, ISAAC 2010 received 182 papers. Each submission was reviewed by at least three Program Committee members with the assistance of external referees. Since there were many high-quality papers, the Program Committee’s task was extremely di?cult. Through an extensive discussion, the Program Committee accepted 77 of the submissions to be p- sented at the conference. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications,were prepared with selected papers from ISAAC 2010. The best paper award was given to “From Holant to #CSP and Back: c DichotomyforHolant Problems”byJin-YiCai,SangxiaHuangandPinyanLu, and the best student paper award to “Satis?ability with Index Dependency” by Hongyu Liang and Jing He. Two eminent invited speakers,David Eppstein from UniversityofCalifornia,Irvine,andMattFranklinfromUniversityofCalifornia, Davis, also contributed to this volume.
596 ## -
-- 19
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer science.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer Communication Networks.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Data structures (Computer science).
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer software.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Electronic data processing.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computational complexity.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer graphics.
650 14 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer Science.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer Communication Networks.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer Graphics.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Data Structures.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Numeric Computing.
700 1# - ASIENTO SECUNDARIO - NOMBRE PERSONAL
Personal name Chwa, Kyung-Yong.
Relator term editor.
700 1# - ASIENTO SECUNDARIO - NOMBRE PERSONAL
Personal name Park, Kunsoo.
Relator term editor.
710 2# - ASIENTO SECUNDARIO - NOMBRE CORPORATIVO
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642175169
830 #0 - ASIENTO SECUNDARIO DE SERIE--TITULO UNIFORME
Uniform title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 6506
856 40 - LOCALIZACIÓN Y ACCESO ELECTRÓNICOS
Public note Libro electrónico
Uniform Resource Identifier <a href="http://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-17517-6">http://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-17517-6</a>
942 ## - TIPO DE MATERIAL (KOHA)
Koha item type Libro Electrónico
Existencias
Estado de retiro Fuente de clasificación Colección Ubicación permanente Ubicación actual Fecha de ingreso Total Checkouts Signatura topográfica Código de barras Date last seen Número de copia Tipo de material
    Colección de Libros Electrónicos Biblioteca Electrónica Biblioteca Electrónica     QA76.9 .A43 375523-2001 12/08/2016 1 Libro Electrónico

Con tecnología Koha