LEADER 05248nam 22007335 450 001 9910983300903321 005 20251116222208.0 010 $a9783031826979 010 $a3031826973 024 7 $a10.1007/978-3-031-82697-9 035 $a(MiAaPQ)EBC31909405 035 $a(Au-PeEL)EBL31909405 035 $a(CKB)37548189300041 035 $a(DE-He213)978-3-031-82697-9 035 $a(OCoLC)1500765184 035 $a(EXLCZ)9937548189300041 100 $a20250215d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSOFSEM 2025: Theory and Practice of Computer Science $e50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20?23, 2025, Proceedings, Part II /$fedited by Rastislav Královi?, V?ra K?rková 205 $a1st ed. 2025. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025. 215 $a1 online resource (0 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15539 311 08$a9783031826962 311 08$a3031826965 327 $aOn Pumping Problems for Unary Regular Languages -- The Complexity of Graph Exploration Games -- A SUBSET-SUM Characterisation of the A-Hierarchy -- On the periodic decompositions of multidimensional configurations -- Quantum Algorithm for the Multiple String Matching Problem -- Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds -- The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem -- Colorful 3-Rainbow Domination -- The Computational Complexity of Equilibria with Strategic Constraints -- Exact characterizations of non-commutative algebraic complexity without homogeneity -- Roman Hitting Set -- Visual Complexity of Point Set Mappings -- Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees -- Knowledge Neurons in the Knowledge Graph-based Link Prediction Models -- Disjoint covering of bipartite graphs with $s$-clubs -- Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets -- Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs -- DAG Scheduling in the BSP Model -- Incremental computation of the set of period sets -- Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints -- Packed Acyclic Deterministic Finite Automata -- Holey Graphs: Very Large Betti Numbers are Testable -- Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere -- Online Busy Time Scheduling with Untrusted Prediction -- Maximal $\alpha$-gapped Repeats in a Fibonacci String. 330 $aThis book constitutes the proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, held in Bratislava, Slovak Republic, during January 20-23, 2025. The 48 full papers presented in this book were carefully reviewed and selected from 109 submissions. They include original research from all areas of foundations of computer science and artificial intelligence focusing on AI-based algorithms and techniques, nature-inspired computing, machine learning theory, multi-agent algorithms and games, neural network theory, parallel and distributed computing, quantum computing, computability, decidability, classical and non-classical models of computation, computational complexity, computational learning, cryptographic techniques and security, data compression, data and pattern mining methods, discrete combinatorial optimization, automata, languages, machine models, rewriting systems, efficient data structures, graph structure and algorithms, logics of computation, robotics, and other relevant theory topics in computing and AI. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15539 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence 606 $aComputer networks 606 $aTheory of Computation 606 $aMathematics of Computing 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aArtificial Intelligence 606 $aComputer Communication Networks 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence. 615 0$aComputer networks. 615 14$aTheory of Computation. 615 24$aMathematics of Computing. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aArtificial Intelligence. 615 24$aComputer Communication Networks. 676 $a004.0151 700 $aKra?lovic?$b Rastislav$00 701 $aK?rková$b V?ra$01784961 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910983300903321 996 $aSOFSEM 2025: Theory and Practice of Computer Science$94316559 997 $aUNINA