Skip to main content
SpringerLink
Log in
Book cover

LATIN 2012: Theoretical Informatics

10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012, Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. David Fernández-Baca

    1. Department of Computer Science, Iowa State University, Ames, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast-track conference proceedings
  • State-of-the-art research

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

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

Included in the following conference series:

Conference proceedings info: LATIN 2012.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (55 papers)

  1. Front Matter

    Download chapter PDF

  2. A Generalization of the Convex Kakeya Problem

    • Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron
    Pages 1-12

  3. Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines

    • Eric Angel, Evripidis Bampis, Vincent Chau
    Pages 13-24

  4. Bichromatic 2-Center of Pairs of Points

    • Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop et al.
    Pages 25-36

  5. Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs

    • Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
    Pages 37-48

  6. A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem

    • Rafael da Ponte Barbosa, Yoshiko Wakabayashi
    Pages 49-60

  7. On the Advice Complexity of the Knapsack Problem

    • Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič, Peter Rossmanith
    Pages 61-72

  8. Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems

    • Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
    Pages 73-84

  9. On Plane Constrained Bounded-Degree Spanners

    • Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
    Pages 85-96

  10. Space-Efficient Approximation Scheme for Circular Earth Mover Distance

    • Joshua Brody, Hongyu Liang, Xiaoming Sun
    Pages 97-108

  11. Density Classification on Infinite Lattices and Trees

    • Ana Bušić, Nazim Fatès, Jean Mairesse, Irène Marcovici
    Pages 109-120

  12. Coloring Planar Homothets and Three-Dimensional Hypergraphs

    • Jean Cardinal, Matias Korman
    Pages 121-132

  13. An Equivariance Theorem with Applications to Renaming

    • Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
    Pages 133-144

  14. Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks

    • Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal
    Pages 145-156

  15. Pseudorandomness of a Random Kronecker Sequence

    • Eda Cesaratto, Brigitte Vallée
    Pages 157-171

  16. Revisiting the Cache Miss Analysis of Multithreaded Algorithms

    • Richard Cole, Vijaya Ramachandran
    Pages 172-183

  17. Parameterized Complexity of MaxSat above Average

    • Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
    Pages 184-194

  18. Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2n

    • Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk
    Pages 195-206

  19. A O(1/ε 2)n-Time Sieving Algorithm for Approximate Integer Programming

    • Daniel Dadush
    Pages 207-218

  20. Two-Dimensional Range Diameter Queries

    • Pooya Davoodi, Michiel Smid, Freek van Walderveen
    Pages 219-230
Back to top

Other volumes

  1. LATIN 2012: Theoretical Informatics

Keywords

About this book

This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety 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.

Editors and Affiliations

  • Department of Computer Science, Iowa State University, Ames, USA

    David Fernández-Baca

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation