LATIN 2004 : theoretical informatics : 6th Latin American symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings
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 aroun...
Spremljeno u:
| Autor kompanije: | |
|---|---|
| Daljnji autori: | |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
2976 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Latin 2004, theoretical informatics, 6th Latin American symposium, Buenos Aires, Argentina, April 5-8, 2004, proceedings, Martin Farach-Colton (ed.), Berlin, Springer, 2004, 1 vol. (XV-626 p.), Lecture notes in computer science, 3-540-21258-2 • LATIN 2004: Theoretical Informatics, Texte imprimé, 9783662196519 |
Sadržaj:
- 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 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.