default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbram Magner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Abram Magner, Arun Padakandla:
Fat shattering, joint measurability, and PAC learnability of POVM hypothesis classes. Quantum Inf. Process. 23(10): 337 (2024)- [c19]Abram Magner, Arun Padakandla:
Empirical Risk Minimization and Uniform Convergence for Probabilistically Observed and Quantum Measurement Hypothesis Classes. ISIT 2024: 563-568 - [c18]Boya Ma
, Maxwell McNeil, Abram Magner, Petko Bogdanov:
Low Rank Multi-Dictionary Selection at Scale. KDD 2024: 2106-2117 - [i10]Ben Shaw, Abram Magner, Kevin R. Moon:
Symmetry Discovery Beyond Affine Transformations. CoRR abs/2406.03619 (2024) - [i9]Boya Ma, Maxwell McNeil, Abram Magner, Petko Bogdanov:
Low Rank Multi-Dictionary Selection at Scale. CoRR abs/2406.06960 (2024) - 2023
- [j16]Sepideh Neshatfar, Abram Magner, Salimeh Yasaei Sekeh:
Promise and Limitations of Supervised Optimal Transport-Based Graph Summarization via Information Theoretic Measures. IEEE Access 11: 87533-87542 (2023) - [i8]Sepideh Neshatfar, Abram Magner, Salimeh Yasaei Sekeh:
Promise and Limitations of Supervised Optimal Transport-Based Graph Summarization via Information Theoretic Measures. CoRR abs/2305.07138 (2023) - [i7]Abram Magner, Arun Padakandla:
Fat Shattering, Joint Measurability, and PAC Learnability of POVM Hypothesis Classes. CoRR abs/2308.12304 (2023) - 2022
- [j15]Mayank Baranwal, Abram Magner, Jacob Saldinger, Emine Sumeyra Turali-Emre, Paolo Elvati, Shivani Kozarekar, J. Scott Vanepps, Nicholas A. Kotov, Angela Violi, Alfred O. Hero III:
Struct2Graph: a graph attention network for structure based predictions of protein-protein interactions. BMC Bioinform. 23(1): 370 (2022) - [j14]Abram Magner, Mayank Baranwal, Alfred O. Hero III:
Fundamental Limits of Deep Graph Convolutional Networks for Graph Classification. IEEE Trans. Inf. Theory 68(5): 3218-3233 (2022) - [j13]Abram Magner, Carolyn S. Kaminski, Petko Bogdanov:
Fast and Accurate Spreading Process Temporal Scale Estimation. Trans. Mach. Learn. Res. 2022 (2022) - [c17]Arun Padakandla, Abram Magner:
PAC Learning of Quantum Measurement Classes : Sample Complexity Bounds and Universal Consistency. AISTATS 2022: 11305-11319 - [c16]Abram Magner, Amith Kumar Singh:
Local Limit Theorems for Approximate Maximum Likelihood Estimation of Network Information Spreading Models. ISIT 2022: 1671-1676 - 2021
- [c15]Abram Magner:
On Dimension in Graph Convolutional Networks for Distinguishing Random Graph Models. ISIT 2021: 1817-1822 - [i6]Abram Magner, Carolyn S. Kaminski, Petko Bogdanov:
Temporal Scale Estimation for Oversampled Network Cascades: Theory, Algorithms, and Experiment. CoRR abs/2109.10937 (2021) - 2020
- [j12]Krzysztof Turowski, Abram Magner, Wojciech Szpankowski:
Compression of Dynamic Graphs Generated by a Duplication Model. Algorithmica 82(9): 2687-2707 (2020) - [j11]Mayank Baranwal, Abram Magner, Paolo Elvati, Jacob Saldinger, Angela Violi, Alfred O. Hero III:
A deep learning architecture for metabolic pathway prediction. Bioinform. 36(8): 2547-2553 (2020) - [c14]Abram Magner, Wojciech Szpankowski:
Toward universal testing of dynamic network models. ALT 2020: 615-633 - [c13]Abram Magner, Mayank Baranwal, Alfred O. Hero III:
The Power of Graph Convolutional Networks to Distinguish Random Graph Models. ISIT 2020: 2664-2669 - [i5]Abram Magner, Mayank Baranwal, Alfred O. Hero III:
The Power of Graph Convolutional Networks to Distinguish Random Graph Models: Short Version. CoRR abs/2002.05678 (2020)
2010 – 2019
- 2019
- [j10]Michael Drmota, Abram Magner, Wojciech Szpankowski:
Asymmetric Rényi Problem. Comb. Probab. Comput. 28(4): 542-573 (2019) - [j9]Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Asymmetry and structural information in preferential attachment graphs. Random Struct. Algorithms 55(3): 696-718 (2019) - [j8]Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski:
Entropy and Optimal Compression of Some General Plane Trees. ACM Trans. Algorithms 15(1): 3:1-3:23 (2019) - [c12]Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Compression of Preferential Attachment Graphs. ISIT 2019: 1697-1701 - [i4]Abram Magner, Wojciech Szpankowski:
Goodness of Fit Testing for Dynamic Networks. CoRR abs/1904.03348 (2019) - [i3]Abram Magner, Mayank Baranwal, Alfred O. Hero III:
The Power of Graph Convolutional Networks to Distinguish Random Graph Models. CoRR abs/1910.12954 (2019) - 2018
- [j7]Abram Magner, Wojciech Szpankowski:
Profiles of PATRICIA Tries. Algorithmica 80(1): 331-397 (2018) - [j6]Abram Magner, Krzysztof Turowski, Wojciech Szpankowski:
Lossless Compression of Binary Trees With Correlated Vertex Names. IEEE Trans. Inf. Theory 64(9): 6070-6080 (2018) - [c11]Abram Magner, Arun Padakandla:
Network Archaeology via Epidemic Processes: The Case of Growing Trees. Allerton 2018: 879-886 - [c10]Krzysztof Turowski, Abram Magner, Wojciech Szpankowski:
Compression of Dynamic Graphs Generated by a Duplication Model. Allerton 2018: 1089-1096 - [c9]Abram N. Magner, Jithin K. Sreedharan, Ananth Y. Grama, Wojciech Szpankowski:
TIMES: Temporal Information Maximally Extracted from Structures. WWW 2018: 389-398 - 2017
- [j5]Abram Magner, Daisuke Kihara, Wojciech Szpankowski:
A Study of the Boltzmann Sequence-Structure Channel. Proc. IEEE 105(2): 286-305 (2017) - [j4]Yuliy M. Baryshnikov, Abram Magner:
Large Deviations for Increasing Subsequences of Permutations and a Concurrency Application. SIGMETRICS Perform. Evaluation Rev. 45(2): 39-41 (2017) - [j3]Yuliy M. Baryshnikov, Abram Magner:
Large Deviations for Increasing Subsequences of Permutations and a Concurrency Application. SIGMETRICS Perform. Evaluation Rev. 45(3): 84-89 (2017) - [c8]Jacek Cichon, Abram Magner, Wojciech Szpankowski, Krzysztof Turowski:
On Symmetries of Non-Plane Trees in a Non-Uniform Model. ANALCO 2017: 156-163 - [c7]Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski:
Entropy of some general plane trees. ISIT 2017: 301-305 - [c6]Abram Magner, Ananth Grama, Jithin K. Sreedharan, Wojciech Szpankowski:
Recovery of vertex orderings in dynamic graphs. ISIT 2017: 1563-1567 - 2016
- [j2]Abram Magner, Jaroslaw Duda, Wojciech Szpankowski, Ananth Grama:
Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(1): 92-106 (2016) - [c5]Abram Magner, Daisuke Kihara, Wojciech Szpankowski:
The Boltzmann sequence-structure channel. ISIT 2016: 255-259 - [c4]Abram Magner, Krzysztof Turowski, Wojciech Szpankowski:
Lossless compression of binary trees with correlated vertex names. ISIT 2016: 1217-1221 - [i2]Michael Drmota, Abram Magner, Wojciech Szpankowski:
Asymmetric Rényi Problem and PATRICIA Tries. CoRR abs/1605.01814 (2016) - [i1]Abram Magner, Shahin Mohammadi, Ananth Grama:
Combining Density and Overlap (CoDO): A New Method for Assessing the Significance of Overlap Among Subgraphs. CoRR abs/1605.06167 (2016) - 2015
- [b1]Abram Magner:
Profiles of PATRICIA Tries. Purdue University, USA, 2015 - [c3]Philippe Jacquet, Abram Magner:
Variance of Size in Regular Graph Tries. ANALCO 2015: 97-104 - [c2]Abram Magner, Daisuke Kihara, Wojciech Szpankowski:
Phase transitions in a sequence-structure channel. ITA 2015: 235-239 - 2014
- [j1]Abram Magner, Svante Janson, Giorgios Kollias, Wojciech Szpankowski:
On Symmetry of Uniform and Preferential Attachment Graphs. Electron. J. Comb. 21(3): 3 (2014) - [c1]Abram Magner, Charles Knessl, Wojciech Szpankowski:
Expected External Profile of PATRICIA Tries. ANALCO 2014: 16-24
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-15 20:46 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:
