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

Author:   Rastislav Královič ,  Věra Kůrková
Publisher:   Springer International Publishing AG
Volume:   15539
ISBN:  

9783031826962


Pages:   353
Publication Date:   16 February 2025
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $155.22 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

Full Product Details

Author:   Rastislav Královič ,  Věra Kůrková
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Volume:   15539
ISBN:  

9783031826962


ISBN 10:   3031826965
Pages:   353
Publication Date:   16 February 2025
Audience:   Professional and scholarly ,  College/higher education ,  Professional & Vocational ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.
Language:   English

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List