🧭 New here?
Take a guided tour of the site.
6 1950s 12 1960s 36 1970s 43 1980s 56 1990s 74 2000s 399 2010s 441 2020s
18 papers · Milutin Obradović · 2020s Page 1 of 1
Milutin Obradović, Nikola Tuneski, Paweł Zaprawa · 2026 arXiv ↗
5 theorems bi-univalent
Milutin Obradović, Nikola Tuneski, Paweł Zaprawa · 2026 arXiv ↗
7 theorems
Milutin Obradović, Nikola Tuneski · 2025 arXiv ↗
16 claims 4 theorems strongly starlike cryptography
Milutin Obradović and Nikola Tuneski · 2024 arXiv ↗
12 claims 6 theorems
Milutin Obradović, Nikola Tuneski · 2024 arXiv ↗
9 theorems
Milutin Obradović, Nikola Tuneski · 2024 arXiv ↗
7 theorems cryptography
Milutin Obradović, Nikola Tuneski · 2021 link ↗
7 theorems
Milutin Obradović, Nikola Tuneski, Pawel Zaprawa · 2020 arXiv ↗
4 claims 4 theorems bounded turning
Milutin Obradović, Nikola Tuneski · 2020 arXiv ↗
4 claims 4 theorems close-to-convex bounded turning
Nikola Tuneski, Milutin Obradović · 2020 arXiv ↗
1 theorems close-to-convex
Milutin Obradović, Nikola Tuneski · 2020 arXiv ↗
1 theorems close-to-convex engineering
Milutin Obradović, Nikola Tuneski · 2020 arXiv ↗
7 claims 4 theorems cryptography engineering
Suggesting a paper: paper ingestion is reviewed offline so the public registry remains a reproducible release snapshot. Please send the paper URL through the project feedback channel rather than expecting immediate indexing.
↑↓ navigate↵ openesc closeall results
✦ 293 explorers have wandered the registry - thanks for stopping by. Tell us what you'd like to see →
Usage & privacy

We use first-party site metrics to improve navigation: page visits, internal clicks, search result counts (not search terms), and approximate active time. A random tab ID groups events for seven days; GPC/DNT turns this off. The separate visitor count uses a self-hosted pseudonymous fingerprint and also respects GPC/DNT.

💬 Feedback