dblp: Arthur da Cunha 0001 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

Arthur Carvalho Walraven da Cunha

• > Home > Persons

Person information

• affiliation: Aarhus University, Department of Computer Science, Aarhus, Denmark
• affiliation (PhD 2023): Côte d'Azur University, Nice, France

Other persons with a similar name

• Arthur L. A. da Cunha — Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Rio de Janeiro, RJ, Brazil
• Arthur L. da Cunha — University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, Urbana, IL, USA
• Arthur Anthony da Cunha Romão E. Silva — Federal University of Rio Grande do Norte, Natal, RN, Brazil

SPARQL queries

🛈 Please note that only 61% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

2020 – today

• 2026
• 
  [i6]
  • 
  • 
  • 
  • 
    Arthur da Cunha, Mikael Møller Høgsgaard, Andrea Paudice:
    Sample-Near-Optimal Agnostic Boosting with Improved Running Time. CoRR abs/2601.11265 (2026)
• 2025
• 
  [c6]
  Arthur da Cunha, Kasper Green Larsen, Martin Ritzert:
  Boosting, Voting Classifiers and Randomized Sample Compression Schemes. ALT 2025: 390-404
• 
  [i5]
  • 
  • 
  • 
  • 
    Arthur da Cunha, Mikael Møller Høgsgaard, Andrea Paudice, Yuxin Sun:
    Revisiting Agnostic Boosting. CoRR abs/2503.09384 (2025)
• 2024
• 
  [c5]
  Arthur da Cunha, Mikael Møller Høgsgaard, Kasper Green Larsen:
  Optimal Parallelization of Boosting. NeurIPS 2024
• 
  [i4]
  • 
  • 
  • 
  • 
    Arthur da Cunha, Kasper Green Larsen, Martin Ritzert:
    Boosting, Voting Classifiers and Randomized Sample Compression Schemes. CoRR abs/2402.02976 (2024)
• 
  [i3]
  • 
  • 
  • 
  • 
    Arthur da Cunha, Mikael Møller Høgsgaard, Kasper Green Larsen:
    Optimal Parallelization of Boosting. CoRR abs/2408.16653 (2024)
• 2023
• 
  [b1]
  Arthur Carvalho Walraven da Cunha:
  Pruning random structures. (Élagage des structures aléatoires). Côte d'Azur University, Nice, France, 2023
• 
  [c4]
  • 
  • 
  • 
  • 
    Arthur Carvalho Walraven da Cunha, Francesco d'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, Laurent Viennot:
    Revisiting the Random Subset Sum Problem. ESA 2023: 37:1-37:11
• 
  [c3]
  Arthur da Cunha, Francesco d'Amore, Emanuele Natale:
  Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets. NeurIPS 2023
• 
  [c2]
  • 
  • 
  • 
  • 
    Arthur Carvalho Walraven da Cunha, Emanuele Natale, Laurent Viennot:
    Neural Network Information Leakage Through Hidden Learning. OLA 2023: 117-128
• 
  [i2]
  • 
  • 
  • 
  • 
    Arthur da Cunha, Francesco d'Amore, Emanuele Natale:
    Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets. CoRR abs/2311.09858 (2023)
• 2022
• 
  [c1]
  Arthur da Cunha, Emanuele Natale, Laurent Viennot:
  Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks. ICLR 2022
• 
  [i1]
  • 
  • 
  • 
  • 
    Luca Becchetti, Arthur Carvalho Walraven da Cunha, Andrea Clementi, Francesco d'Amore, Hicham Lesfari, Emanuele Natale, Luca Trevisan:
    On the Multidimensional Random Subset Sum Problem. CoRR abs/2207.13944 (2022)

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).

load links from unpaywall.org

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).

load content from archive.org

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 .

load data from openalex.org

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.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: