SOFSEM 2025: Theory and Practice of Computer Science
Springer International Publishing (Verlag)
978-3-031-82669-6 (ISBN)
- Noch nicht erschienen - erscheint am 25.02.2025
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
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.Invited talks.- Distributed Computing by Mobile Robots: Exploring the Computational Landscape.- Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs.- Contributed Papers.- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints.- Online b-Matching with Stochastic Rewards.- Shortest Longest-Path Graph Orientations for Trees.- Parameterized Complexity of Generalizations of Edge Dominating Set.-
Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking.- On the Complexity of Minimum Membership Dominating Set.- On the Structural Parameterized Complexity of Defective Coloring.- Dynamic Range Minimum Queries on the Ultra-Wide Word RAM.- Fast Practical Compression of Deterministic Finite Automata.- Orienteering (with Time Windows) on Restricted Graph Classes.- Massively Parallel Maximum Coverage Revisited.- Distance Vector Domination.- Sufficient conditions for polynomial-time detection of induced minors.- Pathways to Tractability for Geometric Thickness.- Minimum Monotone Spanning Trees.- Symvonis and Alexander Wol
Representing Hypergraphs by Point-Line Incidences.- Reachability in temporal graphs under perturbation.- On Computational Completeness of Semi-Conditional Matrix Grammars.- Outer-(ap)RAC Graphs.- Forest Covers and Bounded Forest Covers.- Multi-Agent Search-Type Problems on Polygons.- Generation of Cycle Permutation Graphs and Permutation Snarks.- Expected Density of Random Minimizers.
| Erscheint lt. Verlag | 25.2.2025 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XIX, 350 p. 61 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Schlagworte | algorithms • Automata • Computability • Computational Complexity • computational complexity and cryptography • Computational Learning • Decidability • design and analysis of algorithms • efficient data structures • formal languages and automata theory • graph structure and algorithms • Logic • machine learning • Models of Computation • Program Synthesis • Quantum Computing • randomness, geometry and discrete structures • semantics and reasoning • Structural Complexity • Theory and algorithms for application domains |
| ISBN-10 | 3-031-82669-8 / 3031826698 |
| ISBN-13 | 978-3-031-82669-6 / 9783031826696 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
