Search
Search Results
-
-
Invariant relations for affine loops
Invariant relations are used to analyze while loops; while their primary application is to derive the function of a loop, they can also be used to...
-
-
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
Red–black (RB) trees are one of the most efficient variants of balanced binary search trees. However, they have often been criticized for being too...
-
Distance-edge-monitoring sets of networks
It is important to be able to monitor the network and detect this failure when a connection (an edge) fails. For a vertex set M and an edge e of the...
-
Exact distributed quantum algorithm for generalized Simon’s problem
Simon’s problem is one of the most important problems demonstrating the power of quantum algorithms, as it greatly inspired the proposal of Shor’s...
-
New families of Laplacian borderenergetic graphs
Laplacian matrix and its spectrum are commonly used for giving a measure in networks in order to analyse its topological properties. In this paper,...
-
Approximating subset sum ratio via partition computations
We present a new FPTAS for the Subset Sum Ratio problem, which, given a set of integers, asks for two disjoint subsets such that the ratio of their...
-
Dynamic Logic. New Trends and Applications 5th International Workshop, DaLí 2023, Tbilisi, Georgia, September 15–16, 2023, Revised Selected Papers
This book constitutes the revised selected papers of the 5th International Workshop on Dynamic Logic. New Trends and Applications, DaLí 2023, held in...
-
Unconventional Computation and Natural Computation 21st International Conference, UCNC 2024, Pohang, South Korea, June 17–21, 2024, Proceedings
This book constitutes the proceedings of the 21st International Conference on Unconventional Computation and Natural Computation, UCNC 2024, held in...
-
Mathematics in Programming
The book presents the mathematical view and tools of computer programming with broad and friendly context. It explains the basic concepts such as...
-
Coding Examples from Simple to Complex Applications in Python™
This book provides a comprehensive guide to Python, which stands as the cornerstone of modern programming and is the main computer language driving...
-
On Verifying Concurrent Programs Under Weak Consistency Models: Decidability and Complexity
We present an overview of existing results about the decidability and the complexity of verifying concurrent programs under weak memory consistency...
-
Coverability in Well-Formed Free-Choice Petri Nets
This paper recalls Hack’s two coverability theorems for free-choice Petri nets as well as the history of some of their proofs. It also describes two...
-
SynthLearn: A Tool for Guided Reactive Synthesis
In this paper, we introduce the SynthLearn tool. It implements an algorithm for reactive synthesis using LTL specifications, supplemented with...
-
Hidden Markov Models with Unobservable Transitions
We consider Hidden Markov Models (HMMs) that admit unobservable \(\varepsilon \)...
-
Logic of the Hide and Seek Game: Characterization, Axiomatization, Decidability
The logic of the hide and seek game \(\textsf{LHS}\) was...
-
Kleene Algebra of Weighted Programs with Domain
Weighted programs were recently introduced by Batz et al. (Proc. ACM Program. Lang. 2022) as a generalization of probabilistic programs which can...
-
Axiomatization of Hybrid Logic of Link Variations
In this paper, we investigate local and global dynamic modal operators which have the ability to update the accessibility relation of a model. For...