default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAslan Tchamkerten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]K. R. Sahasranand
, Aslan Tchamkerten:
Feedback Increases the Capacity of Queues With Bounded Service Times. IEEE Trans. Inf. Theory 70(10): 6823-6833 (2024)- [c32]Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka:
Entropy-Achieving Compression with Private Local Decodability. ISIT 2024: 3492-3497 - 2023
- [j25]Manuj Mukherjee, Aslan Tchamkerten, Chadi Jabbour:
Reconfigurable Adaptive Channel Sensing. IEEE Trans. Green Commun. Netw. 7(3): 1394-1406 (2023) - [c31]K. R. Sahasranand, Aslan Tchamkerten:
Feedback Increases the Capacity of Queues with Finite Support Service Times. ISIT 2023: 7-12 - [c30]Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka:
Data Compression with Private Local Decodability. ISIT 2023: 1800-1805 - [i32]K. R. Sahasranand, Aslan Tchamkerten:
Feedback Increases the Capacity of Queues with Bounded Service Times. CoRR abs/2309.14145 (2023) - 2022
- [j24]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
Local Decoding in Distributed Compression. IEEE J. Sel. Areas Inf. Theory 3(4): 711-719 (2022) - [j23]Mohammad Mehrabi, Aslan Tchamkerten:
Error-Correction for Sparse Support Recovery Algorithms. IEEE Trans. Inf. Theory 68(11): 7396-7409 (2022) - [c29]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
Locally Decodable Slepian-Wolf Compression. ISIT 2022: 1430-1435 - [i31]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
Random Access in Distributed Source Coding. CoRR abs/2204.07518 (2022) - 2021
- [j22]Jihad Fahs, Aslan Tchamkerten, Mansoor I. Yousefi:
Capacity-Achieving Input Distribution in Per-Sample Zero-Dispersion Model of Optical Fiber. IEEE Trans. Inf. Theory 67(9): 5840-5852 (2021) - [c28]Mohammad Mehrabi, Aslan Tchamkerten:
Error-Correction for Sparse Support Recovery Algorithms. ISIT 2021: 1754-1759 - [i30]Manuj Mukherjee, Aslan Tchamkerten, Mansoor I. Yousefi:
Approximating Probability Distributions by ReLU Networks. CoRR abs/2101.09973 (2021) - [i29]Milad Sefidgaran, Aslan Tchamkerten:
Zero-Error Sum Modulo Two with a Common Observation. CoRR abs/2102.00697 (2021) - [i28]Mohammad Mehrabi, Aslan Tchamkerten:
Error-Correction for Sparse Support Recovery Algorithms. CoRR abs/2103.03801 (2021) - [i27]Manuj Mukherjee, Aslan Tchamkerten, Chadi Jabbour:
Reconfigurable Adaptive Channel Sensing. CoRR abs/2104.12460 (2021) - 2020
- [j21]Laure Aptel, Aslan Tchamkerten:
Bits Through Queues With Feedback. IEEE Trans. Inf. Theory 66(6): 3317-3326 (2020) - [j20]Shashank Vatedka, Aslan Tchamkerten:
Local Decode and Update for Big Data Compression. IEEE Trans. Inf. Theory 66(9): 5790-5805 (2020) - [c27]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
O (log log n) Worst-Case Local Decoding and Update Efficiency for Data Compression. ISIT 2020: 2371-2376 - [c26]Manuj Mukherjee, Aslan Tchamkerten, Mansoor I. Yousefi:
Approximating Probability Distributions by ReLU Networks. ITW 2020: 1-5 - [c25]Milad Sefidgaran, Aslan Tchamkerten:
Zero-Error Sum Modulo Two with a Common Observation. ITW 2020: 1-5 - [i26]Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
$O(\log \log n)$ Worst-Case Local Decoding and Update Efficiency for Data Compression. CoRR abs/2001.08679 (2020)
2010 – 2019
- 2019
- [j19]Gildas Avoine, Muhammed Ali Bingöl, Ioana Boureanu, Srdjan Capkun, Gerhard P. Hancke, Süleyman Kardas, Chong Hee Kim, Cédric Lauradoux, Benjamin Martin, Jorge Munilla, Alberto Peinado, Kasper Bonne Rasmussen, Dave Singelée, Aslan Tchamkerten, Rolando Trujillo-Rasua, Serge Vaudenay:
Security of Distance-Bounding: A Survey. ACM Comput. Surv. 51(5): 94:1-94:33 (2019) - [j18]Longguang Li, Aslan Tchamkerten:
Second-Order Asymptotics for Communication Under Strong Asynchronism. IEEE Trans. Inf. Theory 65(5): 2838-2849 (2019) - [c24]Jihad Fahs, Aslan Tchamkerten, Mansoor I. Yousefi:
On the Optimal Input of the Nondispersive Optical Fiber. ISIT 2019: 131-135 - [c23]Shashank Vatedka, Aslan Tchamkerten:
Local Decoding and Update of Compressed Data. ISIT 2019: 572-576 - [i25]Ehsan Ebrahimzadeh, Maggie Engler, David Tse, Razvan Cristescu, Aslan Tchamkerten:
Somatic mutations render human exome and pathogen DNA more similar. CoRR abs/1905.03138 (2019) - [i24]Shashank Vatedka, Aslan Tchamkerten:
Local Decode and Update for Big Data Compression. CoRR abs/1909.06444 (2019) - 2018
- [j17]Lin Sok, Jean-Claude Belfiore, Patrick Solé, Aslan Tchamkerten:
Lattice Codes for Deletion and Repetition Channels. IEEE Trans. Inf. Theory 64(3): 1595-1603 (2018) - [j16]Venkat Chandar, Aslan Tchamkerten:
Sampling Constrained Asynchronous Communication: How to Sleep Efficiently. IEEE Trans. Inf. Theory 64(3): 1867-1878 (2018) - [c22]Mohammad Mehrabi, Aslan Tchamkerten, Mansoor I. Yousefi:
Bounds on the Approximation Power of Feedforward Neural Networks. ICML 2018: 3450-3458 - [c21]Laure Aptel, Aslan Tchamkerten:
Feedback Increases the Capacity of Queues. ISIT 2018: 1116-1120 - [i23]Mohammad Mehrabi, Aslan Tchamkerten, Mansoor I. Yousefi:
Bounds on the Approximation Power of Feedforward Neural Networks. CoRR abs/1806.11416 (2018) - 2017
- [c20]Longguang Li, Aslan Tchamkerten:
Infinite dispersion in bursty communication. ISIT 2017: 1257-1261 - [i22]Jihad Fahs, Aslan Tchamkerten, Mansoor I. Yousefi:
Capacity-Achieving Input Distributions in Nondispersive Optical Fibers. CoRR abs/1704.04904 (2017) - [i21]Laure Aptel, Aslan Tchamkerten:
Bits through queues with feedback. CoRR abs/1710.06190 (2017) - [i20]Longguang Li, Aslan Tchamkerten:
Second Order Asymptotics for Communication under Strong Asynchronism. CoRR abs/1710.07025 (2017) - 2016
- [j15]Milad Sefidgaran, Aslan Tchamkerten:
Distributed Function Computation Over a Rooted Directed Tree. IEEE Trans. Inf. Theory 62(12): 7135-7152 (2016) - 2015
- [c19]Ehsan Ebrahimzadeh, Aslan Tchamkerten:
Sequential detection of transient changes in stochastic systems under a sampling constraint. ISIT 2015: 156-160 - [c18]Venkat Chandar, Aslan Tchamkerten:
Asynchronous capacity per unit cost under a receiver sampling constraint. ISIT 2015: 511-515 - [i19]Venkat Chandar, Aslan Tchamkerten:
Quickest Transient-Change Detection under a Sampling Constraint. CoRR abs/1501.05930 (2015) - 2014
- [j14]Aslan Tchamkerten, Venkat Chandar, Giuseppe Caire:
Energy and Sampling Constrained Asynchronous Communication. IEEE Trans. Inf. Theory 60(12): 7686-7697 (2014) - [i18]Lin Sok, Patrick Solé, Aslan Tchamkerten:
Lattice Codes for the Binary Deletion Channel. CoRR abs/1406.1055 (2014) - 2013
- [j13]Venkat Chandar, Aslan Tchamkerten, David Tse:
Asynchronous Capacity per Unit Cost. IEEE Trans. Inf. Theory 59(3): 1213-1226 (2013) - [j12]Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell:
Asynchronous Communication: Capacity Bounds and Suboptimality of Training. IEEE Trans. Inf. Theory 59(3): 1227-1255 (2013) - [c17]Lin Sok, Patrick Solé, Aslan Tchamkerten:
Lattice based codes for insertion and deletion channels. ISIT 2013: 684-688 - [c16]Aslan Tchamkerten, Venkat Chandar, Giuseppe Caire:
Energy and sampling constrained asynchronous communication. ISIT 2013: 2518-2522 - [c15]Milad Sefidgaran, Aslan Tchamkerten:
Distributed function computation over a tree network. ITW 2013: 1-5 - [i17]Aslan Tchamkerten, Venkat Chandar, Giuseppe Caire:
Energy and Sampling Constrained Asynchronous Communication. CoRR abs/1302.6574 (2013) - [i16]Milad Sefidgaran, Aslan Tchamkerten:
On Cooperation in Multi-Terminal Computation and Rate Distortion. CoRR abs/1303.0817 (2013) - [i15]Milad Sefidgaran, Aslan Tchamkerten:
Distributed Function Computation Over a Rooted Directed Tree. CoRR abs/1312.3631 (2013) - 2012
- [j11]Marat V. Burnashev, Aslan Tchamkerten:
Sequential estimation of a threshold crossing time for a Gaussian random walk through correlated observations. Probl. Inf. Transm. 48(2): 142-153 (2012) - [j10]Marat V. Burnashev, Aslan Tchamkerten:
Estimating a Random Walk First-Passage Time From Noisy or Delayed Observations. IEEE Trans. Inf. Theory 58(7): 4230-4243 (2012) - [c14]Hamed Mirghasemi, Aslan Tchamkerten:
On the capacity of the one-bit deletion and duplication channel. Allerton Conference 2012: 152-159 - [c13]Milad Sefidgaran, Aslan Tchamkerten:
On cooperation in multi-terminal computation and rate distortion. ISIT 2012: 766-770 - [c12]Milad Sefidgaran, Aslan Tchamkerten:
On function computation over a cascade network. ITW 2012: 472-476 - [i14]Marat V. Burnashev, Aslan Tchamkerten:
Estimating a Random Walk First-Passage Time from Noisy or Delayed Observations. CoRR abs/1203.4810 (2012) - [i13]Hamed Mirghasemi, Aslan Tchamkerten:
On the Capacity of the One-Bit Deletion and Duplication Channel. CoRR abs/1210.2704 (2012) - 2011
- [j9]Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
On Bounded Weight Codes. IEEE Trans. Inf. Theory 57(10): 6780-6787 (2011) - [c11]Marat V. Burnashev, Aslan Tchamkerten:
Estimating a Gaussian random walk first-passage time from noisy or delayed observations. ISIT 2011: 1594-1597 - [c10]Milad Sefidgaran, Aslan Tchamkerten:
Computing a function of correlated Sources: A rate region. ISIT 2011: 1856-1860 - [i12]Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell:
Asynchronous Communication: Capacity Bounds and Suboptimality of Training. CoRR abs/1105.5639 (2011) - [i11]Milad Sefidgaran, Aslan Tchamkerten:
Computing a Function of Correlated Sources. CoRR abs/1107.5806 (2011) - 2010
- [c9]Venkat Chandar, Aslan Tchamkerten, David Tse:
Asynchronous capacity per unit cost. ISIT 2010: 280-284 - [c8]Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
Heavy weight codes. ISIT 2010: 1120-1124 - [i10]Marat V. Burnashev, Aslan Tchamkerten:
Tracking a Threshold Crossing Time of a Gaussian Random Walk Through Correlated Observations. CoRR abs/1005.0616 (2010) - [i9]Venkat Chandar, Aslan Tchamkerten, David Tse:
Asynchronous Capacity per Unit Cost. CoRR abs/1007.4872 (2010) - [i8]Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
On Bounded Weight Codes. CoRR abs/1009.3657 (2010)
2000 – 2009
- 2009
- [j8]Urs Niesen, Aslan Tchamkerten:
Tracking Stopping Times Through Noisy Observations. IEEE Trans. Inf. Theory 55(1): 422-432 (2009) - [j7]Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell:
Communication under strong asynchronism. IEEE Trans. Inf. Theory 55(10): 4508-4528 (2009) - [c7]Gildas Avoine, Aslan Tchamkerten:
An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement. ISC 2009: 250-261 - [i7]Venkat Chandar, Aslan Tchamkerten, Gregory W. Wornell:
Training-Based Schemes are Suboptimal for High Rate Asynchronous Communication. CoRR abs/0908.4051 (2009) - 2008
- [j6]Ashish Khisti, Aslan Tchamkerten, Gregory W. Wornell:
Secure Broadcasting Over Fading Channels. IEEE Trans. Inf. Theory 54(6): 2453-2469 (2008) - [j5]Venkat Chandar, Aslan Tchamkerten, Gregory W. Wornell:
Optimal Sequential Frame Synchronization. IEEE Trans. Inf. Theory 54(8): 3725-3728 (2008) - [c6]Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell:
On the capacity region of asynchronous channels. ISIT 2008: 1213-1217 - [i6]Gildas Avoine, Aslan Tchamkerten:
An Asymptotically Optimal RFID Authentication Protocol Against Relay Attacks. CoRR abs/0809.4183 (2008) - [i5]Gildas Avoine, Aslan Tchamkerten:
An asymptotically optimal RFID protocol against relay attacks. IACR Cryptol. ePrint Arch. 2008: 406 (2008) - 2007
- [c5]Urs Niesen, Aslan Tchamkerten, Gregory W. Wornell:
The Complexity of Tracking a Stopping Time. ISIT 2007: 1136-1140 - [i4]Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell:
Communication under Strong Asynchronism. CoRR abs/0707.4656 (2007) - [i3]Venkat Chandar, Aslan Tchamkerten, Gregory W. Wornell:
Optimal Sequential Frame Synchronization. CoRR abs/0708.2911 (2007) - [i2]Ashish Khisti, Aslan Tchamkerten, Gregory W. Wornell:
Secure Broadcasting. CoRR abs/cs/0702093 (2007) - [i1]Urs Niesen, Aslan Tchamkerten, Gregory W. Wornell:
Tracking Stopping Times. CoRR abs/math/0701261 (2007) - 2006
- [j4]Aslan Tchamkerten, I. Emre Telatar:
On the use of training sequences for channel estimation. IEEE Trans. Inf. Theory 52(3): 1171-1176 (2006) - [j3]Aslan Tchamkerten, I. Emre Telatar:
Variable length coding over an unknown channel. IEEE Trans. Inf. Theory 52(5): 2126-2145 (2006) - [c4]Aslan Tchamkerten, Ashish Khisti, Gregory W. Wornell:
Information Theoretic Perspectives on Synchronization. ISIT 2006: 371-375 - 2005
- [j2]Aslan Tchamkerten, I. Emre Telatar:
On the universality of Burnashev's error exponent. IEEE Trans. Inf. Theory 51(8): 2940-2944 (2005) - [c3]Aslan Tchamkerten, I. Emre Telatar:
On the universality of Burnashev's error exponent. ISIT 2005: 1382-1385 - [c2]Aslan Tchamkerten, I. Emre Telatar:
On the use of training sequences for channel estimation. ISIT 2005: 1391-1395 - 2004
- [j1]Aslan Tchamkerten:
On the Discreteness of Capacity-Achieving Distributions. IEEE Trans. Inf. Theory 50(11): 2773-2778 (2004) - [c1]Aslan Tchamkerten, Emre Telatar:
Optimal feedback schemes over unknown channels. ISIT 2004: 379
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-13 18:00 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:
