Publications

Export 625 results:
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
H
Hodován R, Kiss Á, Gyimóthy T.  2017.  Tree Preprocessing and Test Outcome Caching for Efficient Hierarchical Delta Debugging. Proceedings of the 12th IEEE/ACM International Workshop on Automation of Software Testing (AST 2017). :23–29.
Hodován R, Kiss Á.  2018.  Fuzzinator: An Open-Source Modular Random Testing Framework. Proceedings of the 11th IEEE International Conference on Software Testing, Verification and Validation (ICST 2018). :416-421.
Hodován R, Kiss Á.  2016.  Modernizing Hierarchical Delta Debugging. Proceedings of the 7th International Workshop on Automating Test Case Design, Selection, and Evaluation (A-TEST 2016). :31–37.
Hodován R, Herczeg Z, Kiss Á.  2010.  Regular Expressions on the Web. Proceedings of the 12th IEEE International Symposium on Web Systems Evolution (WSE 2010). :29–32.
Hodován R, Kiss Á.  2012.  Security Evolution of the Webkit Browser Engine. 14th IEEE International Symposium on Web Systems (WSE). :17–19.
Hodován R, Kiss Á.  2016.  Practical Improvements to the Minimizing Delta Debugging Algorithm. Proceedings of the 11th International Joint Conference on Software Technologies (ICSOFT 2016) – Volume 1: ICSOFT-EA. :241–248.
Holló C..  1995.  Comunicare si concurentă în CSP.
Holló C..  2003.  A partial enumeration algorithm for solving PNS problems. Mathematical and Computer Modelling. 38:855-864.
Holló C, Sárkány R, Németh T.  2016.  Hallgatói teljesítések javításának lehet\H oségei a fels\H ooktatásban informatikus szakokon. INFODIDACT 2016 Informatika Szakmódszertani Konferencia elektronikus kiadványa (DVD). :1–13.
Holló C., Imreh B, Imreh C..  2009.  Reduction techniques for the PNS problems: a novel technique and a review. Optimization and Engineering. 10:351-361.
Holló C..  1996.  Modele ale proceselor concurente bazate pe CSP.
Holló C..  1995.  Tehnici de modelare în psihologie bazate pe teoria Fuzzy. Aplicatii pentru recunoasterea motivatiilor.
Holló C., Blázsik Z, Imreh C., Kovács Z.  1999.  On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybernetica. 14:251-261.
Holló C..  2000.  A Look Ahead Branch-and-Bound Procedure for Solving PNS Problems. Pure Mathematics and Applications. 11:265-279.
Holló C..  2013.  Reliability considerations for process network synthesis problems. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH. 22?
Holló C..  2004.  Hálózati folyamatok szintézise.
Holló C, Németh T.  2015.  Tanulási eredmények alapú egyetemi kurzusleírások kész{ítése, tapasztalatok és módszertani hatások. INFODIDACT 2015 Informatika Szakmódszertani Konferencia elektronikus kiadványa (DVD). :1–8.
Holló C..  2002.  A Procedure Based on Automaton Theory Approach for Solving Modified PNS Problems. Pure Mathematics and Applications. 13:159-169.
Holló C..  2011.  Üzleti webtechnológiák.
Horváth F, Bognár S, Gergely Tamás, Rácz R, Beszédes Á, Marinković V.  2014.  Code Coverage Measurement Framework for Android Devices. Acta Cybernetica. 21:439-458.
Horváth F, Gergely Tamás, Beszédes Á, Tengeri D, Balogh G, Gyimothy T.  2019.  Code Coverage Differences of Java Bytecode and Source Code. Software Quality Journal. 27(1):79-123.
Horváth E, Forgács I, Kiss Á, Jász Judit, Gyimóthy T.  2005.  General Flow-Sensitive Pointer Analysis and Call Graph Construction. Proceedings of the Estonian Academy of Sciences – Engineering. 11:286–295.
Horváth E, Jász Judit.  2006.  Comparison of static- and dynamic call graphs. Volume of Extended Abstracts of 5th Conference of PhD Students in Computer Science (CSCS 2006). :56.
Horváth T, Alexin Z, Gyimóthy T, Fábricz K.  1990.  Towards a Multilingual Natural Language Understanding Interface (Extended Abstract). CC. :217-218.
Horváth F, la Vancsics B, Vidács L, Beszédes Á, Tengeri D, Gergely Tamás, Gyimóthy T.  2015.  Test Suite Evaluation using Code Coverage Based Metrics. Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15). :46-60.