Now showing items 393-412 of 643

    • On relations between CCZ- and EA-equivalences 

      Villa, Irene; Calderini, Marco; Budaghyan, Lilya (Peer reviewed; Journal article, 2020)
      In the present paper we introduce some sufficient conditions and a procedure for checking whether, for a given function, CCZ-equivalence is more general than EA-equivalence together with taking inverses of permutations. ...
    • On Self-Dual Quantum Codes, Graphs, and Boolean Functions 

      Danielsen, Lars Eirik (Master thesis, 2005)
      A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing ...
    • On shared use of renewable stocks 

      Ekerhovd, Nils-Arne; Flåm, Sjur Didrik; Steinshamn, Stein Ivar (Journal article; Peer reviewed, 2020)
      Considered here is multi-party exploitation of common property, renewable resources. The parties play various dynamic games differing in degree of cooperation and commitment. Comparisons of steady states clarify issues on ...
    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (Conference object; Peer reviewed, 2016)
      Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...
    • On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving. 

      Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Wagner, Paul Stankovski (Peer reviewed; Journal article, 2019)
    • On the Boomerang Uniformity of some Permutation Polynomials 

      Calderini, Marco; Villa, Irene (Journal article; Peer reviewed, 2020)
      The boomerang attack, introduced by Wagner in 1999, is a cryptanalysis technique against block ciphers based on differential cryptanalysis. In particular it takes into consideration two differentials, one for the upper ...
    • On the Classification of Hermitian Self-Dual Additive Codes over GF(9) 

      Danielsen, Lars Eirik (Peer reviewed; Journal article, 2012-08)
      Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. ...
    • On the Complexity of Recovering Incidence Matrices 

      Fomin, Fedor; Golovach, Petr; Misra, Pranabendu; Ramanujan, M.S. (Journal article; Peer reviewed, 2020)
      The incidence matrix of a graph is a fundamental object naturally appearing in many applications, involving graphs such as social networks, communication networks, or transportation networks. Often, the data collected about ...
    • On the Distance Between APN Functions 

      Budaghyan, Lilya; Carlet, Claude; Helleseth, Tor; Kaleyski, Nikolay Stoyanov (Journal article; Peer reviewed, 2020)
      We investigate the differential properties of a vectorial Boolean function G obtained by modifying an APN function F . This generalizes previous constructions where a function is modified at a few points. We characterize ...
    • On the EA-classes of known APN functions in small dimensions 

      Calderini, Marco (Journal article; Peer reviewed, 2020)
      Recently Budaghyan et al. (Cryptogr. Commun. 12, 85–100, 2020) introduced a procedure for investigating if CCZ-equivalence can be more general than EA-equivalence together with inverse transformation (when applicable). In ...
    • On the feasibility of distributed systems for interactive visual analysis of omics data 

      Farag, Yehia Mohamed (Master thesis, 2014-06-02)
      The purpose of this thesis is to discuss the feasibility of developing a distributed interactive visual analysis omics system demonstrating how selected modules from the standalone J-Express Modularized application can be ...
    • On the parameterized complexity of deletion to H-free strong components 

      Neogi, Rian; Ramanujan, M.S.; Saurabh, Saket; Sharma, Roohani (Journal article; Peer reviewed, 2020)
      Directed Feedback Vertex Set (DFVS) is a fundamental computational problem that has received extensive attention in parameterized complexity. In this paper, we initiate the study of a wide generalization, the H-SCC Deletion ...
    • On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      In this paper, the privacy of two recent RFID tag ownership transfer protocols are investigated against the tag owners as adversaries. The first protocol called ROTIV is a scheme which provides a privacy-preserving ownership ...
    • On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Linear HB(NLHB) protocol. In contrast to HB, ...
    • On the Tractability of Optimization Problems on H-Graphs 

      Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent (Journal article; Peer reviewed, 2020)
      For a graph H, a graph G is an H-graph if it is an intersection graph of connected subgraphs of some subdivision of H. H-graphs naturally generalize several important graph classes like interval graphs or circular-arc ...
    • On width measures and topological problems on semi-complete digraphs 

      Fomin, Fedor; Pilipczuk, Michal (Peer reviewed; Journal article, 2019)
      The topological theory for semi-complete digraphs, pioneered by Chudnovsky, Fradkin, Kim, Scott, and Seymour [10], [11], [12], [28], [43], [39], concentrates on the interplay between the most important width measures — ...
    • One byte at a time: evidencing the quality of clinical service next-generation sequencing for germline and somatic variants 

      Gutowska-Ding, Maria Weronika; Deans, Zandra C.; Roos, Christophe; Matilainen, Jukka; Khawaja, Farrah; Brügger, Kim; Ahn, Jo Wook; Boustred, Christopher; Patton, Simon J. (Journal article; Peer reviewed, 2020)
      Next-generation sequencing (NGS) is replacing other molecular techniques to become the de facto gene diagnostics approach, transforming the speed of diagnosis for patients and expanding opportunities for precision medicine. ...
    • The Ontology Lookup Service: bigger and better 

      Côté, Richard G.; Reisinger, Florian; Martens, Lennart; Barsnes, Harald; Vizcaíno, Juan Antonio; Hermjakob, Henning (Peer reviewed; Journal article, 2010-05-11)
      The Ontology Lookup Service (OLS; http://www.ebi .ac.uk/ols) has been providing several means to query, browse and navigate biomedical ontologies and controlled vocabularies since it first went into production 4 years ago, ...
    • Optimal preparation of graph states 

      Cabello, Adán; Danielsen, Lars Eirik; López-Tarrida, Antonio J.; Portillo, José R. (Peer reviewed; Journal article, 2011-04-12)
      We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the ...
    • Optimal ternary cyclic codes with minimum distance four and five 

      Li, Nian; Li, Chunlei; Helleseth, Tor; Ding, Cunsheng; Tang, Xiaohu (Journal article, 2014-11)
      Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are ...