Automata, Languages, and Programming (Record no. 91373)

000 -LEADER
fixed length control field 08531nam a22006615i 4500
001 - CONTROL NUMBER
control field 978-3-662-43948-7
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730182453.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 140611s2014 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783662439487
-- 978-3-662-43948-7
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-662-43948-7
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 Automata, Languages, and Programming
Medium [electronic resource] :
Remainder of title 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I /
Statement of responsibility, etc. edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2014.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2014.
300 ## - PHYSICAL DESCRIPTION
Extent XXXIV, 1090 p. 74 illus.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 8572
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs.
520 ## - SUMMARY, ETC.
Summary, etc. This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science.
9 (RLIN) 9832
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer networks .
9 (RLIN) 31572
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Information storage and retrieval systems.
9 (RLIN) 22213
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Application software.
9 (RLIN) 128251
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics.
9 (RLIN) 12873
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theory of Computation.
9 (RLIN) 128252
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Communication Networks.
9 (RLIN) 128253
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Information Storage and Retrieval.
9 (RLIN) 23927
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer and Information Systems Applications.
9 (RLIN) 128254
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics in Computer Science.
9 (RLIN) 31837
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Esparza, Javier.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 128255
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Fraigniaud, Pierre.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 128256
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Husfeldt, Thore.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 128257
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Koutsoupias, Elias.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 128258
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 128259
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783662439470
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783662439494
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 8572
9 (RLIN) 128260
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-662-43948-7">https://doi.org/10.1007/978-3-662-43948-7</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.