05302nam 22005295 450 99646540690331620200630123911.00-387-34770-410.1007/BFb0040367(CKB)1000000000228159(SSID)ssj0000327587(PQKBManifestationID)11245715(PQKBTitleCode)TC0000327587(PQKBWorkID)10301553(PQKB)11752320(DE-He213)978-0-387-34770-7(PPN)155196235(EXLCZ)99100000000022815920121227d1988 u| 0engurnn|008mamaatxtccrVLSI Algorithms and Architectures[electronic resource] 3rd Aegean Workshop on Computing, AWOC 88. Corfu, Greece, June 28 - July 1, 1988. Proceedings /edited by John H. Reif1st ed. 1988.New York, NY :Springer New York :Imprint: Springer,1988.1 online resource (XII, 480 p.) Lecture Notes in Computer Science,0302-9743 ;319Bibliographic Level Mode of Issuance: Monograph0-387-96818-0 Parallel algorithms for evaluating sequences of set-manipulation operations -- Fast parallel and sequential algorithms for edge-coloring planar graphs -- Optimal parallel algorithms on planar graphs -- Efficient parallel triconnectivity in logarithmic time -- Subtree isomorphism is in random NC -- All graphs have cycle separators and planar directed depth-first search is in DNC -- On some languages in NC -- O(log(n)) parallel time finite field inversion -- Deterministic parallel list ranking -- Optimal parallel algorithms for expression tree evaluation and list ranking -- Optimal parallel evaluation of tree-structured computations by raking (extended abstract) -- On finding lowest common ancestors: Simplification and parallelization -- A scheduling problem arising from loop parallelization on MIMD machines -- Scheduling dags to minimize time and communication -- Computing a perfect matching in a line graph -- Separation pair detection -- Graph embeddings 1988: Recent breakthroughs, new directions -- Simulating binary trees on hypercubes -- Embedding rectangular grids into square grids -- Efficient reconfiguration of VLSI arrays -- Embedding grids into hypercubes -- Compaction on the torus -- Channel routing with short wires -- Simple three-layer channel routing algorithms -- Applying the classification theorem for finite simple groups to minimize pin count in uniform permutation architectures -- A new algorithm for wiring layouts -- Input sensitive VLSI layouts for graphs of arbitrary degree -- Fast self-reduction algorithms for combinatorial problems of VLSI design -- Regular structures and testing: RCC-adders -- Parallel simulation and test of VLSI array logic -- Universal hashing in VLSI -- Converting affine recurrence equations to quasi-uniform recurrence equations -- Better computing on the anonymous ring -- Network complexity of sorting and graph problems and simulating CRCW PRAMS by interconnection networks -- Analysis of a distributed scheduler for communication networks -- Weighted distributed match-making -- A tradeoff between information and communication in broadcast protocols -- Families of consensus algorithms -- Uniform self-stabilizing rings -- The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels -- Optimal routing algorithms for mesh-connected processor arrays -- Routing and sorting on mesh-connected arrays -- Time lower bounds for parallel sorting on a mesh-connected processor array -- A correction network for N-sorters -- Cubesort: An optimal sorting algorithm for feasible parallel computers -- A 4d channel router for a two layer diagonal model.From the Foreword: "The papers in this volume were presented at the Aegean Workshop on Computing: VLSI Algorithms and Architectures (AWOC 88), organized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee's call for papers and to additional invitations from John Reif. AWOC 88 took place in Corfu, Greece, June 28-July 1, 1988. AWOC 88 is the third meeting in the International Workshop on Parallel Computing & VLSI series; the first meeting took place in Amalfi, Italy, 1984, and the second at Loutraki, Greece, 1986.".Lecture Notes in Computer Science,0302-9743 ;319ElectronicsMicroelectronicsElectronics and Microelectronics, Instrumentationhttps://scigraph.springernature.com/ontologies/product-market-codes/T24027Electronics.Microelectronics.Electronics and Microelectronics, Instrumentation.621.395Reif John Hedthttp://id.loc.gov/vocabulary/relators/edtAegean Workshop on ComputingBOOK996465406903316VLSI Algorithms and Architectures2831123UNISA03910nam 22005773 450 991101129170332120251022101410.09783111062037311106203110.1515/9783111062037(CKB)37742238800041(MiAaPQ)EBC31954031(Au-PeEL)EBL31954031(DE-B1597)638464(DE-B1597)9783111062037(OCoLC)1507698481(EXLCZ)993774223880004120250313d2025 uy 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierDe Gruyter Handbook of Digital Criminology1st ed.Berlin/Boston :Walter de Gruyter GmbH,2025.©2025.1 online resource (534 pages)De Gruyter Contemporary Social Sciences Handbooks Series ;v.69783111061931 3111061930 Frontmatter --Table of Content --An introduction to digital criminology --1 Abuse --2 Accessing online communities --3 Affordances --4 Agency --5 Algorithm --6 App-based textual interviews --7 Archives --8 Art as method --9 Artificial intelligence --10 Automation --11 Bias --12 Big data --13 Biometric failure --14 Borders and border control --15 Categorization and sorting --16 Computation --17 Cybercrime --18 Darknet --19 Data justice --20 Databases --21 Datafication --22 Digilantism --23 Digital --24 DNA / big genome data --25 Error --26 Ethics --27 Facial recognition --28 Financial crime and surveillance --29 Hacking --30 Hate crime and networked hate --31 Identify theft --32 Infrastructures --33 Intelligence --34 Internet of things --35 Interviews with digital objects --36 Labs --37 Low-tech --38 Online courts --39 Online ethnography --40 Platforms --41 Policing --42 Prediction --43 Privacy and data protection --44 Privatization --45 Punishment --46 Recruitment via social media --47 Researching online forums --48 Robots --49 Sentencing and risk assessment algorithms --50 Sex work --51 Smart city --52 Social media --53 Surveillance --54 Synthetic data and generative machine learning --55 Translation --56 Victimization --57 Vulnerability --List of contributorsThe De Gruyter Handbook of Digital Criminology examines how digital devices spread and cut across all fields of crime and control. Providing a glossary of key theoretical, methodological and criminological concepts, the book defines and further establishes a vibrant and rapidly developing field. At the same time, Digital Criminology is not only presented as a novelty, but also as a continuation of the discipline's history. Each chapter can be read as a free-standing contribution or texts can be combined to gain a more holistic understanding of Digital Criminology or to design a research project. Expert contributions vary from Criminology, Sociology, Law, Science and Technology Studies, to Information Science and Digital Humanities. Together, these supply readers with rich and original perspectives on the digitization of crime and control.De Gruyter Contemporary Social Sciences Handbooks SeriesSOCIAL SCIENCE / GeneralbisacshControl.Crime.Criminology.Digital Criminology.Science and Technology.SOCIAL SCIENCE / General.364.168Kaufmann Mareile1794709Lomell Heidi Mork1851627MiAaPQMiAaPQMiAaPQBOOK9911011291703321De Gruyter Handbook of Digital Criminology4445721UNINA