default search action
Alain Tapp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j13]Ulrich Aïvodji, François Bidet
, Sébastien Gambs, Rosin Claude Ngueveu, Alain Tapp:
Local Data Debiasing for Fairness Based on Generative Adversarial Training. Algorithms 14(3): 87 (2021) - 2020
- [i22]Hansenclever F. Bassani, Renie A. Delgado, José Nilton de O. Lima Junior, Heitor R. Medeiros, Pedro H. M. Braga, Alain Tapp:
Learning to Play Soccer by Reinforcement and Applying Sim-to-Real to Compete in the Real World. CoRR abs/2003.11102 (2020) - [i21]Hansenclever F. Bassani, Renie A. Delgado, José Nilton de O. Lima Junior, Heitor R. Medeiros, Pedro H. M. Braga, Mateus G. Machado, Lucas H. C. Santos, Alain Tapp:
A Framework for Studying Reinforcement Learning and Sim-to-Real in Robot Soccer. CoRR abs/2008.12624 (2020)
2010 – 2019
- 2019
- [j12]Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger:
Noisy Interactive Quantum Communication. SIAM J. Comput. 48(4): 1147-1195 (2019) - [c21]Gabriele Prato, Mathieu Duchesneau, Sarath Chandar, Alain Tapp:
Towards Lossless Encoding of Sentences. ACL (1) 2019: 1577-1583 - [c20]Ulrich Aïvodji, Hiromi Arai, Olivier Fortineau, Sébastien Gambs, Satoshi Hara, Alain Tapp:
Fairwashing: the risk of rationalization. ICML 2019: 161-170 - [i20]Ulrich Aïvodji, Hiromi Arai, Olivier Fortineau, Sébastien Gambs, Satoshi Hara, Alain Tapp:
Fairwashing: the risk of rationalization. CoRR abs/1901.09749 (2019) - [i19]Gabriele Prato, Mathieu Duchesneau, Sarath Chandar, Alain Tapp:
Towards Lossless Encoding of Sentences. CoRR abs/1906.01659 (2019) - [i18]Ulrich Aïvodji, François Bidet, Sébastien Gambs, Rosin Claude Ngueveu, Alain Tapp:
Agnostic data debiasing through a local sanitizer learnt from an adversarial network approach. CoRR abs/1906.07858 (2019) - [i17]David Macêdo, Tsang Ing Ren, Cleber Zanchettin, Adriano L. I. Oliveira, Alain Tapp, Teresa Bernarda Ludermir:
Distinction Maximization Loss: Fast, Scalable, Turnkey, and Native Neural Networks Out-of-Distribution Detection simply by Replacing the SoftMax Loss. CoRR abs/1908.05569 (2019) - 2016
- [c19]Samuel Ranellucci, Alain Tapp, Rasmus Winther Zakarias:
Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract). ICITS 2016: 190-212 - [r2]Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum Algorithm for the Collision Problem. Encyclopedia of Algorithms 2016: 1662-1664 - 2015
- [c18]Bernardo Machado David, Ryo Nishimaki, Samuel Ranellucci, Alain Tapp:
Generalizing Efficient Multiparty Computation. ICITS 2015: 15-32 - [i16]Bernardo David, Ryo Nishimaki, Samuel Ranellucci, Alain Tapp:
Generalizing Efficient Multiparty Computation. IACR Cryptol. ePrint Arch. 2015: 135 (2015) - 2014
- [c17]Sébastien Gambs, Samuel Ranellucci, Alain Tapp:
The Crypto-Democracy and the Trustworthy (Position Paper). DPM/SETOP/QASA 2014: 58-76 - [c16]Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger:
Noisy Interactive Quantum Communication. FOCS 2014: 296-305 - [i15]Sébastien Gambs, Samuel Ranellucci, Alain Tapp:
The Crypto-democracy and the Trustworthy. CoRR abs/1409.2432 (2014) - [i14]Alain Tapp:
A new approach in machine learning. CoRR abs/1409.4044 (2014) - [i13]Samuel Ranellucci, Alain Tapp, Rasmus Winther Zakarias:
Efficient Generic Zero-Knowledge Proofs from Commitments. IACR Cryptol. ePrint Arch. 2014: 934 (2014) - 2013
- [j11]Tal Mor, Alain Tapp:
Preface. Nat. Comput. 12(1): 1-4 (2013) - [j10]Tal Mor, Alain Tapp:
Preface. Theor. Comput. Sci. 486: 1-3 (2013) - [j9]Richard Cleve, Wim van Dam, Michael Nielsen
Quantum entanglement and the communication complexity of the inner product function. Theor. Comput. Sci. 486: 11-19 (2013) - [j8]Viktor Galliard, Alain Tapp, Stefan Wolf
Deterministic quantum non-locality and graph colorings. Theor. Comput. Sci. 486: 20-26 (2013) - [i12]Gilles Brassard, Alain Tapp, Dave Touchette:
Noisy Interactive Quantum Communication. CoRR abs/1309.2643 (2013) - [i11]Samuel Ranellucci, Alain Tapp:
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer. IACR Cryptol. ePrint Arch. 2013: 99 (2013) - 2012
- [j7]Hugue Blier, Alain Tapp:
A Quantum Characterization Of NP. Comput. Complex. 21(3): 499-510 (2012) - [c15]Anne Broadbent, Stacey Jeffery, Samuel Ranellucci, Alain Tapp:
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority. ICITS 2012: 14-36 - 2011
- [c14]Claude Crépeau, Louis Salvail, Jean-Raymond Simard, Alain Tapp:
Two Provers in Isolation. ASIACRYPT 2011: 407-430 - [c13]Samuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger:
On the Efficiency of Bit Commitment Reductions. ASIACRYPT 2011: 520-537 - [i10]Gilles Brassard, Frédéric Dupuis, Sébastien Gambs, Alain Tapp:
An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance. CoRR abs/1106.4267 (2011) - [i9]Samuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger:
On the Efficiency of Bit Commitment Reductions. IACR Cryptol. ePrint Arch. 2011: 324 (2011) - 2010
- [i8]Anne Broadbent, Stacey Jeffery
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters. CoRR abs/1011.5242 (2010) - [i7]Anne Broadbent, Stacey Jeffery, Alain Tapp:
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters. IACR Cryptol. ePrint Arch. 2010: 600 (2010)
2000 – 2009
- 2009
- [i6]Hugue Blier, Alain Tapp:
A Single Initialization Server for Multi-Party Cryptography. IACR Cryptol. ePrint Arch. 2009: 99 (2009) - 2008
- [j6]Anne Broadbent, Alain Tapp:
Can quantum mechanics help distributed computing? SIGACT News 39(3): 67-76 (2008) - [c12]Hugue Blier, Alain Tapp:
A Single Initialization Server for Multi-party Cryptography. ICITS 2008: 71-85 - [r1]Alain Tapp:
Quantum Algorithm for the Collision Problem. Encyclopedia of Algorithms 2008 - [i5]Anne Broadbent, Alain Tapp:
Information-Theoretically Secure Voting Without an Honest Majority. CoRR abs/0806.1931 (2008) - [i4]Anne Broadbent, Alain Tapp:
Information-Theoretically Secure Voting Without an Honest Majority. IACR Cryptol. ePrint Arch. 2008: 266 (2008) - 2007
- [c11]Anne Broadbent, Alain Tapp:
Information-Theoretic Security Without an Honest Majority. ASIACRYPT 2007: 410-426 - [c10]Gilles Brassard, Anne Broadbent, Joseph F. Fitzsimons, Sébastien Gambs, Alain Tapp:
Anonymous Quantum Communication. ASIACRYPT 2007: 460-473 - [c9]Gilles Brassard, Anne Broadbent, Joseph F. Fitzsimons, Sébastien Gambs, Alain Tapp:
Anonymous Quantum Communication - (Extended Abstract). ICITS 2007: 181-182 - [i3]Anne Broadbent, Alain Tapp:
Information-theoretic security without an honest majority. CoRR abs/0706.2010 (2007) - 2005
- [j5]Gilles Brassard, André Allan Méthot, Alain Tapp:
Minimum entangled state dimension required for pseudo-telepathy. Quantum Inf. Comput. 5(4): 275-284 (2005) - [j4]Gilles Brassard, Anne Broadbent, Alain Tapp:
Recasting mermin's multi-player game into the framework of pseudo-telepathy. Quantum Inf. Comput. 5(7): 538-550 (2005) - 2003
- [c8]Gilles Brassard, Anne Broadbent, Alain Tapp:
Multi-party Pseudo-Telepathy. WADS 2003: 1-11 - 2002
- [j3]Michele Mosca, Alain Tapp:
Introduction. Algorithmica 34(4): 309-313 (2002) - [c7]Howard Barnum, Claude Crépeau, Daniel Gottesman
Authentication of Quantum Messages. FOCS 2002: 449-458 - [i2]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. CoRR quant-ph/0205128 (2002) - [i1]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. IACR Cryptol. ePrint Arch. 2002: 82 (2002) - 2000
- [j2]Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp:
Reversible Space Equals Deterministic Space. J. Comput. Syst. Sci. 60(2): 354-367 (2000) - [c6]Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf:
Private Quantum Channels. FOCS 2000: 547-553
1990 – 1999
- 1998
- [c5]Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum Counting. ICALP 1998: 820-831 - [c4]Gilles Brassard, Peter Høyer
Quantum Cryptanalysis of Hash and Claw-Free Functions. LATIN 1998: 163-169 - [c3]Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp:
Quantum Entanglement and the Communication Complexity of the Inner Product Function. QCQC 1998: 61-74 - 1997
- [j1]Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum cryptanalysis of hash and claw-free functions. SIGACT News 28(2): 14-19 (1997) - [c2]Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp:
Reversible Space Equals Deterministic Space. CCC 1997: 45-50 - 1995
- [c1]Claude Crépeau, Jeroen van de Graaf, Alain Tapp:
Committed Oblivious Transfer and Private Multi-Party Computation. CRYPTO 1995: 110-123
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-10-07 21:24 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: