06996nam a22005775i 4500001001800000003000900018005001700027007001500044008004100059020003700100024002400137041000800161050001500169072001600184072002300200082001400223100003800237245018700275260006100462264006100523300003400584336002600618337002600644338003600670347002400706490005800730505370100788520129604489650002205785650004005807650002305847650001805870650003205888650003005920650002205950650004705972650002106019650003706040650003706077650002306114650004606137710003406183773002006217776003606237830005806273856003706331912001406368912001406382942000706396999001506403978-3-540-24698-5DE-He21320141014114342.0cr nn 008mamaa121227s2004 gw | s |||| 0|eng d a97835402469859978-3-540-24698-57 a10.1007/b958522doi aeng 4aQA76.9.A43 7aUMB2bicssc 7aCOM0513002bisacsh04a005.12231 aFarach-Colton, Martín.eeditor.10aLATIN 2004: Theoretical Informaticsh[electronic resource] :b6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004. Proceedings /cedited by Martín Farach-Colton. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. aXVI, 632 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v29760 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 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. 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. 0aComputer science. 0aData structures (Computer science). 0aComputer software. 0aLogic design. 0aElectronic data processing. 0aComputational complexity.14aComputer Science.24aAlgorithm Analysis and Problem Complexity.24aData Structures.24aComputation by Abstract Devices.24aLogics and Meanings of Programs.24aNumeric Computing.24aDiscrete Mathematics in Computer Science.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540212584 0aLecture Notes in Computer Science,x0302-9743 ;v297640uhttp://dx.doi.org/10.1007/b95852 aZDB-2-SCS aZDB-2-LNC cEB c5553d5553