Skip to main content
SpringerLink
Log in
Book cover

LATIN 2018: Theoretical Informatics

13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Michael A. Bender

    1. Stony Brook University, Stony Brook, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Martín Farach-Colton

    1. Rutgers University, New Brunswick, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Miguel A. Mosteiro

    1. Pace University, New York, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: LATIN 2018.

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 EPUB and 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 (63 papers)

  1. Agglomerative Clustering of Growing Squares

    • Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek
    Pages 260-274

  2. Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions

    • Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh
    Pages 275-289

  3. Property Suffix Array with Applications

    • Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
    Pages 290-302

  4. Competitive Algorithms for Demand Response Management in Smart Grid

    • Vincent Chau, Shengzhong Feng, Nguyen Kim Thang
    Pages 303-316

  5. An Average-Case Lower Bound Against \(\mathsf {ACC}^0\)

    • Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam
    Pages 317-330

  6. Compressed Indexing with Signature Grammars

    • Anders Roy Christiansen, Mikko Berggren Ettienne
    Pages 331-345

  7. Combinatorics of Beacon-Based Routing in Three Dimensions

    • Jonas Cleve, Wolfgang Mulzer
    Pages 346-360

  8. On Split \(B_1\)-EPG Graphs

    • Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl
    Pages 361-375

  9. Efficient Algorithms for Computing a Minimal Homology Basis

    • Tamal K. Dey, Tianqi Li, Yusu Wang
    Pages 376-398

  10. Shifting the Phase Transition Threshold for Random Graphs Using Degree Set Constraints

    • Sergey Dovgal, Vlady Ravelomanana
    Pages 399-412

  11. On the Biased Partial Word Collector Problem

    • Philippe Duchon, Cyril Nicaud
    Pages 413-426

  12. Constructive Ramsey Numbers for Loose Hyperpaths

    • Andrzej Dudek, Andrzej Ruciński
    Pages 427-436

  13. Cache Oblivious Sparse Matrix Multiplication

    • Matteo Dusefante, Riko Jacob
    Pages 437-447

  14. Don’t Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading

    • Sándor P. Fekete, Sven von Höveling, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Arne Schmidt et al.
    Pages 448-460

  15. Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering

    • Carsten Fischer, Heiko Röglin
    Pages 461-474

  16. Locating the Eigenvalues for Graphs of Small Clique-Width

    • Martin Fürer, Carlos Hoppen, David P. Jacobs, Vilmar Trevisan
    Pages 475-489

  17. On the Approximation Ratio of Lempel-Ziv Parsing

    • Travis Gagie, Gonzalo Navarro, Nicola Prezza
    Pages 490-503

  18. Kernelization for Maximum Happy Vertices Problem

    • Hang Gao, Wenyu Gao
    Pages 504-514

  19. When is Red-Blue Nonblocker Fixed-Parameter Tractable?

    • Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele
    Pages 515-528

  20. Incremental Strong Connectivity and 2-Connectivity in Directed Graphs

    • Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
    Pages 529-543
Back to top

Other volumes

  1. LATIN 2018: Theoretical Informatics

Keywords

About this book

This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

Editors and Affiliations

  • Stony Brook University, Stony Brook, USA

    Michael A. Bender

  • Rutgers University, New Brunswick, USA

    Martín Farach-Colton

  • Pace University, New York, USA

    Miguel A. Mosteiro

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation