Payam Delgosha

According to our database1, Payam Delgosha authored at least 11 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Universal Lossless Compression of Graphical Data.
IEEE Trans. Inf. Theory, 2020

A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs.
CoRR, 2019

Deep Switch Networks for Generating Discrete Data and Language.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Distributed Compression of Graphical Data.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Information Theoretic Cutting of a Cake.
IEEE Trans. Inf. Theory, 2017

High-Probability Guarantees in Repeated Games: Theory and Applications in Information Theory.
Proc. IEEE, 2017

Load balancing in hypergraphs.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2013
Impossibility of Local State Transformation via Hypercontractivity.
CoRR, 2013

2011
Randomized Algorithms for Comparison-based Search.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

A new decoding scheme for errorless codes for overloaded CDMA with active user detection.
Proceedings of the 18th International Conference on Telecommunications, 2011


  Loading...