Antal Iványi

most citedReconstruction of complete interval tournaments

5 citations · 8 across the 2 of their papers we have counts for

collaborators

2 papers

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…