MARC details
| 000 -LEADER |
|---|
| fixed length control field |
05481cam a2200385 a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
CUTN |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20171130172748.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
060707s2006 gw 101 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
3540359044 (v. 1) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
3540359079 (v. 2) |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.131 |
| Item number |
BUG |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Bugliesi, Michele |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Automata, languages and programming : |
| Remainder of title |
33rd international colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006 : proceedings / |
| Statement of responsibility, etc |
Michele Bugliesi ... [et al.] (eds.). |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Berlin : |
| Name of publisher, distributor, etc |
Springer, |
| Date of publication, distribution, etc |
c2006. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
2 v. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Lecture notes in computer science, |
| Volume number/sequential designation |
4051 |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Contents |
Invited Lectures.- Additive Approximation for Edge-Deletion Problems (Abstract).- Graph Theory I.- Testing Graph Isomorphism in Parallel by Playing a Game.- The Spectral Gap of Random Graphs with Given Expected Degrees.- Embedding Bounded Bandwidth Graphs into ?1.- On Counting Homomorphisms to Directed Acyclic Graphs.- Quantum Computing.- Fault-Tolerance Threshold for a Distance-Three Quantum Code.- Lower Bounds on Matrix Rigidity Via a Quantum Argument.- Self-testing of Quantum Circuits.- Deterministic Extractors for Independent-Symbol Sources.- Randomness.- Gap Amplification in PCPs Using Lazy Random Walks.- Stopping Times, Metrics and Approximate Counting.- Formal Languages.- Algebraic Characterization of the Finite Power Property.- P-completeness of Cellular Automaton Rule 110.- Small Sweeping 2NFAs Are Not Closed Under Complement.- Expressive Power of Pebble Automata.- Approximation Algorithms I.- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.- Better Algorithms for Minimizing Average Flow-Time on Related Machines.- A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.- Edge Disjoint Paths in Moderately Connected Graphs.- Approximation Algorithms II.- A Robust APTAS for the Classical Bin Packing Problem.- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion.- Approximating the Orthogonal Knapsack Problem for Hypercubes.- Graph Algorithms I.- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems.- Weighted Bipartite Matching in Matrix Multiplication Time.- Algorithms I.- Optimal Resilient Sorting and Searching in the Presence of Memory Faults.- Reliable and Efficient Computational Geometry Via Controlled Perturbation.- Tight Bounds for Selfish and Greedy Load Balancing.- Complexity I.- Lower Bounds of Static Lovasz-Schrijver Calculus Proofs for Tseitin Tautologies.- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws.- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.- Data Structures and Linear Algebra.- Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.- Optimal Lower Bounds for Rank and Select Indexes.- Dynamic Interpolation Search Revisited.- Dynamic Matrix Rank.- Graphs.- Nearly Optimal Visibility Representations of Plane Graphs.- Planar Crossing Numbers of Genus g Graphs.- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover.- Tight Approximation Algorithm for Connectivity Augmentation Problems.- Complexity II.- On the Bipartite Unique Perfect Matching Problem.- Comparing Reductions to NP-Complete Sets.- Design Is as Easy as Optimization.- On the Complexity of 2D Discrete Fixed Point Problem.- Game Theory I.- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games.- Network Games with Atomic Players.- Algorithms II.- Finite-State Dimension and Real Arithmetic.- Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.- The Myriad Virtues of Wavelet Trees.- Game Theory II.- Atomic Congestion Games Among Coalitions.- Computing Equilibrium Prices in Exchange Economies with Tax Distortions.- New Constructions of Mechanisms with Verification.- Networks, Circuits and Regular Expressions.- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations.- Dynamic Routing Schemes for General Graphs.- Energy Complexity and Entropy of Threshold Circuits.- New Algorithms for Regular Expression Matching.- Fixed Parameter Complexity and Approximation Algorithms.- A Parameterized View on Matroid Optimization Problems.- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.- Length-Bounded Cuts and Flows.- Graph Algorithms II.- An Adaptive Spectral Heuristic for Partitioning Random Graphs.- Some Results on Matchgates and Holographic Algorithms.- Weighted Popular Matchings. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Machine theory |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Software engineering |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computational complexity |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Formal languages |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer programming |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Bugliesi, Michele. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
General Books |
| 111 2# - MAIN ENTRY--MEETING NAME |
|---|
| Meeting name or jurisdiction name as entry element |
International Colloquium on Automata, Languages, and Programming |
| Number of part/section/meeting |
(33rd : |
| Date of meeting |
2006 : |
| Location of meeting |
Venice, Italy) |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Lecture notes in computer science, |
| International Standard Serial Number |
0302-9743 ; |
| Volume number/sequential designation |
4051 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Form subdivision |
Congresses. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Form subdivision |
Congresses. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Form subdivision |
Congresses. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
European Association for Theoretical Computer Science. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| Uniform title |
Lecture notes in computer science, |
| Volume number/sequential designation |
4051. |
