LEADER 00934nam a2200217 i 4500 001 991004345934107536 005 20241009101723.0 008 241009s1980 it jr 001 0 ita d 040 $aBibl. Dip.le Aggr. Scienze Umane e Sociali$bita$cSocioculturale Scs 041 0 $aita$alat 082 04$a870.8$223 100 1 $aPerelli, Luciano$0185782 245 10$aLetteratura latina e societą :$bun'antologia : per i licei classici e scientifici e per gli istituti magistrali : con un'appendice di letture critiche/$cLuciano Perelli 260 $aTorino :$bParavia,$c1980 300 $a481 p. ;$c25 cm 490 1 $aCiviltą letteraria di Grecia e di Roma. Letteratura e critica. Serie latina ;$v7 650 4$aLetteratura latina$vAntologie 830 0$aCiviltą letteraria di Grecia e di Roma.$pLetteratura e critica. Serie latina ;$v7 912 $a991004345934107536 996 $aLetteratura latina e societą$94215767 997 $aUNISALENTO LEADER 05636nam 22007935 450 001 996664549203316 005 20250629130156.0 010 $a9789819683123 024 7 $a10.1007/978-981-96-8312-3 035 $a(CKB)39532319700041 035 $a(MiAaPQ)EBC32184239 035 $a(Au-PeEL)EBL32184239 035 $a(DE-He213)978-981-96-8312-3 035 $a(EXLCZ)9939532319700041 100 $a20250629d2025 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFrontiers of Algorithmics $e19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 ? July 2, 2025, Proceedings /$fedited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu 205 $a1st ed. 2025. 210 1$aSingapore :$cSpringer Nature Singapore :$cImprint: Springer,$d2025. 215 $a1 online resource (747 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15828 311 08$a9789819683116 327 $aDomination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter -- $k$-Universality of Regular Languages Revisited -- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions -- Complexity Classes for Online Problems with and without Predictions -- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model -- Mixed Graph Covering with Target Constraints -- Multiplication of 0-1 matrices via clustering -- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances -- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem -- Approximation Algorithms for Individual Preference Facility Location -- The online power cover problem on a line -- The Subinterval Cover Problem -- Oblivious Robots Under Round Robin: Gathering on Rings -- Finding a Set of Long Common Substrings with Repeats from m Input Strings -- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties -- Less-excludable Mechanism for DAOs in Public Good Auctions -- TBDS: Transaction-Based Data Sharing -- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents -- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer -- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources -- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms -- Minimizing Blocking Agents for Stable Matching with Partial Approval Information -- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives -- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games -- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints -- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems -- Large-Scale Contextual Market Equilibrium Computation through Deep Learning -- Fair Value Distribution in Cooperative Committee Election -- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs -- Mechanism Design for Auctions with Externalities on Budgets. 330 $aThis book LNCS15828 constitutes the refereed proceedings of the 19th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2025), consisting of the 19th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 6th International Joint Conference on Theoretical Computer Science (IJTCS), held in Paris, France, during June 30?July 2, 2025. The 28 full papers and 2 short papers were carefully reviewed and selected from 63 submissions. The proceedings focuses on Frontiers of Algorithmic Wisdom; Block-chain, Distributed Computing, Multi-Agents; Game Theory, Algorithmic Game Theory, Machine Learning, Electronic Commerce. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15828 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer networks 606 $aSoftware engineering 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Structures and Information Theory 606 $aComputer Communication Networks 606 $aSoftware Engineering 606 $aDesign and Analysis of Algorithms 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer networks. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Structures and Information Theory. 615 24$aComputer Communication Networks. 615 24$aSoftware Engineering. 615 24$aDesign and Analysis of Algorithms. 676 $a004.0151 700 $aChau$b Vincent$01830834 701 $aDu?rr$b Christoph$f1969-$01831908 701 $aLi$b Minming$01423621 701 $aLu$b Pinyan$01354799 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996664549203316 996 $aFrontiers of Algorithmics$94404893 997 $aUNISA