The kth prime is greater than k(lnk + ln lnk - 1) for k ≥ 2

On the open problem OQ. 482, II

Octogon Mathematical Magazine

On the open problem OQ. 593

Octogon Mathematical Magazine

On the integer part of n√pk

Octogon Mathematical Magazine

On the primality of n! ± 1 and 2×3×5×...× p±1

Mathematics of Computation

PEREA: towards practical TTP-free revocation in anonymous authentication

Proceedings of the 15th ACM conference on Computer and communications security

Partial linear spaces and identifying codes

European Journal of Combinatorics

PEREA: Practical TTP-free revocation of repeatedly misbehaving anonymous users

ACM Transactions on Information and System Security (TISSEC)

Deterministic polynomial-time algorithms for designing short DNA words

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation

Improved combinatorial group testing for real-world problem sizes

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures