Coverart for item
The Resource Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, edited by J. Bečvář

Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, edited by J. Bečvář

Label
Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979
Title
Mathematical foundations of computer science, 1979
Title remainder
proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979
Statement of responsibility
edited by J. Bečvář
Creator
Contributor
Subject
Genre
Language
eng
Summary
What do an illegal drug importer, a stolen car exporter, a Hells Angels member, an accountant, and an airplane hijacker have in common? Like most people, they all operate in social networks-and at times, they come together in criminal networks which, though tightly structured and controlled, undergo constant change. Inside Criminal Networks takes a social network perspective to a variety of illegal enterprises, focusing on these organizations' "flexible order" and the collective coping and adjustment strategies of offenders when key members or opportunities are lost. Rich with communication data, electronic surveillance material, and other law-enforcement investigative sources, case studies pursue a number of analytical paths into the partnerships, pecking orders, and situations in flux (e.g., street gang presence within drug distribution), and identify central challenges to research (e.g., are these failed networks if members are arrested?). Flexibility is revealed as a driving force as the book examines: Operational structures and dynamics. Roles of key and peripheral players. The tentative balance between efficiency and security. Criminal network positions and individual traits. Uses of legitimate actors in illegal settings. Adaptation when networks are disrupted. Compellingly written and meticulously presented, Inside Criminal Networks offers rare up-close insights to readers in the criminology and organized crime research fields, and to social network theorists and analysts
Member of
Cataloging source
SCPER
Dewey number
519.7
Illustrations
illustrations
Index
no index present
LC call number
QA76.6
LC item number
.S9194 1979
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1979
http://bibfra.me/vocab/lite/meetingName
Symposium on Mathematical Foundations of Computer Science (1972- )
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1926-
http://library.link/vocab/relatedWorkOrContributorName
Bečvář, J.
Series statement
Lecture notes in computer science
Series volume
74
http://library.link/vocab/subjectName
  • Computer programming
  • Computer algorithms
  • Computable functions
  • Machine theory
  • Algorithmes
  • Programmation (Informatique)
  • Fonctions calculables
  • Automates mathématiques, Théorie des
  • Computable functions
  • Computer algorithms
  • Computer programming
  • Machine theory
  • Fundamentele informatica
