default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexis Maciel
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j7]Alexis Maciel, Phuong Nguyen, Toniann Pitassi:
Lifting lower bounds for tree-like proofs. Comput. Complex. 23(4): 585-636 (2014)
2000 – 2009
- 2006
- [c8]Alexis Maciel, Toniann Pitassi:
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. LICS 2006: 189-200 - 2004
- [j6]Maria Luisa Bonet
, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs. Comput. Complex. 13(1-2): 47-68 (2004) - 2002
- [j5]Alexis Maciel, Toniann Pitassi, Alan R. Woods:
A New Proof of the Weak Pigeonhole Principle. J. Comput. Syst. Sci. 64(4): 843-872 (2002) - 2000
- [j4]Alexis Maciel, Pierre Péladeau, Denis Thérien:
Programs over semigroups of dot-depth one. Theor. Comput. Sci. 245(1): 135-148 (2000) - [c7]Alexis Maciel, Toniann Pitassi, Alan R. Woods:
A new proof of the weak pigeonhole principle. STOC 2000: 368-377
1990 – 1999
- 1999
- [j3]Alexis Maciel, Denis Thérien:
Efficient Threshold Circuits for Power Series. Inf. Comput. 152(1): 62-73 (1999) - [c6]Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs. CCC 1999: 15-23 - [c5]Richard Beigel, Alexis Maciel:
Circuit Lower Bounds Collapse Relativized Complexity Classes. CCC 1999: 222-226 - 1998
- [j2]Alexis Maciel, Denis Thérien:
Threshold Circuits of Small Majority-Depth. Inf. Comput. 146(1): 55-83 (1998) - 1997
- [j1]Richard Beigel, Alexis Maciel:
Upper and Lower Bounds for Some Depth-3 Circuit Classes. Comput. Complex. 6(3): 235-255 (1997) - [c4]Richard Beigel, Alexis Maciel:
Upper and Lower Bounds for Some Depth-3 Circuit Classes. CCC 1997: 149-157 - [c3]Alexis Maciel, Toniann Pitassi:
On ACC0[pk] Frege Proofs. STOC 1997: 720-729 - [i1]Richard Beigel, Alexis Maciel:
Upper and Lower Bounds for Some Depth-3 Circuit Classes. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [c2]Alexis Maciel, Toniann Pitassi:
Towards lower bounds for bounded-depth Frege proofs with modular connectives. Proof Complexity and Feasible Arithmetics 1996: 195-227 - 1993
- [c1]Alexis Maciel, Denis Thérien:
Threshold Circuits for Iterated Multiplication: Using AC0 for Free. STACS 1993: 545-565
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-08-23 18:33 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:
