LEADER 04480nam  22008415  450 
001 9910551843303321
005 20230515182936.0
010   $a3-030-97099-X
024 7 $a10.1007/978-3-030-97099-4
035   $a(MiAaPQ)EBC6904287
035   $a(Au-PeEL)EBL6904287
035   $a(CKB)21348231700041
035   $a(DE-He213)978-3-030-97099-4
035   $a(PPN)261517996
035   $a(EXLCZ)9921348231700041
100   $a20220302d2022      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aFrontiers of Algorithmics $eInternational Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16?19, 2021, Proceedings /$fedited by Jing Chen, Minming Li, Guochuan Zhang
205   $a1st ed. 2022.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022.
215   $a1 online resource (102 pages)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12874
311 08$aPrint version: Chen, Jing Frontiers of Algorithmics Cham : Springer International Publishing AG,c2022 9783030970987 
320   $aIncludes bibliographical references and index.
327   $aInsights from the Conscious Turing Machine (CTM) -- Speculative Smart Contracts -- Optimization from Structured Samples?An Effective Approach for Data-Driven Optimization -- Recent Developments in Property Testing of Boolean Functions -- AC0 Circuits, First-Order Logic, and Well-Structured graphs -- Model-Based Digital Engineering and Verification of Intelligent Systems -- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions -- Fast Sampling Constraint Satisfaction Solutions via the Lovász Local Lemma -- Pool Block Withholding Attack with Rational Miners -- Approximation Algorithms for the Directed Path Partition Problems -- Faster Algorithms for k-Subset Sum and variations -- Hardness and Algorithms for Electoral Manipulation under Media Influence -- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing.
330   $aThis book constitutes the proceedings of the 15th International Workshop on Frontiers in Algorithmics, FAW 2021, held in conjunction with second International Joint Conference on Theoretical Computer Science (IJTCS 2021), as IJTCS-FAW 2021, in Beijing, China, in August 2021. The conference IJTCS-FAW 2021 was held in hybrid mode due to the COVID-19 pandemic. The 5 full papers presented in this volume were carefully reviewed and selected from 9 submissions. The joint conference provides a focused forum on Algorithmic Game Theory, Blockchain, Multi-agent Reinforcement Learning, Quantum Computation, Theory of Machine Learning, Machine Learning, Formal Method, Algorithm and Complexity, and EconCS.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12874
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aData structures (Computer science)
606   $aInformation theory
606   $aComputer engineering
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 Engineering and 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 engineering.
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 Engineering and Networks.
615 24$aSoftware Engineering.
615 24$aDesign and Analysis of Algorithms.
676   $a005.1
676   $a004
702   $aChen$b Jing
702   $aLi$b Minming
702   $aZhang$b Guochuan
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910551843303321
996   $aFrontiers of algorithmics$92922829
997   $aUNINA