LEADER 01027nam0 2200277 i 450 001 SUN0071457 005 20110405101046.504 100 $a20090915d1990 |0engc50 ba 101 $aeng 102 $aGB 105 $a|||| ||||| 200 1 $aSmith and Keenan's company law for students$fDenis Keenan 205 $a8th ed.$fby Denis Keenan 210 $aLondon$cPitman$d1990 215 $aXX, 460 p.$d25 cm. 620 $aGB$dLondon$3SUNL000015 676 $a344.10666$v21 700 1$aKeenan$b, Denis$3SUNV038780$0277443 702 1$aSmith$b, Kenneth$3SUNV038782 712 $aPitman$3SUNV000256$4650 801 $aIT$bSOL$c20181109$gRICA 912 $aSUN0071457 950 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI ECONOMIA$d03 PREST IIBb47 $e03 2986 995 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI ECONOMIA$bIT-CE0106$h2986$kPREST IIBb47$op$qa 996 $aSmith and Keenan's company law for students$91414858 997 $aUNICAMPANIA LEADER 06075nam 22007335 450 001 996465619403316 005 20230329153544.0 010 $a3-642-36899-9 024 7 $a10.1007/978-3-642-36899-8 035 $a(CKB)3280000000007559 035 $a(DE-He213)978-3-642-36899-8 035 $a(SSID)ssj0000880019 035 $a(PQKBManifestationID)11484782 035 $a(PQKBTitleCode)TC0000880019 035 $a(PQKBWorkID)10873608 035 $a(PQKB)10784399 035 $a(MiAaPQ)EBC3093087 035 $a(PPN)169139743 035 $a(EXLCZ)993280000000007559 100 $a20130305d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInformation Theory, Combinatorics, and Search Theory$b[electronic resource] $eIn Memory of Rudolf Ahlswede /$fedited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XL, 773 p. 58 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7777 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-36898-0 327 $aI. Information Theory -- 1 Two New Results for Identification for Sources -- 2 L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order -- 3 Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme -- 4 Strong Secrecy for Multiple Access Channels -- 5 Capacity Results for Arbitrarily Varying Wiretap Channels -- 6 On Oblivious Transfer Capacity -- 7 Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay -- 8 Uniformly Generating Origin Destination Tables -- 9 Identification via Quantum Channels -- 10 Classical-Quantum Arbitrarily Varying Wiretap Channel -- 11 Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities -- 12 On the Value of Multiple Read/Write Streams for Data Compression -- 13 How to Read a Randomly Mixed Up Message -- 14 Multiple Objects: Error Exponents in Hypotheses Testing and Identification -- II. Combinatorics 15 Family Complexity and VC-Dimension -- 16 The Restricted Word Shadow Problem -- 17 Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multi-families, and Full Multitransversals -- 18 Generic Algorithms for Factoring Strings -- 19 On Data Recovery in Distributed Databases -- 20 An Unstable Hypergraph Problem with a Unique Optimal Solution -- 21 Multiparty Communication Complexity of Vector?Valued and Sum?Type Functions -- 22 Threshold Functions for Distinct Parts: Revisiting Erd¨os?Lehner -- 23 On Some Structural Properties of Star and Pancake Graphs -- III. Search Theory -- 24 Threshold and Majority Group Testing -- 25 Superimposed Codes and Threshold Group Testing -- 26 New Construction of Error-Tolerant Pooling Designs -- 27 Density-Based Group Testing -- 28 Group Testing with Multiple Mutually-Obscuring Positives -- 29 An Efficient Algorithm for Combinatorial Group Testing -- 30 Randomized Post-optimization for t-Restrictions -- 31 Search for Sparse Active Inputs: A Review -- 32 Search When the Lie Depends on the Target -- 33 A Heuristic Solution of a Cutting Problem Using Hypergraphs -- 34 Remarks on History and Presence of Game Tree Search and Research -- 35 Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture -- Michael Bodewig 36 Creating Order and Ballot Sequences -- Obituaries and Personal Memories -- Abschied -- 38 Rudi -- 39 Gedenkworte f¨ur Rudolf Ahlswede -- 40 In Memoriam Rudolf Ahlswede 1938 - 2010 -- 41 Rudolf Ahlswede 1938-2010 -- 42 Remembering Rudolf Ahlswede -- 43 Rudi Ahlswede -- 44 The Happy Connection between Rudi and Japanese Researchers -- 45 From Information Theory to Extremal Combinatorics: My Joint Works with Rudi Ahlswede -- 46 Mr. Schimanski and the Pragmatic Dean -- 47 Broken Pipes -- 48 Rudolf Ahlswede?s Funny Character -- 49 Two Anecdotes of Rudolf Ahlswede -- Bibliography of Rudolf Ahlswede?s Publications. 330 $aThis volume is dedicated to the memory of Rudolf Ahlswede, who passed away in December 2010. The Festschrift contains 36 thoroughly refereed research papers from a memorial symposium, which took place in July 2011. The four macro-topics of this workshop: theory of games and strategic planning; combinatorial group testing and database mining; computational biology and string matching; information coding and spreading and patrolling on networks; provide a comprehensive picture of the vision Rudolf Ahlswede put forward of a broad and systematic theory of search. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7777 606 $aCoding theory 606 $aInformation theory 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aCoding and Information Theory 606 $aDiscrete Mathematics in Computer Science 606 $aDiscrete Mathematics 606 $aAlgorithms 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 14$aCoding and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aDiscrete Mathematics. 615 24$aAlgorithms. 676 $a004 702 $aAydinian$b Harout$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCicalese$b Ferdinando$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDeppe$b Christian$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465619403316 996 $aInformation Theory, Combinatorics, and Search Theory$92831594 997 $aUNISA