Pulkit Sharma

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 Olivier Absil

> Home > Persons > Pulkit Sharma

Publications

2016
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AbrolAAAAABBBBB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AbrolAAAAABBBBB16
Vinayak Abrol, Olivier Absil, Pierre-Antoine Absil, Sandrine Anthoine, Philippe Antoine, Thomas Arildsen, Nancy Bertin, Folkert Bleichrodt, Jérôme Bobin, Anne Bol, Antoine Bonnefoy, Francesco Caltagirone, Valerio Cambareri, Cecile Chenot, Vladimir S. Crnojevic, Marie Danková, Kévin Degraux, Jens Eisert, Mohamed-Jalal Fadili, Marylou Gabrié, Nicolas Gac, Daniele Giacobello, Carlos A. Gomez Gonzalez, Adriana Gonzalez, Pierre-Yves Gousenbourger, Mads Græsbøll Christensen, Rémi Gribonval, Stéphanie Guérit, Shaoguang Huang, Paul Irofti, Laurent Jacques, Ulugbek S. Kamilov, Srdan Kitic, Martin Kliesch, Florent Krzakala, John A. Lee, Wenzhi Liao, Tobias Lindstrøm Jensen, Andre Manoel, Hassan Mansour, Ali Mohammad-Djafari, Amirafshar Moshtaghpour, Fred Maurice Ngolè Mboula, Benoît Pairet, Marko Panic, Gabriel Peyré, Aleksandra Pizurica, Pavel Rajmic, Matthieu Roblin, Ingo Roth, Anil Kumar Sao, Pulkit Sharma, Jean-Luc Starck, Eric W. Tramel, Toon van Waterschoot, Dejan Vukobratovic, Li Wang, Benedikt Wirth, Gerhard Wunder, Hongyan Zhang:
Proceedings of the third "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'16). CoRR abs/1609.04167 (2016)

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.