Sean Simmons

Affiliations:
  • Massachusetts Institute of Technology, Cambridge, MA, USA
  • The University of Texas at Austin, TX, USA (former)


According to our database1, Sean Simmons authored at least 19 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Privacy-Preserving Biomedical Database Queries with Optimal Privacy-Utility Trade-Offs.
Proceedings of the Research in Computational Molecular Biology, 2020

2019
Protecting Genomic Data Privacy with Probabilistic Modeling.
Proceedings of the Biocomputing 2019: Proceedings of the Pacific Symposium, 2019

2016
Realizing privacy preserving genome-wide association studies.
Bioinform., 2016

Enabling Privacy Preserving GWAS in Heterogeneous Human Populations.
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

2015
Discovering What Dimensionality Reduction Really Tells Us About RNA-Seq Data.
J. Comput. Biol., 2015

One Size Doesn't Fit All: Measuring Individual Privacy in Aggregate Genomic Data.
Proceedings of the 2015 IEEE Symposium on Security and Privacy Workshops, 2015

2014
Abelian pattern avoidance in partial words.
RAIRO Theor. Informatics Appl., 2014

Computing Depths of Patterns.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Deciding representability of sets of words of equal length.
Theor. Comput. Sci., 2013

Abelian periods, partial words, and an extension of a theorem of Fine and Wilf.
RAIRO Theor. Informatics Appl., 2013

Counting minimal semi-Sturmian words.
Discret. Appl. Math., 2013

2012
Avoiding abelian squares in partial words.
J. Comb. Theory, Ser. A, 2012

Erratum to: Avoidable binary patterns in partial words.
Acta Informatica, 2012

Abelian repetitions in partial words.
Adv. Appl. Math., 2012

Abelian Pattern Avoidance in Partial Words.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Avoidable binary patterns in partial words.
Acta Informatica, 2011

Avoiding Abelian Powers in Partial Words.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Abelian Square-Free Partial Words.
Proceedings of the Language and Automata Theory and Applications, 2010

Classifying All Avoidable Sets of Partial Words of Size Two.
Proceedings of the Scientific Applications of Language Methods., 2010


  Loading...