Остановите войну!
for scientists:
default search action
Germán Bassi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j7]Sina Molavipour, Hamid Ghourchian, Germán Bassi, Mikael Skoglund:
Neural Estimator of Information for Time-Series Data with Dependency. Entropy 23(6): 641 (2021) - [j6]Borja Rodríguez Gálvez, Germán Bassi, Mikael Skoglund:
Upper Bounds on the Generalization Error of Private Algorithms for Discrete Data. IEEE Trans. Inf. Theory 67(11): 7362-7379 (2021) - [j5]Sina Molavipour, Germán Bassi, Mikael Skoglund:
Neural Estimators for Conditional Mutual Information Using Nearest Neighbors Sampling. IEEE Trans. Signal Process. 69: 766-780 (2021) - [c14]Borja Rodríguez Gálvez, Germán Bassi, Ragnar Thobaben, Mikael Skoglund:
Tighter Expected Generalization Error Bounds via Wasserstein Distance. NeurIPS 2021: 19109-19121 - [i11]Borja Rodríguez Gálvez, Germán Bassi, Ragnar Thobaben, Mikael Skoglund:
Tighter expected generalization error bounds via Wasserstein distance. CoRR abs/2101.09315 (2021) - [i10]Sina Molavipour, Germán Bassi, Mikael Skoglund:
Testing for directed information graphs. CoRR abs/2108.11074 (2021) - 2020
- [c13]Giulia Cervia, Germán Bassi, Mikael Skoglund:
Secure Strong Coordination. CNS 2020: 1-6 - [c12]Sina Molavipour, Germán Bassi, Mikael Skoglund:
Conditional Mutual Information Neural Estimator. ICASSP 2020: 5025-5029 - [c11]Borja Rodríguez Gálvez, Germán Bassi, Ragnar Thobaben, Mikael Skoglund:
On Random Subset Generalization Error Bounds and the Stochastic Gradient Langevin Dynamics Algorithm. ITW 2020: 1-5 - [i9]Borja Rodríguez Gálvez, Germán Bassi, Mikael Skoglund:
Upper Bounds on the Generalization Error of Private Algorithms. CoRR abs/2005.05889 (2020) - [i8]Sina Molavipour, Germán Bassi, Mikael Skoglund:
On Neural Estimators for Conditional Mutual Information Using Nearest Neighbors Sampling. CoRR abs/2006.07225 (2020) - [i7]Giulia Cervia, Germán Bassi, Mikael Skoglund:
Secure Strong Coordination. CoRR abs/2009.01572 (2020) - [i6]Borja Rodríguez Gálvez, Germán Bassi, Ragnar Thobaben, Mikael Skoglund:
On Random Subset Generalization Error Bounds and the Stochastic Gradient Langevin Dynamics Algorithm. CoRR abs/2010.10994 (2020) - [i5]Sina Molavipour, Germán Bassi, Mladen Cicic, Mikael Skoglund, Karl Henrik Johansson:
Causality Graph of Vehicular Traffic Flow. CoRR abs/2011.11323 (2020)
2010 – 2019
- 2019
- [j4]Germán Bassi, Pablo Piantanida, Shlomo Shamai (Shitz):
The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources. Entropy 21(8): 732 (2019) - [j3]Germán Bassi, Pablo Piantanida, Shlomo Shamai Shitz:
The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation. IEEE Trans. Inf. Theory 65(4): 2213-2233 (2019) - [c10]Germán Bassi, Mikael Skoglund:
On the Mutual Information of Two Boolean Functions, with Application to Privacy. ISIT 2019: 1197-1201 - [i4]Sina Molavipour, Germán Bassi, Mikael Skoglund:
Conditional Mutual Information Neural Estimator. CoRR abs/1911.02277 (2019) - 2018
- [c9]Germán Bassi, Mikael Skoglund, Pablo Piantanida:
Lossy Communication Subject to Statistical Parameter Privacy. ISIT 2018: 1031-1035 - 2017
- [c8]Sina Molavipour, Germán Bassi, Mikael Skoglund:
Testing for directed information graphs. Allerton 2017: 212-219 - [c7]Sina Molavipour, Germán Bassi, Mikael Skoglund:
Improved performance bounds for the infinite-dimensional Witsenhausen problem. ACC 2017: 1067-1072 - 2016
- [c6]Germán Bassi, Pablo Piantanida, Shlomo Shamai:
Secret key generation over noisy channels with common randomness. ISIT 2016: 510-514 - [i3]Germán Bassi, Pablo Piantanida, Shlomo Shamai:
Secret Key Generation over Noisy Channels with Common Randomness. CoRR abs/1609.08330 (2016) - 2015
- [j2]Germán Bassi, Pablo Piantanida, Sheng Yang:
Capacity Bounds for a Class of Interference Relay Channels. IEEE Trans. Inf. Theory 61(7): 3698-3721 (2015) - [c5]Germán Bassi, Pablo Piantanida, Shlomo Shamai:
On the capacity of the wiretap channel with generalized feedback. ISIT 2015: 1154-1158 - [c4]Germán Bassi, Pablo Piantanida, Shlomo Shamai:
The wiretap channel with generalized feedback: Secure communication and key generation. ITW Fall 2015: 282-286 - [i2]Germán Bassi, Pablo Piantanida, Shlomo Shamai (Shitz):
The Wiretap Channel with Generalized Feedback: Secure Communication and Key Generation. CoRR abs/1507.07091 (2015) - 2014
- [c3]Germán Bassi, Pablo Piantanida, Sheng Yang:
Constant-gap results and cooperative strategies for a class of Interference Relay Channels. ISIT 2014: 1421-1425 - [i1]Germán Bassi, Pablo Piantanida, Sheng Yang:
Capacity Bounds for a Class of Interference Relay Channels. CoRR abs/1403.3036 (2014) - 2013
- [c2]Germán Bassi, Pablo Piantanida, Sheng Yang:
Capacity to within a constant gap for a class of Interference Relay Channels. Allerton 2013: 1300-1306 - 2012
- [j1]Germán Bassi, Cecilia G. Galarza:
High throughput and low power consumption on a wireless sensor network. Digit. Signal Process. 22(2): 263-268 (2012) - 2010
- [c1]Germán Bassi, Cecilia G. Galarza:
High Throughput on a Sensor Network Using Cooperation. ICC 2010: 1-5
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 2023-09-27 22:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint