Zhe Feng

Affiliations:

University of California, Los Angeles, USA

According to our database¹, Zhe Feng authored at least 15 papers between 2005 and 2014.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2014

IPF: In-Place X-Filling Algorithm for the Reliability of Modern FPGAs.

[BibT_eX]

[DOI]

Zhe Feng

Naifeng Jing

Lei He

IEEE Trans. Very Large Scale Integr. Syst., 2014

2012

SEU fault evaluation and characteristics for SRAM-based FPGA architectures and synthesis algorithms.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 2012

2011

Quantitative SEU Fault Evaluation for SRAM-Based FPGA Architectures and Synthesis Algorithms.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Field Programmable Logic and Applications, 2011

IPF: In-Place X-Filling to Mitigate Soft Errors in SRAM-Based FPGAs.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Field Programmable Logic and Applications, 2011

Acceleration of Multi-agent Simulation on FPGAs.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Field Programmable Logic and Applications, 2011

2010

In-place decomposition for robustness in FPGA.

[BibT_eX]

[DOI]

Ju-Yueh Lee

Zhe Feng

Lei He

Proceedings of the 2010 International Conference on Computer-Aided Design, 2010

2009

IPR: In-Place Reconfiguration for FPGA fault tolerance.

[BibT_eX]

[DOI]

Proceedings of the 2009 International Conference on Computer-Aided Design, 2009

2008

Fashion: A Fast and Accurate Solution to Global Routing Problem.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008

A full-scale solution to the rectilinear obstacle-avoiding Steiner problem.

[BibT_eX]

[DOI]

Integr., 2008

Robust FPGA resynthesis based on fault-tolerant Boolean matching.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on Computer-Aided Design, 2008

2007

lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007

2006

ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2006

An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Symposium on Physical Design, 2006

CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model.

[BibT_eX]

[DOI]

Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, 2006

2005

An-OARSMan: obstacle-avoiding routing tree construction with good length performance.

[BibT_eX]

[DOI]

Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

Zhe Feng

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...