000 07064nam a22005895i 4500
001 978-3-540-24698-5
003 DE-He213
005 20240423125639.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540246985
_9978-3-540-24698-5
024 7 _a10.1007/b95852
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aLATIN 2004: Theoretical Informatics
_h[electronic resource] :
_b6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings /
_cedited by Martin Farach-Colton.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aXVI, 632 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,
_x1611-3349 ;
_v2976
505 0 _aInvited 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 ofRegular 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 _aThis 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 _aComputer science.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aNumerical analysis.
650 1 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aNumerical Analysis.
700 1 _aFarach-Colton, Martin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540212584
776 0 8 _iPrinted edition:
_z9783662196519
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2976
856 4 0 _uhttps://doi.org/10.1007/b95852
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c180222
_d180222