000 06404nam a22006015i 4500
001 978-3-540-47516-3
003 DE-He213
005 20160624102023.0
007 cr nn 008mamaa
008 121227s1991 gw | s |||| 0|eng d
020 _a9783540475163
_9978-3-540-47516-3
024 7 _a10.1007/3-540-54233-7
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aAutomata, Languages and Programming
_h[electronic resource] :
_b18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings /
_cedited by Javier Leach Albert, Burkhard Monien, Mario Rodríguez Artalejo.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1991.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1991.
300 _aXII, 768 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v510
505 0 _aOn the semantics of logic programs -- Logic programming with recurrence domains -- Extensional embedding of a strongly stable model of PCF -- Uniform ideals and strictness analysis -- Logical and computational aspects of programming with sets/bags/lists -- Safety for branching time semantics -- Program composition and modular verification -- Model-checking for probabilistic real-time systems -- Computing behavioural relations, logically -- The power of reconfiguration -- General resolution of tseitin formulas is hard -- Program checkers for probability generation -- Running time to recognize nonregular languages by 2-way probabilistic automata -- Statistics on random trees -- The expressive power of implicit specifications -- CCS + time = an interleaving model for real time systems -- On confluent semi-commutations — Decidability and complexity results -- Lazard's factorizations of free partially commutative monoids -- A Kleene theorem for infinite trace languages -- Canonical sets of horn clauses -- A specialized completion procedure for monadic string-rewriting systems presenting groups -- A confluent reduction for the ?-calculus with surjective pairing and terminal object -- Provably recursive programs and program extraction -- Efficient algorithms for path problems with general cost criteria -- Computing shortest paths and distances in planar graphs -- Maintaining biconnected components of dynamic planar graphs -- Efficient maximal cubic graph cuts -- Structural parallel algorithmics -- Improving known solutions is hard -- Collapsing degrees via strong computation -- Fast parallel generation of random permutations -- A parallel algorithm for two processors precedence constraint scheduling -- An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs -- On logics, tilings, and automata -- Satisfiability of systems of ordinal notations with the subterm property is decidable -- Complete axiomatizations of some quotient term algebras -- The meaning of negative premises in transition system specifications -- Deciding history preserving bisimilarity -- Adding action refinement to a finite process algebra -- Improved parallel computations with matrices and polynomials -- Finding minimal forbidden minors using a finite congruence -- Better algorithms for the pathwidth and treewidth of graphs -- Two P-complete problems in the theory of the reals -- L morphisms: Bounded delay and regularity of ambiguity -- Degree and decomposability of variable-length codes -- An EILENBERG theorem for ?-languages -- Balancing order and chaos in image generation -- Average case complexity -- Minimal NFA problems are hard -- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language -- Computing shortest transversals -- Ray shooting in polygons using geodesic triangulations -- The expected extremes in a delaunay triangulation -- Computational geometry for the gourmet old fare and new dishes -- On the power of multiple reads in a chip -- On linear decision trees computing Boolean functions -- An almost linear-time algorithm for the dense subset-sum problem -- On-line algorithms for weighted bipartite matching and stable marriages -- String matching with preprocessing of text and pattern -- Ordering problems approximated: single-processor scheduling and interval graph completion.
520 _aThis volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP stands for International Colloquium on Automata, Languages, and Programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aArtificial intelligence.
650 0 _aComputer graphics.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aData Structures.
650 2 4 _aCombinatorics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aComputer Graphics.
700 1 _aAlbert, Javier Leach.
_eeditor.
700 1 _aMonien, Burkhard.
_eeditor.
700 1 _aArtalejo, Mario Rodríguez.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540542339
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v510
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-54233-7
942 _2EBK6092
_cEBK
999 _c35386
_d35386