Matthias Zwicker

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 Markus Kettunen

> Home > Persons > Matthias Zwicker

Publications

2016
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/Durand16b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/Durand16b
Marco Manzi, Markus Kettunen, Frédo Durand, Matthias Zwicker, Jaakko Lehtinen:
Temporal gradient-domain path tracing. ACM Trans. Graph. 35(6): 246:1-246:9 (2016)
2015
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/KettunenMALDZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/KettunenMALDZ15
Markus Kettunen, Marco Manzi, Miika Aittala, Jaakko Lehtinen, Frédo Durand, Matthias Zwicker:
Gradient-domain path tracing. ACM Trans. Graph. 34(4): 123:1-123:13 (2015)
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/rt/ManziKALDZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rt/ManziKALDZ15
Marco Manzi, Markus Kettunen, Miika Aittala, Jaakko Lehtinen, Frédo Durand, Matthias Zwicker:
Gradient-Domain Bidirectional Path Tracing. EGSR (EI&I) 2015: 65-74
2014
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/ManziRKLZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/ManziRKLZ14
Marco Manzi, Fabrice Rousselle, Markus Kettunen, Jaakko Lehtinen, Matthias Zwicker:
Improved sampling for gradient-domain metropolis light transport. ACM Trans. Graph. 33(6): 178:1-178:12 (2014)

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.