Publications

Export 655 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 
B
Bilicki V, Kállai T, Kasza M.  2007.  Wireless Mesh Network For Rural Communities. AVA 3 International Conference on Agricultural Ekonomics , Rural Development and Informatics. :237-247.
Bilicki V.  1998.  Mobil felhasználók mobilitásának modellezése.
Bilicki V.  2005.  LanStore: a highly distributed reliable file storage system. Proceedings of the 3rd International Conference on .NET Technologies. :47-56.
Bilicki V, Béládi R.  2010.  Monitoring the Quality of Service in Wireless Mesh Networks Consumption Aspect.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.  2005.  Minimal Slicing and the Relationships between Forms of Slicing. Proceedings of the 5th {IEEE} International Workshop on Source Code Analysis and Manipulation ({SCAM} 2005). :45–54.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.  2006.  Theoretical Foundations of Dynamic Program Slicing. Theoretical Computer Science. 360:23–41.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Ouarbya L.  2004.  Formalizing Executable Dynamic and Forward Slicing. Proceedings of the 4th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2004). :43–52.
Binkley D, Beszédes Á, Islam S, Jász Judit, la Vancsics B.  2015.  Uncovering Dependence Clusters and Linchpin Functions. Proceedings of the 31th IEEE International Conference on Software Maintenance and Evolution (ICSME'15). :141-150.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.  2006.  A Formalisation of the Relationship between Forms of Program Slicing. Science of Computer Programming. 62:228–252.
Blázsik Z, Holló C., Imreh B.  1998.  Explicit bounds for the number of feasible solutions of special PNS-problem classes. Pure Mathematics and Applications. 9:17-27.
Blázsik Z, Holló C., Imreh B.  1999.  Kiszámolható korlátok speciális PNS-problémaosztályok lehetséges megoldásainak a számára. :182-194.
Blázsik Z, Holló C., Imreh B.  1998.  On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybernetica. 13:319-328.
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On a well solvable class of the PNS problem. Novi Sad Journal of Mathematics. 30:21-30.
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On bottleneck and k-sum versions of the Process Network Synthesis problems. Novi Sad Journal of Mathematics. 30:11-19.
Blázsik Z, Holló C., Imreh C., Kovács Z.  2001.  Heuristics for the PNS problem. Optimization theory: Recent development from Mátraháza. :1-18.
Bognár S, Gergely Tamás, Rácz R, Beszédes Á, Marinkovic V.  2013.  Code Coverage Measurement Framework for Android Devices. Proceedings of the 13th Symposium on Programming Languages and Software Tools, SPLST'13. :46–60.
Bohus M, Bilicki V.  2005.  LanStore: egy elosztott, megbízható fájl tároló rendszer. Networkshop 2005. :Paper156.
van den Brand MGJ, Canfora G, Gyimóthy T.  2004.  Seventh European Conference on Software Maintenance and Reengineering (CSMR 2003). Journal of Software Maintenance and Evolution: Research and Practice. 16:217–218.
Brandic I, Emeakaroha VC, Maurer M, Dustdar S, Acs S, Kertész Attila, Kecskeméti G.  2010.  LAYSI: A Layered Approach for SLA-Violation Propagation in Self-Manageable Cloud Infrastructures. Computer Software and Applications Conference Workshops (COMPSACW), 2010 IEEE 34th Annual. :365-370.
C
Capilla R, Duenas JC, Ferenc R.  2013.  A retrospective view of software maintenance and reengineering research – a selection of papers from European Conference on Software Maintenance and Reengineering 2010. JOURNAL OF SOFTWARE MAINTENANCE AND EVOLUTION-RESEARCH AND PRACTICE. 25:569–574.
Capilla R, Duenas JC, Ferenc R.  2011.  A retrospective view of software maintenance and reengineering research a selection of papers from European Conference on Software Maintenance and Reengineering 2010. Journal of Software Maintenance and Evolution: Research and Practice.
Csaba B., Schrettner L, Beszédes Á, Jász Judit, Hegedűs P, Gyimóthy T.  2013.  Relating clusterization measures and software quality. CSMR'13. :345–348.
Csendes D, Hatvani C., Alexin Z, Csirik J, Gyimóthy T, Prószéky G, Váradi T.  2003.  Kézzel annotált magyar nyelvi korpusz: a Szeged Korpusz. I. Magyar Számítógépes Nyelvészeti Konferencia előadásai: MSZNY 2003. :238-245.
Csendes D, Alexin Z, Csirik J, Kocsor A.  2005.  A Szeged Korpusz és Treebank verzióinak története. III. magyar számítógépes grafika és geometria konferencia. :409-412.
Csendes D, Csirik J, Gyimóthy T, Kocsor A.  2005.  The Szeged Treebank. TSD. :123-131.