Blar i Department of Informatics på tittel
Viser treff 130-149 av 981
-
Comparison of RNA-folding structures, in-vivo, in-vitro and in-silico
(Master thesis, 2019-10-31)The main objective of the work has been to develop the understanding of the difference between RNA structure probing approaches; in vivo, in vitro and in silico. Similarities and differences between three libraries of data ... -
Comparison of Solving Techniques for Non-linear Sparse Equations over Finite Fields with Application in Cryptanalysis
(Master thesis, 2008)The work on this thesis gives a summary of the Gluing/Agreeing techniques, as well as a reference implementation of this methods. Furthermore widely used SAT-solving techniques are explained and a short insight to the ... -
A Comparison of Vertex and Edge Partitioning Approaches for Parallel Maximal Matching
(Master thesis, 2013-12-09)This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edge partitioning, using a distributed memory system. Previous studies on the parallelization of graphs has often been focused ... -
Compiler Support for Parallel Evaluation of C++ Constant Expressions
(Journal article; Peer reviewed, 2023)Metaprogramming, the practice of writing programs that manipulate other programs at compile-time, continues to impact software development; enabling new approaches to optimisation, static analysis, and reflection. Nevertheless, ... -
A complexity dichotomy for critical values of the b-chromatic number of graphs
(Journal article; Peer reviewed, 2020)A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph G has ... -
A complexity dichotomy for critical values of the b-chromatic number of graphs
(Peer reviewed; Journal article, 2019-08-20)A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph G has ... -
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
(Journal article; Peer reviewed, 2019)In the Directed Steiner Network problem we are given an arc-weighted digraph G, a set of terminals T subseteq V(G) with |T|=q, and an (unweighted) directed request graph R with V(R)=T. Our task is to output a subgraph H ... -
Composition of multilevel domain-specific modelling languages
(Journal article; Peer reviewed, 2023)Multilevel Modelling (MLM) approaches make it possible for designers and modellers to work with an unlimited number of abstraction levels to specify their domain-specific modelling languages (DSMLs). To fully exploit MLM ... -
Compound Logics for Modification Problems
(Journal article; Peer reviewed, 2023)We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with ... -
Compressing permutation groups into grammars and polytopes. A graph embedding approach
(Journal article; Peer reviewed, 2020)It can be shown that each permutation group G ⊑ 𝕊_n can be embedded, in a well defined sense, in a connected graph with O(n+|G|) vertices. Some groups, however, require much fewer vertices. For instance, 𝕊_n itself can ... -
Computation of Treespan. A Generalization of Bandwidth to Treelike Structures
(Master thesis, 2012-06-14)Motivated by a search game, Fomin, Heggernes and Telle [Algorithmica, 2005] defined the graph parameter treespan, a generalization of the well studied parameter bandwidth. Treespan is the maximum number of appearances of ... -
Computational analysis of the evolutionary dynamics of proteins on a genomic scale
(Doctoral thesis, 2007-01-16)Biology is primarily concerned with the study of all phenotypic aspects of living organisms and evolutionary biology is more specifically interested in elucidating how different phenotypes evolved. Proteins (and RNA ... -
Computational complexity aspects of super domination
(Journal article; Peer reviewed, 2023)Let G be a graph. A dominating set D ⊆ V (G) is a super dominating set if for every vertex x ∈ V (G) \ D there exists y ∈ D such that NG (y) ∩ (V (G) \ D)) = {x}. The cardinality of a smallest super dominating set of G is ... -
Computational Science in the 17th Century. Numerical Solution of Algebraic Equations: Digit–by–Digit Computation
(Chapter, 2022)In this paper we give a complete overview of test–problems by Viète from 1600, Harriot from 1631 and Oughtred from 1647. The original material is not easily accessible due to archaic language and lack of conciseness. Viéte’s ... -
Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745
(Peer reviewed; Journal article, 2020)This is an overview of examples and problems posed in the late 1600s up to the mid 1700s for the purpose of testing or explaining the two different implementations of the Newton-Raphson method, Newton’s method as described ... -
Computational searches for quadratic APN functions with subfield coefficients
(Master thesis, 2023-06-01)Almost perfect nonlinear (APN) functions are important in fields such as algebra, combinatorics, cryptography, etc. Finding new APN functions is of special importance in cryptography. This is because when used in modern ... -
Computing Complexity Measures of Degenerate Graphs
(Journal article; Peer reviewed, 2023)We show that the VC-dimension of a graph can be computed in time n^{⌈log d+1⌉} d^{O(d)}, where d is the degeneracy of the input graph. The core idea of our algorithm is a data structure to efficiently query the number of ... -
Computing Connected Components on Multiple GPUs
(Master thesis, 2018-12-19)We look at multiple GPU programming, using the connected components algorithm as the basis when we look into libraries and runtime environment for multiple GPU programming. We also show that Rem is a fast parallel algorithm, ... -
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
(Peer reviewed; Journal article, 2013)The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ... -
Computing minimal triangulation in Time o(n^2.376)
(Journal article, 2005)