Automata, Languages and Programming (Record no. 93089)

000 -LEADER
fixed length control field 07073nam a22006375i 4500
001 - CONTROL NUMBER
control field 978-3-642-02927-1
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730190115.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 100301s2009 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642029271
-- 978-3-642-02927-1
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-02927-1
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.758
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051230
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
245 10 - TITLE STATEMENT
Title Automata, Languages and Programming
Medium [electronic resource] :
Remainder of title 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I /
Statement of responsibility, etc. edited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2009.
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 2009.
300 ## - PHYSICAL DESCRIPTION
Extent XXII, 789 p.
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 5555
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Lectures -- Assigning Papers to Referees -- Algorithmic Game Theory: A Snapshot -- Contributed Papers -- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs -- Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems -- Sorting and Selection with Imprecise Comparisons -- Fast FAST -- Bounds on the Size of Small Depth Circuits for Approximating Majority -- Counting Subgraphs via Homomorphisms -- External Sampling -- Functional Monitoring without Monotonicity -- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results -- Towards a Study of Low-Complexity Graphs -- Decidability of Conjugacy of Tree-Shifts of Finite Type -- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule -- Competitive Analysis of Aggregate Max in Windowed Streaming -- Faster Regular Expression Matching -- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem -- Unconditional Lower Bounds against Advice -- Approximating Decision Trees with Multiway Branches -- Annotations in Data Streams -- The Tile Complexity of Linear Assemblies -- A Graph Reduction Step Preserving Element-Connectivity and Applications -- Approximating Matches Made in Heaven -- Strong and Pareto Price of Anarchy in Congestion Games -- A Better Algorithm for Random k-SAT -- Exact and Approximate Bandwidth -- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs -- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs -- On Cartesian Trees and Range Minimum Queries -- Applications of a Splitting Trick -- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness -- Incompressibility through Colors and IDs -- Partition Arguments in Multiparty Communication Complexity -- High Complexity Tilings with SparseErrors -- Tight Bounds for the Cover Time of Multiple Random Walks -- Online Computation with Advice -- Dynamic Succinct Ordered Trees -- Universal Succinct Representations of Trees? -- Distortion Is Fixed Parameter Tractable -- Towards Optimal Range Medians -- B-Treaps: A Uniquely Represented Alternative to B-Trees -- Testing Fourier Dimensionality and Sparsity -- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams -- Wireless Communication Is in APX -- The Ehrenfeucht-Silberger Problem -- Applications of Effective Probability Theory to Martin-Löf Randomness -- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables -- Popular Mixed Matchings -- Factoring Groups Efficiently -- On Finding Dense Subgraphs -- Learning Halfspaces with Malicious Noise -- General Scheme for Perfect Quantum Network Coding with Free Classical Communication -- Greedy -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost -- Limits and Applications of Group Algebras for Parameterized Problems -- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy -- Improved Bounds for Flow Shop Scheduling -- A 3/2-Approximation Algorithm for General Stable Marriage -- Limiting Negations in Formulas -- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems -- Superhighness and Strong Jump Traceability -- Amortized Communication Complexity of Distributions -- The Number of Symbol Comparisons in QuickSort and QuickSelect -- Computing the Girth of a Planar Graph in O(n logn) Time -- Elimination Graphs.
520 ## - SUMMARY, ETC.
Summary, etc. The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009. The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 5555 contains 62 contributions of track A selected from 223 submissions as well as 2 invited lectures. This two-volume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Software engineering.
9 (RLIN) 4138
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 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 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Software Engineering.
9 (RLIN) 4138
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theory of Computation.
9 (RLIN) 141299
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics in Computer Science.
9 (RLIN) 31837
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics of Computing.
9 (RLIN) 31875
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Albers, Susanne.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 141300
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Marchetti-Spaccamela, Alberto.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 141301
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Matias, Yossi.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 141302
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Nikoletseas, Sotiris.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 141303
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Thomas, Wolfgang.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 141304
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 141305
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642029264
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642029288
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 5555
9 (RLIN) 141306
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-02927-1">https://doi.org/10.1007/978-3-642-02927-1</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.