default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVirginia Niculescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c36]Virginia Niculescu, Camelia Chisalita-Cretu, Cristina-Claudia Osman, Adrian Sterca:
Vector Based Modelling of Business Processes. ENASE 2024: 735-742- [c35]Dora Moraru, Adrian Sterca, Virginia Niculescu, Camelia Chisalita-Cretu, Cristina-Claudia Osman:
Conceptual Model Detection in Business Web Applications Within the RPA Context. ICSOFT 2024: 519-526 - 2023
- [j6]Virginia Niculescu, Frédéric Loulergue
:
Guest Editor's Note: High-Level Parallel Programming 2021. Int. J. Parallel Program. 51(4-5): 271-273 (2023) - [c34]Virginia Niculescu, Cristina-Claudia Osman, Camelia Chisalita-Cretu, Adrian Sterca:
Business Process Representation Analysis in the RPA Context. COMPSAC 2023: 1600-1606 - [c33]Virginia Niculescu, Horea-Adrian Grebla, Adrian Sterca, Darius Bufnea:
Efficient Academic Retrieval System Based on Aggregated Sources. ENASE 2023: 436-443 - [c32]Alina Lazar, Virginia Niculescu, David P. Bunde:
Peachy Parallel Assignments (EduPar 2023). IPDPS Workshops 2023: 248-255 - [c31]Adrian Sterca, Virginia Niculescu, Alexandru Kiraly, Darius Bufnea:
Automatic Mapping of Business Web Applications. WEBIST 2023: 437-445 - [c30]Adrian Sterca, Virginia Niculescu, Camelia Chisalita-Cretu, Cristina-Claudia Osman:
Primary Building Blocks for Web Automation. WISE 2023: 376-386 - 2022
- [j5]Virginia Niculescu, Robert Manuel Stefanica:
Tries-Based Parallel Solutions for Generating Perfect Crosswords Grids. Algorithms 15(1): 22 (2022) - [j4]Sebastian Stefan, Virginia Niculescu:
Microservice-Oriented Workload Prediction Using Deep Learning. e Informatica Softw. Eng. J. 16(1): 220107 (2022) - [c29]Virginia Niculescu, Camelia Serban, Andreea Vescan:
A New Metric for Multithreaded Parallel Programs Overhead Time Prediction. ENASE (Selected Papers) 2022: 315-336 - [c28]Virginia Niculescu, Camelia Serban, Andreea Vescan:
Towards an Overhead Estimation Model for Multithreaded Parallel Programs. ENASE 2022: 502-509 - [c27]Horea-Adrian Grebla, Catalin V. Rusu, Adrian Sterca, Darius Bufnea, Virginia Niculescu:
Recommendation System for Student Academic Progress. ICAART (3) 2022: 285-292 - [e1]Robert Andrei Buchmann, Gheorghe Cosmin Silaghi, Darius Bufnea, Virginia Niculescu, Gabriela Czibula, Carol L. Barry, Michael Lang, Henry Linger, Christoph Schneider:
Information Systems Development: Artificial Intelligence for Information Systems Development and Operations (ISD2022 Proceedings), Cluj-Napoca, Romania, 31 August - 2 September 2022. Risoprint / Association for Information Systems 2022, ISBN 978-973-53-2917-4 [contents] - 2021
- [c26]Virginia Niculescu:
Mixin based Adaptation of Design Patterns. ENASE 2021: 261-268 - [c25]Ioan Badarînza, Adrian Sterca, Darius Bufnea, Virginia Niculescu:
Integration Challenges for a Web-based Personalized Query Suggestions System in Information Retrieval. SERA 2021: 2-9 - [c24]Virginia Niculescu, Dan-Mircea Suciu, Darius Bufnea:
Agile principles applied in learning contexts. EASEAI@ESEC/SIGSOFT FSE 2021: 31-38 - 2020
- [j3]Virginia Niculescu, Frédéric Loulergue:
Transforming powerlist-based divide-and-conquer programs for an improved execution model. J. Supercomput. 76(7): 5016-5037 (2020) - [c23]Virginia Niculescu, Frédéric Loulergue, Darius Bufnea, Adrian Sterca:
Pattern-driven Design of a Multiparadigm Parallel Programming Framework. ENASE 2020: 50-61 - [c22]Virginia Niculescu, Adrian Sterca, Frédéric Loulergue:
Reflections on the Design of Parallel Programming Frameworks. ENASE (Selected Papers) 2020: 154-181 - [c21]Virginia Niculescu:
Efficient Decorator Pattern Variants through C++ Policies. ENASE 2020: 281-288 - [c20]Camelia Serban, Virginia Niculescu, Andreea Vescan:
Attaining competences in software quality oriented design based on cyclic learning. FIE 2020: 1-9 - [c19]Virginia Niculescu, Darius Bufnea, Adrian Sterca:
Enhancing Java Streams API with PowerList Computation. IPDPS Workshops 2020: 375-384 - [c18]Adrian Sterca, Darius Bufnea, Virginia Niculescu:
Bandwidth Aggregation over Multihoming Links. ISCC 2020: 1-7 - [c17]Claudia Ioana Coste, Darius Bufnea, Virginia Niculescu:
A New Language Independent Strategy for Clickbait Detection. SoftCOM 2020: 1-6 - [c16]Adrian Sterca, Darius Bufnea, Virginia Niculescu:
IP Multihoming Throughput Maximization based on Passive RTT Measurements. SoftCOM 2020: 1-6 - [i1]Virginia Niculescu, Adrian Sterca, Darius Bufnea:
Should Decorators Preserve the Component Interface? CoRR abs/2009.06414 (2020)
2010 – 2019
- 2019
- [c15]Virginia Niculescu, Camelia Serban, Andreea Vescan:
Does Cyclic Learning have Positive Impact on Teaching Object-Oriented Programming? FIE 2019: 1-9 - [c14]Virginia Niculescu, Darius Bufnea, Adrian Sterca:
MPI Scaling Up for Powerlist Based Parallel Programs. PDP 2019: 199-204 - [c13]Virginia Niculescu, Darius Bufnea, Adrian Sterca, Robert Silimon:
Multi-way Divide and Conquer Parallel Programming based on PLists. SoftCOM 2019: 1-6 - 2017
- [c12]Virginia Niculescu, Darius Bufnea:
Experience with Teaching PDC Topics into Babeş-Bolyai University's CS Courses. Euro-Par Workshops 2017: 240-251 - [c11]Virginia Niculescu, Frédéric Loulergue, Darius Bufnea, Adrian Sterca:
A Java Framework for High Level Parallel Programming Using Powerlists. PDCAT 2017: 255-262 - 2015
- [c10]Virginia Niculescu:
MixDecorator: an enhanced version of decorator pattern. EuroPLoP 2015: 36:1-36:12 - 2014
- [c9]Frédéric Loulergue, Virginia Niculescu, Julien Tesson:
Implementing Powerlists with Bulk Synchronous Parallel ML. SYNASC 2014: 325-332 - 2013
- [c8]Frédéric Loulergue, Virginia Niculescu, Simon Robillard:
Powerlists in Coq: Programming and Reasoning. CANDAR 2013: 57-65 - 2011
- [c7]Virginia Niculescu:
Formal Refinement of BSP Programs with Early Cost Evaluation. ISPDC 2011: 49-56
2000 – 2009
- 2009
- [c6]Virginia Niculescu, Adriana Mihaela Guran:
Bounded Parallelism in PowerList and ParList Theories. SYNASC 2009: 237-244 - 2007
- [j2]Virginia Niculescu:
Cost-efficient parallel programs based on set-distributions for polynomial interpolation. J. Parallel Distributed Comput. 67(8): 935-946 (2007) - [c5]Virginia Niculescu:
Data-Distributions in PowerList Theory. ICTAC 2007: 396-409 - 2006
- [c4]Virginia Niculescu:
Cost evaluation from specifications for BSP programs. IPDPS 2006 - 2005
- [c3]Virginia Niculescu, Grigoreta Sofia Moldovan:
Building an Object Oriented Computational Algebra System Based on Design Patterns. SYNASC 2005: 101-108 - 2004
- [j1]Virginia Niculescu:
On Data Distributions in the Construction of Parallel Programs. J. Supercomput. 29(1): 5-25 (2004) - [c2]Virginia Niculescu:
OOLACA: an object oriented library for abstract and computational algebra. OOPSLA Companion 2004: 160-161 - 2002
- [c1]Virginia Niculescu:
Parallel Algorithms for Fast Fourier Transformation Using PowerList , ParList and PList Theories (Research Note). Euro-Par 2002: 400-403
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 2025-01-21 00:20 CET 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:
