• A New Generating Set Search Algorithm for Partially Separable Functions 

      Frimannslund, Lennart; Steihaug, Trond (Chapter; Peer reviewed, 2010)
      A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...
    • New Key-Recovery Attack on Reduced-Round AES 

      Bardeh, Navid Ghaedi; Rijmen, Vincent Stefaan (Journal article; Peer reviewed, 2022)
      A new fundamental 4-round property of AES, called the zero-difference property, was introduced by Rønjom, Bardeh and Helleseth at Asiacrypt 2017. Our work characterizes it in a simple way by exploiting the notion of related ...
    • New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers 

      Ryland, Ida (Master thesis, 2017-06-20)
      Graphs are important mathematical structures that are used to model many real-life problems. They can, for instance, be used to model relations between objects in a network. An important field of study in graph theory is ...
    • New Results on Minimal Triangulations 

      Villanger, Yngve (Doctoral thesis, 2006-04-25)
    • New Width Parameters of Graphs 

      Vatshelle, Martin (Doctoral thesis, 2012-09-03)
      The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of ...
    • Newsenhancer 

      Nerdal, Sindre Lilland (Master thesis, 2018-08-23)
      This thesis describes a web browser plugin called NewsEnhancer, which has the goal to make it more efficient to read the news. The plugin receives data from a server application, which continuously aggregates meta information ...
    • Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width 

      Bergougnoux, Benjamin; Papadopoulos, Charis; Telle, Jan Arne (Journal article; Peer reviewed, 2022)
      The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects ...
    • Non-Constructivity in Kan Simplicial Sets 

      Bezem, Marc; Coquand, Thierry; Parmann, Erik (Journal article; Peer reviewed, 2015)
      We give an analysis of the non-constructivity of the following basic result: if X and Y are simplicial sets and Y has the Kan extension property, then Y X also has the Kan extension property. By means of Kripke countermodels ...
    • Non-Uniform k-Center and Greedy Clustering 

      Inamdar, Tanmay Nitin; Varadarajan, Kasturi (Journal article; Peer reviewed, 2022)
      In the Non-Uniform k-Center (NUkC) problem, a generalization of the famous k-center clustering problem, we want to cover the given set of points in a metric space by finding a placement of balls with specified radii. In ...
    • Nonlinear feedback shift registers and generating of binary de Bruijn sequences 

      Vivelid, Christian Ebne (Master thesis, 2016-11-21)
    • Norwegian e-Infrastructure for Life Sciences (NeLS) 

      Tekle, Kidane M; Gundersen, Sveinung; Klepper, Kjetil; Bongo, Lars Ailo; Raknes, Inge Alexander; Li, Xiaxi; Zhang, Wei; Andreetta, Christian; Mulugeta, Teshome Dagne; Kalaš, Matúš; Rye, Morten Beck; Hjerde, Erik; Antony Samy, Jeevan Karloss; Fornous, Ghislain; Azab, Abdulrahman; Våge, Dag Inge; Hovig, Eivind; Willassen, Nils Peder; Drabløs, Finn; Nygård, Ståle; Petersen, Kjell; Jonassen, Inge (Peer reviewed; Journal article, 2018)
      The Norwegian e-Infrastructure for Life Sciences (NeLS) has been developed by ELIXIR Norway to provide its users with a system enabling data storage, sharing, and analysis in a project-oriented fashion. The system is ...
    • A Note on Exact Algorithms for Vertex Ordering Problems on Graphs 

      Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M.C.A.; Kratsch, Dieter; Thilikos, Dimitrios M. (Peer reviewed; Journal article, 2011-01-21)
      In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...
    • A note on some algebraic trapdoors for block ciphers 

      Calderini, Marco (Peer reviewed; Journal article, 2018)
      We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it ...
    • Notes on Lattice-Based Cryptography 

      Budroni, Alessandro (Doctoral thesis, 2022-09-06)
      Asymmetrisk kryptering er avhengig av antakelsen om at noen beregningsproblemer er vanskelige å løse. I 1994 viste Peter Shor at de to mest brukte beregningsproblemene, nemlig det diskrete logaritmeproblemet og ...
    • A novel approach to co-expression network analysis identifies modules and genes relevant for moulting and development in the Atlantic salmon louse (Lepeophtheirus salmonis) 

      Zhou, Zhaoran; Eichner, Christiane; Nilsen, Frank; Jonassen, Inge; Dondrup, Michael (Journal article; Peer reviewed, 2021)
      Background The salmon louse (Lepeophtheirus salmonis) is an obligate ectoparasitic copepod living on Atlantic salmon and other salmonids in the marine environment. Salmon lice cause a number of environmental problems and ...
    • A novel CCA attack using decryption errors against LAC 

      Guo, Qian; Johansson, Thomas; Yang, Jing (Peer reviewed; Journal article, 2019)
      Cryptosystems based on Learning with Errors or related problems are central topics in recent cryptographic research. One main witness to this is the NIST Post-Quantum Cryptography Standardization effort. Many submitted ...
    • A novel collaboration platform: Structuring books as networks 

      Steensen, Ole Eskild (Master thesis, 2018-08-21)
      Ever since Gutenberg introduced the art of printing in Europe in the mid 1400s, the way we consume and author books has remained somewhat static. In spite of several technological advances since that time, the very structure ...
    • A Novel Evolutionary Solution Approach for Many-objective Reliability-Redundancy Allocation Problem Based on Objective Prioritization and Constraint Optimization 

      Nath, Rahul (Journal article; Peer reviewed, 2024)
      The reliability redundancy allocation problem (RRAP) has been mostly solved either as a single or as a multi-objective optimization problem. However, this problem also has numerous important constraints which play prominent ...
    • Novice Difficulties with Language Constructs 

      Rosbach, Alexander Hoem (Master thesis, 2013-08-01)
      Programming is a difficult skill to learn, and programming courses have high dropout rates. In this thesis we study the problems that students have during their first introductory programming course at The University of ...
    • NP-scout: Machine learning approach for the quantification and visualization of the natural product-likeness of small molecules 

      Chen, Ya; Stork, Conrad; Hirte, Steffen; Kirchmair, Johannes (Peer reviewed; Journal article, 2019)
      Natural products (NPs) remain the most prolific resource for the development of small-molecule drugs. Here we report a new machine learning approach that allows the identification of natural products with high accuracy. ...