06803nam 22007335 450 99646572070331620200702030605.03-540-46201-510.1007/BFb0035746(CKB)1000000000233415(SSID)ssj0000321508(PQKBManifestationID)11227082(PQKBTitleCode)TC0000321508(PQKBWorkID)10279581(PQKB)11679677(DE-He213)978-3-540-46201-9(PPN)155233599(EXLCZ)99100000000023341520121227d1989 u| 0engurnn|008mamaatxtccrAutomata, Languages and Programming[electronic resource] 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings /edited by Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simonetta Ronchi Della Rocca1st ed. 1989.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1989.1 online resource (XIV, 790 p.)Lecture Notes in Computer Science,0302-9743 ;372Bibliographic Level Mode of Issuance: Monograph3-540-51371-X 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 CREW-PRAM computation of monotone functions -- Subduing self-application -- Everything in NP can be argued in perfect zero-knowledge 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 singly-exponential stratification scheme for real semi-algebraic varieties and its applications -- About primitive recursive algorithms -- The definability of equational graphs in monadic second-order 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 pointer-free data structure for merging heaps and min-max heaps -- Structured operational semantics and bisimulation as a congruence -- Parallel retrieval of scattered information -- Tensor rank is NP-complete -- The complexity of nonlinear separable optimization -- General methods for the analysis of the maximum size of dynamic data structures -- How to share concurrent asynchronous wait-free 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 non-modifiable 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 on-line 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 v-calculus -- DI-domains as information systems.This volume contains the proceedings of ICALP 89, held at Stresa, Italy, July 11-15, 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.Lecture Notes in Computer Science,0302-9743 ;372ComputersComputer logicAlgorithmsMathematical logicCombinatoricsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XAlgorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Computers.Computer logic.Algorithms.Mathematical logic.Combinatorics.Theory of Computation.Logics and Meanings of Programs.Algorithm Analysis and Problem Complexity.Mathematical Logic and Formal Languages.Computation by Abstract Devices.Combinatorics.004.0151Ausiello Giorgioedthttp://id.loc.gov/vocabulary/relators/edtDezani-Ciancaglini Mariangiolaedthttp://id.loc.gov/vocabulary/relators/edtRonchi Della Rocca Simonettaedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465720703316Automata, languages and programming339738UNISA03204nam 22006495 450 991098333270332120250225120802.09783031824234303182423710.1007/978-3-031-82423-4(CKB)37702837000041(MiAaPQ)EBC31919724(Au-PeEL)EBL31919724(DE-He213)978-3-031-82423-4(OCoLC)1507695431(EXLCZ)993770283700004120250225d2024 u| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierBridging the Divide Exploring Social Theory and Social Policy /by Jason L. Powell1st ed. 2024.Cham :Springer Nature Switzerland :Imprint: Springer,2024.1 online resource (192 pages)International Perspectives on Social Policy, Administration, and Practice,2625-69839783031824227 3031824229 Chapter 1. Introduction – Social Theory and Social Policy: Enriching Understandings -- Chapter 2. The Relevance of Michel Foucault -- Chapter 3. Foucault and Social Theory -- Chapter 4. Foucault, Governmentality and Social Work Policy -- Chapter 5. Foucault’s Impact: Butler, Performance and Social Work -- Chapter 6. Foucault, Surveillance and Penal Policy -- Chapter 7. Elder Abuse and Social Policy -- Chapter 8. Public Health and Social Policy -- Chapter 9. Death, Social Policy and Aging -- Chapter 10. Risk, Aging and Policy.In today's complex and rapidly changing globe, understanding the link between social theory and social policy is crucial for addressing the diverse challenges that diverse societies face. This book aims to provide a thorough critical analysis of how social theory shapes social policy and how effective policies can be informed by theoretical frameworks emanating from history and the present. This book is both important and significant: by bridging the gap between theory and policy, this book seeks to contribute to the development of evidence-based policies that promote social cohesion, social justice, and well-being. The book is one of the first to open up theoretical strategies and applicability to social policies.International Perspectives on Social Policy, Administration, and Practice,2625-6983SociologySocial sciencesPhilosophySocial policySociologySocial TheorySocial PolicyGlobal Social PolicyComparative Social PolicySociology.Social sciencesPhilosophy.Social policy.Sociology.Social Theory.Social Policy.Global Social Policy.Comparative Social Policy.301Powell Jason L1734153MiAaPQMiAaPQMiAaPQBOOK9910983332703321Bridging the Divide4317578UNINA