default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMadalina Erascu
Person information
- affiliation: West University of Timisoara, Romania
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Madalina Erascu:
Fast and Exact Synthesis of Application Deployment Plans using Graph Neural Networks and Satisfiability Modulo Theory. IJCNN 2024: 1-10- 2023
- [c19]Vlad-Ioan Luca, Madalina Erascu:
SAGE - A Tool for Optimal Deployments in Kubernetes Clusters. CloudCom 2023: 10-17 - [c18]Andreea Postovan, Madalina Erascu:
Architecturing Binarized Neural Networks for Traffic Sign Recognition. ICANN (1) 2023: 87-98 - [c17]Andreea Postovan, Madalina Erascu:
Benchmarking Local Robustness of High-Accuracy Binary Neural Networks for Enhanced Traffic Sign Recognition. FROM 2023: 120-130 - [i4]Andreea Postovan, Madalina Erascu:
Architecturing Binarized Neural Networks for Traffic Sign Recognition. CoRR abs/2303.15005 (2023) - [i3]Bogdan David, Madalina Erascu:
Benchmarking Optimization Solvers and Symmetry Breakers for the Automated Deployment of Component-based Applications in the Cloud (EXTENDED ABSTRACT). CoRR abs/2305.15231 (2023) - [i2]Vlad-Ioan Luca, Madalina Erascu:
SAGE - A Tool for Optimal Deployments in Kubernetes Clusters. CoRR abs/2307.06318 (2023) - 2022
- [c16]Madalina Erascu, Velibor Mladenovici
:
Transferring Learning into the Workplace: Evaluating a Student-centered Learning Approach through Computer Science Students' Lens. CSEDU (2) 2022: 442-449 - [c15]Bogdan David, Madalina Erascu:
Automatic Deployment of Component-based Applications in the Cloud (short paper). SC-Square@FLoC 2022: 37-44 - 2021
- [j4]Madalina Erascu, Flavia Micota, Daniela Zaharie:
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking. J. Log. Algebraic Methods Program. 121: 100664 (2021) - 2020
- [i1]Madalina Erascu, Flavia Micota, Daniela Zaharie:
Scalable Optimal Deployment in the Cloud of Component-based Applications using Optimization Modulo Theory, Mathematical Programming and Symmetry Breaking. CoRR abs/2006.05401 (2020)
2010 – 2019
- 2018
- [c14]Flavia Micota, Madalina Erascu, Daniela Zaharie:
Constraint Satisfaction Approaches in Cloud Resource Selection for Component Based Applications. ICCP 2018: 443-450 - [c13]Madalina Erascu, Flavia Micota, Daniela Zaharie:
Influence of Variables Encoding and Symmetry Breaking on the Performance of Optimization Modulo Theories Tools Applied to Cloud Resource Selection. LPAR (Workshop and Short Papers) 2018: 1-14 - [c12]Madalina Erascu, Gabriel Iuhasz, Flavia Micota:
An Architecture for a Management Agency for Cloud Resources. SYNASC 2018: 288-295 - [c11]Bashar Al Asaad, Madalina Erascu:
A Tool for Fake News Detection. SYNASC 2018: 379-386 - 2017
- [j3]Valentina Casola, Alessandra De Benedictis, Madalina Erascu, Jolanda Modic, Massimiliano Rak:
Automatically Enforcing Security SLAs in the Cloud. IEEE Trans. Serv. Comput. 10(5): 741-755 (2017) - [c10]Marcello M. Bersani, Francesco Marconi, Matteo Rossi, Madalina Erascu, Silvio Ghilardi:
Formal verification of data-intensive applications through model checking modulo theories. SPIN 2017: 98-101 - 2016
- [j2]Madalina Erascu, Hoon Hong:
Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation). J. Symb. Comput. 75: 110-126 (2016) - [c9]Madalina Erascu:
Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms. CASC 2016: 193-211 - [c8]Valentina Casola, Alessandra De Benedictis, Madalina Erascu, Massimiliano Rak, Umberto Villano:
A Security SLA-driven Methodology to Set-Up Security Capabilities on Top of Cloud Services. CISIS 2016: 549-554 - [c7]Francesco Marconi, Marcello M. Bersani, Madalina Erascu, Matteo Rossi:
Towards the Formal Verification of Data-Intensive Applications Through Metric Temporal Logic. ICFEM 2016: 193-209 - [c6]Marcello M. Bersani, Francesco Marconi, Matteo Rossi, Madalina Erascu:
A tool for verification of big-data applications. QUDOS@ISSTA 2016: 44-45 - 2014
- [c5]Madalina Erascu, Hoon Hong:
Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation). ISSAC 2014: 162-169 - [c4]Madalina Erascu:
Semi-automatic analysis of algorithm complexity (Case study: Square-root computation). SISY 2014: 67-72 - 2013
- [j1]Madalina Erascu, Hoon Hong:
The Secant-Newton Map is Optimal Among Contracting Quadratic Maps for Square Root Computation. Reliab. Comput. 18: 73-81 (2013) - 2012
- [c3]Madalina Erascu, Tudor Jebelean:
Soundness of a Logic-Based Verification Method for Imperative Loops. SYNASC 2012: 127-134 - 2010
- [c2]Madalina Erascu, Tudor Jebelean:
A Purely Logical Approach to the Termination of Imperative Loops. SYNASC 2010: 142-149
2000 – 2009
- 2009
- [c1]Madalina Erascu, Tudor Jebelean:
A Calculus for Imperative Programs: Formalization and Implementation. SYNASC 2009: 77-84
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-10-04 21:02 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:
