MARC details
000 -LEADER |
fixed length control field |
05298nam a22005415i 4500 |
001 - CONTROL NUMBER |
control field |
978-3-540-32288-7 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
DE-He213 |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20170628034440.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 |
100301s2006 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783540322887 |
-- |
978-3-540-32288-7 |
024 7# - OTHER STANDARD IDENTIFIER |
Standard number or code |
10.1007/11672142 |
Source of number or code |
doi |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA75.5-76.95 |
072 #7 - SUBJECT CATEGORY CODE |
Subject category code |
UYZG |
Source |
bicssc |
072 #7 - SUBJECT CATEGORY CODE |
Subject category code |
COM037000 |
Source |
bisacsh |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
004.0151 |
Edition number |
23 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Durand, Bruno. |
Relator term |
editor. |
245 10 - TITLE STATEMENT |
Title |
STACS 2006 |
Medium |
[electronic resource] : |
Remainder of title |
23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006. Proceedings / |
Statement of responsibility, etc |
edited by Bruno Durand, Wolfgang Thomas. |
264 #1 - |
-- |
Berlin, Heidelberg : |
-- |
Springer Berlin Heidelberg, |
-- |
2006. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
XIX, 714 p. Also available online. |
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 |
Lecture Notes in Computer Science, |
International Standard Serial Number |
0302-9743 ; |
Volume number/sequential designation |
3884 |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
The Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the “Most General” Firing Squad Synchronization Problem. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Data structures (Computer science). |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer software. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Logic design. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computational complexity. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computation by Abstract Devices. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Algorithm Analysis and Problem Complexity. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Logics and Meanings of Programs. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Mathematical Logic and Formal Languages. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Data Structures. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Thomas, Wolfgang. |
Relator term |
editor. |
710 2# - ADDED ENTRY--CORPORATE NAME |
Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY |
Title |
Springer eBooks |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
Display text |
Printed edition: |
International Standard Book Number |
9783540323013 |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
Uniform title |
Lecture Notes in Computer Science, |
-- |
0302-9743 ; |
Volume number/sequential designation |
3884 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
<a href="http://dx.doi.org/10.1007/11672142">http://dx.doi.org/10.1007/11672142</a> |
912 ## - |
-- |
ZDB-2-SCS |
912 ## - |
-- |
ZDB-2-LNC |