Results 81 to 90 of about 855 (105)

Revisiting structure graphs: Applications to CBC-MAC and EMAC

open access: yesJournal of Mathematical Cryptology, 2016
In [2], Bellare, Pietrzak and Rogaway proved an O⁢(ℓ⁢q2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ...
Jha Ashwin, Nandi Mridul
doaj   +1 more source

Inserting One Edge into a Simple Drawing is Hard. [PDF]

open access: yesDiscrete Comput Geom, 2023
Arroyo A   +5 more
europepmc   +1 more source

Matching with Couples: a Multidisciplinary Survey [PDF]

open access: yes
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Flip Klijn, Peter Biro
core  

Completeness for the Complexity Class ∀∃R and Area-Universality. [PDF]

open access: yesDiscrete Comput Geom, 2023
Dobbins MG   +3 more
europepmc   +1 more source

A Regularization Term Based on a Discrete Total Variation for Mathematical Image Processing

open access: yes, 2017
In this paper, a new regularization term is proposed to solve mathematical image problems. By using difference operators in the four directions; horizontal, vertical and two diagonal directions, an estimation of derivative amplitude is found.
Hosseini, Alireza
core  

A novel algebraic technique for adjacency matrices of some derived graphs

open access: yesMathematical and Computer Modelling of Dynamical Systems
Graph energy has been the main concern of spectral graph theory in the last five decades. The classical graph energy is the sum of the absolute values of the eigenvalues of the adjacency matrix. In many research papers, different versions of graph energy
Hacer Ozden Ayna   +5 more
doaj   +1 more source

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]

open access: yesDiscrete Comput Geom, 2023
Casel K   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy