Latin 2008 - Theoretical Informatics : 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings
by Laber, Eduardo Sany; Bornstein, Claudson; Nogueira, Loana Tito; Faria, LuerbioFormat: Paperback
Pub. Date: 2008-05-20
Publisher(s): Springer Verlag
Other versions by this Author
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
List Price: $187.95
Rent Textbook
Select for Price
Rent Digital
$131.82
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This book constitutes the refereed proceedings of the 8th International Latin American Symposium on Theoretical Informatics, LATIN 2008, held in Búzios, Brazil, in April 2008. The 66 revised full papers presented together with the extended abstract of 1 invited paper were carefully reviewed and selected from 242 submissions. The papers address a veriety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.
Table of Contents
| Profile of Tries | p. 1 |
| Random 2-XORSAT at the Satisfiability Threshold | p. 12 |
| On Disseminatiou Thresholds in Regular and Irregular Graph Classes | p. 24 |
| How to Complete a Doubling Metric | p. 36 |
| Sorting and Selection with Random Costs | p. 48 |
| Guided Search and a Faster Deterministic Algorithm for 3-SAT | p. 60 |
| Comparing and Aggregating Partially Resolved Trees | p. 72 |
| Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices | p. 84 |
| On Stateless Multihead Automata: Hierarchies and the Emptiness Problem | p. 94 |
| Myhill-Nerode Theorem for Recognizable Tree Series Revisited | p. 106 |
| The View Selection Problem for Regular Path Queries | p. 121 |
| Optimal Higher Order Delaunay Triangulations of Polygons | p. 133 |
| Coloring Geometric Range Spaces | p. 146 |
| Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes | p. 158 |
| Spanners of Complete k-Partite Geometric Graphs | p. 170 |
| Minimum Cost Homomorphisms to Reflexive Digraphs | p. 182 |
| On the Complexity of Reconstructing H-free Graphs from Their Star Systems | p. 194 |
| Optimization and Recognition for K[subscript 5]-minor Free Graphs in Linear Tillie | p. 206 |
| Bandwidth of Bipartite Permutation Graphs in Polynomial Time | p. 210 |
| The Online Transportation Problem: On the Exponential Boost of One Extra Server | p. 228 |
| Average Rate Speed Scaling | p. 240 |
| Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers | p. 252 |
| Maximizing the Minimum Load for Selfish Agents | p. 264 |
| Approximate Polynomial gcd: Small Degree and Small Height Perturbations | p. 270 |
| Pseudorandom Graphs from Elliptic Curves | p. 284 |
| Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) | p. 293 |
| Sparse Approximate Solutions to Semidefinite Programs | p. 306 |
| On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints | p. 317 |
| A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant | p. 329 |
| Competitive Cost Sharing with Economics of Scale | p. 339 |
| Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes | p. 350 |
| Fully-Compressed Suffix Trees | p. 362 |
| Improved Dynamic Rank-Select Entropy-Bound Structures | p. 374 |
| An Improved Algorithm Finding Nearest Neighbor Using Kd-trees | p. 387 |
| List Updatc with Locality of Reference | p. 399 |
| Approximating Steiner Networks with Node Weights | p. 411 |
| Approximating Minimum-Power Degree and Connectivity Problems | p. 423 |
| Energy Efficient Monitoring in Sensor Networks | p. 436 |
| Approximation Algorithms for k-Hmdle Problems | p. 449 |
| Approximating Crossing Minimization in Radial Layouts | p. 461 |
| New Upper Bound on Vertex Folkman Numbers | p. 473 |
| Ptolemaic: Graphs and Interval Graphs Are Leaf Powers | p. 479 |
| A Representation Theorem for Union-Difference Families and Application (Extended Abstract) | p. 492 |
| Algorithms to Locate Errors Using Covering Arrays | p. 504 |
| On Injective Colourings of Chordal Graphs | p. 520 |
| Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms | p. 531 |
| On 2-Subcolourings of Chordal Graphs | p. 544 |
| Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Extended Abstract) | p. 555 |
| The Generalized Median Stable Matchings: Finding Them Is Not That Easy | p. 568 |
| Stateless Near Optimal Flow Control with Poly-logarithmic Convergence | p. 580 |
| The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences | p. 593 |
| Randomized Rendez-Vous with Limited Memory | p. 605 |
| Origami Embedding of Piecewise-Linear Two-Manifolds | p. 617 |
| Simplifying 3D Polygonal Chains Under the Discrete Frechet Distance | p. 630 |
| Weighted Rectilinear Approximation of Points in the Plane | p. 642 |
| Paths with no Small Angles | p. 654 |
| Simpler Constant-Seed Condensers | p. 664 |
| Parallel Repetition of the Odd Cycle Game | p. 676 |
| I/O-Efficient Point Location in a Set of Rectangles | p. 687 |
| Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream | p. 699 |
| Fixed-Parameter Algorithms for Cluster Vertex Deletion | p. 711 |
| Paths and Trails in Edge-Colored Graphs | p. 723 |
| Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs | p. 736 |
| Domination in Geometric Intersection Graphs | p. 747 |
| An Etficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups | p. 759 |
| Quantum Property Testing of Croup Solvability | p. 772 |
| Solving NP-Complete Problems with Quantum Search | p. 784 |
| Author Index | p. 793 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.