Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Emanuele Viola

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 Anna Gál

> Home > Persons > Emanuele Viola

Publications

2013
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/GalHKPV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/GalHKPV13
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates. IEEE Trans. Inf. Theory 59(10): 6611-6627 (2013)
2012
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/GalHKPV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/GalHKPV12
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC 2012: 479-494
2011
[i33]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GalHKPV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GalHKPV11
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electron. Colloquium Comput. Complex. TR11 (2011)

a service of

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.