Label
Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, edited by J. Bečvář
Instantiates
Publication
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
A sound and complete proof system for partial program correctness -- The problem of reachability and verification of programs -- Assertion programming -- Complexity classes of formal languages -- Fast probabilistic algorithms -- Relative succinctness of representations of languages and separation of complexity classes -- On two types of loops -- Full abstraction for a simple parallel programming language -- On some developments in cryptography and their applications to computer science -- Searching, sorting and information theory -- Lcf: A way of doing proofs with a machine -- Axioms or algorithms -- Power from power series -- Computational complexity of string and graph ident ification -- A survey of grammar and l forms-1978 -- A theoretical study on the time analysis of programs -- Completeness problems in verification of programs and program schemes -- Relationships between AFDL's and cylinders -- Computable data types -- Program equivalence and provability -- Interactive L systems with almost interactionless behaviour -- On the simplification of constructions in degrees of unsolvability via computational complexity -- An algebraic extension of the Chomsky -- hierarchy -- Bounds on computational complexity and approximability of initial segments of recursive sets -- On the weighted path length of binary search trees for unknown access probabilities -- Computational complexity of approximation algorithms for combinatorial problems -- A reduct-and-closure algorithm for graphs -- Small universal Minsky machines -- Parallel and two-way recognizers of directed acyclic graphs -- Fully effective solutions of recursive domain equations -- A note on computational complexity of a statistical deducibility testing procedure -- Context free normal systems -- New proofs for jump dpda's -- Synchronization and maximality for very pure subsemigroups of a free semigroup -- On the sets of minimal indices of partial recursive functions -- Some remarks on Boolean sums -- On the propositional algorithmic logic -- Ch(k) grammars: A characterization of LL(k) languages -- A uniform approach to balanced binary and multiway trees -- On the generative capacity of some classes of grammars with regulated rewriting -- Validity test for Floyd's operator-precedence parsing algorithms -- On the languages of bounded Petri nets -- Dyck language D2 is not absolutely parallel -- Fixed points in the power-set algebra of infinite trees -- On relaxation rules in algorithmic logic -- L-Fuzzy functorial automata -- Schematics of structural parallel programming and its applications -- On axiomatization of deterministic propositional dynamic logic -- Bounded recursion and complexity classes -- Characterization of rational and algebraic power series -- A crossing measure for 2-tape Turing machines -- The complexity of lexicographic sorting and searching -- An algebraic approach to concurrence -- On multitape automata -- A turing machine oracle hierarchy -- A survey of some syntactic results in the?-calculus -- On rational expressions representing infinite rational trees : Application to the structure of flow charts
Control code
326963847
Dimensions
unknown
Extent
1 online resource (ix, 580 pages)
Form of item
online
Isbn
9780387095264
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-09526-8
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)326963847
Label
Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, edited by J. Bečvář
Publication
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
A sound and complete proof system for partial program correctness -- The problem of reachability and verification of programs -- Assertion programming -- Complexity classes of formal languages -- Fast probabilistic algorithms -- Relative succinctness of representations of languages and separation of complexity classes -- On two types of loops -- Full abstraction for a simple parallel programming language -- On some developments in cryptography and their applications to computer science -- Searching, sorting and information theory -- Lcf: A way of doing proofs with a machine -- Axioms or algorithms -- Power from power series -- Computational complexity of string and graph ident ification -- A survey of grammar and l forms-1978 -- A theoretical study on the time analysis of programs -- Completeness problems in verification of programs and program schemes -- Relationships between AFDL's and cylinders -- Computable data types -- Program equivalence and provability -- Interactive L systems with almost interactionless behaviour -- On the simplification of constructions in degrees of unsolvability via computational complexity -- An algebraic extension of the Chomsky -- hierarchy -- Bounds on computational complexity and approximability of initial segments of recursive sets -- On the weighted path length of binary search trees for unknown access probabilities -- Computational complexity of approximation algorithms for combinatorial problems -- A reduct-and-closure algorithm for graphs -- Small universal Minsky machines -- Parallel and two-way recognizers of directed acyclic graphs -- Fully effective solutions of recursive domain equations -- A note on computational complexity of a statistical deducibility testing procedure -- Context free normal systems -- New proofs for jump dpda's -- Synchronization and maximality for very pure subsemigroups of a free semigroup -- On the sets of minimal indices of partial recursive functions -- Some remarks on Boolean sums -- On the propositional algorithmic logic -- Ch(k) grammars: A characterization of LL(k) languages -- A uniform approach to balanced binary and multiway trees -- On the generative capacity of some classes of grammars with regulated rewriting -- Validity test for Floyd's operator-precedence parsing algorithms -- On the languages of bounded Petri nets -- Dyck language D2 is not absolutely parallel -- Fixed points in the power-set algebra of infinite trees -- On relaxation rules in algorithmic logic -- L-Fuzzy functorial automata -- Schematics of structural parallel programming and its applications -- On axiomatization of deterministic propositional dynamic logic -- Bounded recursion and complexity classes -- Characterization of rational and algebraic power series -- A crossing measure for 2-tape Turing machines -- The complexity of lexicographic sorting and searching -- An algebraic approach to concurrence -- On multitape automata -- A turing machine oracle hierarchy -- A survey of some syntactic results in the?-calculus -- On rational expressions representing infinite rational trees : Application to the structure of flow charts
Control code
326963847
Dimensions
unknown
Extent
1 online resource (ix, 580 pages)
Form of item
online
Isbn
9780387095264
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-09526-8
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)326963847

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...