default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Pires
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Mika Göös
, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. J. ACM 71(4): 26:1-26:45 (2024)- [j2]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\). SIAM J. Comput. 53(3): 573-587 (2024) - [c6]Yuhao Li, William Pires, Robert Robere:
Intersection Classes in TFNP and Proof Complexity. ITCS 2024: 74:1-74:22 - 2023
- [c5]Rogério Sousa E. Silva, William Pires, Sand Luz Correa, Antonio Oliveira Jr., Kleber Vieira Cardoso:
Dynamic resources allocation in non-3GPP IoT networks involving UAVs. VTC2023-Spring 2023: 1-5 - 2022
- [j1]Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani:
On public-coin zero-error randomized communication complexity. Inf. Process. Lett. 178: 106293 (2022) - [c4]Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao:
Lower Bound Methods for Sign-Rank and Their Limitations. APPROX/RANDOM 2022: 22:1-22:24 - [c3]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. CCC 2022: 33:1-33:15 - [c2]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. FOCS 2022: 1150-1161 - [c1]William Pires, Gabriel Matheus de Almeida, Sand Correa, Cristiano Both, Leizer de Lima Pinto, Kleber Vieira Cardoso:
Bi-objective Optimization for Energy Efficiency and Centralization Level in Virtualized RAN. ICC 2022: 1034-1039 - [i6]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. CoRR abs/2202.07761 (2022) - [i5]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. CoRR abs/2205.02168 (2022) - [i4]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - [i3]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - [i2]Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao:
Lower Bound Methods for Sign-rank and their Limitations. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i1]Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani:
On public-coin zero-error randomized communication complexity. Electron. Colloquium Comput. Complex. TR21 (2021)
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 2024-10-07 21:25 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:
