Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario Goldenbaum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c27]Alex R. Dytso, Mario Goldenbaum, H. Vincent Poor, Shlomo Shamai:
A Dimensionality Reduction Method for Finding Least Favorable Priors with a Focus on Bregman Divergence. AISTATS 2022: 8080-8094- [i7]Alex Dytso, Mario Goldenbaum, H. Vincent Poor, Shlomo Shamai:
A Dimensionality Reduction Method for Finding Least Favorable Priors with a Focus on Bregman Divergence. CoRR abs/2202.11598 (2022) - 2021
- [j7]Muhammad Tariq, Takuro Sato, Gautam Srivastava, Vuk Marojevic, Mario Goldenbaum:
IEEE Access Special Section Editorial: Lightweight Security and Provenance for Internet of Health Things. IEEE Access 9: 67501-67503 (2021)
2010 – 2019
- 2019
- [j6]Alex Dytso
, Mario Goldenbaum, H. Vincent Poor, Shlomo Shamai (Shitz):
Amplitude Constrained MIMO Channels: Properties of Optimal Input Distributions and Bounds on the Capacity. Entropy 21(2): 200 (2019) - [c26]H. Vincent Poor, Mario Goldenbaum, Wei Yang:
Fundamentals for IoT networks: secure and low-latency communications. ICDCN 2019: 362-364 - 2018
- [c25]Alex Dytso, Mario Goldenbaum, H. Vincent Poor, Shlomo Shamai Shitz:
When are discrete channel inputs optimal? - Optimization techniques and some new results. CISS 2018: 1-6 - 2017
- [j5]Wenwen Tu, Mario Goldenbaum, Lifeng Lai, H. Vincent Poor:
On Simultaneously Generating Multiple Keys in a Joint Source-Channel Model. IEEE Trans. Inf. Forensics Secur. 12(2): 298-308 (2017) - [c24]Alex Dytso, Mario Goldenbaum, Shlomo Shamai, H. Vincent Poor:
Upper and Lower Bounds on the Capacity of Amplitude-Constrained MIMO Channels. GLOBECOM 2017: 1-6 - [c23]Alex Dytso, Mario Goldenbaum, H. Vincent Poor, Shlomo Shamai Shitz:
A generalized Ozarow-Wyner capacity bound with applications. ISIT 2017: 1058-1062 - [i6]Alex Dytso, Mario Goldenbaum, Shlomo Shamai, H. Vincent Poor:
Upper and Lower Bounds on the Capacity of Amplitude-Constrained MIMO Channels. CoRR abs/1708.09517 (2017) - 2016
- [c22]Mario Goldenbaum, Holger Boche, H. Vincent Poor:
Secure computation of linear functions over linear discrete multiple-access wiretap channels. ACSSC 2016: 1670-1674 - [c21]Wenwen Tu, Mario Goldenbaum, Lifeng Lai, H. Vincent Poor:
Multiple key generation with restricted public discussion structure. CNS 2016: 641-645 - [c20]Kiril Ralinovski, Mario Goldenbaum, Slawomir Stanczak:
Energy-efficient classification for anomaly detection: The wireless channel as a helper. ICC 2016: 1-6 - [c19]Mario Goldenbaum, Peter Jung, Miruna Raceala-Motoc, Jan Schreck, Slawomir Stanczak, Chan Zhou:
Harnessing channel collisions for efficient massive access in 5G networks: A step forward to practical implementation. ISTC 2016: 335-339 - [c18]Mario Goldenbaum, Holger Boche, H. Vincent Poor:
On secure computation over the binary modulo-2 adder multiple-access wiretap channel. ITW 2016: 21-25 - [c17]Wenwen Tu, Mario Goldenbaum, Lifeng Lai, H. Vincent Poor:
Simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel. ITW 2016: 206-210 - [i5]Mario Goldenbaum, Holger Boche, H. Vincent Poor:
On Secure Computation Over the Binary Modulo-2 Adder Multiple-Access Wiretap Channel. CoRR abs/1603.07227 (2016) - 2015
- [j4]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
Nomographic Functions: Efficient Computation in Clustered Gaussian Sensor Networks. IEEE Trans. Wirel. Commun. 14(4): 2093-2105 (2015) - [c16]Mario Goldenbaum, Rafael F. Schaefer, H. Vincent Poor:
The multiple-access channel with an external eavesdropper: Trusted vs. untrusted users. ACSSC 2015: 564-568 - [c15]Mario Goldenbaum, Slawomir Stanczak, Holger Boche:
On achievable rates for analog computing real-valued functions over the wireless channel. ICC 2015: 4036-4041 - [i4]Kiril Ralinovski, Mario Goldenbaum, Slawomir Stanczak:
Energy-Efficient Classification for Anomaly Detection: The Wireless Channel as a Helper. CoRR abs/1512.04857 (2015) - 2014
- [j3]Mario Goldenbaum, Slawomir Stanczak:
On the Channel Estimation Effort for Analog Computation over Wireless Multiple-Access Channels. IEEE Wirel. Commun. Lett. 3(3): 261-264 (2014) - 2013
- [j2]Mario Goldenbaum, Slawomir Stanczak:
Robust Analog Function Computation via Wireless Multiple-Access Channels. IEEE Trans. Commun. 61(9): 3863-3877 (2013) - [j1]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
Harnessing Interference for Analog Function Computation in Wireless Sensor Networks. IEEE Trans. Signal Process. 61(20): 4893-4906 (2013) - [c14]Steffen Limmer, Slawomir Stanczak, Mario Goldenbaum, Renato L. G. Cavalcante:
Exploiting interference for efficient distributed computation in cluster-based wireless sensor networks. GlobalSIP 2013: 933-936 - [c13]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
Reliable computation of nomographic functions over Gaussian multiple-access channels. ICASSP 2013: 4814-4818 - [i3]Steffen Limmer, Slawomir Stanczak, Mario Goldenbaum, Renato L. G. Cavalcante:
Exploiting Interference for Efficient Distributed Computation in Cluster-based Wireless Sensor Networks. CoRR abs/1309.3139 (2013) - [i2]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
Nomographic Functions: Efficient Computation in Clustered Gaussian Sensor Networks. CoRR abs/1310.7123 (2013) - 2012
- [c12]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
On analog computation of vector-valued functions in clustered wireless sensor networks. CISS 2012: 1-6 - [c11]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
Analog computation via wireless multiple-access channels: Universality and robustness. ICASSP 2012: 2921-2924 - [c10]Slawomir Stanczak, Mario Goldenbaum, Renato L. G. Cavalcante, Federico Penna:
On in-network computation via wireless multiple-access channels with applications. ISWCS 2012: 276-280 - [c9]Meng Zheng, Mario Goldenbaum, Slawomir Stanczak, Haibin Yu:
Fast average consensus in clustered wireless sensor networks by superposition gossiping. WCNC 2012: 1982-1987 - [c8]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
Nomographic gossiping for ƒ-consensus. WiOpt 2012: 130-137 - [c7]Mario Goldenbaum, Slawomir Stanczak:
On multiantenna sensor networks with interference: Energy consumption vs. robustness. WSA 2012: 125-132 - [i1]Mario Goldenbaum, Slawomir Stanczak:
Robust Analog Function Computation via Wireless Multiple-Access Channels. CoRR abs/1210.2967 (2012) - 2011
- [c6]Mario Goldenbaum, Rudi Abi Akl, Stefan Valentin, Slawomir Stanczak:
On the effect of feedback delay in the downlink of multiuser OFDM systems. CISS 2011: 1-6 - [c5]Slawomir Stanczak, Michal Kaliszan, Mario Goldenbaum:
Max-min fair rate control based on a saddle-point characterization of some perron roots. ICASSP 2011: 3112-3115 - [c4]Mario Goldenbaum, Holger Boche, Slawomir Stanczak:
Analyzing the space of functions analog-computable via wireless multiple-access channels. ISWCS 2011: 779-783 - [c3]Slawomir Stanczak, Michal Kaliszan, Mario Goldenbaum:
On distributed power control and transceiver optimization in wireless networks. VALUETOOLS 2011: 244-253 - 2010
- [c2]Mario Goldenbaum, Slawomir Stanczak:
Computing functions via simo multiple-access channels: Howmuch channel knowledge is needed? ICASSP 2010: 3394-3397
2000 – 2009
- 2009
- [c1]Mario Goldenbaum, Slawomir Stanczak, Michal Kaliszan:
On function computation via wireless sensor multiple-access channels. WCNC 2009: 1486-1491
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-05-08 21:45 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:
