Alexey Lvov

According to our database1, Alexey Lvov authored at least 13 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
FlowTuner: A Multi-Stage EDA Flow Tuner Exploiting Parameter Knowledge Transfer.
Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2021

2018
On Coloring and Colorability Analysis of Integrated Circuits with Triple and Quadruple Patterning Techniques.
Proceedings of the 2018 International Symposium on Physical Design, 2018

2015
ScaffCC: Scalable compilation and analysis of quantum programs.
Parallel Comput., 2015

2014
Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry.
Formal Methods Syst. Des., 2014

ScaffCC: a framework for compilation and analysis of quantum computing programs.
Proceedings of the Computing Frontiers Conference, CF'14, 2014

2012
Formal verification of error correcting circuits using computational algebraic geometry.
Proceedings of the Formal Methods in Computer-Aided Design, 2012

2011
Floorplanning challenges in early chip planning.
Proceedings of the IEEE 24th International SoC Conference, SOCC 2011, Taipei, Taiwan, 2011

2008
Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates.
Proceedings of the 2008 International Conference on Computer-Aided Design, 2008

2006
Novel algorithms for placement of rectangular covers for mask inspection in advanced lithography and other VLSI design applications.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006

2004
A graph based simplex method for the integer minimum perturbation problem with sum and difference constraints.
Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, 2004

2001
A Trace Bound for the Hereditary Discrepancy.
Discret. Comput. Geom., 2001

The Discrepancy of Boxes in Higher Dimension.
Discret. Comput. Geom., 2001

1999
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999


  Loading...