SOFSEM 2025: Theory and Practice of Computer Science 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II /
This 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 1...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Vydání: | 1st ed. 2025. |
| Edice: | Lecture Notes in Computer Science,
15539 |
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-3-031-82697-9 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-82697-9 | ||
| 003 | DE-He213 | ||
| 005 | 20260706115746.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 250215s2025 sz | s |||| 0|eng d | ||
| 020 | |a 9783031826979 |9 978-3-031-82697-9 | ||
| 024 | 7 | |a 10.1007/978-3-031-82697-9 |2 doi | |
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 245 | 1 | 0 | |a SOFSEM 2025: Theory and Practice of Computer Science |h [electronic resource] : |b 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II / |c edited by Rastislav Královič, Věra Kůrková. |
| 250 | |a 1st ed. 2025. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2025. | |
| 300 | |a XXV, 353 p. 40 illus., 22 illus. in color. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 341 | 0 | |b Table of contents navigation |2 onix | |
| 341 | 0 | |b Single logical reading order |2 onix | |
| 341 | 0 | |b Short alternative textual descriptions |2 onix | |
| 341 | 0 | |b Use of color is not sole means of conveying information |2 onix | |
| 341 | 0 | |b Use of high contrast between text and background color |2 onix | |
| 341 | 0 | |b Next / Previous structural navigation |2 onix | |
| 341 | 0 | |b All non-decorative content supports reading without sight |2 onix | |
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 15539 | |
| 505 | 0 | |a On 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. | |
| 520 | |a This 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. | ||
| 532 | 8 | |a Accessibility summary: This PDF does not fully comply with PDF/UA standards, but does feature limited screen reader support, described non-text content (images, graphs), bookmarks for easy navigation and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com. | |
| 532 | 8 | |a No reading system accessibility options actively disabled | |
| 532 | 8 | |a Publisher contact for further accessibility information: accessibilitysupport@springernature.com | |
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 0 | |a Artificial intelligence. | |
| 650 | 0 | |a Computer networks . | |
| 650 | 1 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Mathematics of Computing. |
| 650 | 2 | 4 | |a Discrete Mathematics in Computer Science. |
| 650 | 2 | 4 | |a Symbolic and Algebraic Manipulation. |
| 650 | 2 | 4 | |a Artificial Intelligence. |
| 650 | 2 | 4 | |a Computer Communication Networks. |
| 700 | 1 | |a Královič, Rastislav. |e editor. |0 (orcid)0000-0003-1121-1009 |1 https://orcid.org/0000-0003-1121-1009 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Kůrková, Věra. |e editor. |0 (orcid)0000-0002-8181-2128 |1 https://orcid.org/0000-0002-8181-2128 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031826962 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031826986 |
| 830 | 0 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 15539 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-82697-9 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-SXPS | ||
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-238 | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||
| 950 | |a Springer Nature Proceedings Computer Science (SpringerNature-85344) | ||
| 950 | |a Focus Bundle Foundational Computer Science (SpringerNature-85408) | ||