Skip to main content
  • Conference proceedings
  • © 2008

LATIN 2008: Theoretical Informatics

8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4957)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): LATIN: Latin American Symposium on Theoretical Informatics

Conference proceedings info: LATIN 2008.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (67 papers)

  1. Front Matter

  2. Profile of Tries

    • G. Park, H. -K Hwang, P. Nicodème, W. Szpankowski
    Pages 1-11
  3. Random 2-XORSAT at the Satisfiability Threshold

    • Hervé Daudé, Vlady Ravelomanana
    Pages 12-23
  4. On Dissemination Thresholds in Regular and Irregular Graph Classes

    • I. Rapaport, K. Suchan, I. Todinca, J. Verstraete
    Pages 24-35
  5. How to Complete a Doubling Metric

    • Anupam Gupta, Kunal Talwar
    Pages 36-47
  6. Sorting and Selection with Random Costs

    • Stanislav Angelov, Keshav Kunal, Andrew McGregor
    Pages 48-59
  7. Comparing and Aggregating Partially Resolved Trees

    • Mukul S. Bansal, Jianrong Dong, David Fernández-Baca
    Pages 72-83
  8. Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices

    • Raphaël M. Jungers, Vladimir Yu. Protasov, Vincent D. Blondel
    Pages 84-93
  9. On Stateless Multihead Automata: Hierarchies and the Emptiness Problem

    • Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
    Pages 94-105
  10. Optimal Higher Order Delaunay Triangulations of Polygons

    • Rodrigo I. Silveira, Marc van Kreveld
    Pages 133-145
  11. Coloring Geometric Range Spaces

    • Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky
    Pages 146-157
  12. Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes

    • J. Czyzowicz, S. Dobrev, T. Fevens, H. González-Aguilar, E. Kranakis, J. Opatrny et al.
    Pages 158-169
  13. Spanners of Complete k-Partite Geometric Graphs

    • Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel Smid
    Pages 170-181
  14. Minimum Cost Homomorphisms to Reflexive Digraphs

    • Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
    Pages 182-193
  15. On the Complexity of Reconstructing H-free Graphs from Their Star Systems

    • Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
    Pages 194-205
  16. Bandwidth of Bipartite Permutation Graphs in Polynomial Time

    • Pinar Heggernes, Dieter Kratsch, Daniel Meister
    Pages 216-227

Other Volumes

  1. LATIN 2008: Theoretical Informatics

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access