LATIN 2006: Theoretical Informatics (Record no. 183211)

MARC details
000 -LEADER
fixed length control field 06679nam a22006015i 4500
001 - CONTROL NUMBER
control field 978-3-540-32756-1
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423125929.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 100301s2006 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540327561
-- 978-3-540-32756-1
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/11682462
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title LATIN 2006: Theoretical Informatics
Medium [electronic resource] :
Remainder of title 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings /
Statement of responsibility, etc edited by José R. Correa, Alejandro Hevia, Marcos Kiwi.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2006.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2006.
300 ## - PHYSICAL DESCRIPTION
Extent XVI, 814 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume number/sequential designation 3887
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Keynotes -- Algorithmic Challenges in Web Search Engines -- RNA Molecules: Glimpses Through an Algorithmic Lens -- Squares -- Matching Based Augmentations for Approximating Connectivity Problems -- Modelling Errors and Recovery for Communication -- Lossless Data Compression Via Error Correction -- The Power and Weakness of Randomness in Computation -- Regular Contributions -- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization -- On Clusters in Markov Chains -- An Architecture for Provably Secure Computation -- Scoring Matrices That Induce Metrics on Sequences -- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams -- The Complexity of Diffuse Reflections in a Simple Polygon -- Counting Proportions of Sets: Expressive Power with Almost Order -- Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets -- Relations Among Notions of Security for Identity Based Encryption Schemes -- Optimally Adaptive Integration of Univariate Lipschitz Functions -- Classical Computability and Fuzzy Turing Machines -- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees -- An Algorithm for a Generalized Maximum Subsequence Problem -- Random Bichromatic Matchings -- Eliminating Cycles in the Discrete Torus -- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions -- Pattern Matching Statistics on Correlated Sources -- Robust Model-Checking of Linear-Time Properties in Timed Automata -- The Computational Complexity of the Parallel Knock-Out Problem -- Reconfigurations in Graphs and Grids -- -Varieties, Actions and Wreath Product -- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges -- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise -- Oblivious Medians Via Online Bidding -- Efficient Computation of the Relative Entropy of Probabilistic Automata -- A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences -- De Dictionariis Dynamicis Pauco Spatio Utentibus -- Customized Newspaper Broadcast: Data Broadcast with Dependencies -- On Minimum k-Modal Partitions of Permutations -- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm -- Maximizing Throughput in Queueing Networks with Limited Flexibility -- Network Flow Spanners -- Finding All Minimal Infrequent Multi-dimensional Intervals -- Cut Problems in Graphs with a Budget Constraint -- Lower Bounds for Clear Transmissions in Radio Networks -- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata -- Lower Bounds for Geometric Diameter Problems -- Connected Treewidth and Connected Graph Searching -- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs -- The Committee Decision Problem -- Common Deadline Lazy Bureaucrat Scheduling Revisited -- Approximate Sorting -- Stochastic Covering and Adaptivity -- Algorithms for Modular Counting of Roots of Multivariate Polynomials -- Hardness Amplification Via Space-Efficient Direct Products -- The Online Freeze-Tag Problem -- I/O-Efficient Algorithms on Near-Planar Graphs -- Minimal Split Completions of Graphs -- Design and Analysis of Online Batching Systems -- Competitive Analysis of Scheduling Algorithms for Aggregated Links -- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains -- On Sampling in Higher-Dimensional Peer-to-Peer Systems -- Mobile Agent Rendezvous in a Synchronous Torus -- Randomly Colouring Graphs with Girth Five and Large Maximum Degree -- Packing Dicycle Covers in Planar Graphs with No K 5–e Minor -- SharpEstimates for the Main Parameters of the Euclid Algorithm -- Position-Restricted Substring Searching -- Rectilinear Approximation of a Set of Points in the Plane -- The Branch-Width of Circular-Arc Graphs -- Minimal Eulerian Circuit in a Labeled Digraph -- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization -- RISOTTO: Fast Extraction of Motifs with Mismatches -- Minimum Cost Source Location Problems with Flow Requirements -- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms -- Constructions of Approximately Mutually Unbiased Bases -- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.
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 Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence
General subdivision Data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete mathematics.
650 14 - 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 Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science Logic and Foundations of Programming.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Correa, José R.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hevia, Alejandro.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Kiwi, Marcos.
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 9783540327554
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540821298
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
-- 2512-2029 ;
Volume number/sequential designation 3887
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/11682462">https://doi.org/10.1007/11682462</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in