default search action
Ariane M. Masuda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
- [i2]Santiago Gonzalez, Alireza Amiri Bavandpour, Peter Ye, Edward Zhang, Ruslans Aleksejevs, Todor Antic, Polina Baron, Sujeet Bhalerao, Shubhrajit Bhattacharya, Zachary Burton, John Byrne, Hyungjun Choi, Nujhat Ahmed Disha, Koppány István Encz, Yuchen Fang, Robert Joseph George, Ebrahim Ghorbani
, Alan Goldfarb, Jing Guo, Meghal Gupta, Stefano Huber, Annika Kanckos, Minjung Kang, Hyun Jong Kim, Dino Lorenzini, Levi Lorenzo, Tianyi Mao, Giovanni Marzenta, Ariane M. Masuda, Lukas Mauth, Ana Mickovic, Andres Miniguano-Trujillo, Antoine Moulin, Wenqi Ni, Tomos Parry, Kevin Ren, Hossein Roodbarani, Mathieu Rundström, Manjil Saikia, Detchat Samart, Rebecca Steiner, Connor Stewart, Dhara Thakkar, Jeffrey Tse, Vasiliki Velona, Yunhai Xiang, Sibel Yalçin, Jun Yan, Ji Zeng, Arman Cohan, Quanquan C. Liu:
QEDBENCH: Quantifying the Alignment Gap in Automated Evaluation of University-Level Mathematical Proofs. CoRR abs/2602.20629 (2026) - 2022
- [j9]Ariane M. Masuda
Permutation binomials of the form xr(xq-1 + a) over Fqe. Finite Fields Their Appl. 79: 102003 (2022) - [j8]Juliane Capaverde
Rédei permutations with the same cycle structure. Finite Fields Their Appl. 81: 102046 (2022) - 2020
- [j7]Juliane Capaverde
Rédei permutations with cycles of the same length. Des. Codes Cryptogr. 88(12): 2561-2579 (2020)
2010 – 2019
- 2018
- [j6]Daniele Bartoli
Pure gaps on curves with many rational places. Finite Fields Their Appl. 53: 287-308 (2018) - [i1]Daniele Bartoli, Ariane M. Masuda, Maria Montanucci, Luciane Quoos:
Pure gaps on curves with many rational places. CoRR abs/1804.01086 (2018) - 2016
- [j5]Sandie Han, Ariane M. Masuda
Orphans in Forests of Linear Fractional Transformations. Electron. J. Comb. 23(3): 3 (2016) - [j4]Alonso Sepúlveda
One- and Two-Point Codes Over Kummer Extensions. IEEE Trans. Inf. Theory 62(9): 4867-4872 (2016)
2000 – 2009
- 2008
- [j3]Ariane M. Masuda
Low Complexity Normal Elements over Finite Fields of Characteristic Two. IEEE Trans. Computers 57(7): 990-1001 (2008) - 2007
- [j2]Ariane M. Masuda
Nonexistence of Permutation Binomials of Certain Shapes. Electron. J. Comb. 14(1) (2007) - 2006
- [j1]Ariane M. Masuda, Daniel Panario, Qiang Wang:
The Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes. Electron. J. Comb. 13(1) (2006)
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 2026-05-08 22:55 CEST 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: