default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Kaliszan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c14]Michal Kaliszan, Giuseppe Caire, Slawomir Stanczak:
On the throughput rate of wireless multipoint multicasting. ISIT 2016: 2998-3002- 2013
- [c13]Michal Kaliszan, Jafar Mohammadi, Slawomir Stanczak:
Cross-layer security in two-hop wireless Gaussian relay network with untrusted relays. ICC 2013: 2199-2204 - 2012
- [c12]Jafar Mohammadi, Michal Kaliszan, Slawomir Stanczak, Jan Schreck:
Secrecy capacity limits of multiple antenna multiple eavesdropper multicast. ACSCC 2012: 1896-1900 - [c11]Michal Kaliszan, Emmanuel Pollakis, Slawomir Stanczak:
Multigroup multicast with application-layer coding: Beamforming for maximum weighted sum rate. WCNC 2012: 2270-2275 - 2011
- [c10]Qi Liao, Michal Kaliszan, Slawomir Stanczak:
A Virtual Soft Handover Method Based on Base Station Cooperation with Fountain Codes. EW 2011 - [c9]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 - [c8]Michal Kaliszan, Emmanuel Pollakis, Slawomir Stanczak:
Efficient beamforming algorithms for MIMO multicast with application-layer coding. ISIT 2011: 928-932 - [c7]Slawomir Stanczak, Michal Kaliszan, Mario Goldenbaum:
On distributed power control and transceiver optimization in wireless networks. VALUETOOLS 2011: 244-253 - 2010
- [j1]Slawomir Stanczak, Michal Kaliszan, Nicholas Bambos
:
A characterization of max-min SIR-balanced power allocation with applications. Wirel. Networks 16(8): 2335-2347 (2010) - [c6]Michal Kaliszan, Slawomir Stanczak, Nicholas Bambos:
Admission control for autonomous wireless links with power constraints. ICASSP 2010: 3138-3141
2000 – 2009
- 2009
- [c5]Michal Kaliszan, Marcin Wiczanowski, Slawomir Stanczak, Nicholas Bambos:
A characterization of max-min SIR-balanced power allocation with applications. ISIT 2009: 2747-2751 - [c4]Daniel Tomecki, Slawomir Stanczak, Michal Kaliszan:
Low complexity power control and beamforming for multigroup multicast MIMO downlink channel. WCNC 2009: 918-923 - [c3]Mario Goldenbaum, Slawomir Stanczak, Michal Kaliszan:
On function computation via wireless sensor multiple-access channels. WCNC 2009: 1486-1491 - [i2]Slawomir Stanczak, Michal Kaliszan, Nicholas Bambos, Marcin Wiczanowski:
A Characterization of Max-Min SIR-Balanced Power Allocation with Applications. CoRR abs/0901.0824 (2009) - [i1]Slawomir Stanczak, Michal Kaliszan, Nicholas Bambos:
Decentralized Admission Control for Power-Controlled Wireless Links. CoRR abs/0907.2896 (2009) - 2008
- [c2]Slawomir Stanczak, Michal Kaliszan, Nicholas Bambos:
Admission control for power-controlled wireless networks under general interference functions. ACSCC 2008: 900-904 - [c1]Slawomir Stanczak, Michal Kaliszan:
Some bounds on the network outage probability in wireless networks. CISS 2008: 396-401
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-04-24 23:20 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:
