Denis Thérien

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alexis Maciel

> Home > Persons > Denis Thérien

Publications

2000
[j21]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/MacielPT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MacielPT00
Alexis Maciel, Pierre Péladeau, Denis Thérien:
Programs over semigroups of dot-depth one. Theor. Comput. Sci. 245(1): 135-148 (2000)
1999
[j20]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/MacielT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/MacielT99
Alexis Maciel, Denis Thérien:
Efficient Threshold Circuits for Power Series. Inf. Comput. 152(1): 62-73 (1999)
1998
[j19]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/MacielT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/MacielT98
Alexis Maciel, Denis Thérien:
Threshold Circuits of Small Majority-Depth. Inf. Comput. 146(1): 55-83 (1998)
1993
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/MacielT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/MacielT93
Alexis Maciel, Denis Thérien:
Threshold Circuits for Iterated Multiplication: Using AC0 for Free. STACS 1993: 545-565

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.