Advertisement

LATIN 2008: Theoretical Informatics

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

  • Editors
  • Eduardo Sany Laber
  • Claudson Bornstein
  • Loana Tito Nogueira
  • Luerbio Faria
Conference proceedings LATIN 2008

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

Table of contents

  1. Front Matter
    PDF
  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. Guided Search and a Faster Deterministic Algorithm for 3-SAT
    Dominik Scheder
    Pages 60-71
  8. Comparing and Aggregating Partially Resolved Trees
    Mukul S. Bansal, Jianrong Dong, David Fernández-Baca
    Pages 72-83
  9. 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
  10. On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
    Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
    Pages 94-105
  11. Myhill-Nerode Theorem for Recognizable Tree Series Revisited
    Andreas Maletti
    Pages 106-120
  12. The View Selection Problem for Regular Path Queries
    Sergey Afonin
    Pages 121-132
  13. Optimal Higher Order Delaunay Triangulations of Polygons
    Rodrigo I. Silveira, Marc van Kreveld
    Pages 133-145
  14. Coloring Geometric Range Spaces
    Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky
    Pages 146-157
  15. 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
  16. Spanners of Complete k-Partite Geometric Graphs
    Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel Smid
    Pages 170-181
  17. Minimum Cost Homomorphisms to Reflexive Digraphs
    Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
    Pages 182-193
  18. 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
  19. Optimization and Recognition for K5-minor Free Graphs in Linear Time
    Bruce Reed, Zhentao Li
    Pages 206-215
  20. Bandwidth of Bipartite Permutation Graphs in Polynomial Time
    Pinar Heggernes, Dieter Kratsch, Daniel Meister
    Pages 216-227
  21. The Online Transportation Problem: On the Exponential Boost of One Extra Server
    Christine Chung, Kirk Pruhs, Patchrawat Uthaisombut
    Pages 228-239
  22. Average Rate Speed Scaling
    Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs
    Pages 240-251
  23. Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
    Marcin Bienkowski, Aleksander Mądry
    Pages 252-263
  24. Maximizing the Minimum Load for Selfish Agents
    Leah Epstein, Rob van Stee
    Pages 264-275
  25. Approximate Polynomial gcd: Small Degree and Small Height Perturbations
    Joachim von zur Gathen, Igor E. Shparlinski
    Pages 276-283
  26. Pseudorandom Graphs from Elliptic Curves
    Igor E. Shparlinski
    Pages 284-292
  27. Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
    Ali Akhavi, Damien Stehlé
    Pages 293-305
  28. Sparse Approximate Solutions to Semidefinite Programs
    Elad Hazan
    Pages 306-316
  29. On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
    Gérard Cornuéjols, François Margot
    Pages 317-328
  30. A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
    Cristina G. Fernandes, Carlos E. Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi
    Pages 329-338
  31. Competitive Cost Sharing with Economies of Scale
    Martin Hoefer
    Pages 339-349
  32. Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes
    George Karakostas, Euripides Markou
    Pages 350-361
  33. Fully-Compressed Suffix Trees
    Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
    Pages 362-373
  34. Improved Dynamic Rank-Select Entropy-Bound Structures
    Rodrigo González, Gonzalo Navarro
    Pages 374-386
  35. An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
    Rina Panigrahy
    Pages 387-398
  36. List Update with Locality of Reference
    Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz
    Pages 399-410
  37. Approximating Steiner Networks with Node Weights
    Zeev Nutov
    Pages 411-422
  38. Approximating Minimum-Power Degree and Connectivity Problems
    Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko
    Pages 423-435
  39. Energy Efficient Monitoring in Sensor Networks
    Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi
    Pages 436-448
  40. Approximation Algorithms for k-Hurdle Problems
    Brian C. Dean, Adam Griffis, Adam Whitley
    Pages 449-460
  41. Approximating Crossing Minimization in Radial Layouts
    Seok-Hee Hong, Hiroshi Nagamochi
    Pages 461-472
  42. New Upper Bound on Vertex Folkman Numbers
    Andrzej Dudek, Vojtěch Rödl
    Pages 473-478
  43. Ptolemaic Graphs and Interval Graphs Are Leaf Powers
    Andreas Brandstädt, Christian Hundt
    Pages 479-491
  44. A Representation Theorem for Union-Difference Families and Application
    B. -M. Bui-Xuan, M. Habib
    Pages 492-503
  45. Algorithms to Locate Errors Using Covering Arrays
    Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens
    Pages 504-519
  46. On Injective Colourings of Chordal Graphs
    Pavol Hell, André Raspaud, Juraj Stacho
    Pages 520-530
  47. Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
    Paul Bonsma, Florian Zickfeld
    Pages 531-543
  48. On 2-Subcolourings of Chordal Graphs
    Juraj Stacho
    Pages 544-554
  49. Collective Additive Tree Spanners of Homogeneously Orderable Graphs
    Feodor F. Dragan, Chenyu Yan, Yang Xiang
    Pages 555-567
  50. The Generalized Median Stable Matchings: Finding Them Is Not That Easy
    Christine T. Cheng
    Pages 568-579

About these proceedings

Keywords

Automat algorithms automata coding theory complexity complexity theory computer science data structure database databases distributed computing formal language number theory optimization programming

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-78773-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-78772-3
  • Online ISBN 978-3-540-78773-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site