LATIN 2018: Theoretical Informatics (Record no. 186478)

MARC details
000 -LEADER
fixed length control field 07393nam a22006495i 4500
001 - CONTROL NUMBER
control field 978-3-319-77404-6
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423130232.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 180312s2018 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319774046
-- 978-3-319-77404-6
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-319-77404-6
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051300
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Edition number 23
245 10 - TITLE STATEMENT
Title LATIN 2018: Theoretical Informatics
Medium [electronic resource] :
Remainder of title 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings /
Statement of responsibility, etc edited by Michael A. Bender, Martín Farach-Colton, Miguel A. Mosteiro.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2018.
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2018.
300 ## - PHYSICAL DESCRIPTION
Extent XVII, 889 p. 142 illus.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume number/sequential designation 10807
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note The graph tessellation cover number: extremal bounds, efficient algorithms and hardness -- Approximate Correlation Clustering Using Same-Cluster Queries -- Finding tight Hamilton cycles in random hypergraphs faster -- Walking Through Waypoints -- Lower Bounds for Online Matching on the Line -- On the complexity of _nding internally vertex-disjoint long directed paths -- Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets -- A Polynomial Sized Kernel for Tracking Paths Problem -- Time-Space Trade-O_s for Computing Euclidean Minimum Spanning Trees -- Approximate nearest neighbor for lp-spaces (2 < p < ) via embeddings -- The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model -- Partitioning Orthogonal Histograms into Rectangular Boxes -- Compact Self-Stabilizing Leader Election for General Networks -- Random Walks with Multiple Step Lengths -- Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set -- A tight bound for shortest augmenting paths on trees -- Approximation Algorithms for Replenishment Problems with Fixed Turnover Times -- Maximum Box Problem on Stochastic Points -- The Online Set Aggregation Problem -- Agglomerative Clustering of Growing Squares -- Fourier Entropy-Inuence Conjecture for Random Linear Threshold Functions -- Property Suffix Array with Applications -- Competitive Algorithms for Demand Response Management in Smart Grid -- An Average-Case Lower Bound against ACC^0 -- Compressed Indexing with Signature Grammars -- Combinatorics of Beacon-based Routing in Three Dimensions -- On split B1-EPG graphs -- Efficient algorithms for computing a minimal homology basis -- Shifting the Phase Transition Threshold for Random Graphs using Degree Set Constraints -- On the Biased Partial Word Collector Problem -- Constructive Ramsey Numbers For Loose Hyperpaths -- Cache Oblivious Sparse Matrix Multiplication -- Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading -- Probabilistic Analysis of Online (Class-constrained) Bin Packing and Bin Covering -- Locating the eigenvalues for graphs of small clique-width -- On the Approximation Ratio of Lempel-Ziv Parsing -- Kernelization for Maximum Happy Vertices Problem -- When is Red-Blue Nonblocker FPT -- Incremental Strong Connectivity and 2-Connectivity in Directed Graphs -- Efficient Algorithms for Listing K Disjoint st-Paths in Graphs -- Transversals of longest cycles in chordal and bounded tree-width graphs -- Majority Model on Random Regular Graphs -- Property testing for point sets on the plane -- Maximal and Convex Layers of Random Point Sets -- Plane Gossip: Approximating rumor spread in planar graphs -- Algorithms and Bounds for Very Strong Rainbow Coloring -- New Integer Linear Programming Models for the Vertex Coloring Problem -- Submodular maximization with uncertain knapsack capacity -- Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time -- Recognizinggeneralized transmission graphs of line segments and circular sectors -- A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game -- The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue -- Satisfying neighbor preferences on a circle -- Two-dimensional Knapsack for Circles -- Scheduling Parallelizable Jobs Online to Maximize Throughput -- Reactive Proximity Data Structures for Graphs -- Mutants and Residents with Different Connection Graphs in the Moran Process -- A Framework for Algorithm Stability and its Application to Kinetic Euclidean MSTs -- Rapid Mixing of k-Class Biased Permutations -- Transition Operations over Plane Trees -- Analysis of the Continued Logarithm Algorithm -- Quadratic Simulations of Merlin-Arthur Games -- On Counting Perfect Matchings in General Graphs.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer networks .
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence
General subdivision Data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer graphics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Engineering and Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial Intelligence.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Bender, Michael A.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Farach-Colton, Martín.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Mosteiro, Miguel A.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783319774039
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783319774053
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
-- 2512-2029 ;
Volume number/sequential designation 10807
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-319-77404-6">https://doi.org/10.1007/978-3-319-77404-6</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in