000			06347nam a22005655i 4500
003			DE-He213
005			20191012065707.0
007			cr nn 008mamaa
008			101221s2006 gw | s |||| 0|eng d
020	6	4	_a9783540377931 _9978-3-540-37793-1
024	8	7	_a10.1007/11821069 _2doi
050	8	4	_aLibro electrónico
072	8	7	_aUMB _2bicssc
072	8	7	_aCOM051300 _2bisacsh
082			_a005.1 _223
100	8	1	_aKrlovi, Rastislav. _eeditor. _9119647
245	9	7	_aMathematical Foundations of Computer Science 2006 _h[electronic resource] : _b31st International Symposium, MFCS 2006, Star Lesn, Slovakia, August 28-September 1, 2006. Proceedings / _cedited by Rastislav Krlovi, Pawe Urzyczyn.
001			000062142
300	6	4	_aXVI, 816 p. _bonline resource.
490	8	1	_aLecture Notes in Computer Science, _x0302-9743 ; _v4162
505	8	0	_aInvited Talks -- A Core Calculus for Scala Type Checking -- Tree Exploration with an Oracle -- Distributed Data Structures: A Survey on Informative Labeling Schemes -- From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions -- The Structure of Tractable Constraint Satisfaction Problems -- On the Representation of Kleene Algebras with Tests -- From Three Ideas in TCS to Three Applications in Bioinformatics -- Contributed Papers -- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles -- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces -- A Unified Construction of the Glushkov, Follow, and Antimirov Automata -- Algebraic Characterizations of Unitary Linear Quantum Cellular Automata -- A Polynomial Time Nilpotence Test for Galois Groups and Related Results -- The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems -- Crochemore Factorization of Sturmian and Other Infinite Words -- Equations on Partial Words -- Concrete Multiplicative Complexity of Symmetric Functions -- On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures -- Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities -- The Kleene Equality for Graphs -- On the Repetition Threshold for Large Alphabets -- Improved Parameterized Upper Bounds for Vertex Cover -- On Comparing Sums of Square Roots of Small Integers -- A Combinatorial Approach to Collapsing Words -- Optimal Linear Arrangement of Interval Graphs -- The Lempel-Ziv Complexity of Fixed Points of Morphisms -- Partially Commutative Inverse Monoids -- Learning Bayesian Networks Does Not Have to Be NP-Hard -- Lower Bounds for the Transition Complexity of NFAs -- Smart Robot Teams Exploring Sparse Trees -- k-Sets of Convex Inclusion Chains of Planar Point Sets -- Toward the Eigenvalue Power Law -- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves -- Very Sparse Leaf Languages -- On the Correlation Between Parity and Modular Polynomials -- Optimally Fast Data Gathering in Sensor Networks -- Magic Numbers in the State Hierarchy of Finite Automata -- Online Single Machine Batch Scheduling -- Machines that Can Output Empty Words -- Completeness of Global Evaluation Logic -- NOF-Multiparty Information Complexity Bounds for Pointer Jumping -- Dimension Characterizations of Complexity Classes -- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems -- An Expressive Temporal Logic for Real Time -- On Matroid Representability and Minor Problems -- Non-cooperative Tree Creation -- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners -- Reductions for Monotone Boolean Circuits -- Generalised Integer Programming Based on Logically Defined Relations -- Probabilistic Length-Reducing Automata -- Sorting Long Sequences in a Single Hop Radio Network -- Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture -- Valiants Model: From Exponential Sums to Exponential Products -- A Reachability Algorithm for General Petri Nets Based on Transition Invariants -- Approximability of Bounded Occurrence Max Ones -- Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability -- Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes -- Quantum Weakly Nondeterministic Communication Complexity -- Minimal Chordal Sense of Direction and Circulant Graphs -- Querying and Embedding Compressed Texts -- Lempel-Ziv Dimension for Lempel-Ziv Compression -- Characterizing Valiants Algebraic Complexity Classes -- The Price of Defense -- The Data Complexity of MDatalog in Basic Modal Logics -- The Complexity of Counting Functions with Easy Decision Version -- On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model -- Constrained Minimum Enclosing Circle with Center on a Query Line Segment -- Hierarchical Unambiguity -- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the ?erny Conjecture -- On Genome Evolution with Innovation.
650	8	0	_aComputer science. _9119648
650	8	0	_aData structures (Computer science). _96719
650	8	0	_aComputer software. _910118
650	8	0	_aLogic design. _9119649
650	8	0	_aComputational complexity. _98597
650	8	0	_aAlgorithms. _98598
650			_aComputer Science. _9119650
650			_aAlgorithm Analysis and Problem Complexity. _910120
650			_aComputation by Abstract Devices. _99725
650			_aDiscrete Mathematics in Computer Science. _98602
650			_aData Structures. _9119651
650			_aLogics and Meanings of Programs. _913880
650			_aAlgorithms. _98598
700	8	1	_aUrzyczyn, Pawe. _eeditor. _9119652
710	8	2	_aSpringerLink (Online service) _9119653
773	8	0	_tSpringer eBooks
776			_iPrinted edition: _z9783540377917
830	8	0	_aLecture Notes in Computer Science, _x0302-9743 ; _v4162 _9119654
856			_uhttp://dx.doi.org/10.1007/11821069 _zde clik aquí para ver el libro electrónico
264	8	1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
336	6	4	_atext _btxt _2rdacontent
337	6	4	_acomputer _bc _2rdamedia
338	6	4	_aonline resource _bcr _2rdacarrier
347	6	4	_atext file _bPDF _2rda
516	6	4	_aZDB-2-SCS
516	6	4	_aZDB-2-LNC
999			_c61872 _d61872
942			_c05