A. Iványi

activity

20102013

most citedReconstruction of complete interval tournaments

5 citations · 20 across the 9 of their papers we have counts for

collaborators

Showing 2010Show all

5 papers · 1 filter

math.CO2010★ 3 cited

Imbalances in directed multigraphs

S. Pirzada, T. A. Naikoo, U. Samee +1

In a directed multigraph, the imbalance of a vertex $v_{i}$ is defined as $b_{v_{i}} = d_{v_{i}}^{+} - d_{v_{i}}^{-}$ , where $d_{v_{i}}^{+}$ and $d_{v_{i}}^{-}$ denote the outdegree an…

cs.DM2010

Score lists in multipartite hypertournaments

Shariefuddin Pirzada, Guofei Zhou, Antal Iványi

Given non-negative integers $n_{i}$ and $α_{i}$ with $0 \leq α_{i} \leq n_{i}$ $(i = 1, 2, ..., k)$ , an $[α_{1}, α_{2}, ..., α_{k}]$ - $k$ -partite hypertournament on $\sum_{1}^{k} n_{i}$ vertic…

cs.DS2010

Testing of sequences by simulation

Antal Iványi, Balázs Novák

Let $ξ$ be a random integer vector, having uniform distribution \[\mathbf{P} \{ξ= (i_1,i_2,...,i_n) = 1/n^n \} \ \hbox{for} \ 1 \leq i_1,i_2,...,i_n\leq n.\] A realization $(i_1,i_…

cs.DM2010★ 5 cited

Reconstruction of complete interval tournaments

Antal Iványi

Let $a, b$ and $n$ be nonnegative integers $(b \geq a, b > 0, n \geq 1)$ , $G_{n} (a, b)$ be a multigraph on $n$ vertices in which any pair of vertices is connected with a…

cs.OS2010★ 3 cited

FIFO anomaly is unbounded

Peter Fornai, Antal Ivanyi

Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increa…