Department

Sort by: Order: Results:

  • Mixed Covering Arrays on Hypergraphs 
    YASMEEN; MAITY, SOUMEN (Springer, 2012-08)
    Mixed covering arrays are natural generalizations of covering arrays that are motivated by applications in software and network testing. A strength three mixed covering array C is a k×n array with the cells of row i is ...
  • Towards the equivalence of Diffie-Hellman problem and discrete logarithm problem for important elliptic curves used in practice 
    KUSHWAHA, PRABHAT (IEEE, 2017-07)
    In this paper, we have improved the existing estimates of the minimum number of group operations required to solve Diffie-Hellman problem for important elliptic curves used in practice. This leads us towards the equivalence ...
  • A Probabilistic Baby-step Giant-step Algorithm 
    Kushwaha, Prabhat; MAHALANOBIS, AYAN (Science and Technology Publications, 2017-07)
    In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative ...
  • A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes 
    KAPSHIKAR, U.; MAHALANOBIS, AYAN (European Commission, 2018-01)
  • The Pillars of Relative Quillen–Suslin Theory 
    BASU, RABEYA; Khanna, Reema; Rao, Ravi A. (Springer Nature, 2020-01)
    We deduce the relative version of the equivalences relating the relative Local-Global Principle and the Normality of the relative Elementary subgroups of the traditional classical groups; viz. general linear, symplectic ...
  • p-adic Asai L-functions Attached to Bianchi Cusp Forms 
    BALASUBRAMANYAM, BASKAR; Ghate, Eknath; Vangala, Ravitheja (Springer Nature, 2020-11)
    We establish a rationality result for the twisted Asai L-values attached to a Bianchi cusp form and construct distributions interpolating these L-values. Using the method of abstract Kummer congruences, we then outline the ...
  • Domination and Cut Problems on Chordal Graphs with Bounded Leafage 
    Galby, Esther; Marx, Dániel; Schepper, Philipp; Sharma, Roohani; TALE, PRAFULLKUMAR (Dagstuhl Publishing, 2022)
    The leafage of a chordal graph G is the minimum integer ℓ such that G can be realized as an intersection graph of subtrees of a tree with ℓ leaves. We consider structural parameterization by the leafage of classical ...
  • Romeo and Juliet Meeting in Forest like Regions 
    Misra, Neeldhara; Mulpuri, Manas; TALE, PRAFULLKUMAR; Viramgami, Gaurav (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2022-12)
    The game of rendezvous with adversaries is a game on a graph played by two players: Facilitator and Divider. Facilitator has two agents and Divider has a team of k ≥ 1 agents. While the initial positions of Facilitator’s ...
  • Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction 
    Krithika, R.; Malu, V. K. Kutty; Sharma, Roohani; TALE, PRAFULLKUMAR (Schloss Dagstuhl, 2023-12)
    A bipartite graph is called a biclique if it is a complete bipartite graph and a biclique is called a balanced biclique if it has equal number of vertices in both parts of its bipartition. In this work, we initiate the ...

Search Repository


Advanced Search

Browse

My Account