LATIN 2004: Theoretical Informatics (Record no. 5553)

000 -LEADER
fixed length control field 07043nam a22005895i 4500
001 - CONTROL NUMBER
control field 978-3-540-24698-5
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20141014114342.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 121227s2004 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540246985
-- 978-3-540-24698-5
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/b95852
Source of number or code doi
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051300
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Farach-Colton, Martín.
Relator term editor.
245 10 - TITLE STATEMENT
Title LATIN 2004: Theoretical Informatics
Medium [electronic resource] :
Remainder of title 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004. Proceedings /
Statement of responsibility, etc edited by Martín Farach-Colton.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Berlin, Heidelberg :
Name of publisher, distributor, etc Springer Berlin Heidelberg,
Date of publication, distribution, etc 2004.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2004.
300 ## - PHYSICAL DESCRIPTION
Extent XVI, 632 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 Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 2976
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Speakers -- Analysis of Scheduling Algorithms for Proportionate Fairness -- Advances in the Regularity Method -- Fighting Spam: The Science -- The Consequences of Imre Simon’s Work in the Theory of Automata, Languages, and Semigroups -- Contributions -- Querying Priced Information in Databases: The Conjunctive Case -- Sublinear Methods for Detecting Periodic Trends in Data Streams -- An Improved Data Stream Summary: The Count-Min Sketch and Its Applications -- Rotation and Lighting Invariant Template Matching -- Computation of the Bisection Width for Random d-Regular Graphs -- Constrained Integer Partitions -- Embracing the Giant Component -- Sampling Grid Colorings with Fewer Colors -- The Complexity of Finding Top-Toda-Equivalence-Class Members -- List Partitions of Chordal Graphs -- Bidimensional Parameters and Local Treewidth -- Vertex Disjoint Paths on Clique-Width Bounded Graphs -- On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications -- Collective Tree Exploration -- Off-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations -- Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time -- A Geometric Approach to the Bisection Method -- Improved Linear Expected-Time Algorithms for Computing Maxima -- A Constant Approximation Algorithm for Sorting Buffers -- Approximation Schemes for a Class of Subset Selection Problems -- Finding k-Connected Subgraphs with Minimum Average Weight -- On the (Im)possibility of Non-interactive Correlation Distillation -- Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces -- How Expressions Can Code for Automata -- Automata for Arithmetic Meyer Sets -- Efficiently Computing the Density of Regular Languages -- Longest Repeats with a Block of Don’t Cares -- Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups -- Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank -- Expected Length of the Longest Common Subsequence for Large Alphabets -- Universal Types and Simulation of Individual Sequences -- Separating Codes: Constructions and Bounds -- Encoding Homotopy of Paths in the Plane -- A Unified Approach to Coding Labeled Trees -- Cost-Optimal Trees for Ray Shooting -- Packing Problems with Orthogonal Rotations -- Combinatorial Problems on Strings with Applications to Protein Folding -- Measurement Errors Make the Partial Digest Problem NP-Hard -- Designing Small Keyboards Is Hard -- Metric Structures in L 1: Dimension, Snowflakes, and Average Distortion -- Nash Equilibria via Polynomial Equations -- Minimum Latency Tours and the k-Traveling Repairmen Problem -- Server Scheduling in the Weighted ? p Norm -- An Improved Communication-Randomness Tradeoff -- Distributed Games and Distributed Control for Asynchronous Systems -- A Simplified and Dynamic Unified Structure -- Another View of the Gaussian Algorithm -- Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections -- Rooted Maximum Agreement Supertrees -- Complexity of Cycle Length Modularity Problems in Graphs -- Procedural Semantics for Fuzzy Disjunctive Programs on Residuated Lattices -- A Proof System and a Decision Procedure for Equality Logic -- Approximating the Expressive Power of Logics in Finite Models -- Arithmetic Circuits for Discrete Logarithms -- On the Competitiveness of AIMD-TCP within a General Network -- Gathering Non-oblivious Mobile Robots -- Bisecting and Gossiping in Circulant Graphs -- Multiple Mobile Agent Rendezvous in a Ring -- Global Synchronization in Sensornets.
520 ## - SUMMARY, ETC.
Summary, etc This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5–8, 2004. The LATIN series of symposia was launched in 1992 to foster interactions between the Latin American community and computer scientists around the world. This was the sixth event in the series, following S˜ ao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these conferences were also published by Springer-Verlag in the Lecture Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and 2286, respectively. Also, as before, we published a selection of the papers in a special issue of a prestigious journal. We received 178 submissions. Each paper was assigned to four program c- mittee members, and 59 papers were selected. This was 80% more than the previous record for the number of submissions. We feel lucky to have been able to build on the solid foundation provided by the increasingly successful previous LATINs. And we are very grateful for the tireless work of Pablo Mart´ ?nez L´ opez, the Local Arrangements Chair. Finally, we thank Springer-Verlag for publishing these proceedings in its LNCS series.
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 Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logic design.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Electronic data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Structures.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logics and Meanings of Programs.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Numeric Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
710 2# - ADDED ENTRY--CORPORATE NAME
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
Display text Printed edition:
International Standard Book Number 9783540212584
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 2976
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/b95852
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-Books

No items available.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha