Andrew Winslow

 AndrewS. Winslow

Andrew S. Winslow

  • Courses0
  • Reviews0

Biography

Tufts University - Not Specified

Software Engineer at Google
Higher Education
Andrew
Winslow
Edinburg, Texas
Assistant Professor in Computer Science, with 49 peer-reviewed publications in computational geometry and algorithmic self-assembly. Experience in C, C++, and Python development in both industry and academic settings.


Experience

  • Apple

    Intern

    Intern in the Interactive Media Group.

  • Google

    Software Engineer

    Working on developer infrastructure for YouTube.

  • Université libre de Bruxelles

    Posdoctoral Researcher

    Postdoc in the Algorithms Group. Research in algorithmic and combinatorial properties of tilings (i.e. tessellations).

  • Nova Photonics, Inc.

    Subcontractor

    Algorithm development on the NASA SBIR Award NNX17CP55P entitled Coded Aperture Techniques for High-Throughput Imaging Spectroscopy with PI Yancey Sechrest.

  • The University of Texas Rio Grande Valley

    Assistant Professor

    Assistant Professor in the Department of Computer Science. Research in computational geometry and molecular computing. Teaching algorithms, programming, and mathematics courses.

Education

  • Tufts University

    Master of Science - MS

    Computer Science

  • Tufts University

    Doctor of Philosophy - PhD

    Computer Science
    Ph.D. dissertation title: Staged Self-Assembly and Polyomino Context-Free Grammars Ph.D. advisors: Diane Souvaine (Tufts), Erik Demaine (MIT)

  • University of Arizona

    Bachelor of Science - BS

    Computer Science

Publications

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Design of Geometric Molecular Bonds

    IEEE Transactions on Molecular, Biological, and Multi-Scale Communications

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Design of Geometric Molecular Bonds

    IEEE Transactions on Molecular, Biological, and Multi-Scale Communications

  • Covering Folded Shapes

    Journal of Computational Geometry

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Design of Geometric Molecular Bonds

    IEEE Transactions on Molecular, Biological, and Multi-Scale Communications

  • Covering Folded Shapes

    Journal of Computational Geometry

  • Diffuse Reflection Diameter in Simple Polygons

    Discrete Applied Mathematics

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Design of Geometric Molecular Bonds

    IEEE Transactions on Molecular, Biological, and Multi-Scale Communications

  • Covering Folded Shapes

    Journal of Computational Geometry

  • Diffuse Reflection Diameter in Simple Polygons

    Discrete Applied Mathematics

  • Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

    Proceedings of the 24th International Computing and Combinatorics Conference

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Design of Geometric Molecular Bonds

    IEEE Transactions on Molecular, Biological, and Multi-Scale Communications

  • Covering Folded Shapes

    Journal of Computational Geometry

  • Diffuse Reflection Diameter in Simple Polygons

    Discrete Applied Mathematics

  • Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

    Proceedings of the 24th International Computing and Combinatorics Conference

  • Tight Bounds for Active Self-Assembly Using an Insertion Primitive

    Algorithmica

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Design of Geometric Molecular Bonds

    IEEE Transactions on Molecular, Biological, and Multi-Scale Communications

  • Covering Folded Shapes

    Journal of Computational Geometry

  • Diffuse Reflection Diameter in Simple Polygons

    Discrete Applied Mathematics

  • Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

    Proceedings of the 24th International Computing and Combinatorics Conference

  • Tight Bounds for Active Self-Assembly Using an Insertion Primitive

    Algorithmica

  • A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino

    Proceedings of the 32nd International Symposium on Computational Geometry (SoCG)

  • Yield Prediction in Parallel Homogeneous Assembly

    Soft Matter

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Diffuse Reflection Radius in a Simple Polygon

    Algorithmica

  • Design of Geometric Molecular Bonds

    IEEE Transactions on Molecular, Biological, and Multi-Scale Communications

  • Covering Folded Shapes

    Journal of Computational Geometry

  • Diffuse Reflection Diameter in Simple Polygons

    Discrete Applied Mathematics

  • Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

    Proceedings of the 24th International Computing and Combinatorics Conference

  • Tight Bounds for Active Self-Assembly Using an Insertion Primitive

    Algorithmica

  • A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino

    Proceedings of the 32nd International Symposium on Computational Geometry (SoCG)

  • An Optimal Algorithm for Tiling the Plane with a Translated Polyomino

    Proceedings of the 26th International Symposium on Algorithms and Computation

Possible Matching Profiles

The following profiles may or may not be the same professor:

  • Andrew S Winslow (60% Match)
    Assistant Professor
    The University Of Texas Rio Grande Valley - The University Of Texas Rio Grande Valley