Julia Salzman

Orcid: 0000-0001-7630-3436

According to our database1, Julia Salzman authored at least 7 papers between 2002 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Adversarial domain translation networks for integrating large-scale atlas-level single-cell datasets.
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
Nat. Comput. Sci., 2022

2019
Molecular sampling at logarithmic rates for next-generation sequencing.
PLoS Comput. Biol., 2019

Ambiguous splice sites distinguish circRNA and linear splicing in the human genome.
Bioinform., 2019

2013
Best permutation analysis.
J. Multivar. Anal., 2013

2006
Limits on the ability of quantum states to convey classical messages.
J. ACM, 2006

2004
An improved upper bound for the pebbling threshold of the <i>n</i>-path.
Discret. Math., 2004

2002
On communication over an entanglement-assisted quantum channel.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002


  Loading...