Publications

Found 34 results
Author [ Keyword(Desc)] Title Type Year
Filters: First Letter Of Last Name is C  [Clear All Filters]
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 
Algorithms
Csirik J., Johnson DS, Kenyon C.  2001.  Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.
Application software
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
Artificial intelligence
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
Computer industry
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
C programs
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
Data flow computing
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
Debugging
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
dynamic slicing methods
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
growth rate
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
Levenshtein distance
Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.
Measurement
Csirik J., Johnson DS, Kenyon C.  2001.  Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.
Median shape
Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.
Median string
Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.
Online algorithm
Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.
Performance
Csirik J., Johnson DS, Kenyon C.  2001.  Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.
Production
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
program maintenance
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
program slicing
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.
program understanding
Beszedes A., Farago C., Z. Szabo M, Csirik J., Gyimothy T..  2002.  Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.

Pages