default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgo-Erik Riet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Junming Ke, Henk D. L. Hollmann, Ago-Erik Riet:
A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8). ISIT 2024: 2335-2340- [c5]Jüri Lember, Ago-Erik Riet:
Equal Requests are Asymptotically Hardest for Data Recovery. ISIT 2024: 3678-3683 - [i6]Jüri Lember, Ago-Erik Riet:
Equal Requests are Asymptotically Hardest for Data Recovery. CoRR abs/2405.02107 (2024) - [i5]Henk D. L. Hollmann, Martin Puskin, Ago-Erik Riet:
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound. CoRR abs/2407.18124 (2024) - 2023
- [j6]Henk D. L. Hollmann
, Karan Khathuria, Ago-Erik Riet, Vitaly Skachek:
On some batch code properties of the simplex code. Des. Codes Cryptogr. 91(5): 1595-1605 (2023) - 2022
- [j5]Jozefien D'haeseleer, Giovanni Longobardi, Ago-Erik Riet, Leo Storme:
Maximal Sets of $k$-Spaces Pairwise Intersecting in at Least a $(k-2)$-Space. Electron. J. Comb. 29(1) (2022) - [j4]Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas:
Batch Codes for Asynchronous Recovery of Data. IEEE Trans. Inf. Theory 68(3): 1545-1559 (2022) - [c4]Junming Ke, Ago-Erik Riet:
Update and Repair Efficient Storage Codes with Availability via Finite Projective Planes. ISIT 2022: 3268-3273 - 2021
- [i4]Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet, Vitaly Skachek:
On some batch code properties of the simplex code. CoRR abs/2110.07421 (2021)
2010 – 2019
- 2018
- [c3]Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas:
Asynchronous Batch and PIR Codes from Hypergraphs. ITW 2018: 1-5 - [i3]Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas:
Asynchronous Batch and PIR Codes from Hypergraphs. CoRR abs/1806.00592 (2018) - 2016
- [c2]Kristo Visk, Ago-Erik Riet:
Generalisation of Kraft inequality for source coding into permutations. ISIT 2016: 1237-1241 - [i2]Kristo Visk, Ago-Erik Riet:
Permutation codes, source coding and a generalisation of Bollobás-Lubell-Yamamoto-Meshalkin and Kraft inequalities. CoRR abs/1601.07059 (2016) - 2015
- [j3]Jonathan D. Lee, Ago-Erik Riet:
F-saturation games. Discret. Math. 338(12): 2356-2362 (2015) - [j2]Ago-Erik Riet, Jonathan D. Lee:
Graph Saturation Games. Electron. Notes Discret. Math. 50: 349-354 (2015) - [c1]Faruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek:
New bounds for permutation codes in Ulam metric. ISIT 2015: 1726-1730 - [i1]Faruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek:
New Bounds for Permutation Codes in Ulam Metric. CoRR abs/1504.05100 (2015) - 2011
- [j1]Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn:
Completing partial packings of bipartite graphs. J. Comb. Theory A 118(8): 2463-2473 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
