000 06560nam a22006015i 4500
001 978-3-662-49529-2
003 DE-He213
005 20240730181444.0
007 cr nn 008mamaa
008 160321s2016 gw | s |||| 0|eng d
020 _a9783662495292
_9978-3-662-49529-2
024 7 _a10.1007/978-3-662-49529-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aLATIN 2016: Theoretical Informatics
_h[electronic resource] :
_b12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings /
_cedited by Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez.
250 _a1st ed. 2016.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aXXVI, 714 p. 114 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9644
505 0 _aReversible Figures and Solids -- Simplicity is in Vogue (again) -- Subgame Perfect Equilibrium: Computation and Efficiency -- Buying Stuff Online -- Data Crowdsourcing: Is It for Real -- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion -- A Middle Curve Based on Discrete Fréchet Distance -- Comparison-Based FIFO Buffer Management in QoS Switches -- Scheduling on Power-Heterogeneous Processors -- Period Recovery over the Hamming and Edit Distances -- Chasing Convex Bodies and Functions -- Parameterized Lower Bounds and Dichotomy Results for the NP-Completeness of H-Free Edge Modification Problems -- Parameterized Complexity of Red Blue Set Cover for lines -- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons -- On Mobile Agent Verifiable Problems -- Computing Maximal Layers Of Points In Ef(n) -- On the Total Number of Bends for Planar Octilinear Drawings -- Bidirectional BWT-Based De Bruijn Graphs -- The Read/Write Protocol Complex is Collapsible -- The I/O Complexity of Computing Prime Tables.-Increasing Diamonds -- Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs -- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-Vertex Cover in Bipartite Graphs -- Improved Spanning Ratio for Low Degree Spanners -- Constructing Consistent Digital Line Segments -- Faster Information Gathering in Ad-Hoc Radio Tree Networks -- Stabbing circles for Sets of Segments in the Plane -- Faster Algorithms to Enumerate Hypergraph Transversals -- Listing Acyclic Orientations of Graphs with Single and Multiple Sources -- Linear-Time Sequence Comparison Using Minimal Absent Words -- The Grandmama de Bruijn Sequence for Binary Strings -- Compressing Bounded Degree Graphs -- Random Partial Match Queries in Quad-K-d Trees -- From Discrepancy to Majority -- On the Planar Split Thickness of Graphs -- A Bounded-Risk Mechanism for the Kidney Exchange Game -- Tight Approximations of Degeneracy inLarge Graphs -- Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center -- Bundled Crossings in Embedded Graphs -- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering -- Deterministic Sparse Suffix Sorting on Rewritable Texts -- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Ordering -- Unshuffling Permutations -- Generating Random Spanning Trees via Fast Matrix Multiplication -- Routing in Unit Disk Graphs -- Graph Drawings with One Bend and Few Slopes -- Edge-Editing to a Dense and a Sparse Graph Class -- Containment and Evasion in Stochastic Point Data -- Tree Compression Using String Grammars -- Trees and Languages with Periodic Signature -- Rank Reduction of Directed Graphs by Vertex and Edge Deletions -- New Deterministic Algorithms for Solving Parity Games -- Computing a Geodesic Two-Center of Points in a Simple Polygon -- Simple Approximation Algorithms for Balanced MAX 2SAT -- A Parameterized Algorithm for Mixed-Cut -- (k; n - k)-MAX-CUT: An O*(2p)-Time Algorithm and a Polynomial Kernel -- Independent set of convex polygons: from nƐ to 1 + Ɛ via shrinking.
520 _aThis book constitutes the refereed proceedings of the 12th Latin American Symposium on Theoretical Informatics, LATIN 2016, held in Ensenada, Mexico, in April 2016. The 52 papers presented together with 5 abstracts were carefully reviewed and selected from 131 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on 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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aTheory of Computation.
_9124901
650 2 4 _aData Science.
_934092
700 1 _aKranakis, Evangelos.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_930615
700 1 _aNavarro, Gonzalo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9124902
700 1 _aChávez, Edgar.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9124903
710 2 _aSpringerLink (Online service)
_9124904
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662495285
776 0 8 _iPrinted edition:
_z9783662495308
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9644
_9124905
856 4 0 _uhttps://doi.org/10.1007/978-3-662-49529-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90906
_d90906