default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey Lvov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c9]Rongjian Liang
, Jinwook Jung, Hua Xiang, Lakshmi N. Reddy, Alexey Lvov, Jiang Hu, Gi-Joon Nam:
FlowTuner: A Multi-Stage EDA Flow Tuner Exploiting Parameter Knowledge Transfer. ICCAD 2021: 1-9
2010 – 2019
- 2018
- [c8]Alexey Lvov, Gustavo E. Téllez, Gi-Joon Nam:
On Coloring and Colorability Analysis of Integrated Circuits with Triple and Quadruple Patterning Techniques. ISPD 2018: 152-159 - 2015
- [j5]Ali JavadiAbhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T. Chong, Margaret Martonosi:
ScaffCC: Scalable compilation and analysis of quantum programs. Parallel Comput. 45: 2-17 (2015) - [i1]Ali JavadiAbhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T. Chong, Margaret Martonosi:
ScaffCC: Scalable Compilation and Analysis of Quantum Programs. CoRR abs/1507.01902 (2015) - 2014
- [j4]Alexey Lvov, Luis Alfonso Lastras-Montaño, Barry M. Trager, Viresh Paruthi, Robert Shadowen, Ali El-Zein:
Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry. Formal Methods Syst. Des. 45(2): 189-212 (2014) - [c7]Ali JavadiAbhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T. Chong, Margaret Martonosi:
ScaffCC: a framework for compilation and analysis of quantum computing programs. Conf. Computing Frontiers 2014: 1:1-1:10 - 2012
- [c6]Alexey Lvov, Luis Alfonso Lastras-Montaño, Viresh Paruthi, Robert Shadowen, Ali El-Zein:
Formal verification of error correcting circuits using computational algebraic geometry. FMCAD 2012: 141-148 - 2011
- [c5]Jeonghee Shin, John A. Darringer, Guojie Luo, Merav Aharoni, Alexey Lvov, Gi-Joon Nam, Michael B. Healy:
Floorplanning challenges in early chip planning. SoCC 2011: 388-393
2000 – 2009
- 2008
- [c4]Alexey Lvov, Ulrich Finkler:
Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates. ICCAD 2008: 494-498 - 2006
- [j3]Kanad Chakraborty, Alexey Lvov, Maharaj Mukherjee:
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. 25(1): 79-91 (2006) - 2004
- [c3]Alexey Lvov, Fook-Luen Heng:
A graph based simplex method for the integer minimum perturbation problem with sum and difference constraints. ACM Great Lakes Symposium on VLSI 2004: 67-72 - 2001
- [j2]Bernard Chazelle, Alexey Lvov:
The Discrepancy of Boxes in Higher Dimension. Discret. Comput. Geom. 25(4): 519-524 (2001) - [j1]Bernard Chazelle, Alexey Lvov:
A Trace Bound for the Hereditary Discrepancy. Discret. Comput. Geom. 26(2): 221-231 (2001) - 2000
- [c2]Bernard Chazelle, Alexey Lvov:
A trace bound for the hereditary discrepancy. SCG 2000: 64-69
1990 – 1999
- 1999
- [c1]Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov:
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. STOC 1999: 305-311
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
