The Resource Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca
Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca
Resource Information
The item Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 This volume contains the proceedings of ICALP 89, held at Stresa, Italy, July 1115, 1989. ICALP 89 is the 16th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics such as computability, automata theory, formal language theory, analysis of algorithms, computational complexity, mathematical aspects of programming language definition, logic and semantics of programming languages, foundations of logic programming, theorem proving, software specification, computational geometry, data types and data structures, theory of data bases and knowledge based systems, cryptography, VLSI structures, parallel and distributed computing, models of concurrency and robotics
 Language
 eng
 Extent
 1 online resource
 Contents

 Realizable and unrealizable specifications of reactive systems
 Limitations of the upward separation technique (preliminary version)
 Lower bounds for the low hierarchy
 Efficient text searching of regular expressions
 Factors of words
 Asymptotically optimal distributed consensus
 Time lower bounds for CREWPRAM computation of monotone functions
 Subduing selfapplication
 Everything in NP can be argued in perfect zeroknowledge in a bounded number of rounds
 Polymorphic rewriting conserves algebraic strong normalization and confluence
 Completion of finite codes with finite deciphering delay
 Relational semantics for recursive types and bounded quantification
 A singlyexponential stratification scheme for real semialgebraic varieties and its applications
 About primitive recursive algorithms
 The definability of equational graphs in monadic secondorder logic
 Dominoes and the regularity of DNA splicing languages
 Causal trees
 Infinite normal forms
 On recent trends in algebraic specification
 Automata with storage on infinite words
 Parallel algorithmic techniques for combinatorial computation
 On dice and coins: models of computation for random generation
 An optimal probabilistic algorithm for synchronous Byzantine agreement
 Finding triconnected components by local replacements
 An improved algorithm for approximate string matching
 A pointerfree data structure for merging heaps and minmax heaps
 Structured operational semantics and bisimulation as a congruence
 Parallel retrieval of scattered information
 Tensor rank is NPcomplete
 The complexity of nonlinear separable optimization
 General methods for the analysis of the maximum size of dynamic data structures
 How to share concurrent asynchronous waitfree variables
 A new approach to formal language theory by kolmogorov complexity
 Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis
 Completing the temporal picture
 Lower bounds for computations with the floor operation
 Programming, transforming, and proving with function abstractions and memories
 Automata theory meets circuit complexity
 Two versus one index register and modifiable versus nonmodifiable programs
 Shortest paths without a map
 Modular system design applying graph grammars techniques
 Partial communations
 On the synthesis of an asynchronous reactive module
 The complexity of controlled selection
 Memory versus randomization in online algorithms
 Syntactic control of interference Part 2
 Characteristic formulae
 A combinatorial technique for separating counting complexity classes
 Horn programs and semicomputable relations on abstract structures
 A note on model checking the modal vcalculus
 DIdomains as information systems
 Isbn
 9783540462019
 Label
 Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings
 Title
 Automata, Languages and Programming
 Title remainder
 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings
 Statement of responsibility
 edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca
 Language
 eng
 Summary
 This volume contains the proceedings of ICALP 89, held at Stresa, Italy, July 1115, 1989. ICALP 89 is the 16th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics such as computability, automata theory, formal language theory, analysis of algorithms, computational complexity, mathematical aspects of programming language definition, logic and semantics of programming languages, foundations of logic programming, theorem proving, software specification, computational geometry, data types and data structures, theory of data bases and knowledge based systems, cryptography, VLSI structures, parallel and distributed computing, models of concurrency and robotics
 Cataloging source
 KIJ
 http://library.link/vocab/creatorDate
 1941
 http://library.link/vocab/creatorName
 Ausiello, G.
 Dewey number
 005.131
 Image bit depth
 0
 Index
 no index present
 Language note
 English
 LC call number
 QA8.9QA10.3
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 DezaniCiancaglini, M.
 Rocca, Simonetta Ronchi
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 372
 http://library.link/vocab/subjectName

 Computer science
 Computer software
 Logic design
 Combinatorial analysis
 Combinatorial analysis
 Computer science
 Computer software
 Logic design
 Label
 Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Realizable and unrealizable specifications of reactive systems  Limitations of the upward separation technique (preliminary version)  Lower bounds for the low hierarchy  Efficient text searching of regular expressions  Factors of words  Asymptotically optimal distributed consensus  Time lower bounds for CREWPRAM computation of monotone functions  Subduing selfapplication  Everything in NP can be argued in perfect zeroknowledge in a bounded number of rounds  Polymorphic rewriting conserves algebraic strong normalization and confluence  Completion of finite codes with finite deciphering delay  Relational semantics for recursive types and bounded quantification  A singlyexponential stratification scheme for real semialgebraic varieties and its applications  About primitive recursive algorithms  The definability of equational graphs in monadic secondorder logic  Dominoes and the regularity of DNA splicing languages  Causal trees  Infinite normal forms  On recent trends in algebraic specification  Automata with storage on infinite words  Parallel algorithmic techniques for combinatorial computation  On dice and coins: models of computation for random generation  An optimal probabilistic algorithm for synchronous Byzantine agreement  Finding triconnected components by local replacements  An improved algorithm for approximate string matching  A pointerfree data structure for merging heaps and minmax heaps  Structured operational semantics and bisimulation as a congruence  Parallel retrieval of scattered information  Tensor rank is NPcomplete  The complexity of nonlinear separable optimization  General methods for the analysis of the maximum size of dynamic data structures  How to share concurrent asynchronous waitfree variables  A new approach to formal language theory by kolmogorov complexity  Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis  Completing the temporal picture  Lower bounds for computations with the floor operation  Programming, transforming, and proving with function abstractions and memories  Automata theory meets circuit complexity  Two versus one index register and modifiable versus nonmodifiable programs  Shortest paths without a map  Modular system design applying graph grammars techniques  Partial communations  On the synthesis of an asynchronous reactive module  The complexity of controlled selection  Memory versus randomization in online algorithms  Syntactic control of interference Part 2  Characteristic formulae  A combinatorial technique for separating counting complexity classes  Horn programs and semicomputable relations on abstract structures  A note on model checking the modal vcalculus  DIdomains as information systems
 Control code
 827358653
 Dimensions
 unknown
 Extent
 1 online resource
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540462019
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/BFb0035746.
 Other physical details
 volumes: digital.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (OCoLC)827358653
 Label
 Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Realizable and unrealizable specifications of reactive systems  Limitations of the upward separation technique (preliminary version)  Lower bounds for the low hierarchy  Efficient text searching of regular expressions  Factors of words  Asymptotically optimal distributed consensus  Time lower bounds for CREWPRAM computation of monotone functions  Subduing selfapplication  Everything in NP can be argued in perfect zeroknowledge in a bounded number of rounds  Polymorphic rewriting conserves algebraic strong normalization and confluence  Completion of finite codes with finite deciphering delay  Relational semantics for recursive types and bounded quantification  A singlyexponential stratification scheme for real semialgebraic varieties and its applications  About primitive recursive algorithms  The definability of equational graphs in monadic secondorder logic  Dominoes and the regularity of DNA splicing languages  Causal trees  Infinite normal forms  On recent trends in algebraic specification  Automata with storage on infinite words  Parallel algorithmic techniques for combinatorial computation  On dice and coins: models of computation for random generation  An optimal probabilistic algorithm for synchronous Byzantine agreement  Finding triconnected components by local replacements  An improved algorithm for approximate string matching  A pointerfree data structure for merging heaps and minmax heaps  Structured operational semantics and bisimulation as a congruence  Parallel retrieval of scattered information  Tensor rank is NPcomplete  The complexity of nonlinear separable optimization  General methods for the analysis of the maximum size of dynamic data structures  How to share concurrent asynchronous waitfree variables  A new approach to formal language theory by kolmogorov complexity  Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis  Completing the temporal picture  Lower bounds for computations with the floor operation  Programming, transforming, and proving with function abstractions and memories  Automata theory meets circuit complexity  Two versus one index register and modifiable versus nonmodifiable programs  Shortest paths without a map  Modular system design applying graph grammars techniques  Partial communations  On the synthesis of an asynchronous reactive module  The complexity of controlled selection  Memory versus randomization in online algorithms  Syntactic control of interference Part 2  Characteristic formulae  A combinatorial technique for separating counting complexity classes  Horn programs and semicomputable relations on abstract structures  A note on model checking the modal vcalculus  DIdomains as information systems
 Control code
 827358653
 Dimensions
 unknown
 Extent
 1 online resource
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540462019
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/BFb0035746.
 Other physical details
 volumes: digital.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (OCoLC)827358653
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming16th/z9bcKVlbreo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming16th/z9bcKVlbreo/">Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming16th/z9bcKVlbreo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming16th/z9bcKVlbreo/">Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 1115, 1989 Proceedings, edited by Giorgio Ausiello, Mariangiola DezaniCiancaglini, Simonetta Ronchi Rocca</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>