default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJános Csirik
Person information
- János A. Csirik (with a middle initial) is his son
- award: Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j33]Attila Bódis
, János Csirik:
The variable-width strip packing problem. Central Eur. J. Oper. Res. 30(4): 1337-1351 (2022)- 2020
- [j32]András Dobó, János Csirik:
A Comprehensive Study of the Parameters in the Creation and Comparison of Feature Vectors in Distributional Semantic Models. J. Quant. Linguistics 27(3): 244-271 (2020) - [c40]János Csirik, György Dósa, Dávid Kószó:
Online Scheduling with Machine Cost and a Quadratic Objective Function. SOFSEM 2020: 199-210
2010 – 2019
- 2019
- [c39]András Dobó, János Csirik:
Comparison of the Best Parameter Settings in the Creation and Comparison of Feature Vectors in Distributional Semantic Models Across Multiple Languages. AIAI 2019: 487-499 - [c38]Hassina Bouressace, János Csirik:
A Convolutional Neural Network for Arabic Document Analysis. ISSPIT 2019: 1-6 - [c37]Hassina Bouressace, János Csirik:
A Self-organizing Feature Map for Arabic Word Extraction. TSD 2019: 127-136 - [e3]Imre J. Rudas, János Csirik, Carlos Toro, János Botzheim, Robert J. Howlett, Lakhmi C. Jain:
Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, Budapest, Hungary, 4-6 September 2019. Procedia Computer Science 159, Elsevier 2019 [contents] - 2018
- [j31]János Csirik:
In Memoriam Csanád Imreh. Acta Cybern. 23(3): 757-760 (2018) - [c36]Hassina Bouressace, János Csirik:
Recognition of the Logical Structure of Arabic Newspaper Pages. TSD 2018: 251-258 - [p3]János Csirik, György Dósa:
Performance Guarantees for One Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 491-517 - [p2]János Csirik, Csanád Imreh:
Variants of Classical One Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 519-538 - [p1]János Csirik:
Variable Sized Bin Packing and Bin Covering. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 539-552 - 2014
- [c35]Veronika Vincze, Viktor Varga, Katalin Ilona Simkó, János Zsibrita, Ágoston Nagy, Richárd Farkas, János Csirik:
Szeged Corpus 2.5: Morphological Modifications in a Manually POS-tagged Hungarian Corpus. LREC 2014: 1074-1078 - 2013
- [j30]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
Online Clustering with Variable Sized Clusters. Algorithmica 65(2): 251-274 (2013) - [c34]András Dobó, János Csirik:
Computing Semantic Similarity Using Large Static Corpora. SOFSEM 2013: 491-502 - 2012
- [c33]Márton Kiss, Ágoston Nagy, Veronika Vincze, Attila Almási, Zoltán Alexin, János Csirik:
A Manually Annotated Corpus of Pharmaceutical Patents. TSD 2012: 135-142 - 2011
- [c32]Horst Bunke, János Csirik, Zoltan Gingl, Erika Griechisch:
Online Signature Verification Method Based on the Acceleration Signals of Handwriting Samples. CIARP 2011: 499-506 - [c31]János Csirik, Zoltan Gingl, Erika Griechisch:
The Effect of Training Data Selection and Sampling Time Intervals on Signature Verification. AFHA 2011: 6-10 - [c30]János Csirik, Peter Bertholet, Horst Bunke:
Sequential Classifier Combination for Pattern Recognition in Wireless Sensor Networks. MCS 2011: 187-196 - [c29]István Nagy T., Richárd Farkas, János Csirik:
On Positive and Unlabeled Learning for Text Classification. TSD 2011: 219-226 - 2010
- [j29]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
On the sum minimization version of the online bin covering problem. Discret. Appl. Math. 158(13): 1381-1393 (2010) - [c28]Veronika Vincze, János Csirik:
Hungarian Corpus of Light Verb Constructions. COLING 2010: 1110-1118 - [c27]Richárd Farkas, Veronika Vincze, György Móra, János Csirik, György Szarvas:
The CoNLL-2010 Shared Task: Learning to Detect Hedges and their Scope in Natural Language Text. CoNLL Shared Task 2010: 1-12 - [c26]Veronika Vincze, Dóra Szauter, Attila Almási, György Móra, Zoltán Alexin, János Csirik:
Hungarian Dependency Treebank. LREC 2010 - [c25]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
Online Clustering with Variable Sized Clusters. MFCS 2010: 282-293 - [e2]Richárd Farkas, Veronika Vincze, György Szarvas, György Móra, János Csirik:
Proceedings of the Fourteenth Conference on Computational Natural Language Learning: Shared Task, CoNLL 2010, Uppsala, Sweden, July 15-16, 2010. ACL 2010, ISBN 978-1-932432-84-8 [contents]
2000 – 2009
- 2008
- [j28]Veronika Vincze, György Szarvas, Richárd Farkas, György Móra, János Csirik:
The BioScope corpus: biomedical texts annotated for uncertainty, negation and their scopes. BMC Bioinform. 9(S-11) (2008) - [j27]Edward G. Coffman Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán:
Random-order bin packing. Discret. Appl. Math. 156(14): 2810-2816 (2008) - [c24]György Szarvas, Veronika Vincze, Richárd Farkas, János Csirik:
The BioScope corpus: annotation for negation, uncertainty and their scope in biomedical texts. BioNLP 2008: 38-45 - [c23]Veronika Vincze, György Szarvas, Attila Almási, Dóra Szauter, Róbert Ormándi, Richárd Farkas, Csaba Hatvani, János Csirik:
Hungarian Word-Sense Disambiguated Corpus. LREC 2008 - 2007
- [j26]Edward G. Coffman Jr., János Csirik:
A Classification Scheme for Bin Packing Theory. Acta Cybern. 18(1): 47-60 (2007) - [r3]Edward G. Coffman Jr., János Csirik:
Performance Guarantees for One-Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r2]Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variants of Classical One-Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variable-Sized Bin Packing and Bin Covering. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j25]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares algorithm for bin packing. J. ACM 53(1): 1-65 (2006) - [c22]György Szarvas, Richárd Farkas, László Felföldi, András Kocsor, János Csirik:
A highly accurate Named Entity corpus for Hungarian. LREC 2006: 1957-1960 - 2005
- [c21]Dóra Csendes, János Csirik, Tibor Gyimóthy, András Kocsor:
The Szeged Treebank. TSD 2005: 123-131 - [i2]János Csirik, David S. Johnson, Claire Kenyon:
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing. CoRR abs/cs/0509031 (2005) - 2004
- [c20]Dóra Csendes, János Csirik, Tibor Gyimóthy:
The Szeged Corpus: A POS Tagged and Syntactically Annotated Hungarian Natural Language Corpus. TSD 2004: 41-48 - [c19]András Kuba, András Hócza, János Csirik:
POS Tagging of Hungarian with Combined Statistical and Rule-Based Methods. TSD 2004: 113-120 - 2003
- [j24]Xiaoyi Jiang, Karin Abegglen, Horst Bunke, János Csirik:
Dynamic computation of generalised median strings. Pattern Anal. Appl. 6(3): 185-193 (2003) - [c18]Zoltán Alexin, János Csirik, Tibor Gyimóthy, Károly Bibok, Csaba Hatvani, Gábor Prószéky, László Tihanyi:
Annotated Hungarian National Corpus. EACL 2003: 53-56 - 2002
- [j23]János Csirik, Gerhard J. Woeginger:
Resource augmentation for online bounded space bin packing. J. Algorithms 44(2): 308-320 (2002) - [c17]Árpád Beszédes, Csaba Faragó, Zsolt Mihály Szabó, János Csirik, Tibor Gyimóthy:
Union Slices for Program Maintenance. ICSM 2002: 12-21 - [i1]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares Algorithm for Bin Packing. CoRR cs.DS/0210013 (2002) - 2001
- [j22]János Csirik, David S. Johnson:
Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica 31(2): 115-138 (2001) - [c16]Árpád Beszédes, Tamás Gergely, Zsolt Mihály Szabó, János Csirik, Tibor Gyimóthy:
Dynamic Slicing Method for Maintenance of Large C Programs. CSMR 2001: 105-113 - [c15]János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger:
Buying a Constant Competitive Ratio for Paging. ESA 2001: 98-108 - [c14]Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger:
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP 2001: 862-874 - [c13]János Csirik, David S. Johnson, Claire Kenyon:
Better approximation algorithms for bin covering. SODA 2001: 557-566 - [c12]András Kocsor, János Csirik:
Fast Independent Component Analysis in Kernel Feature Spaces. SOFSEM 2001: 271-281 - 2000
- [j21]András Kocsor, László Tóth, András Kuba, Kornél Kovács, Márk Jelasity, Tibor Gyimóthy, János Csirik:
A Comparative Study of Several Feature Transformation and Learning Methods for Phoneme Classification. Int. J. Speech Technol. 3(3-4): 263-276 (2000) - [c11]János Csirik, Gerhard J. Woeginger:
Resource Augmentation for Online Bounded Space Bin Packing. ICALP 2000: 296-304 - [c10]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the sum-of-squares algorithm for bin packing. STOC 2000: 208-217
1990 – 1999
- 1999
- [j20]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Two Simple Algorithms for bin Covering. Acta Cybern. 14(1): 13-25 (1999) - [c9]János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber:
A Self Organizing Bin Packing Heuristic. ALENEX 1999: 246-265 - 1998
- [j19]Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger:
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica 21(1): 104-118 (1998) - 1997
- [j18]János Csirik, Gerhard J. Woeginger:
Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett. 63(4): 171-175 (1997) - [c8]Gabriella Kókai, János Csirik, Tibor Gyimóthy:
Learning the Syntax and Semantic Rules of an ECG Grammar. AI*IA 1997: 171-182 - [c7]Zoltán Alexin, János Csirik, Tibor Gyimóthy, Márk Jelasity, László Tóth:
Learning Phonetic Rules in a Speech Recognition System. ILP 1997: 37-44 - 1996
- [c6]János Csirik, Gerhard J. Woeginger:
On-line Packing and Covering Problems. Online Algorithms 1996: 147-177 - [c5]Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger:
On-line and Off-line Approximation Algorithms for Vector Covering Problems. ESA 1996: 406-418 - 1995
- [j17]Horst Bunke, János Csirik:
An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Inf. Process. Lett. 54(2): 93-96 (1995) - [j16]Horst Bunke, János Csirik:
Parametric string edit distance and its application to pattern recognition. IEEE Trans. Syst. Man Cybern. 25(1): 202-206 (1995) - 1993
- [j15]Horst Bunke, János Csirik:
An algorithm for matching run-length coded strings. Computing 50(4): 297-314 (1993) - [j14]János Csirik, J. B. G. Frenk, Martine Labbé:
Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discret. Appl. Math. 45(3): 197-204 (1993) - [j13]János Csirik:
The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. J. Algorithms 15(1): 1-28 (1993) - [j12]János Csirik, André van Vliet:
An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. 13(3): 149-158 (1993) - 1992
- [j11]János Csirik, Hans Kellerer, Gerhard J. Woeginger:
The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. 11(5): 281-287 (1992) - [c4]Horst Bunke, János Csirik:
Inference of edit costs using parametric string matching. ICPR (2) 1992: 549-552 - [c3]Horst Bunke, János Csirik:
Edit distance of run-length coded strings. SAC 1992: 137-143 - 1991
- [j10]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Heuristic for the 0-1 Min-Knapsack Problem. Acta Cybern. 10(1-2): 15-20 (1991) - [j9]János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan:
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. J. Algorithms 12(2): 189-203 (1991) - [c2]János Csirik, David S. Johnson:
Bounded Space On-Line Bin Packing: Best is Better than First. SODA 1991: 309-319 - 1990
- [j8]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
On the multidimensional vector bin packing. Acta Cybern. 9(4): 361-369 (1990)
1980 – 1989
- 1989
- [j7]János Csirik:
An On-Line Algorithm for Variable-Sized Bin Packing. Acta Informatica 26(8): 697-709 (1989) - [j6]János Csirik, Balázs Imreh:
On the worst-case performance of the NkF bin-packing heuristic. Acta Cybern. 9(2): 89-105 (1989) - [e1]János Csirik, János Demetrovics, Ferenc Gécseg:
Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings. Lecture Notes in Computer Science 380, Springer 1989, ISBN 3-540-51498-8 [contents] - 1988
- [j5]János Csirik, V. Totik:
Online algorithms for a dual version of bin packing. Discret. Appl. Math. 21(2): 163-167 (1988) - [c1]János Csirik, Horst Bunke:
Longest k-distance substrings of two strings. ICPR 1988: 69-71 - 1987
- [j4]János Csirik, Gábor Galambos:
On the expected behaviour of the NF algorithm for a dual bin-packing problem. Acta Cybern. 8(1): 5-9 (1987) - [j3]János Csirik, Judit Magyar, G. Polner:
A computer algorithm to determine the recognition site of restriction enzymes. Comput. Appl. Biosci. 3(3): 245-246 (1987) - 1986
- [j2]János Csirik, E. Máté:
The probabilistic behaviour of the NFD Bin Packing algorithm. Acta Cybern. 7(3): 241-245 (1986) - [j1]János Csirik, Gábor Galambos:
An O(n) bin-packing algorithm for uniformly distributed data. Computing 36(4): 313-319 (1986)
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-10-30 21:34 CET 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:
