LEADER 01353nam0 22003011i 450 001 UON00018643 005 20231205102007.241 100 $a20020107d1955 |0itac50 ba 101 $aave 102 $aIN 105 $a|||| 1|||| 200 1 $aAVESTA Texts for University Students 210 $aBombay$cThe Trustees of the Parsi Punchayet$d1955 256 p. ; 25 cm 606 $aZOROASTRISMO$xTESTI AVESTICI$3UONC000949$2FI 606 $aLINGUA AVESTICA$xTESTI$3UONC004802$2FI 606 $aLINGUA AVESTICA$xGRAMMATICHE E MANUALI$3UONC005170$2FI 620 $aIN$dMumbai$3UONL000115 686 $aIR II AV$cIRAN ANTICO - LINGUISTICA - AVESTICO$2A 712 $aTrustess of the Parsee Punchayet$3UONV247783$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00018643 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI IR II AV 003 $eSI IR 1263 5 003 966 $aLINGUE IRANICHE - ANTICOIRANICO$yLINGUA AVESTICA - TESTI$3UONC005444 966 $aMANOSCRITTI AVESTICI - CATALOGHI$yLINGUA AVESTICA - TESTI$3UONC006305 966 $aLINGUE IRANICHE - ANTICOIRANICO$yLINGUA AVESTICA - GRAMMATICHE E MANUALI$3UONC005444 996 $aAvesta Texts for University Students$91177824 997 $aUNIOR LEADER 05505nam 22007575 450 001 996587869603316 005 20231208092045.0 010 $a3-031-49190-4 024 7 $a10.1007/978-3-031-49190-0 035 $a(MiAaPQ)EBC31009098 035 $a(Au-PeEL)EBL31009098 035 $a(DE-He213)978-3-031-49190-0 035 $a(EXLCZ)9929337981500041 100 $a20231208d2024 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputing and Combinatorics$b[electronic resource] $e29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15?17, 2023, Proceedings, Part I /$fedited by Weili Wu, Guangmo Tong 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (424 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14422 311 08$aPrint version: Wu, Weili Computing and Combinatorics Cham : Springer,c2024 9783031491894 327 $aCombinatorics and Algorithms -- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher -- Extended formulations via decision diagrams -- Greedy Gray codes for Dyck words and ballot sequences -- Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication -- (min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences -- A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons -- An Approach to Agent Path Planning under Temporal Logic Constraints -- The Heterogeneous Rooted Tree Cover Problem -- The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model -- The Regularized Submodular Maximization via the Lyapunov Method -- Topological network-control games -- Lower Bounds of Functions on Finite Abelian Groups -- A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering -- Random Shortening of Linear Codes and Applications -- Algorithms for Full-View Coverage of Targets with Group Set Cover -- Improved bounds for the binary paint shop problem -- Algorithmic Solution in Applications -- Fitch Graph Completion -- Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays -- Diversity and freshness-aware regret minimizing set queries -- A Modified EXP3 in Adversarial Bandits with Multi-User Delayed Feedback -- Cabbage Can?t Always be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals -- k-median/means with outliers revisited: a simple fpt approximation -- A cost-sharing scheme for the $k$-product facility location game with penalties -- Algorithm in Networks -- Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks -- Stochastic Model for Rumor Blocking Problem in Social Networks under Rumor Source Uncertainty -- Algorithms for Shortest Path Tour Problem in Large-Scale Road Network -- Solving systems of linear equations through zero forcing sets -- Profit Maximization for Competitive Influence Spread in Social Networks -- Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing -- On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes -- Approval-Based Participatory Budgeting with Donations. 330 $aThis two volume set LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023. The 60 full papers were carefully reviewed and selected from 146 submissions. They are organized in the following topical sections: Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks. Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14422 606 $aComputer science 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aTheory of Computation 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aData Structures and Information Theory 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aNumerical Analysis 615 0$aComputer science. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aTheory of Computation. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aData Structures and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aNumerical Analysis. 676 $a004.0151 700 $aWu$b Weili$01005291 701 $aTong$b Guangmo$01460283 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996587869603316 996 $aComputing and Combinatorics$93660150 997 $aUNISA LEADER 02142nam0 2200469 i 450 001 VAN00114399 005 20241121084627.199 017 70$2N$a9783319395586 100 $a20180202d2016 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aAlgorithmic mathematics$fStefan Hougardy, Jens Vygen 210 $a[Cham]$cSpringer$d2016 215 $aXIII, 163 p.$cill.$d24 cm 500 1$3VAN00241914$aAlgorithmic mathematics$91523131 606 $a05C85$xGraph algorithms (graph-theoretic aspects) [MSC 2020]$3VANC023679$2MF 606 $a65-XX$xNumerical analysis [MSC 2020]$3VANC019772$2MF 606 $a65F05$xDirect numerical methods for linear systems and matrix inversion [MSC 2020]$3VANC027309$2MF 606 $a65Gxx$xError analysis and interval analysis [MSC 2020]$3VANC023264$2MF 606 $a65Y04$xNumerical algorithms for computer arithmetic, etc. [MSC 2020]$3VANC033858$2MF 606 $a68-XX$xComputer science [MSC 2020]$3VANC019670$2MF 606 $a68P10$xSearching and sorting [MSC 2020]$3VANC024570$2MF 606 $a68R10$xGraph theory (including graph drawing) in computer science [MSC 2020]$3VANC023623$2MF 606 $a90C27$xCombinatorial optimization [MSC 2020]$3VANC031074$2MF 610 $aAlgorithmic mathematics$9KW:K 610 $aAlgorithms$9KW:K 610 $aC++$9KW:K 610 $aElementary data structures$9KW:K 610 $aSorting algorithms$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aHougardy$bStefan$3VANV088491$0755819 701 1$aVygen$bJens$3VANV078709$0441957 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20241122$gRICA 856 4 $uhttp://dx.doi.org/10.1007/978-3-319-39558-6$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA CENTRO DI SERVIZIO SBA$2VAN15 912 $fN 912 $aVAN00114399 950 $aBIBLIOTECA CENTRO DI SERVIZIO SBA$d15CONS SBA EBOOK 2098 $e15EB 2098 20180202 996 $aAlgorithmic mathematics$91523131 997 $aUNICAMPANIA