Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge Floros 0002
Person information
- affiliation (PhD 2019): University of Thessaly, Volos, Greece
Other persons with the same name
- Georgios Floros 0001
![[0000-0001-8193-3571]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-8193-3571")
(aka: George Floros 0001) — Aristotle University of Thessaloniki, School of Medicine, Department of Psychiatry, Greece - George Floros 0005 — University of Crete, Department of Computer Science, Greece
- Georgios Floros 0003 — RWTH Aachen University, Computer Vision Group, Germany
- Georgios Floros 0004 — Foundation for Research and Technology-Hellas Heraklion, Crete, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j6]Olympia Axelou, George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
Fast electromigration stress analysis using Low-Rank Balanced Truncation for general interconnect and power grid structures. Integr. 89: 197-206 (2023)- 2022
- [j5]Antonios N. Dadaliaris, George K. Kranas, Panagiotis Oikonomou, George Floros, Michael F. Dossis:
Exploiting Net Connectivity in Legalization and Detailed Placement Scenarios. Inf. 13(5): 212 (2022) - [j4]Antonios Tragoudaras, Pavlos Stoikos, Konstantinos Fanaras, Athanasios Tziouvaras, George Floros, Georgios Dimitriou, Kostas Kolomvatsos, Georgios I. Stamoulis:
Design Space Exploration of a Sparse MobileNetV2 Using High-Level Synthesis and Sparse Matrix Techniques on FPGAs. Sensors 22(12): 4318 (2022) - 2021
- [j3]Osama Bin Tariq, Junnan Shan, Georgios Floros, Christos P. Sotiriou, Mario R. Casu, Mihai Teodor Lazarescu, Luciano Lavagno:
High-Level Annotation of Routing Congestion for Xilinx Vivado HLS Designs. IEEE Access 9: 54286-54297 (2021) - 2020
- [j2]George Floros, Nestor E. Evmorfopoulos, Georgios I. Stamoulis:
Frequency-Limited Reduction of Regular and Singular Circuit Models Via Extended Krylov Subspace Method. IEEE Trans. Very Large Scale Integr. Syst. 28(7): 1610-1620 (2020) - 2019
- [j1]George Floros, Nestoras E. Evmorfopoulos, Georgios I. Stamoulis:
Efficient IC hotspot thermal analysis via low-rank Model Order Reduction. Integr. 66: 1-8 (2019)
Conference and Workshop Papers
- 2024
- [c18]Olympia Axelou, Kostas Kolomvatsos, George Floros, Nestor E. Evmorfopoulos, Georg I. Georgakos, George Stamoulis:
An Electromigration-Aware Wire Sizing Methodology via Particle Swarm Optimization. ACM Great Lakes Symposium on VLSI 2024: 403-408 - 2023
- [c17]Pavlos Stoikos, George Floros, Dimitrios Garyfallou, Nestor E. Evmorfopoulos, George I. Stamoulis:
A Fast Semi-Analytical Approach for Transient Electromigration Analysis of Interconnect Trees Using Matrix Exponential. ASP-DAC 2023: 1-6 - [c16]Alexandra Takou, Pavlos Stoikos, Moysis Moysis, George Floros, Nestoras E. Evmorfopoulos, Georgios I. Stamoulis:
An Efficient Security Closure Methodology for EM-based Attacks on Power Grid Structures. DFT 2023: 1-4 - [c15]Olympia Axelou, Pavlos Stoikos, George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
A System Theoretic Approach for the Reduction of Large-Scale Room Acoustic Models. EUSIPCO 2023: 381-385 - [c14]Pavlos Stoikos, Olympia Axelou, George Floros, Nestoras E. Evmorfopoulos, Georgios I. Stamoulis:
On the Reduction of Large-Scale Room Acoustic Models. ICASSP 2023: 1-5 - [c13]Alexandra Takou, Olympia Axelou, George Floros, Nestoras E. Evmorfopoulos, Georgios I. Stamoulis:
An Optimal Methodology for EM-Based Hardware Trojan Placement on Clock Tree Networks. MWSCAS 2023: 25-29 - [c12]Olympia Axelou, Eleni Tselepi, George Floros, Nestor E. Evmorfopoulos, Georgios I. Stamoulis:
PROTON - A Python Framework for Physics-Based Electromigration Assessment on Contemporary VLSI Power Grids. SMACD 2023: 1-4 - [c11]Pavlos Stoikos, George Floros, Dimitrios Garyfallou, Nestor E. Evmorfopoulos, Georgios I. Stamoulis:
Electromigration Stress Analysis with Rational Krylov-based Approximation of Matrix Exponential. SMACD 2023: 1-4 - 2022
- [c10]Olympia Axelou, Nestor E. Evmorfopoulos, George Floros, George I. Stamoulis, Sachin S. Sapatnekar:
A Novel Semi-Analytical Approach for Fast Electromigration Stress Analysis in Multi-Segment Interconnects. ICCAD 2022: 27:1-27:7 - [c9]Dimitrios Papalekas, Athanasios Tziouvaras, George Floros, Georgios Dimitriou, Michael F. Dossis, Georgios I. Stamoulis:
Near Data Processing Performance Improvement Prediction via Metric-Based Workload Classification. MOCAST 2022: 1-4 - [c8]Olympia Axelou, George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
Accelerating Electromigration Stress Analysis Using Low-Rank Balanced Truncation. SMACD 2022: 1-4 - 2021
- [c7]Chrysostomos Chatzigeorgiou, Dimitrios Garyfallou, George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
Exploiting Extended Krylov Subspace for the Reduction of Regular and Singular Circuit Models. ASP-DAC 2021: 773-778 - [c6]Dimitrios Bountas, Nestor E. Evmorfopoulos, George Dimitriou, Antonios N. Dadaliaris, George Floros, Georgios I. Stamoulis:
Statistical Estimation of Leakage Power Bounds in CMOS VLSI Circuits. PCI 2021: 312-317 - [c5]George K. Kranas, Antonios N. Dadaliaris, Panagiotis Oikonomou, George Floros, Michael F. Dossis:
Redesign, Extensibility & Evaluation of a Placement Utilities Toolset. SEEDA-CECNSM 2021: 1-5 - 2019
- [c4]George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
Efficient Circuit Reduction in Limited Frequency Windows. SMACD 2019: 129-132 - 2018
- [c3]George Floros, Konstantis Daloukas, Nestor E. Evmorfopoulos, George I. Stamoulis:
A parallel iterative approach for efficient full chip thermal analysis. MOCAST 2018: 1-4 - [c2]George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
Efficient Hotspot Thermal Simulation Via Low-Rank Model Order Reduction. SMACD 2018: 205-208 - 2014
- [c1]Georgios Floros, Konstantinos Kyritsis, Gerasimos Potamianos:
Database and baseline system for detecting degraded traffic signs in urban environments. EUVIP 2014: 1-5
Informal and Other Publications
- 2022
- [i3]Pavlos Stoikos, Dimitrios Garyfallou, George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
The Extended and Asymmetric Extended Krylov Subspace in Moment-Matching-Based Order Reduction of Large Circuit Models. CoRR abs/2204.02467 (2022) - [i2]Pavlos Stoikos, George Floros, Dimitrios Garyfallou, Nestor E. Evmorfopoulos, George I. Stamoulis:
A Fast Semi-Analytical Approach for Transient Electromigration Analysis of Interconnect Trees using Matrix Exponential. CoRR abs/2211.10320 (2022) - 2020
- [i1]Chrysostomos Chatzigeorgiou, Dimitrios Garyfallou, George Floros, Nestor E. Evmorfopoulos, George I. Stamoulis:
Exploiting Extended Krylov Subspace for the Reduction of Regular and Singular Circuit Models. CoRR abs/2007.01948 (2020)
Coauthor Index
aka: Nestor E. Evmorfopoulos
aka: George I. Stamoulis
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-08-05 20:25 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:
