default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Roman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b2]Lucjan Stapp, Adam Roman, Michaël Pilaeten:
ISTQB® Certified Tester Foundation Level - A Self-Study Guide Syllabus v4.0. Springer 2024, ISBN 978-3-031-42766-4, pp. 3-398- [j12]Tomasz Wojnar
, Jaroslaw Hryszko, Adam Roman:
Mi-Go: tool which uses YouTube as data source for evaluating general-purpose speech recognition machine learning models. EURASIP J. Audio Speech Music. Process. 2024(1): 24 (2024) - 2023
- [c17]Adam Roman, Rafal Brozek, Jaroslaw Hryszko:
Predictive Power of Two Data Flow Metrics in Software Defect Prediction. ENASE 2023: 114-125 - [c16]Adam Roman, Michal Mnich, Jaroslaw Hryszko:
Empirical Verification of TQED - A New Test Design Heuristic Technique. ICTSS 2023: 80-96 - [i2]Tomasz Wojnar, Jaroslaw Hryszko, Adam Roman:
Mi-Go: Test Framework which uses YouTube as Data Source for Evaluating Speech Recognition Models like OpenAI's Whisper. CoRR abs/2309.00329 (2023) - 2021
- [j11]Adam Roman, Michal Mnich:
Test-driven development with mutation testing - an experimental study. Softw. Qual. J. 29(1): 1-38 (2021) - [c15]Hanan Ba Ali, Adam Roman:
Designing Urban Transit Network using Memetic Algorithm. CEC 2021: 343-350
2010 – 2019
- 2019
- [j10]Vojtech Vorel, Adam Roman:
Complexity of road coloring with prescribed reset words. J. Comput. Syst. Sci. 104: 342-358 (2019) - [c14]Igor T. Podolak, Adam Roman, Arkadiusz Czekajski, Damian Lesniak, Bartosz Zielinski:
Variational auto-encoders for generating feature-preserving automata. NCMA 2019: 171-185 - 2018
- [b1]Adam Roman:
A Study Guide to the ISTQB® Foundation Level 2018 Syllabus - Test Techniques and Sample Mock Exams. Springer 2018, ISBN 978-3-319-98739-2, pp. 1-225 - [j9]Igor T. Podolak, Adam Roman, Marek Szykula, Bartosz Zielinski:
A machine learning approach to synchronization of automata. Expert Syst. Appl. 97: 357-371 (2018) - 2017
- [c13]Jakub Kowalski, Adam Roman:
A New Evolutionary Algorithm for Synchronization. EvoApplications (1) 2017: 620-635 - 2016
- [c12]Adam Roman, Rafal Babiarz:
Dynamic Stylometry for Defect Prediction. KKIO Software Engineering Conference 2016: 91-102 - 2015
- [j8]Vojtech Vorel, Adam Roman:
Parameterized Complexity of Synchronization and Road Coloring. Discret. Math. Theor. Comput. Sci. 17(1): 283-306 (2015) - [j7]Adam Roman, Marek Szykula:
Forward and backward synchronizing algorithms. Expert Syst. Appl. 42(24): 9512-9527 (2015) - [c11]Vojtech Vorel, Adam Roman:
Complexity of Road Coloring with Prescribed Reset Words. LATA 2015: 161-172 - 2014
- [c10]Bartosz Zielinski, Adam Roman, Agata Drózdz, Agata Kowalewska, Marzena Frolow:
A new approach to automatic continuous artery diameter measurement. FedCSIS 2014: 247-251 - [i1]Vojtech Vorel, Adam Roman:
Complexity of Road Coloring with Prescribed Reset Words. CoRR abs/1412.0799 (2014) - 2013
- [j6]Igor T. Podolak, Adam Roman:
Theoretical Foundations and Experimental Results for a Hierarchical Classifier with Overlapping Clusters. Comput. Intell. 29(2): 357-388 (2013) - 2012
- [c9]Igor T. Podolak, Adam Roman, Dariusz Jedrzejczyk:
Application of Hierarchical Classifier to Minimal Synchronizing Word Problem. ICAISC (1) 2012: 421-429 - [c8]Adam Roman:
P-NP Threshold for Synchronizing Road Coloring. LATA 2012: 480-489 - 2011
- [j5]Adam Roman:
The NP-completeness of the Road Coloring Problem. Inf. Process. Lett. 111(7): 342-347 (2011) - [j4]Igor T. Podolak, Adam Roman:
CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem. Pattern Anal. Appl. 14(4): 395-413 (2011) - [j3]Igor T. Podolak, Adam Roman:
Risk function estimation for subproblems in a hierarchical classifier. Pattern Recognit. Lett. 32(15): 2136-2142 (2011) - [c7]Igor T. Podolak, Adam Roman:
Risk Estimation for Hierarchical Classifier. HAIS (1) 2011: 156-163 - 2010
- [c6]Krzysztof Chmiel, Adam Roman:
COMPAS - A Computing Package for Synchronization. CIAA 2010: 79-86
2000 – 2009
- 2009
- [j2]Adam Roman:
Synchronizing finite automata with short reset words. Appl. Math. Comput. 209(1): 125-136 (2009) - [c5]Adam Roman:
Decision Version of the Road Coloring Problem Is NP-Complete. FCT 2009: 287-297 - [c4]Adam Roman:
Genetic Algorithm for Synchronization. LATA 2009: 684-695 - [p1]Igor T. Podolak, Adam Roman:
A New Notion of Weakness in Classification Theory. Computer Recognition Systems 3 2009: 239-245 - 2008
- [j1]Adam Roman:
A Note on Černý Conjecture for Automata over 3-Letter Alphabet. J. Autom. Lang. Comb. 13(2): 141-143 (2008) - [c3]Adam Roman, Wit Forys:
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. SOFSEM 2008: 448-459 - [c2]Piotr Kalita, Igor T. Podolak, Adam Roman, Bartosz Bierkowski:
Algorithm for Intelligent Prediction of Requests in Business Systems. SOFSEM 2008: 696-707 - 2005
- [c1]Adam Roman:
New Algorithms for Finding Short Reset Sequences in Synchronizing Automata. IEC (Prague) 2005: 13-17
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-05-19 00:09 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:
