default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichelle Effros
Person information
- affiliation: California Institute of Technology, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j54]Recep Can Yavas
, Victoria Kostina, Michelle Effros:
Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels. IEEE Trans. Inf. Theory 70(4): 2367-2394 (2024)- [j53]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Third-Order Analysis of Channel Coding in the Small-to-Moderate Deviations Regime. IEEE Trans. Inf. Theory 70(9): 6139-6170 (2024) - [c143]Siming Sun, Michelle Effros:
Almost Lossless Onion Peeling Data Compression. DCC 2024: 472-481 - [c142]Siming Sun, Michelle Effros:
Asynchronous Random Access Data Compression. DCC 2024: 482-491 - [c141]Michael Langberg, Michelle Effros:
Characterizing positive-rate secure multicast network coding with eavesdropping nodes. ISIT 2024: 1303-1308 - [c140]Oliver Kosut, Michelle Effros, Michael Langberg:
Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying. ISIT 2024: 3332-3337 - [i56]Oliver Kosut, Michelle Effros, Michael Langberg:
Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying. CoRR abs/2401.15495 (2024) - [i55]Michael Langberg, Michelle Effros:
Characterizing positive-rate key-cast (and multicast network coding) with eavesdropping nodes. CoRR abs/2407.01703 (2024) - 2023
- [c139]Oliver Kosut, Michelle Effros, Michael Langberg:
Perfect vs. Independent Feedback in the Multiple-Access Channel. ISIT 2023: 1502-1507 - [i54]Michael Langberg, Michelle Effros:
Multiple Key-cast over Networks. CoRR abs/2302.03524 (2023) - [i53]Oliver Kosut, Michelle Effros, Michael Langberg:
Perfect vs. Independent Feedback in the Multiple-Access Channel. CoRR abs/2305.06340 (2023) - 2022
- [c138]Siming Sun, Michelle Effros:
Source Coding with Unreliable Side Information in the Finite Blocklength Regime. ISIT 2022: 222-227 - [c137]Oliver Kosut, Michelle Effros, Michael Langberg:
On the Benefit of Cooperation in Relay Networks. ISIT 2022: 1945-1950 - [c136]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Third-order Analysis of Channel Coding in the Moderate Deviations Regime. ISIT 2022: 2309-2314 - [c135]Michael Langberg, Michelle Effros:
Network Coding Multicast Key-Capacity. ITW 2022: 422-427 - [i52]Oliver Kosut, Michelle Effros, Michael Langberg:
On the Benefit of Cooperation in Relay Networks. CoRR abs/2202.01878 (2022) - [i51]Michael Langberg, Michelle Effros:
Network Coding Multicast Key-Capacity. CoRR abs/2202.03918 (2022) - [i50]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Third-order Analysis of Channel Coding in the Moderate Deviations Regime. CoRR abs/2203.01418 (2022) - [i49]SooJean Han, Michelle Effros, Richard M. Murray:
OUTformation: Distributed Data-Gathering with Feedback under Unknown Environment and Communication Delay Constraints. CoRR abs/2208.06395 (2022) - 2021
- [j52]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Random Access Channel Coding in the Finite Blocklength Regime. IEEE Trans. Inf. Theory 67(4): 2115-2140 (2021) - [j51]Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina:
The Birthday Problem and Zero-Error List Codes. IEEE Trans. Inf. Theory 67(9): 5791-5803 (2021) - [j50]Parham Noorzad, Michael Langberg, Michelle Effros:
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases. IEEE Trans. Inf. Theory 67(9): 5885-5902 (2021) - [j49]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis. IEEE Trans. Inf. Theory 67(11): 6983-7009 (2021) - [c134]Michael Langberg, Michelle Effros:
Edge removal in undirected networks. ISIT 2021: 1421-1426 - [c133]Yuxin Liu, Michelle Effros:
Nested LDPC Codes for Random Access Communication. ISIT 2021: 1877-1882 - [c132]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel. ISIT 2021: 1883-1888 - [c131]Oliver Kosut, Michelle Effros, Michael Langberg:
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. ISIT 2021: 2214-2219 - [c130]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Nested Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels. ITW 2021: 1-6 - [i48]Michael Langberg, Michelle Effros:
Beyond Capacity: The Joint Time-Rate Region. CoRR abs/2101.12236 (2021) - [i47]Oliver Kosut, Michelle Effros, Michael Langberg:
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. CoRR abs/2102.01247 (2021) - [i46]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel. CoRR abs/2103.09373 (2021) - 2020
- [j48]Michael Langberg, Michelle Effros:
The Edge-Removal Problem's Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding. IEEE Trans. Inf. Theory 66(2): 900-913 (2020) - [j47]Shuqing Chen, Michelle Effros, Victoria Kostina:
Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios. IEEE Trans. Inf. Theory 66(11): 6688-6722 (2020) - [c129]Yuxin Liu, Michelle Effros:
Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication. ISIT 2020: 361-366 - [c128]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Gaussian Multiple and Random Access in the Finite Blocklength Regime. ISIT 2020: 3013-3018 - [c127]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Gaussian Multiple and Random Access in the Finite Blocklength Regime. ITA 2020: 1-25 - [i45]Recep Can Yavas, Victoria Kostina, Michelle Effros:
Gaussian Multiple and Random Access in the Finite Blocklength Regime. CoRR abs/2001.03867 (2020) - [i44]Fei Wei, Michael Langberg, Michelle Effros:
Towards an Operational Definition of Group Network Codes. CoRR abs/2002.00781 (2020) - [i43]Yuxin Liu, Michelle Effros:
Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication. CoRR abs/2005.06428 (2020) - [i42]Michael Langberg, Michelle Effros:
Edge removal in undirected networks. CoRR abs/2005.10315 (2020)
2010 – 2019
- 2019
- [c126]Fei Wei, Michael Langberg, Michelle Effros:
A Local Perspective on the Edge Removal Problem. ISIT 2019: 191-195 - [c125]Shuqing Chen, Michelle Effros, Victoria Kostina:
Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios. ISIT 2019: 1692-1696 - [c124]Miguel Arrieta, Iñaki Esnaola, Michelle Effros:
Universal Privacy Guarantees for Smart Meters. ISIT 2019: 2154-2158 - [c123]Debaditya Chaudhuri, Michael Langberg, Michelle Effros:
Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. ISIT 2019: 2309-2313 - [i41]Shuqing Chen, Michelle Effros, Victoria Kostina:
Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios. CoRR abs/1902.03366 (2019) - [i40]Miguel Arrieta, Iñaki Esnaola, Michelle Effros:
Universal Mutual Information Privacy Guarantees for Smart Meters. CoRR abs/1905.00111 (2019) - [i39]Fei Wei, Michael Langberg, Michelle Effros:
A Local Perspective on the Edge Removal Problem. CoRR abs/1907.01133 (2019) - [i38]Debaditya Chaudhuri, Michael Langberg, Michelle Effros:
Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. CoRR abs/1907.03522 (2019) - [i37]Parham Noorzad, Michael Langberg, Michelle Effros:
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases. CoRR abs/1911.10449 (2019) - 2018
- [j46]Parham Noorzad, Michelle Effros, Michael Langberg:
The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC. IEEE Trans. Inf. Theory 64(5): 3655-3678 (2018) - [j45]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligible Rate Increase Network Reliability? IEEE Trans. Inf. Theory 64(6): 4282-4293 (2018) - [c122]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligihle Cooperation Increase Capacity? The Average-Error Case. ISIT 2018: 1256-1260 - [c121]Michelle Effros, Victoria Kostina, Recep Can Yavas:
Random Access Channel Coding in the Finite Blocklength Regime. ISIT 2018: 1261-1265 - [i36]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligible Cooperation Increase Network Capacity? The Average-Error Case. CoRR abs/1801.03655 (2018) - [i35]Michelle Effros, Victoria Kostina, Recep Can Yavas:
Random Access Channel Coding in the Finite Blocklength Regime. CoRR abs/1801.09018 (2018) - [i34]Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina:
The Birthday Problem and Zero-Error List Codes. CoRR abs/1802.04719 (2018) - 2017
- [c120]Parham Noorzad, Michelle Effros, Michael Langberg:
The benefit of encoder cooperation in the presence of state information. ISIT 2017: 41-45 - [c119]Ming Fai Wong, Michelle Effros, Michael Langberg:
A code equivalence between streaming network coding and streaming index coding. ISIT 2017: 1638-1642 - [c118]Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina:
The birthday problem and zero-error list codes. ISIT 2017: 1648-1652 - [i33]Parham Noorzad, Michelle Effros, Michael Langberg:
The Benefit of Encoder Cooperation in the Presence of State Information. CoRR abs/1707.05869 (2017) - 2016
- [c117]Michael Langberg, Michelle Effros:
On the Capacity Advantage of a Single Bit. GLOBECOM Workshops 2016: 1-6 - [c116]Parham Noorzad, Michelle Effros, Michael Langberg:
The unbounded benefit of encoder cooperation for the k-user MAC. ISIT 2016: 340-344 - [c115]Woong Kim, Michael Langberg, Michelle Effros:
A characterization of the capacity region for network coding with dependent sources. ISIT 2016: 1764-1768 - [c114]Ming Fai Wong, Michelle Effros, Michael Langberg:
On tightness of an entropic region outer bound for network coding and the edge removal property. ISIT 2016: 1769-1773 - [c113]Parham Noorzad, Michelle Effros, Michael Langberg:
Can negligible cooperation increase network reliability? ISIT 2016: 1784-1788 - [i32]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligible Cooperation Increase Network Reliability? (Extended Version). CoRR abs/1601.05769 (2016) - [i31]Parham Noorzad, Michelle Effros, Michael Langberg:
The Unbounded Benefit of Encoder Cooperation for the $k$-User MAC (Extended Version). CoRR abs/1601.06113 (2016) - [i30]Shirin Jalali, Michelle Effros, Tracey Ho:
On the Impact of a Single Edge on the Network Coding Capacity. CoRR abs/1607.06793 (2016) - [i29]Michael Langberg, Michelle Effros:
On the Capacity Advantage of a Single Bit. CoRR abs/1607.07024 (2016) - 2015
- [j44]Shirin Jalali, Michelle Effros:
Separation of Source-Network Coding and Channel Coding in Wireline Networks. IEEE Trans. Inf. Theory 61(4): 1524-1538 (2015) - [j43]Michelle Effros, Salim Y. El Rouayheb, Michael Langberg:
An Equivalence Between Network Coding and Index Coding. IEEE Trans. Inf. Theory 61(5): 2478-2487 (2015) - [c112]Parham Noorzad, Michelle Effros, Michael Langberg:
On the cost and benefit of cooperation. ISIT 2015: 36-40 - [c111]Ming Fai Wong, Michelle Effros, Michael Langberg:
On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property. ISIT 2015: 371-375 - [c110]Mingyue Ji, Ming Fai Wong, Antonia M. Tulino, Jaime Llorca, Giuseppe Caire, Michelle Effros, Michael Langberg:
On the fundamental limits of caching in combination networks. SPAWC 2015: 695-699 - [i28]Parham Noorzad, Michelle Effros, Michael Langberg:
On the Cost and Benefit of Cooperation (Extended Version). CoRR abs/1504.04432 (2015) - [i27]Jeffrey G. Andrews, Alexandros G. Dimakis, Lara Dolecek, Michelle Effros, Muriel Médard, Olgica Milenkovic, Andrea Montanari, Sriram Vishwanath, Edmund M. Yeh, Randall Berry, Ken R. Duffy, Soheil Feizi, Saul Kato, Manolis Kellis, Stuart Licht, Jon Sorenson, Lav R. Varshney, Haris Vikalo:
A Perspective on Future Research Directions in Information Theory. CoRR abs/1507.05941 (2015) - [i26]Parham Noorzad, Michelle Effros, Michael Langberg:
The Multivariate Covering Lemma and its Converse. CoRR abs/1508.03349 (2015) - 2014
- [j42]Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros:
On the Delay Advantage of Coding in Packet Erasure Networks. IEEE Trans. Inf. Theory 60(5): 2868-2883 (2014) - [j41]Ralf Koetter, Michelle Effros, Muriel Médard:
A Theory of Network Equivalence - Part II: Multiterminal Channels. IEEE Trans. Inf. Theory 60(7): 3709-3732 (2014) - [c109]Anoosheh Heidarzadeh, Shiyu Zhao, Tracey Ho, Michelle Effros:
Efficient pooling against strategic adversary with applications in anonymous and reliable networking. Allerton 2014: 1317-1324 - [c108]Ming Fai Wong, Michael Langberg, Michelle Effros:
Linear capacity equivalence between multiple multicast and multiple unicast. ISIT 2014: 2152-2156 - [c107]Parham Noorzad, Michelle Effros, Michael Langberg, Tracey Ho:
On the power of cooperation: Can a little help a lot? ISIT 2014: 3132-3136 - [c106]Michelle Effros, Michael Langberg:
Is there a canonical network for network information theory? ITW 2014: 82-86 - [i25]Parham Noorzad, Michelle Effros, Michael Langberg, Tracey Ho:
On the Power of Cooperation: Can a Little Help a Lot? (Extended Version). CoRR abs/1401.6498 (2014) - 2013
- [c105]Ming Fai Wong, Michael Langberg, Michelle Effros:
On a capacity equivalence between multiple multicast and multiple unicast. Allerton 2013: 1537-1544 - [c104]Michelle Effros, Salim Y. El Rouayheb, Michael Langberg:
An equivalence between network coding and index coding. ISIT 2013: 967-971 - [c103]Ming Fai Wong, Michael Langberg, Michelle Effros:
On a capacity equivalence between network and index coding and the edge removal problem. ISIT 2013: 972-976 - [c102]Batuhan Karagöz, Semih Yavuz, Tracey Ho, Michelle Effros:
Capacity region of multi-resolution streaming in peer-to-peer networks. ITW 2013: 1-5 - [c101]Eun Jee Lee, Michael Langberg, Michelle Effros:
Outer bounds and a functional study of the edge removal problem. ITW 2013: 1-5 - [c100]Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros:
Zero vs. ε error in interference channels. ITW 2013: 1-5 - [i24]Batuhan Karagöz, Semih Yavuz, Tracey Ho, Michelle Effros:
Multi-Resolution Video Streaming in Peer-to-peer Networks. CoRR abs/1304.1858 (2013) - [i23]Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros:
Zero vs. epsilon Error in Interference Channels. CoRR abs/1307.6779 (2013) - 2012
- [j40]Jason R. Marden, Michelle Effros:
The Price of Selfishness in Network Coding. IEEE Trans. Inf. Theory 58(4): 2349-2361 (2012) - [c99]Christopher S. Chang, Tracey Ho, Michelle Effros:
Peer-to-peer anonymous networking using coding. Allerton Conference 2012: 525-532 - [c98]Theodoros K. Dikaliotis, Hongyi Yao, Tracey Ho, Michelle Effros, Jörg Kliewer:
Network equivalence in the presence of an eavesdropper. Allerton Conference 2012: 960-967 - [c97]Mayank Bakshi, Michelle Effros:
On network coding capacity under on-off scheduling. ISIT 2012: 1667-1671 - [c96]Michael Langberg, Michelle Effros:
Source coding for dependent sources. ITW 2012: 70-74 - [c95]Michelle Effros:
On dependence and delay: Capacity bounds for wireless networks. WCNC 2012: 550-554 - [i22]Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros:
On the Delay Advantage of Coding in Packet Erasure Networks. CoRR abs/1211.3174 (2012) - [i21]Theodoros K. Dikaliotis, Hongyi Yao, Tracey Ho, Michelle Effros, Jörg Kliewer:
Network Equivalence in the Presence of an Eavesdropper. CoRR abs/1211.4081 (2012) - [i20]Michelle Effros, Salim Y. El Rouayheb, Michael Langberg:
An Equivalence between Network Coding and Index Coding. CoRR abs/1211.6660 (2012) - 2011
- [j39]Andrea Goldsmith, Michelle Effros, Ralf Koetter, Muriel Médard, Asuman E. Ozdaglar, Lizhong Zheng:
Beyond Shannon: the quest for fundamental performance limits of wireless ad hoc networks. IEEE Commun. Mag. 49(5): 195-205 (2011) - [j38]Ralf Koetter, Michelle Effros, Muriel Médard:
A Theory of Network Equivalence - Part I: Point-to-Point Channels. IEEE Trans. Inf. Theory 57(2): 972-995 (2011) - [j37]Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Hongyi Yao, Michelle Effros, Jörg Kliewer, Elona Erez:
Multiple-Access Network Information-Flow and Correction Codes. IEEE Trans. Inf. Theory 57(2): 1067-1079 (2011) - [j36]Sukwon Kim, Tracey Ho, Michelle Effros, Amir Salman Avestimehr:
Network Error Correction With Unequal Link Capacities. IEEE Trans. Inf. Theory 57(2): 1144-1164 (2011) - [j35]Hanying Feng, Michelle Effros:
Near Optimality of Composite Multiple Description Source Codes. IEEE Trans. Inf. Theory 57(6): 3783-3795 (2011) - [c94]Ming Fai Wong, Michelle Effros:
On capacity bounds for networks containing two-way channels. Allerton 2011: 408-417 - [c93]Michelle Effros:
On sources and networks: Can computational tools derive information theoretic limits? Allerton 2011: 1190-1194 - [c92]Michael Langberg, Michelle Effros:
Network coding: Is zero error always possible? Allerton 2011: 1478-1485 - [c91]Shirin Jalali, Michelle Effros:
On distortion bounds for dependent sources over wireless networks. ISIT 2011: 46-50 - [c90]Wei-Hsin Gu, Michelle Effros:
A strong converse in source coding for super-source networks. ISIT 2011: 395-399 - [c89]Hongyi Yao, Tracey Ho, Michelle Effros:
On the equivalence of Shannon capacity and stable capacity in networks with memoryless channels. ISIT 2011: 503-507 - [c88]Mayank Bakshi, Michelle Effros, Tracey Ho:
On equivalence for networks of noisy channels under byzantine attacks. ISIT 2011: 973-977 - [c87]Tracey Ho, Sukwon Kim, Yanbo Yang, Michelle Effros, Amir Salman Avestimehr:
On network error correction with limited feedback capacity. ITA 2011: 160-162 - [c86]Shirin Jalali, Michelle Effros, Tracey Ho:
On the impact of a single edge on the network coding capacity. ITA 2011: 196-200 - [c85]Shirin Jalali, Michelle Effros:
Separation of source-network coding and channel coding in wireline networks. ITA 2011: 201-207 - [c84]Flávio du Pin Calmon, Muriel Médard, Michelle Effros:
Equivalent models for multi-terminal channels. ITW 2011: 370-374 - [i19]Michael Langberg, Michelle Effros:
Network Coding: Is zero error always possible? CoRR abs/1102.3162 (2011) - [i18]Shirin Jalali, Michelle Effros:
Separation of source-network coding and channel coding in wireline networks. CoRR abs/1110.3559 (2011) - 2010
- [j34]Michelle Effros, Andrea J. Goldsmith, Yifan Liang:
Generalizing capacity: new definitions and capacity theorems for composite channels. IEEE Trans. Inf. Theory 56(7): 3069-3087 (2010) - [j33]Vishal Doshi, Devavrat Shah, Muriel Médard, Michelle Effros:
Functional compression through graph coloring. IEEE Trans. Inf. Theory 56(8): 3901-3917 (2010) - [c83]Tracey Ho, Michelle Effros, Shirin Jalali:
On equivalence between network topologies. Allerton 2010: 391-398 - [c82]Soheil Feizi, Muriel Médard, Michelle Effros:
Compressive sensing over networks. Allerton 2010: 1129-1136 - [c81]Ali ParandehGheibi, Asuman E. Ozdaglar, Michelle Effros, Muriel Médard:
Optimal reverse carpooling over wireless networks - a distributed optimization approach. CISS 2010: 1-6 - [c80]Mayank Bakshi, Michelle Effros:
On zero-error source coding with feedback. ISIT 2010: 11-15 - [c79]Shirin Jalali, Michelle Effros:
On the separation of lossy source-network coding and channel coding in wireline networks. ISIT 2010: 500-504 - [c78]Michelle Effros:
Capacity bounds for networks of broadcast channels. ISIT 2010: 580-584 - [c77]Mayank Bakshi, Sidharth Jaggi, Michelle Effros:
Concatenated Polar codes. ISIT 2010: 918-922 - [c76]Michelle Effros:
On capacity outer bounds for a simple family of wireless networks. ITA 2010: 112-118 - [c75]Sukwon Kim, Tracey Ho, Michelle Effros, Amir Salman Avestimehr:
New results on network error correction: Capacities and upper bounds. ITA 2010: 184-193 - [c74]Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros:
On the delay advantage of coding in packet erasure networks. ITW 2010: 1-5 - [i17]Mayank Bakshi, Sidharth Jaggi, Michelle Effros:
Concatenated Polar Codes. CoRR abs/1001.2545 (2010) - [i16]Mayank Bakshi, Michelle Effros:
On Zero-Error Source Coding with Feedback. CoRR abs/1001.2547 (2010) - [i15]Ali ParandehGheibi, Asuman E. Ozdaglar, Michelle Effros, Muriel Médard:
Optimal Reverse Carpooling Over Wireless Networks - A Distributed Optimization Approach. CoRR abs/1001.3171 (2010) - [i14]Shirin Jalali, Michelle Effros:
On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks. CoRR abs/1005.0117 (2010) - [i13]Ralf Koetter, Michelle Effros, Muriel Médard:
A Theory of Network Equivalence. CoRR abs/1007.1033 (2010) - [i12]Michelle Effros, Tracey Ho, Shirin Jalali:
On Equivalence Between Network Topologies. CoRR abs/1010.0654 (2010) - [i11]Sukwon Kim, Tracey Ho, Michelle Effros, Amir Salman Avestimehr:
Network error correction with unequal link capacities. CoRR abs/1011.3870 (2010) - [i10]Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Hongyi Yao, Michelle Effros, Jörg Kliewer, Elona Erez:
Multiple-access Network Information-flow and Correction Codes. CoRR abs/1012.0112 (2010) - [i9]Soheil Feizi-Khankandi, Muriel Médard, Michelle Effros:
Compressive Sensing Over Networks. CoRR abs/1012.0955 (2010)
2000 – 2009
- 2009
- [j32]Daniel Marco, Michelle Effros:
On lossless coding with coded side information. IEEE Trans. Inf. Theory 55(7): 3284-3296 (2009) - [c73]Ralf Koetter, Michelle Effros, Muriel Médard:
Beyond network equivalence. Allerton 2009: 997-1004 - [c72]Sukwon Kim, Tracey Ho, Michelle Effros, Salman Avestimehr:
Network error correction with unequal link capacities. Allerton 2009: 1387-1394 - [c71]Svitlana Vyetrenko, Tracey Ho, Michelle Effros, Jörg Kliewer, Elona Erez:
Rate rRegions for coherent and noncoherent multisource network error correction. ISIT 2009: 1001-1005 - [c70]Asaf Cohen, Amir Salman Avestimehr, Michelle Effros:
On networks with side information. ISIT 2009: 1343-1347 - [c69]Mayank Bakshi, Michelle Effros:
On feedback in network source coding. ISIT 2009: 1348-1352 - [c68]Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros:
On the delay of network coding over line networks. ISIT 2009: 1408-1412 - [c67]Wei-Hsin Gu, Michelle Effros:
A strong converse for a collection of network source coding problems. ISIT 2009: 2316-2320 - [c66]Jason R. Marden, Michelle Effros:
A game theoretic approach to network coding. ITW 2009: 147-151 - [c65]Ralf Koetter, Michelle Effros, Muriel Médard:
On a theory of network equivalence. ITW 2009: 326-330 - [i8]Yifan Liang, Andrea J. Goldsmith, Michelle Effros:
Source-Channel Coding and Separation for Generalized Communication Systems. CoRR abs/0902.4647 (2009) - [i7]Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros:
On the Delay of Network Coding over Line Networks. CoRR abs/0910.3975 (2009) - 2008
- [j31]Desmond S. Lun, Muriel Médard, Ralf Koetter, Michelle Effros:
On coding for reliable communication over packet networks. Phys. Commun. 1(1): 3-20 (2008) - [j30]Dan Muresan, Michelle Effros:
Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems. IEEE Trans. Inf. Theory 54(1): 344-366 (2008) - [j29]Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Médard, Michelle Effros:
Resilient Network Coding in the Presence of Byzantine Adversaries. IEEE Trans. Inf. Theory 54(6): 2596-2603 (2008) - [j28]Tracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R. Karger:
Byzantine Modification Detection in Multicast Networks With Random Network Coding. IEEE Trans. Inf. Theory 54(6): 2798-2803 (2008) - [c64]Christopher S. Chang, Tracey Ho, Michelle Effros:
On robust network coding subgraph construction under uncertainty. ACSCC 2008: 2211-2215 - [c63]Sukwon Kim, Tracey Ho, Michelle Effros:
Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networks. Allerton 2008: 154-161 - [c62]Sukwon Kim, Michelle Effros, Tracey Ho:
Distributed design of network codes for wireless multiple unicasts. Allerton 2008: 324-331 - [c61]Elona Erez, Michelle Effros, Tracey Ho:
Network codes with deadlines. Allerton 2008: 339-346 - [c60]Wei-Hsin Gu, Michelle Effros, Mayank Bakshi:
A continuity theory for lossless source coding over networks. Allerton 2008: 1527-1534 - [c59]Yifan Liang, Andrea J. Goldsmith, Michelle Effros:
Generalized Capacity and Source-Channel Coding for Packet Erasure Channels. GLOBECOM 2008: 951-955 - [c58]Mayank Bakshi, Michelle Effros:
On achievable rates for multicast in the presence of side information. ISIT 2008: 1661-1665 - [c57]Wei-Hsin Gu, Soumya Jana, Michelle Effros:
On approximating the rate regions for lossy source coding with coded and uncoded side information. ISIT 2008: 2162-2166 - [i6]Michelle Effros, Andrea J. Goldsmith, Yifan Liang:
Capacity Definitions for General Channels with Receiver Side Information. CoRR abs/0804.4239 (2008) - 2007
- [j27]Radhika Gowaikar, Amir F. Dana, Babak Hassibi, Michelle Effros:
A Practical Scheme for Wireless Network Operation. IEEE Trans. Commun. 55(3): 463-476 (2007) - [c56]Mortada Mehyar, Wei-Hsin Gu, Steven H. Low, Michelle Effros, Tracey Ho:
Optimal Strategies for Efficient Peer-to-Peer File Sharing. ICASSP (4) 2007: 1337-1340 - [c55]Minkyu Kim, Muriel Médard, Varun Aggarwal, Una-May O'Reilly, Wonsik Kim, Chang Wook Ahn, Michelle Effros:
Evolutionary Approaches To Minimizing Network Coding Resources. INFOCOM 2007: 1991-1999 - [c54]Mayank Bakshi, Michelle Effros, Wei-Hsin Gu, Ralf Koetter:
On Network Coding of Independent and Dependent Sources in Line Networks. ISIT 2007: 1096-1100 - [c53]Michelle Effros:
Network Source Coding: Pipe Dream or Promise? ISIT 2007 - [c52]Michelle Effros, Andrea Goldsmith, Yifan Liang:
Capacity Definitions of General Channels with Receiver Side Information. ISIT 2007: 921-925 - [c51]Wei-Hsin Gu, Ralf Koetter, Michelle Effros, Tracey Ho:
On Source Coding with Coded Side Information for a Binary Source with Binary Side Information. ISIT 2007: 1456-1460 - [i5]Minkyu Kim, Muriel Médard, Varun Aggarwal, Una-May O'Reilly, Wonsik Kim, Chang Wook Ahn, Michelle Effros:
Evolutionary Approaches to Minimizing Network Coding Resources. CoRR abs/cs/0702037 (2007) - 2006
- [j26]Amir F. Dana, Radhika Gowaikar, Ravi Palanki, Babak Hassibi, Michelle Effros:
Capacity of wireless erasure networks. IEEE Trans. Inf. Theory 52(3): 789-804 (2006) - [j25]Michael Fleming, Michelle Effros:
On rate-distortion with mixed types of side information. IEEE Trans. Inf. Theory 52(4): 1698-1705 (2006) - [j24]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung:
Introduction to the special issue on networking and information theory. IEEE Trans. Inf. Theory 52(6): 2285-2288 (2006) - [j23]Aditya Ramamoorthy, Kamal Jain, Philip A. Chou, Michelle Effros:
Separating distributed source coding from network coding. IEEE Trans. Inf. Theory 52(6): 2785-2795 (2006) - [j22]Todd P. Coleman, Anna H. Lee, Muriel Médard, Michelle Effros:
Low-Complexity Approaches to Slepian-Wolf Near-Lossless Distributed Data Compression. IEEE Trans. Inf. Theory 52(8): 3546-3561 (2006) - [j21]Tracey Ho, Muriel Médard, Ralf Koetter, David R. Karger, Michelle Effros, Jun Shi, Ben Leong:
A Random Linear Network Coding Approach to Multicast. IEEE Trans. Inf. Theory 52(10): 4413-4430 (2006) - [j20]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung:
Introduction to the special issue on networking and information theory. IEEE/ACM Trans. Netw. 14(4): 674 (2006) - [c50]Todd P. Coleman, Muriel Médard, Michelle Effros:
Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis. DCC 2006: 53-62 - [c49]Wei-Hsin Gu, Michelle Effros:
On Mult-iResolution Coding and a Two-Hop Network. DCC 2006: 451 - [c48]Sidharth Jaggi, Yuval Cassuto, Michelle Effros:
Low Complexity Encoding for Network Codes. ISIT 2006: 40-44 - [c47]Wei-Hsin Gu, Michelle Effros:
On the Concavity of Rate Regions for Lossless Source Coding in Networks. ISIT 2006: 1599-1603 - [c46]Michelle Effros, Tracey Ho, Sukwon Kim:
A Tiling Approach to Network Code Design for Wireless Networks. ITW 2006: 62-66 - [c45]Daniel Marco, Michelle Effros:
A Partial Solution for Lossless Source Coding with Coded Side Information. ITW 2006: 247-251 - [i4]Siddharth Ray, Michelle Effros, Muriel Médard, Ralf Koetter, Tracey Ho, David R. Karger, Jinane Abounadi:
On Separation, Randomness and Linearity for Network Codes over Finite Fields. CoRR abs/cs/0603022 (2006) - 2005
- [j19]Hanying Feng, Michelle Effros:
On the rate loss of multiple description source codes. IEEE Trans. Inf. Theory 51(2): 671-683 (2005) - [j18]Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen:
Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory 51(6): 1973-1982 (2005) - [c44]Todd P. Coleman, Muriel Médard, Michelle Effros:
Towards Practical Minimum-Entropy Universal Decoding. DCC 2005: 33-42 - [c43]Wei-Hsin Gu, Michelle Effros:
Source Coding for a Multihop Network. DCC 2005: 461 - [c42]Todd P. Coleman, Muriel Médard, Michelle Effros:
Towards bridging the gap between theory and practice for the Slepian-Wolf problem. ICASSP (5) 2005: 1105-1108 - [c41]Hanying Feng, Michelle Effros:
On the rate loss and construction of source codes for broadcast channels. ISIT 2005: 82-86 - [c40]Sidharth Jaggi, Michael Langberg, Tracey Ho, Michelle Effros:
Correction of adversarial errors in networks. ISIT 2005: 1455-1459 - [c39]Desmond S. Lun, Muriel Médard, Ralf Koetter, Michelle Effros:
Further results on coding for reliable communication over packet networks. ISIT 2005: 1848-1852 - [c38]Todd P. Coleman, Michelle Effros, Emin Martinian, Muriel Médard:
Rate-splitting for the deterministic broadcast channel. ISIT 2005: 2189-2192 - [c37]Wei-Hsin Gu, Michelle Effros:
Source coding for a simple multi-hop network. ISIT 2005: 2335-2339 - [c36]Todd P. Coleman, Emin Martinian, Michelle Effros, Muriel Médard:
Interference management via capacity-achieving codes for the deterministic broadcast channel. ITW 2005: 29-33 - [i3]Desmond S. Lun, Muriel Médard, Ralf Koetter, Michelle Effros:
Further Results on Coding for Reliable Communication over Packet Networks. CoRR abs/cs/0508047 (2005) - [i2]Desmond S. Lun, Muriel Médard, Ralf Koetter, Michelle Effros:
On Coding for Reliable Communication over Packet Networks. CoRR abs/cs/0510070 (2005) - 2004
- [j17]Michael Fleming, Qian Zhao, Michelle Effros:
Network Vector Quantization. IEEE Trans. Inf. Theory 50(8): 1584-1604 (2004) - [j16]Michelle Effros, Hanying Feng, Kenneth Zeger:
Suboptimality of the Karhunen-Loève Transform for Transform Coding. IEEE Trans. Inf. Theory 50(8): 1605-1619 (2004) - [j15]Michelle Effros, Diego Dugatkin:
Multiresolution vector quantization. IEEE Trans. Inf. Theory 50(12): 3130-3145 (2004) - [c35]Qian Zhao, Hanying Feng, Michelle Effros:
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization. Data Compression Conference 2004: 22-31 - [c34]Todd P. Coleman, Anna H. Lee, Muriel Médard, Michelle Effros:
On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding. Data Compression Conference 2004: 282-291 - [c33]Tracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R. Karger:
Byzantine modification detection in multicast networks using randomized network coding. ISIT 2004: 144 - [c32]Qian Zhao, Michelle Effros:
Uniquely decodable multiple access source codes. ISIT 2004: 195 - [c31]Michelle Effros, Leonard J. Schulman:
Rapid near-optimal VQ design with a deterministic data net. ISIT 2004: 298 - [c30]Todd P. Coleman, Anna H. Lee, Muriel Médard, Michelle Effros:
A new source-splitting approach to the slepian-wolf problem. ISIT 2004: 332 - [c29]Sidharth Jaggi, Michelle Effros:
Communication and distributional complexity of joint probability mass functions. ISIT 2004: 365 - [c28]Radhika Gowaikar, Amir F. Dana, Ravi Palanki, Babak Hassibi, Michelle Effros:
On the capacity of wireless erasure networks. ISIT 2004: 401 - [c27]Michelle Effros, Ralf Koetter, Andrea J. Goldsmith, Muriel Médard:
On source and channel codes for multiple inputs and outputs: does multiple description beat space time? ITW 2004: 324-329 - [i1]Michelle Effros, Leonard J. Schulman:
Deterministic clustering with data nets. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j14]Qian Zhao, Michelle Effros:
Lossless and near-lossless source coding for multiple access networks. IEEE Trans. Inf. Theory 49(1): 112-128 (2003) - [j13]Hanying Feng, Michelle Effros:
Improved bounds for the rate loss of multiresolution source codes. IEEE Trans. Inf. Theory 49(4): 809-821 (2003) - [c26]Qian Zhao, Michelle Effros:
Low Complexity Code Design for Lossless and Near-Lossless Side Information Source Codes. DCC 2003: 3-12 - [c25]Michelle Effros, Hanying Feng, Kenneth Zeger:
Suboptimality of the Karhuenen-Loève Transform for Transform Coding. DCC 2003: 293-302 - [c24]Hanying Feng, Qian Zhao, Michelle Effros:
Network Source Coding Using Entropy Constrained Dithered Quantization. DCC 2003: 427 - [c23]Michelle Effros, Muriel Médard, Tracey Ho, Siddharth Ray, David R. Karger, Ralf Koetter, Babak Hassibi:
Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding. Advances in Network Information Theory 2003: 197-216 - 2002
- [j12]Hanying Feng, Michelle Effros:
On the rate-distortion performance and computational efficiency of the Karhunen-Loeve transform for lossy data compression. IEEE Trans. Image Process. 11(2): 113-122 (2002) - [j11]Michelle Effros, Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú:
Universal lossless source coding with the Burrows Wheeler Transform. IEEE Trans. Inf. Theory 48(5): 1061-1081 (2002) - [c22]Dan Muresan, Michelle Effros:
Quantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System. DCC 2002: 302-311 - [c21]Michelle Effros, Dan Muresan:
Codecell Contiguity in Optimal Fixed-Rate and Entropy-Constrained Network Scalar Quantizers. DCC 2002: 312-321 - 2001
- [j10]Andrea J. Goldsmith, Michelle Effros:
The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise. IEEE Trans. Inf. Theory 47(1): 219-240 (2001) - [j9]Michelle Effros:
Universal multiresolution source codes. IEEE Trans. Inf. Theory 47(6): 2113-2129 (2001) - [c20]Michael Fleming, Michelle Effros:
Network Vector Quantization. Data Compression Conference 2001: 13-22 - [c19]Qian Zhao, Michelle Effros:
Optimal Code Design for Lossless and Near Lossless Source Coding in Multiple Access Networks. Data Compression Conference 2001: 263-272 - 2000
- [j8]Michelle Effros:
PPM performance with BWT complexity: a fast and effective data compression algorithm. Proc. IEEE 88(11): 1703-1712 (2000) - [c18]Qian Zhao, Michelle Effros:
Lossless and Lossy Broadcast System Source Codes: Theoretical Limits, Optimal Design, and Empirical Performance. Data Compression Conference 2000: 63-72 - [c17]Michelle Effros:
PPM Performance with BWT Complexity: A New Method for Lossless Data Compression. Data Compression Conference 2000: 203-212 - [c16]Nedeljko Varnica, Michael Fleming, Michelle Effros:
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description. Data Compression Conference 2000: 303-312 - [c15]Yirong Shen, Andrea J. Goldsmith, Michelle Effros:
Joint design of vector quantizers and RCPC channel codes for Rayleigh fading channels. GLOBECOM 2000: 1611-1615
1990 – 1999
- 1999
- [j7]Michelle Effros, Philip A. Chou, Robert M. Gray:
Weighted universal image compression. IEEE Trans. Image Process. 8(10): 1317-1329 (1999) - [j6]Michelle Effros:
Distortion-rate bounds for fixed- and variable-rate multiresolution source codes. IEEE Trans. Inf. Theory 45(6): 1887-1910 (1999) - [c14]Michael Fleming, Michelle Effros:
Generalized Multiple Description Vector Quantization. Data Compression Conference 1999: 3-12 - [c13]Michelle Effros:
Universal Lossless Source Coding with the Burrows Wheeler Transform. Data Compression Conference 1999: 178-187 - [c12]Hanying Feng, Michelle Effros:
Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm. ICASSP 1999: 2435-2438 - 1998
- [j5]Michelle Effros:
Optimal modeling for complex system design [data compression]. IEEE Signal Process. Mag. 15(6): 51-73 (1998) - [j4]Andrea J. Goldsmith, Michelle Effros:
Joint design of fixed-rate source codes and multiresolution channel codes. IEEE Trans. Commun. 46(10): 1301-1312 (1998) - [c11]Michelle Effros:
Practical Multi-Resolution Source Coding: TSVQ Revisited. Data Compression Conference 1998: 53-62 - 1997
- [c10]Michelle Effros:
Fast Weighted Universal Transform Coding: Toward Optimal, Low Complexity Bases for Image Compression. Data Compression Conference 1997: 211-220 - [c9]Michelle Effros:
Conditional weighted universal source codes: second order statistics in universal coding. ICASSP 1997: 2733-2736 - [c8]Michelle Effros:
Robustness to channel variation in source coding for transmission across noisy channels. ICASSP 1997: 2961-2964 - [c7]Andrea J. Goldsmith, Michelle Effros:
Iterative Joint Design of Source Codes and Multiresolution Channel Codes. ICC (1) 1997: 319-323 - [c6]Michelle Effros:
Zerotree Design for Image Compression: Toward Weighted Universal Zerotree Coding. ICIP (1) 1997: 616-619 - 1996
- [j3]Philip A. Chou, Michelle Effros, Robert M. Gray:
A vector quantization approach to universal noiseless coding and quantization. IEEE Trans. Inf. Theory 42(4): 1109-1138 (1996) - 1995
- [c5]Michelle Effros, Philip A. Chou:
Weighted universal bit allocation: optimal multiple quantization matrix coding. ICASSP 1995: 2343-2346 - [c4]Michelle Effros, Philip A. Chou:
Weighted universal transform coding: universal image compression with the Karhunen-Loeve transform. ICIP 1995: 61-64 - 1994
- [j2]Michelle Effros, Philip A. Chou, Eve A. Riskin, Robert M. Gray:
A progressive universal noiseless coder. IEEE Trans. Inf. Theory 40(1): 108-117 (1994) - [j1]Michelle Effros, Philip A. Chou, Robert M. Gray:
Variable-rate source coding theorems for stationary nonergodic sources. IEEE Trans. Inf. Theory 40(6): 1920-1925 (1994) - [c3]Michelle Effros, Philip A. Chou, Robert M. Gray:
Variable Dimension Weighted Universal Vector Quantization and Noiseless Coding. Data Compression Conference 1994: 2-11 - [c2]Michelle Effros, Philip A. Chou, Robert M. Gray:
One-pass adaptive universal vector quantization. ICASSP (5) 1994: 625-628 - 1993
- [c1]Barry D. Andrews, Philip A. Chou, Michelle Effros, Robert M. Gray:
A Mean-Removed Variation of Weighted Universal Vector Quantization for Image Coding. Data Compression Conference 1993: 302-309
Coauthor Index
Andrea J. Goldsmith
aka: Andrea Goldsmith
aka: Andrea Goldsmith
[c141] [c140] [i56] [i55] [c139] [i54] [i53] [c137] [c135] [i52] [i51] [j51] [j50] [c134] [c131] [i48] [i47] [j48] [i44] [i42] [c126] [c123] [i39] [i38] [i37] [j46] [j45] [c122] [i36] [i34] [c120] [c119] [c118] [i33] [c117] [c116] [c115] [c114] [c113] [i32] [i31] [i29] [j43] [c112] [c111] [c110] [i28] [i26] [c108] [c107] [c106] [i25] [c105] [c104] [c103] [c101] [c100] [i23] [c96] [i20] [c92] [i19] [j29] [c40]
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-12 22:55 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:
