default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Kói
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j5]Imre Csiszár
, Lóránt Farkas, Tamás Kói:
Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism. IEEE Trans. Inf. Theory 67(12): 7684-7707 (2021)
2010 – 2019
- 2019
- [c9]Lóránt Farkas, Tamás Kói:
Two Contributions to Error Exponents for Asynchronous Multiple Access Channel. ISIT 2019: 2664-2668 - [i4]Lóránt Farkas, Tamás Kói:
Error Exponents for Asynchronous Multiple Access Channels. Controlled Asynchronism may Outperform Synchronism. CoRR abs/1907.05139 (2019) - 2018
- [j4]Lóránt Farkas, Tamás Kói:
Universal Random Access Error Exponents for Codebooks of Different Blocklengths. IEEE Trans. Inf. Theory 64(4): 2240-2252 (2018) - [c8]Lóránt Farkas, Tamás Kói:
Contributions to Successive Decoding for Multiple Access Channels. ISITA 2018: 570-574 - 2017
- [c7]Lóránt Farkas, Tamás Kói, Imre Csiszár:
Error exponents for sparse communication. ISIT 2017: 3145-3149 - [c6]Lóránt Farkas, Tamás Kói:
Universal random access error exponents for codebooks with different word-lengths. ISIT 2017: 3150-3154 - 2016
- [i3]Lóránt Farkas, Tamás Kói:
Universal Random Access Error Exponent for Codebooks with Different Word-Lengths. CoRR abs/1607.01935 (2016) - 2015
- [j3]Lóránt Farkas, Tamás Kói:
Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels. IEEE Trans. Inf. Theory 61(6): 3029-3040 (2015) - [c5]Lóránt Farkas, Tamás Kói:
Controlled asynchronism improves error exponent. ISIT 2015: 2638-2642 - 2014
- [j2]Lóránt Farkas, Tamás Kói:
On capacity regions of discrete asynchronous multiple access channels. Kybernetika 50(6): 1003-1031 (2014) - [c4]Lóránt Farkas, Tamás Kói:
Universal error exponent for discrete asynchronous multiple access channels. ISIT 2014: 2944-2948 - 2013
- [c3]Lóránt Farkas, Tamás Kói:
Random access and source-channel coding error exponents for Multiple Access Channels. ISIT 2013: 374-378 - [i2]Lóránt Farkas, Tamás Kói:
Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels. CoRR abs/1301.6412 (2013) - 2012
- [j1]Marianna Bolla, Tamás Kói, András Krámli:
Testability of minimum balanced multiway cut densities. Discret. Appl. Math. 160(7-8): 1019-1027 (2012) - [c2]Lóránt Farkas, Tamás Kói:
Capacity regions of partly asynchronous multiple access channels. ISIT 2012: 3018-3022 - [i1]Lóránt Farkas, Tamás Kói:
On Capacity Regions of Discrete Asynchronous Multiple Access Channels. CoRR abs/1204.2447 (2012) - 2011
- [c1]Lóránt Farkas, Tamás Kói:
Capacity regions of discrete asynchronous multiple access channels. ISIT 2011: 2273-2277
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-09 21:28 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:
