Publications
Found 12 results
Author Keyword Title Type [ Year] Filters: Author is János Csirik [Clear All Filters]
Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica. 31:115–138.
.
2001. The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP. 2076:862–874.
.
2001. Learning the Syntax and Semantic Rules of an ECG Grammar. AI*IA. 1321:171–182.
.
1997. Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett.. 63:171–175.
.
1997. An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Inf. Process. Lett.. 54:93–96.
.
1995. Parametric string edit distance and its application to pattern recognition. IEEE Trans. Systems, Man, and Cybernetics. 25:202–206.
.
1995. An algorithm for matching run-length coded strings. Computing. 50:297–314.
.
1993. An on-line algorithm for multidimensional bin packing. Oper. Res. Lett.. 13:149–158.
.
1993. The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. J. Algorithms. 15:1–28.
.
1993. Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discrete Applied Mathematics. 45:197–204.
.
1993. Edit distance of run-length coded strings. SAC. :137–143.
.
1992. The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett.. 11:281–287.
.
1992.