Mira Shalah

mira@cs.stanford.edu
personal page

Research interests

Computational and Discrete Geometry, Combinatorics, Computer Graphics and Visualization, Human Computer Interaction, Automated Theorem Proving, Scientific Computing, and Markov chains for problems from discrete geometry.

Recent publications

(All the publications are available on the personal page linked above)
Gill Barequet and Mira Shalah, Improved Upper Bounds on the Growth constants of Polyominoes and Polycubes, submitted to the Symposium on Computational Geometry (SoCG) 2018.
Gill Barequet, Mira Shalah, and Yufei Zheng, An Improved Lower Bound on the Growth Constant of Polyiamonds, Proc. 23rd Ann. Int. Computing and Combinatorics Conference (COCOON), 50-61, 2017.   
Gill Barequet and Mira Shalah, Proper n-cell Polycubes in n-k Dimensions, European Journal of Combinatorics , 63, 146-163, June 2017.   
Gill Barequet, Gunter Rote and Mira Shalah, λ > 4 : an improved lower bound on the growth constant of polyominoes, Communications of the ACM, 59 (7), 88-95, July 2016.   
Gill Barequet and Mira Shalah, Automatic Proofs for Formulae Enumerating Proper Polycubes, Proc. 8th European Conf. on Combinatorics, Graph Theory, and Applications (EuroComb), 49, 145-151, 2015.   
Gill Barequet, Gunter Rote and Mira Shalah, λ > 4, Proc. 23rd Ann. European Symp. on Algorithms (ESA), 83-94, 2015.   
Gill Barequet and Mira Shalah, Automatic Proofs for Formulae Enumerating Proper Polycubes, Video Review at the 31st Symposium on Computational Geometry (SoCG), 19-22, June 2015.   
Gill Barequet and Mira Shalah, Polyominoes on Twisted Cylinders, Video Review at the 29th Symposium on Computational Geometry (SoCG), 339-340, June 2013.