Abram Magner

According to our database1, Abram Magner authored at least 27 papers between 2014 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The Power of Graph Convolutional Networks to Distinguish Random Graph Models: Short Version.
CoRR, 2020

A deep learning architecture for metabolic pathway prediction.
Bioinform., 2020

Compression of Dynamic Graphs Generated by a Duplication Model.
Algorithmica, 2020

The Power of Graph Convolutional Networks to Distinguish Random Graph Models.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Toward universal testing of dynamic network models.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Entropy and Optimal Compression of Some General Plane Trees.
ACM Trans. Algorithms, 2019

Asymmetry and structural information in preferential attachment graphs.
Random Struct. Algorithms, 2019

Asymmetric Rényi Problem.
Comb. Probab. Comput., 2019

Goodness of Fit Testing for Dynamic Networks.
CoRR, 2019

Compression of Preferential Attachment Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Lossless Compression of Binary Trees With Correlated Vertex Names.
IEEE Trans. Inf. Theory, 2018

Profiles of PATRICIA Tries.
Algorithmica, 2018

TIMES: Temporal Information Maximally Extracted from Structures.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Network Archaeology via Epidemic Processes: The Case of Growing Trees.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Large Deviations for Increasing Subsequences of Permutations and a Concurrency Application.
SIGMETRICS Perform. Evaluation Rev., 2017

A Study of the Boltzmann Sequence-Structure Channel.
Proc. IEEE, 2017

Recovery of vertex orderings in dynamic graphs.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Entropy of some general plane trees.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On Symmetries of Non-Plane Trees in a Non-Uniform Model.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Combining Density and Overlap (CoDO): A New Method for Assessing the Significance of Overlap Among Subgraphs.
CoRR, 2016

Asymmetric Rényi Problem and PATRICIA Tries.
CoRR, 2016

The Boltzmann sequence-structure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Phase transitions in a sequence-structure channel.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

Variance of Size in Regular Graph Tries.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014
On Symmetry of Uniform and Preferential Attachment Graphs.
Electron. J. Comb., 2014

Expected External Profile of PATRICIA Tries.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014


  Loading...