This list includes papers published at CORE A* conferences where at least one author has a Hungarian affiliation.

Authors:

ALL

keywords:

ALL TheoryAppliedAll_hungarianMostly_hungarianInternationalBMEELTERényiSZTEEricssonSZTAKICorvinusPPKE

2025

• S. Bhore, B. Keszegh, A. Kupavskii, H. Le, A. Louvet, Dömötör. Pálvölgyi, and C. D. Tóth, “Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.,” in SODA, 2025.
  [Bibtex]

  @inproceedings{sodaBhoreKK0LPT25,
  author = {Sujoy Bhore and Bal\'azs Keszegh and Andrey Kupavskii and Hung Le and Alexandre Louvet and D\"om\"ot\"or P\'alv\"olgyi and Csaba D. T\'oth},
  title = {Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.},
  booktitle = {SODA},
  year = 2025,
  doi = {https://doi.org/10.1137/1.9781611978322.145},
  keywords = {Rényi and ELTE and international and theory}
  }

• K. Bérczi, B. Gehér, A. Imolay, L. Lovász, B. Maga, and T. Schwarcz, “Matroid Products via Submodular Coupling.,” in STOC, 2025.
  [Bibtex]

  @inproceedings{stocBercziGI0MS25,
  author = {Krist\'of B\'erczi and Bogl\'arka Geh\'er and Andr\'as Imolay and L\'aszl\'o Lov\'asz and Bal\'azs Maga and Tam\'as Schwarcz},
  title = {Matroid Products via Submodular Coupling.},
  booktitle = {STOC},
  year = 2025,
  doi = {['https://doi.org/10.1145/3717823.3718152', 'https://www.wikidata.org/entity/Q135685490']},
  keywords = {ELTE and mostly_hungarian and theory}
  }

• S. Pettie and G. Tardos, “A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices.,” in SODA, 2025.
  [Bibtex]

  @inproceedings{sodaPettieT25,
  author = {Seth Pettie and G\'abor Tardos},
  title = {A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices.},
  booktitle = {SODA},
  year = 2025,
  doi = {https://doi.org/10.1137/1.9781611978322.152},
  keywords = {Rényi and international and theory}
  }

• E. Aljalbout, N. Sotirakis, P. van der Smagt, M. Karl, and N. Chen, “LIMT: Language-Informed Multi-Task Visual World Models.,” in ICRA, 2025.
  [Bibtex]

  @inproceedings{icraAljalboutSSKC25,
  author = {Elie Aljalbout and Nikolaos Sotirakis and Patrick van der Smagt and Maximilian Karl and Nutan Chen},
  title = {LIMT: Language-Informed Multi-Task Visual World Models.},
  booktitle = {ICRA},
  year = 2025,
  doi = {https://doi.org/10.1109/ICRA55743.2025.11128817},
  keywords = {Hungary and international and applied}
  }

• P. Antal, T. Péni, and R. Tóth, “Hook-Based Aerial Payload Grasping from a Moving Platform.,” in ICRA, 2025.
  [Bibtex]

  @inproceedings{icraAntalPT25,
  author = {P\'eter Antal and Tam\'as P\'eni and Roland T\'oth},
  title = {Hook-Based Aerial Payload Grasping from a Moving Platform.},
  booktitle = {ICRA},
  year = 2025,
  doi = {https://doi.org/10.1109/ICRA55743.2025.11127483},
  keywords = {BME and SZTAKI and mostly_hungarian and applied}
  }

• B. Chen, J. A. H. López, G. Mussbacher, and D. Varró, “The Power of Types: Exploring the Impact of Type Checking on Neural Bug Detection in Dynamically Typed Languages.,” in ICSE, 2025.
  [Bibtex]

  @inproceedings{icseChenLMV25,
  author = {Boqi Chen and Jos\'e Antonio Hern\'andez L\'opez and Gunter Mussbacher and D\'aniel Varr\'o},
  title = {The Power of Types: Exploring the Impact of Type Checking on Neural Bug Detection in Dynamically Typed Languages.},
  booktitle = {ICSE},
  year = 2025,
  doi = {https://doi.org/10.1109/ICSE55347.2025.00088},
  keywords = {BME and international and applied}
  }

• D. M. Kelen, Ádám. Jung, P. Kersch, and A. A. Benczúr, “Distribution-Free Data Uncertainty for Neural Network Regression.,” in ICLR, 2025.
  [Bibtex]

  @inproceedings{iclrKelenJKB25,
  author = {Domokos M. Kelen and \'Ad\'am Jung and P\'eter Kersch and Andr\'as A. Bencz\'ur},
  title = {Distribution-Free Data Uncertainty for Neural Network Regression.},
  booktitle = {ICLR},
  year = 2025,
  doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=pDDODPtpx9'}},
  keywords = {SZTAKI and BME and mostly_hungarian and theory}
  }

• A. Balogh and M. Jelasity, “How Not to Stitch Representations to Measure Similarity: Task Loss Matching Versus Direct Matching.,” in AAAI, 2025.
  [Bibtex]

  @inproceedings{aaaiBaloghJ25,
  author = {Andr\'as Balogh and M\'ark Jelasity},
  title = {How Not to Stitch Representations to Measure Similarity: Task Loss Matching Versus Direct Matching.},
  booktitle = {AAAI},
  year = 2025,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v39i15.33698'}},
  keywords = {SZTE and all_hungarian and applied}
  }

• Y. Chen, A. Gilyén, and R. de Wolf, “A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix.,” in SODA, 2025.
  [Bibtex]

  @inproceedings{sodaChenGW25,
  author = {Yanlin Chen and Andr\'as Gily\'en and Ronald de Wolf},
  title = {A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix.},
  booktitle = {SODA},
  year = 2025,
  doi = {https://doi.org/10.1137/1.9781611978322.29},
  keywords = {ELTE and international and theory}
  }

• I. Schlotter and K. Cechlárová, “Candidate Nomination for Condorcet-consistent Voting Rules.,” in AAMAS, 2025.
  [Bibtex]

  @inproceedings{ifaamasSchlotterC25,
  author = {Ildik\'o Schlotter and Katar\'ina Cechl\'arov\'a},
  title = {Candidate Nomination for Condorcet-consistent Voting Rules.},
  booktitle = {AAMAS},
  year = 2025,
  doi = {https://dl.acm.org/doi/10.5555/3709347.3743822},
  keywords = {BME and international and theory}
  }

• I. Schlotter and L. M. Mendoza-Cadena, “The Strong Core of Housing Markets with Partial Order Preferences.,” in AAMAS, 2025.
  [Bibtex]

  @inproceedings{ifaamasSchlotterC25a,
  author = {Ildik\'o Schlotter and Lydia Mirabel Mendoza-Cadena},
  title = {The Strong Core of Housing Markets with Partial Order Preferences.},
  booktitle = {AAMAS},
  year = 2025,
  doi = {https://dl.acm.org/doi/10.5555/3709347.3743823},
  keywords = {BME and international and theory}
  }

• J. Chen, J. Kaczmarek, P. Nüsken, J. Rothe, I. Schlotter, and T. Seeger, “Control in Computational Social Choice.,” in IJCAI, 2025.
  [Bibtex]

  @inproceedings{ijcai00010NRSS25,
  author = {Jiehua Chen and Joanna Kaczmarek and Paul N\"usken and J\"org Rothe and Ildik\'o Schlotter and Tessa Seeger},
  title = {Control in Computational Social Choice.},
  booktitle = {IJCAI},
  year = 2025,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2025/1154'}},
  keywords = {BME and international and theory}
  }

• W. Castryck, T. Decru, P. Kutas, A. Laval, C. Petit, and Y. B. Ti, “‘sup': ‘2’, ‘#text': ‘KLPT: Algebraic Pathfinding in Dimension Two and Applications.’,” in CRYPTO (1), 2025.
  [Bibtex]

  @inproceedings{cryptoCastryckDKLPT25,
  author = {Wouter Castryck and Thomas Decru and P\'eter Kutas and Abel Laval and Christophe Petit and Yan Bo Ti},
  title = {{'sup': '2', '#text': 'KLPT: Algebraic Pathfinding in Dimension Two and Applications.'}},
  booktitle = {CRYPTO (1)},
  year = 2025,
  doi = {https://doi.org/10.1007/978-3-032-01855-7_6},
  keywords = {ELTE and international and theory}
  }

2024

• S. Pettie and G. Tardos, “On the Extremal Functions of Acyclic Forbidden 0-1 Matrices.,” in SODA, 2024.
  [Bibtex]

  @inproceedings{sodaPettieT24,
  author = {Seth Pettie and G\'abor Tardos},
  title = {On the Extremal Functions of Acyclic Forbidden 0-1 Matrices.},
  booktitle = {SODA},
  year = 2024,
  doi = {https://doi.org/10.1137/1.9781611977912.45},
  keywords = {Rényi and international and theory}
  }

• E. R. Bérczi-Kovács, P. Gyimesi, B. Vass, and J. Tapolcai, “Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks.,” in INFOCOM, 2024.
  [Bibtex]

  @inproceedings{infocomBerczi-KovacsGV24,
  author = {Erika R. B\'erczi-Kov\'acs and P\'eter Gyimesi and Bal\'azs Vass and J\'anos Tapolcai},
  title = {Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks.},
  booktitle = {INFOCOM},
  year = 2024,
  doi = {https://doi.org/10.1109/INFOCOM52122.2024.10621256},
  keywords = {ELTE and BME and all_hungarian and applied}
  }

• N. J. Wilhelm, S. Haddadin, R. Burgkart, P. van der Smagt, and M. Karl, “Accurate Kinematic Modeling using Autoencoders on Differentiable Joints.,” in ICRA, 2024.
  [Bibtex]

  @inproceedings{icraWilhelmHBSK24,
  author = {Nikolas J. Wilhelm and Sami Haddadin and Rainer Burgkart and Patrick van der Smagt and Maximilian Karl},
  title = {Accurate Kinematic Modeling using Autoencoders on Differentiable Joints.},
  booktitle = {ICRA},
  year = 2024,
  doi = {https://doi.org/10.1109/ICRA57147.2024.10611062},
  keywords = {Hungary and international and applied}
  }

• N. J. Wilhelm, C. Glowalla, S. Haddadin, J. Schote, H. Höppner, P. van der Smagt, M. Karl, and R. Burgkart, “Design and Implementation of a Robotic Testbench for Analyzing Pincer Grip Execution in Human Specimen Hands.,” in ICRA, 2024.
  [Bibtex]

  @inproceedings{icraWilhelmGHSHSKB24,
  author = {Nikolas J. Wilhelm and Claudio Glowalla and Sami Haddadin and Julian Schote and Hannes H\"oppner and Patrick van der Smagt and Maximilian Karl and Rainer Burgkart},
  title = {Design and Implementation of a Robotic Testbench for Analyzing Pincer Grip Execution in Human Specimen Hands.},
  booktitle = {ICRA},
  year = 2024,
  doi = {https://doi.org/10.1109/ICRA57147.2024.10610715},
  keywords = {Hungary and international and applied}
  }

• M. Alles, P. Becker-Ehmck, P. van der Smagt, and M. Karl, “Constrained Latent Action Policies for Model-Based Offline Reinforcement Learning.,” in NeurIPS, 2024.
  [Bibtex]

  @inproceedings{nipsAllesBSK24,
  author = {Marvin Alles and Philip Becker-Ehmck and Patrick van der Smagt and Maximilian Karl},
  title = {Constrained Latent Action Policies for Model-Based Offline Reinforcement Learning.},
  booktitle = {NeurIPS},
  year = 2024,
  doi = {{'@type': 'oa', '#text': 'http://papers.nips.cc/paper_files/paper/2024/hash/82389fbff376d1e8aec510916d50d054-Abstract-Conference.html'}},
  keywords = {Hungary and international and applied}
  }

• G. Ivanyos, E. J. Mendoza, Y. Qiao, X. Sun, and C. Zhang, “Faster Isomorphism Testing of p-Groups of Frattini Class 2.,” in FOCS, 2024.
  [Bibtex]

  @inproceedings{focsIvanyosMQSZ24,
  author = {G\'abor Ivanyos and Euan J. Mendoza and Youming Qiao and Xiaorui Sun and Chuanqi Zhang},
  title = {Faster Isomorphism Testing of p-Groups of Frattini Class 2.},
  booktitle = {FOCS},
  year = 2024,
  doi = {https://doi.org/10.1109/FOCS61266.2024.00090},
  keywords = {SZTAKI and international and theory}
  }

• L. Halmosi, B. Mohos, and M. Jelasity, “Evaluating the Adversarial Robustness of Semantic Segmentation: Trying Harder Pays Off.,” in ECCV (79), 2024.
  [Bibtex]

  @inproceedings{eccvHalmosiMJ24,
  author = {Levente Halmosi and B\'alint Mohos and M\'ark Jelasity},
  title = {Evaluating the Adversarial Robustness of Semantic Segmentation: Trying Harder Pays Off.},
  booktitle = {ECCV (79)},
  year = 2024,
  doi = {https://doi.org/10.1007/978-3-031-72986-7_1},
  keywords = {SZTE and all_hungarian and applied}
  }

• T. Kavitha, K. Makino, I. Schlotter, and Y. Yokoi, “Arborescences, Colorful Forests, and Popularity.,” in SODA, 2024.
  [Bibtex]

  @inproceedings{sodaKavithaMSY24,
  author = {Telikepalli Kavitha and Kazuhisa Makino and Ildik\'o Schlotter and Yu Yokoi},
  title = {Arborescences, Colorful Forests, and Popularity.},
  booktitle = {SODA},
  year = 2024,
  doi = {https://doi.org/10.1137/1.9781611977912.131},
  keywords = {BME and international and theory}
  }

• G. Csáji, “A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems.,” in AAMAS, 2024.
  [Bibtex]

  @inproceedings{atalCsaji24,
  author = {Gergely Cs\'aji},
  title = {A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems.},
  booktitle = {AAMAS},
  year = 2024,
  doi = {https://dl.acm.org/doi/10.5555/3635637.3662890},
  keywords = {ELTE and all_hungarian and theory}
  }

• L. Codazzi, G. Csáji, and M. Mnich, “Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities.,” in IJCAI, 2024.
  [Bibtex]

  @inproceedings{ijcaiCodazziCM24,
  author = {Laura Codazzi and Gergely Cs\'aji and Matthias Mnich},
  title = {Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities.},
  booktitle = {IJCAI},
  year = 2024,
  doi = {{'@type': 'oa', '#text': 'https://www.ijcai.org/proceedings/2024/207'}},
  keywords = {ELTE and international and theory}
  }

• G. Csáji, D. F. Manlove, I. McBride, and J. Trimble, “Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.,” in IJCAI, 2024.
  [Bibtex]

  @inproceedings{ijcaiCsajiMM024,
  author = {Gergely Cs\'aji and David F. Manlove and Iain McBride and James Trimble},
  title = {Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.},
  booktitle = {IJCAI},
  year = 2024,
  doi = {{'@type': 'oa', '#text': 'https://www.ijcai.org/proceedings/2024/302'}},
  keywords = {ELTE and international and theory}
  }

• G. Csáji, “Popular and Dominant Matchings with Uncertain and Multimodal Preferences.,” in IJCAI, 2024.
  [Bibtex]

  @inproceedings{ijcaiCsaji24,
  author = {Gergely Cs\'aji},
  title = {Popular and Dominant Matchings with Uncertain and Multimodal Preferences.},
  booktitle = {IJCAI},
  year = 2024,
  doi = {{'@type': 'oa', '#text': 'https://www.ijcai.org/proceedings/2024/303'}},
  keywords = {ELTE and all_hungarian and theory}
  }

• K. Bérczi, B. Mátravölgyi, and T. Schwarcz, “Reconfiguration of Basis Pairs in Regular Matroids.,” in STOC, 2024.
  [Bibtex]

  @inproceedings{stocBercziMS24,
  author = {Krist\'of B\'erczi and Bence M\'atrav\"olgyi and Tam\'as Schwarcz},
  title = {Reconfiguration of Basis Pairs in Regular Matroids.},
  booktitle = {STOC},
  year = 2024,
  doi = {['https://doi.org/10.1145/3618260.3649660', 'https://www.wikidata.org/entity/Q130980783']},
  keywords = {ELTE and mostly_hungarian and theory}
  }

• B. Bencina, P. Kutas, S. Merz, C. Petit, M. Stopar, and C. Weitkämper, “Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves.,” in CRYPTO (5), 2024.
  [Bibtex]

  @inproceedings{cryptoBencinaKMPSW24,
  author = {Benjamin Bencina and P\'eter Kutas and Simon-Philipp Merz and Christophe Petit and Miha Stopar and Charlotte Weitkämper},
  title = {Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves.},
  booktitle = {CRYPTO (5)},
  year = 2024,
  doi = {https://doi.org/10.1007/978-3-031-68388-6_8},
  keywords = {ELTE and international and theory}
  }

• E. N. Tas, I. A. Seres, Y. Zhang, M. Melczer, M. Kelkar, J. Bonneau, and V. Nikolaenko, “Atomic and Fair Data Exchange via Blockchain.,” in CCS, 2024.
  [Bibtex]

  @inproceedings{ccsTasSZMKBN24,
  author = {Ertem Nusret Tas and Istv\'an Andr\'as Seres and Yinuo Zhang and M\'ark Melczer and Mahimna Kelkar and Joseph Bonneau and Valeria Nikolaenko},
  title = {Atomic and Fair Data Exchange via Blockchain.},
  booktitle = {CCS},
  year = 2024,
  doi = {https://doi.org/10.1145/3658644.3690248},
  keywords = {ELTE and international and theory}
  }

2023

• D. Barath, D. Rozumnyi, I. Eichhardt, L. Hajder, and J. Matas, “Finding Geometric Models by Clustering in the Consensus Space.,” in CVPR, 2023.
  [Bibtex]

  @inproceedings{cvprBarathREHM23,
  author = {Daniel Barath and Denys Rozumnyi and Ivan Eichhardt and Levente Hajder and Jiri Matas},
  title = {Finding Geometric Models by Clustering in the Consensus Space.},
  booktitle = {CVPR},
  year = 2023,
  doi = {https://doi.org/10.1109/CVPR52729.2023.00524},
  keywords = {ELTE and international and theory}
  }

• L. Hajder, L. Lóczi, and D. Barath, “Fast Globally Optimal Surface Normal from an Affine Correspondence.,” in ICCV, 2023.
  [Bibtex]

  @inproceedings{iccvHajderLB23,
  author = {Levente Hajder and Lajos L\'oczi and Daniel Barath},
  title = {Fast Globally Optimal Surface Normal from an Affine Correspondence.},
  booktitle = {ICCV},
  year = 2023,
  doi = {https://doi.org/10.1109/ICCV51070.2023.00314},
  keywords = {ELTE and mostly_hungarian and theory}
  }

• J. Tapolcai, P. Babarczi, P. Ho, and L. Rónyai, “Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences.,” in INFOCOM, 2023.
  [Bibtex]

  @inproceedings{infocomTapolcaiBHR23,
  author = {J\'anos Tapolcai and P\'eter Babarczi and Pin-Han Ho and Lajos R\'onyai},
  title = {Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences.},
  booktitle = {INFOCOM},
  year = 2023,
  doi = {https://doi.org/10.1109/INFOCOM53939.2023.10229023},
  keywords = {BME and mostly_hungarian and applied}
  }

• X. Zhang, P. Becker-Ehmck, P. van der Smagt, and M. Karl, “Action Inference by Maximising Evidence: Zero-Shot Imitation from Observation with World Models.,” in NeurIPS, 2023.
  [Bibtex]

  @inproceedings{nipsZhangBSK23,
  author = {Xingyuan Zhang and Philip Becker-Ehmck and Patrick van der Smagt and Maximilian Karl},
  title = {Action Inference by Maximising Evidence: Zero-Shot Imitation from Observation with World Models.},
  booktitle = {NeurIPS},
  year = 2023,
  doi = {{'@type': 'oa', '#text': 'http://papers.nips.cc/paper_files/paper/2023/hash/90e73f3cf1a6c84c723a2e8b7fb2b2c1-Abstract-Conference.html'}},
  keywords = {Hungary and international and applied}
  }

• V. Addanki, M. Pacut, A. Pourdamghani, G. Rétvári, S. Schmid, and J. Vanerio, “Self-Adjusting Partially Ordered Lists.,” in INFOCOM, 2023.
  [Bibtex]

  @inproceedings{infocomAddankiPPRSV23,
  author = {Vamsi Addanki and Maciej Pacut and Arash Pourdamghani and G\'abor R\'etv\'ari and Stefan Schmid and Juan Vanerio},
  title = {Self-Adjusting Partially Ordered Lists.},
  booktitle = {INFOCOM},
  year = 2023,
  doi = {https://doi.org/10.1109/INFOCOM53939.2023.10228937},
  keywords = {BME and international and applied}
  }

• G. Ivanyos and Y. Qiao, “On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions.,” in SODA, 2023.
  [Bibtex]

  @inproceedings{sodaIvanyosQ23,
  author = {G\'abor Ivanyos and Youming Qiao},
  title = {On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions.},
  booktitle = {SODA},
  year = 2023,
  doi = {https://doi.org/10.1137/1.9781611977554.ch158},
  keywords = {SZTAKI and international and theory}
  }

• D. M. Kelen, M. Petreczky, P. Kersch, and A. A. Benczúr, “Theoretical Evaluation of Asymmetric Shapley Values for Root-Cause Analysis.,” in ICDM, 2023.
  [Bibtex]

  @inproceedings{icdmKelenPKB23,
  author = {Domokos M. Kelen and Mih\'aly Petreczky and P\'eter Kersch and Andr\'as A. Bencz\'ur},
  title = {Theoretical Evaluation of Asymmetric Shapley Values for Root-Cause Analysis.},
  booktitle = {ICDM},
  year = 2023,
  doi = {https://doi.org/10.1109/ICDM58522.2023.00030},
  keywords = {SZTAKI and BME and mostly_hungarian and theory}
  }

• A. Balogh and M. Jelasity, “On the Functional Similarity of Robust and Non-Robust Neural Representations.,” in ICML, 2023.
  [Bibtex]

  @inproceedings{icmlBaloghJ23,
  author = {Andr\'as Balogh and M\'ark Jelasity},
  title = {On the Functional Similarity of Robust and Non-Robust Neural Representations.},
  booktitle = {ICML},
  year = 2023,
  doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/balogh23a.html'}},
  keywords = {SZTE and all_hungarian and applied}
  }

• J. van Apeldoorn, A. Cornelissen, A. Gilyén, and G. Nannicini, “Quantum tomography using state-preparation unitaries.,” in SODA, 2023.
  [Bibtex]

  @inproceedings{sodaApeldoornCGN23,
  author = {Joran van Apeldoorn and Arjan Cornelissen and Andr\'as Gily\'en and Giacomo Nannicini},
  title = {Quantum tomography using state-preparation unitaries.},
  booktitle = {SODA},
  year = 2023,
  doi = {https://doi.org/10.1137/1.9781611977554.ch47},
  keywords = {ELTE and international and theory}
  }

• J. Chen, G. Csáji, S. Roy, and S. Simola, “Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity.,” in AAMAS, 2023.
  [Bibtex]

  @inproceedings{atal0001CRS23,
  author = {Jiehua Chen and Gergely Cs\'aji and Sanjukta Roy and Sofia Simola},
  title = {Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity.},
  booktitle = {AAMAS},
  year = 2023,
  doi = {https://dl.acm.org/doi/10.5555/3545946.3598644},
  keywords = {ELTE and international and theory}
  }

• M. Oldenhof, G. Ács, B. Pejó, A. Schuffenhauer, N. Holway, N. Sturm, A. Dieckmann, O. Fortmeier, E. Boniface, C. Mayer, A. Gohier, P. Schmidtke, R. Niwayama, D. Kopecky, L. H. Mervin, P. C. Rathi, L. Friedrich, A. Formanek, P. Antal, J. Rahaman, A. Zalewski, W. Heyndrickx, E. Oluoch, M. Stößel, M. Vanco, D. Endico, F. Gelus, T. de Boisfossé, A. Darbier, A. Nicollet, M. Blottière, M. Telenczuk, V. T. Nguyen, T. Martinez, C. Boillet, K. Moutet, A. Picosson, A. Gasser, I. Djafar, A. Simon, A. Arany, J. Simm, Y. Moreau, O. Engkvist, H. Ceulemans, C. Marini, and M. Galtier, “Industry-Scale Orchestrated Federated Learning for Drug Discovery.,” in AAAI, 2023.
  [Bibtex]

  @inproceedings{aaaiOldenhofAPSHSDF23,
  author = {Martijn Oldenhof and Gergely \'Acs and Bal\'azs Pej\'o and Ansgar Schuffenhauer and Nicholas Holway and No\'e Sturm and Arne Dieckmann and Oliver Fortmeier and Eric Boniface and Cl\'ement Mayer and Arnaud Gohier and Peter Schmidtke and Ritsuya Niwayama and Dieter Kopecky and Lewis H. Mervin and Prakash Chandra Rathi and Lukas Friedrich and Andr\'as Formanek and Peter Antal and Jordon Rahaman and Adam Zalewski and Wouter Heyndrickx and Ezron Oluoch and Manuel St\"oßel and Michal Vanco and David Endico and Fabien Gelus and Thaïs de Boisfoss\'e and Adrien Darbier and Ashley Nicollet and Matthieu Blottière and Maria Telenczuk and Van Tien Nguyen and Thibaud Martinez and Camille Boillet and Kelvin Moutet and Alexandre Picosson and Aur\'elien Gasser and Inal Djafar and Antoine Simon and Adam Arany and Jaak Simm and Yves Moreau and Ola Engkvist and Hugo Ceulemans and Camille Marini and Mathieu Galtier},
  title = {Industry-Scale Orchestrated Federated Learning for Drug Discovery.},
  booktitle = {AAAI},
  year = 2023,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v37i13.26847'}},
  keywords = {BME and international and applied}
  }

• J. Balogh, D. Dong, B. Lidický, N. Mani, and Y. Zhao, “Nearly All k-SAT Functions Are Unate.,” in STOC, 2023.
  [Bibtex]

  @inproceedings{stocBaloghDLMZ23,
  author = {J\'ozsef Balogh and Dingding Dong and Bernard Lidický and Nitya Mani and Yufei Zhao},
  title = {Nearly All k-SAT Functions Are Unate.},
  booktitle = {STOC},
  year = 2023,
  doi = {https://doi.org/10.1145/3564246.3585123},
  keywords = {Hungary and international and theory}
  }

• F. Bencs, P. Csikvári, P. Srivastava, and J. Vondrák, “On complex roots of the independence polynomial.,” in SODA, 2023.
  [Bibtex]

  @inproceedings{sodaBencsC0V23,
  author = {Ferenc Bencs and P\'eter Csikv\'ari and Piyush Srivastava and Jan Vondr\'ak},
  title = {On complex roots of the independence polynomial.},
  booktitle = {SODA},
  year = 2023,
  doi = {https://doi.org/10.1137/1.9781611977554.ch29},
  keywords = {ELTE and international and theory}
  }

2022

• D. Barath and G. Valasek, “Space-Partitioning RANSAC.,” in ECCV (32), 2022.
  [Bibtex]

  @inproceedings{eccvBarathV22,
  author = {Daniel Barath and G\'abor Valasek},
  title = {Space-Partitioning RANSAC.},
  booktitle = {ECCV (32)},
  year = 2022,
  doi = {https://doi.org/10.1007/978-3-031-19824-3_42},
  keywords = {Hungary and international and applied}
  }

• B. Vass, E. R. Bérczi-Kovács, Á. Barabás, Z. L. Hajdú, and J. Tapolcai, “Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem.,” in INFOCOM, 2022.
  [Bibtex]

  @inproceedings{infocomVassBBHT22,
  author = {Bal\'azs Vass and Erika R. B\'erczi-Kov\'acs and \'Abel Barab\'as and Zsombor L. Hajd\'u and J\'anos Tapolcai},
  title = {Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem.},
  booktitle = {INFOCOM},
  year = 2022,
  doi = {https://doi.org/10.1109/INFOCOM48880.2022.9796870},
  keywords = {BME and ELTE and all_hungarian and applied}
  }

• B. Chen, K. Marussy, S. Pilarski, O. Semeráth, and D. Varró, “Consistent Scene Graph Generation by Constraint Optimization.,” in ASE, 2022.
  [Bibtex]

  @inproceedings{kbseChenMPSV22,
  author = {Boqi Chen and Krist\'of Marussy and Sebastian Pilarski and Oszk\'ar Semer\'ath and D\'aniel Varr\'o},
  title = {Consistent Scene Graph Generation by Constraint Optimization.},
  booktitle = {ASE},
  year = 2022,
  doi = {https://doi.org/10.1145/3551349.3560433},
  keywords = {BME and mostly_hungarian and applied}
  }

• S. Miano, A. Sanaee, F. Risso, G. Rétvári, and G. Antichi, “Domain specific run time optimization for software data planes.,” in ASPLOS, 2022.
  [Bibtex]

  @inproceedings{asplosMianoSRRA22,
  author = {Sebastiano Miano and Alireza Sanaee and Fulvio Risso and G\'abor R\'etv\'ari and Gianni Antichi},
  title = {Domain specific run time optimization for software data planes.},
  booktitle = {ASPLOS},
  year = 2022,
  doi = {https://doi.org/10.1145/3503222.3507769},
  keywords = {BME and international and applied}
  }

• H. Aziz, P. Biró, and M. Yokoo, “Matching Market Design with Constraints.,” in AAAI, 2022.
  [Bibtex]

  @inproceedings{aaai0001BY22,
  author = {Haris Aziz and P\'eter Bir\'o and Makoto Yokoo},
  title = {Matching Market Design with Constraints.},
  booktitle = {AAAI},
  year = 2022,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v36i11.21495'}},
  keywords = {Hungary and international and theory}
  }

• M. Benedek, P. Biró, W. Kern, and D. Paulusma, “Computing Balanced Solutions for Large International Kidney Exchange Schemes.,” in AAMAS, 2022.
  [Bibtex]

  @inproceedings{atalBenedekBKP22,
  author = {M\'arton Benedek and P\'eter Bir\'o and Walter Kern and Daniël Paulusma},
  title = {Computing Balanced Solutions for Large International Kidney Exchange Schemes.},
  booktitle = {AAMAS},
  year = 2022,
  doi = {[{'@type': 'oa', '#text': 'https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p82.pdf'}, 'https://dl.acm.org/doi/10.5555/3535850.3535861']},
  keywords = {Corvinus and Hungary and international and theory}
  }

• T. Kavitha, T. Király, J. Matuschke, I. Schlotter, and U. Schmidt-Kraepelin, “The popular assignment problem: when cardinality is more important than popularity.,” in SODA, 2022.
  [Bibtex]

  @inproceedings{sodaKavithaKMSS22,
  author = {Telikepalli Kavitha and Tam\'as Kir\'aly and Jannik Matuschke and Ildik\'o Schlotter and Ulrike Schmidt-Kraepelin},
  title = {The popular assignment problem: when cardinality is more important than popularity.},
  booktitle = {SODA},
  year = 2022,
  doi = {https://doi.org/10.1137/1.9781611977073.6},
  keywords = {ELTE and BME and international and theory}
  }

2021

• D. Barath, D. Mishkin, I. Eichhardt, I. Shipachev, and J. Matas, “Efficient Initial Pose-Graph Generation for Global SfM.,” in CVPR, 2021.
  [Bibtex]

  @inproceedings{cvprBarathMESM21,
  author = {Daniel Barath and Dmytro Mishkin and Ivan Eichhardt and Ilia Shipachev and Jiri Matas},
  title = {Efficient Initial Pose-Graph Generation for Global SfM.},
  booktitle = {CVPR},
  year = 2021,
  doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2021/html/Barath_Efficient_Initial_Pose-Graph_Generation_for_Global_SfM_CVPR_2021_paper.html'}, 'https://doi.org/10.1109/CVPR46437.2021.01431']},
  keywords = {ELTE and international and theory}
  }

• J. Tapolcai, Z. L. Hajdú, A. Pasic, P. Ho, and L. Rónyai, “On Network Topology Augmentation for Global Connectivity under Regional Failures.,” in INFOCOM, 2021.
  [Bibtex]

  @inproceedings{infocomTapolcaiHPHR21,
  author = {J\'anos Tapolcai and Zsombor L. Hajd\'u and Alija Pasic and Pin-Han Ho and Lajos R\'onyai},
  title = {On Network Topology Augmentation for Global Connectivity under Regional Failures.},
  booktitle = {INFOCOM},
  year = 2021,
  doi = {https://doi.org/10.1109/INFOCOM42981.2021.9488879},
  keywords = {BME and mostly_hungarian and applied}
  }

• J. Bayer, M. Soelch, A. Mirchev, B. Kayalibay, and P. van der Smagt, “Mind the Gap when Conditioning Amortised Inference in Sequential Latent-Variable Models.,” in ICLR, 2021.
  [Bibtex]

  @inproceedings{iclrBayerSMKS21,
  author = {Justin Bayer and Maximilian Soelch and Atanas Mirchev and Baris Kayalibay and Patrick van der Smagt},
  title = {Mind the Gap when Conditioning Amortised Inference in Sequential Latent-Variable Models.},
  booktitle = {ICLR},
  year = 2021,
  doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=a2gqxKDvYys'}},
  keywords = {Hungary and international and applied}
  }

• A. Mirchev, B. Kayalibay, P. van der Smagt, and J. Bayer, “Variational State-Space Models for Localisation and Dense 3D Mapping in 6 DoF.,” in ICLR, 2021.
  [Bibtex]

  @inproceedings{iclrMirchevKSB21,
  author = {Atanas Mirchev and Baris Kayalibay and Patrick van der Smagt and Justin Bayer},
  title = {Variational State-Space Models for Localisation and Dense 3D Mapping in 6 DoF.},
  booktitle = {ICLR},
  year = 2021,
  doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=XAS3uKeFWj'}},
  keywords = {Hungary and international and applied}
  }

• A. Klushyn, R. Kurle, M. Soelch, B. Cseke, and P. van der Smagt, “Latent Matters: Learning Deep State-Space Models.,” in NeurIPS, 2021.
  [Bibtex]

  @inproceedings{nipsKlushynKSCS21,
  author = {Alexej Klushyn and Richard Kurle and Maximilian Soelch and Botond Cseke and Patrick van der Smagt},
  title = {Latent Matters: Learning Deep State-Space Models.},
  booktitle = {NeurIPS},
  year = 2021,
  doi = {{'@type': 'oa', '#text': 'https://proceedings.neurips.cc/paper/2021/hash/54b2b21af94108d83c2a909d5b0a6a50-Abstract.html'}},
  keywords = {Hungary and international and applied}
  }

• D. Zombori, B. Bánhelyi, T. Csendes, I. Megyeri, and M. Jelasity, “Fooling a Complete Neural Network Verifier.,” in ICLR, 2021.
  [Bibtex]

  @inproceedings{iclrZomboriBCMJ21,
  author = {D\'aniel Zombori and Bal\'azs B\'anhelyi and Tibor Csendes and Istv\'an Megyeri and M\'ark Jelasity},
  title = {Fooling a Complete Neural Network Verifier.},
  booktitle = {ICLR},
  year = 2021,
  doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=4IwieFS44l'}},
  keywords = {SZTE and all_hungarian and applied}
  }

• C. Palmer and Dömötör. Pálvölgyi, “‘sup': ‘n’, ‘#text': ‘At most 3.55 stable matchings.’,” in FOCS, 2021.
  [Bibtex]

  @inproceedings{focsPalmerP21,
  author = {Cory Palmer and D\"om\"ot\"or P\'alv\"olgyi},
  title = {{'sup': 'n', '#text': 'At most 3.55 stable matchings.'}},
  booktitle = {FOCS},
  year = 2021,
  doi = {https://doi.org/10.1109/FOCS52979.2021.00029},
  keywords = {ELTE and international and theory}
  }

• R. Kerkouche, G. Ács, C. Castelluccia, and P. Genevès, “Constrained differentially private federated learning for low-bandwidth devices.,” in UAI, 2021.
  [Bibtex]

  @inproceedings{uaiKerkoucheCG21,
  author = {Raouf Kerkouche and Gergely \'Acs and Claude Castelluccia and Pierre Genevès},
  title = {Constrained differentially private federated learning for low-bandwidth devices.},
  booktitle = {UAI},
  year = 2021,
  doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v161/kerkouche21a.html'}},
  keywords = {BME and international and applied}
  }

• V. de Quehen, P. Kutas, C. Leonardi, C. Martindale, L. Panny, C. Petit, and K. E. Stange, “Improved Torsion-Point Attacks on SIDH Variants.,” in CRYPTO (3), 2021.
  [Bibtex]

  @inproceedings{cryptoQuehenKLMPPS21,
  author = {Victoria de Quehen and P\'eter Kutas and Chris Leonardi and Chloe Martindale and Lorenz Panny and Christophe Petit and Katherine E. Stange},
  title = {Improved Torsion-Point Attacks on SIDH Variants.},
  booktitle = {CRYPTO (3)},
  year = 2021,
  doi = {https://doi.org/10.1007/978-3-030-84252-9_15},
  keywords = {ELTE and international and theory}
  }

• P. Kutas, S. Merz, C. Petit, and C. Weitkämper, “One-Way Functions and Malleability Oracles: Hidden Shift Attacks on Isogeny-Based Protocols.,” in EUROCRYPT (1), 2021.
  [Bibtex]

  @inproceedings{eurocryptKutasMPW21,
  author = {P\'eter Kutas and Simon-Philipp Merz and Christophe Petit and Charlotte Weitkämper},
  title = {One-Way Functions and Malleability Oracles: Hidden Shift Attacks on Isogeny-Based Protocols.},
  booktitle = {EUROCRYPT (1)},
  year = 2021,
  doi = {https://doi.org/10.1007/978-3-030-77870-5_9},
  keywords = {ELTE and international and theory}
  }

• A. M. Alba, P. Babarczi, A. Blenk, M. He, P. Kalmbach, J. Zerwas, and W. Kellerer, “Modeling the Cost of Flexibility in Communication Networks.,” in INFOCOM, 2021.
  [Bibtex]

  @inproceedings{infocomAlbaBBHKZK21,
  author = {Alberto Mart\'inez Alba and P\'eter Babarczi and Andreas Blenk and Mu He and Patrick Kalmbach and Johannes Zerwas and Wolfgang Kellerer},
  title = {Modeling the Cost of Flexibility in Communication Networks.},
  booktitle = {INFOCOM},
  year = 2021,
  doi = {https://doi.org/10.1109/INFOCOM42981.2021.9488900},
  keywords = {BME and international and applied}
  }

• T. Szabó, S. Erdweg, and G. Bergmann, “Incremental whole-program analysis in Datalog with lattices.,” in PLDI, 2021.
  [Bibtex]

  @inproceedings{pldiSzaboEB21,
  author = {Tam\'as Szab\'o and Sebastian Erdweg and G\'abor Bergmann},
  title = {Incremental whole-program analysis in Datalog with lattices.},
  booktitle = {PLDI},
  year = 2021,
  doi = {https://doi.org/10.1145/3453483.3454026},
  keywords = {BME and international and applied}
  }

• J. Yen, T. Lévai, Q. Ye, X. Ren, R. Govindan, and B. Raghavan, “Semi-automated protocol disambiguation and code generation.,” in SIGCOMM, 2021.
  [Bibtex]

  @inproceedings{sigcommYenLY0GR21,
  author = {Jane Yen and Tam\'as L\'evai and Qinyuan Ye and Xiang Ren and Ramesh Govindan and Barath Raghavan},
  title = {Semi-automated protocol disambiguation and code generation.},
  booktitle = {SIGCOMM},
  year = 2021,
  doi = {https://doi.org/10.1145/3452296.3472910},
  keywords = {BME and international and applied}
  }

• A. Csiszárik, P. Korösi-Szabó, Á. K. Matszangosz, G. Papp, and D. Varga, “Similarity and Matching of Neural Network Representations.,” in NeurIPS, 2021.
  [Bibtex]

  @inproceedings{nipsCsiszarikKMPV21,
  author = {Adri\'an Csisz\'arik and P\'eter Kor\"osi-Szab\'o and \'Akos K. Matszangosz and Gergely Papp and D\'aniel Varga},
  title = {Similarity and Matching of Neural Network Representations.},
  booktitle = {NeurIPS},
  year = 2021,
  doi = {{'@type': 'oa', '#text': 'https://proceedings.neurips.cc/paper/2021/hash/2cb274e6ce940f47beb8011d8ecb1462-Abstract.html'}},
  keywords = {Rényi and all_hungarian and applied}
  }

• M. Bentert, R. Bredereck, P. Györgyi, A. Kaczmarczyk, and R. Niedermeier, “A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.,” in AAAI, 2021.
  [Bibtex]

  @inproceedings{aaaiBentertBG0N21,
  author = {Matthias Bentert and Robert Bredereck and P\'eter Gy\"orgyi and Andrzej Kaczmarczyk and Rolf Niedermeier},
  title = {A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.},
  booktitle = {AAAI},
  year = 2021,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v35i13.17397'}},
  keywords = {SZTAKI and international and theory}
  }

2020

• Z. Ádám. Milacski, B. Póczos, and A. Lörincz, “VideoOneNet: Bidirectional Convolutional Recurrent OneNet with Trainable Data Steps for Video Processing.,” in ICML, 2020.
  [Bibtex]

  @inproceedings{icmlMilacskiPL20,
  author = {Zolt\'an \'Ad\'am Milacski and Barnab\'as P\'oczos and Andr\'as L\"orincz},
  title = {VideoOneNet: Bidirectional Convolutional Recurrent OneNet with Trainable Data Steps for Video Processing.},
  booktitle = {ICML},
  year = 2020,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/milacski20a.html'}},
  keywords = {ELTE and international and applied}
  }

• D. Baráth, J. Noskova, M. Ivashechkin, and J. Matas, “MAGSAC++, a Fast, Reliable and Accurate Robust Estimator.,” in CVPR, 2020.
  [Bibtex]

  @inproceedings{cvprBarathNIM20,
  author = {D\'aniel Bar\'ath and Jana Noskova and Maksym Ivashechkin and Jiri Matas},
  title = {MAGSAC++, a Fast, Reliable and Accurate Robust Estimator.},
  booktitle = {CVPR},
  year = 2020,
  doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content_CVPR_2020/html/Barath_MAGSAC_a_Fast_Reliable_and_Accurate_Robust_Estimator_CVPR_2020_paper.html'}, 'https://doi.org/10.1109/CVPR42600.2020.00138']},
  keywords = {SZTAKI and international and applied}
  }

• T. Hodan, D. Baráth, and J. Matas, “EPOS: Estimating 6D Pose of Objects With Symmetries.,” in CVPR, 2020.
  [Bibtex]

  @inproceedings{cvprHodanBM20,
  author = {Tom\'as Hodan and D\'aniel Bar\'ath and Jiri Matas},
  title = {EPOS: Estimating 6D Pose of Objects With Symmetries.},
  booktitle = {CVPR},
  year = 2020,
  doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content_CVPR_2020/html/Hodan_EPOS_Estimating_6D_Pose_of_Objects_With_Symmetries_CVPR_2020_paper.html'}, 'https://doi.org/10.1109/CVPR42600.2020.01172']},
  keywords = {SZTAKI and international and applied}
  }

• G. Csurka, Z. Kato, A. Juhasz, and M. Humenberger, “Estimating Low-Rank Region Likelihood Maps.,” in CVPR, 2020.
  [Bibtex]

  @inproceedings{cvprCsurkaKJH20,
  author = {Gabriela Csurka and Zoltan Kato and Andor Juhasz and Martin Humenberger},
  title = {Estimating Low-Rank Region Likelihood Maps.},
  booktitle = {CVPR},
  year = 2020,
  doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content_CVPR_2020/html/Csurka_Estimating_Low-Rank_Region_Likelihood_Maps_CVPR_2020_paper.html'}, 'https://doi.org/10.1109/CVPR42600.2020.01379']},
  keywords = {SZTE and international and applied}
  }

• V. Balogh, G. Berend, D. I. Diochnos, and G. Turán, “Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base.,” in AAAI, 2020.
  [Bibtex]

  @inproceedings{aaaiBaloghBDT20,
  author = {Vanda Balogh and G\'abor Berend and Dimitrios I. Diochnos and Gy\"orgy Tur\'an},
  title = {Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base.},
  booktitle = {AAAI},
  year = 2020,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i05.6235'}},
  keywords = {SZTE and Hungary and mostly_hungarian and applied}
  }

• R. Kurle, B. Cseke, A. Klushyn, P. van der Smagt, and S. Günnemann, “Continual Learning with Bayesian Neural Networks for Non-Stationary Data.,” in ICLR, 2020.
  [Bibtex]

  @inproceedings{iclrKurleCKSG20,
  author = {Richard Kurle and Botond Cseke and Alexej Klushyn and Patrick van der Smagt and Stephan G\"unnemann},
  title = {Continual Learning with Bayesian Neural Networks for Non-Stationary Data.},
  booktitle = {ICLR},
  year = 2020,
  doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=SJlsFpVtDB'}},
  keywords = {Hungary and international and applied}
  }

• N. Chen, A. Klushyn, F. Ferroni, J. Bayer, and P. van der Smagt, “Learning Flat Latent Manifolds with VAEs.,” in ICML, 2020.
  [Bibtex]

  @inproceedings{icmlChenKFBS20,
  author = {Nutan Chen and Alexej Klushyn and Francesco Ferroni and Justin Bayer and Patrick van der Smagt},
  title = {Learning Flat Latent Manifolds with VAEs.},
  booktitle = {ICML},
  year = 2020,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/chen20i.html'}},
  keywords = {Hungary and international and applied}
  }

• H. Aziz, A. Baychkov, and P. Biró, “Summer Internship Matching with Funding Constraints.,” in AAMAS, 2020.
  [Bibtex]

  @inproceedings{atal0001BB20,
  author = {Haris Aziz and Anton Baychkov and P\'eter Bir\'o},
  title = {Summer Internship Matching with Funding Constraints.},
  booktitle = {AAMAS},
  year = 2020,
  doi = {['https://dl.acm.org/doi/10.5555/3398761.3398778', {'@type': 'oa', '#text': 'https://www.ifaamas.org/Proceedings/aamas2020/pdfs/p97.pdf'}]},
  keywords = {Hungary and international and theory}
  }

• G. Berend, “Massively Multilingual Sparse Word Representations.,” in ICLR, 2020.
  [Bibtex]

  @inproceedings{iclrBerend20,
  author = {G\'abor Berend},
  title = {Massively Multilingual Sparse Word Representations.},
  booktitle = {ICLR},
  year = 2020,
  doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=HyeYTgrFPB'}},
  keywords = {SZTE and all_hungarian and applied}
  }

• J. Németh, “Adversarial Disentanglement with Grouped Observations.,” in AAAI, 2020.
  [Bibtex]

  @inproceedings{aaaiNemeth20,
  author = {J\'ozsef N\'emeth},
  title = {Adversarial Disentanglement with Grouped Observations.},
  booktitle = {AAAI},
  year = 2020,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i06.6586'}},
  keywords = {SZTE and all_hungarian and applied}
  }

2019

• D. Barath, J. Matas, and J. Noskova, “MAGSAC: Marginalizing Sample Consensus.,” in CVPR, 2019.
  [Bibtex]

  @inproceedings{cvprBarathMN19,
  author = {Daniel Barath and Jiri Matas and Jana Noskova},
  title = {MAGSAC: Marginalizing Sample Consensus.},
  booktitle = {CVPR},
  year = 2019,
  doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_CVPR_2019/html/Barath_MAGSAC_Marginalizing_Sample_Consensus_CVPR_2019_paper.html'}, 'https://doi.org/10.1109/CVPR.2019.01044']},
  keywords = {SZTAKI and international and applied}
  }

• D. Baráth and Z. Kukelova, “Homography From Two Orientation- and Scale-Covariant Features.,” in ICCV, 2019.
  [Bibtex]

  @inproceedings{iccvBarathK19,
  author = {D\'aniel Bar\'ath and Zuzana Kukelova},
  title = {Homography From Two Orientation- and Scale-Covariant Features.},
  booktitle = {ICCV},
  year = 2019,
  doi = {https://doi.org/10.1109/ICCV.2019.00118},
  keywords = {SZTAKI and international and applied}
  }

• D. Baráth and J. Matas, “Progressive-X: Efficient, Anytime, Multi-Model Fitting Algorithm.,” in ICCV, 2019.
  [Bibtex]

  @inproceedings{iccvBarathM19,
  author = {D\'aniel Bar\'ath and Jiri Matas},
  title = {Progressive-X: Efficient, Anytime, Multi-Model Fitting Algorithm.},
  booktitle = {ICCV},
  year = 2019,
  doi = {https://doi.org/10.1109/ICCV.2019.00388},
  keywords = {SZTAKI and international and applied}
  }

• J. Pach, N. Rubin, and G. Tardos, “Planar point sets determine many pairwise crossing segments.,” in STOC, 2019.
  [Bibtex]

  @inproceedings{stocPachRT19,
  author = {J\'anos Pach and Natan Rubin and G\'abor Tardos},
  title = {Planar point sets determine many pairwise crossing segments.},
  booktitle = {STOC},
  year = 2019,
  doi = {https://doi.org/10.1145/3313276.3316328},
  keywords = {Rényi and international and theory}
  }

• R. Kurle, S. Günnemann, and P. van der Smagt, “Multi-Source Neural Variational Inference.,” in AAAI, 2019.
  [Bibtex]

  @inproceedings{aaaiKurleGS19,
  author = {Richard Kurle and Stephan G\"unnemann and Patrick van der Smagt},
  title = {Multi-Source Neural Variational Inference.},
  booktitle = {AAAI},
  year = 2019,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v33i01.33014114'}},
  keywords = {Hungary and international and applied}
  }

• P. Becker-Ehmck, J. Peters, and P. van der Smagt, “Switching Linear Dynamics for Variational Bayes Filtering.,” in ICML, 2019.
  [Bibtex]

  @inproceedings{icmlBecker-Ehmck0S19,
  author = {Philip Becker-Ehmck and Jan Peters and Patrick van der Smagt},
  title = {Switching Linear Dynamics for Variational Bayes Filtering.},
  booktitle = {ICML},
  year = 2019,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/becker-ehmck19a.html'}},
  keywords = {Hungary and international and applied}
  }

• A. Klushyn, N. Chen, R. Kurle, B. Cseke, and P. van der Smagt, “Learning Hierarchical Priors in VAEs.,” in NeurIPS, 2019.
  [Bibtex]

  @inproceedings{nipsKlushynCKCS19,
  author = {Alexej Klushyn and Nutan Chen and Richard Kurle and Botond Cseke and Patrick van der Smagt},
  title = {Learning Hierarchical Priors in VAEs.},
  booktitle = {NeurIPS},
  year = 2019,
  doi = {[{'@type': 'oa', '#text': 'https://proceedings.neurips.cc/paper/2019/hash/7d12b66d3df6af8d429c1a357d8b9e1a-Abstract.html'}, {'@type': 'oa', '#text': 'http://papers.nips.cc/paper/8553-learning-hierarchical-priors-in-vaes'}]},
  keywords = {Hungary and international and applied}
  }

• H. Aziz, P. Biró, R. de Haan, and B. Rastegari, “Pareto Optimal Allocation under Compact Uncertain Preferences.,” in AAAI, 2019.
  [Bibtex]

  @inproceedings{aaai0001BHR19,
  author = {Haris Aziz and P\'eter Bir\'o and Ronald de Haan and Baharak Rastegari},
  title = {Pareto Optimal Allocation under Compact Uncertain Preferences.},
  booktitle = {AAAI},
  year = 2019,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v33i01.33011740'}},
  keywords = {Hungary and international and theory}
  }

• P. Biró, W. Kern, Dömötör. Pálvölgyi, and D. Paulusma, “Generalized Matching Games for International Kidney Exchange.,” in AAMAS, 2019.
  [Bibtex]

  @inproceedings{atalBiroKPP19,
  author = {P\'eter Bir\'o and Walter Kern and D\"om\"ot\"or P\'alv\"olgyi and Daniël Paulusma},
  title = {Generalized Matching Games for International Kidney Exchange.},
  booktitle = {AAMAS},
  year = 2019,
  doi = {http://dl.acm.org/citation.cfm?id=3331721},
  keywords = {Hungary and ELTE and international and theory}
  }

• K. A. Adiprasito, I. Bárány, and N. H. Mustafa, “Theorems of Carathéodory, Helly, and Tverberg without dimension.,” in SODA, 2019.
  [Bibtex]

  @inproceedings{sodaAdiprasitoBM19,
  author = {Karim A. Adiprasito and Imre B\'ar\'any and Nabil H. Mustafa},
  title = {Theorems of Carathéodory, Helly, and Tverberg without dimension.},
  booktitle = {SODA},
  year = 2019,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975482.143'}, 'https://dl.acm.org/citation.cfm?id=3310578']},
  keywords = {Rényi and international and theory}
  }

• M. Saleem, G. Szárnyas, F. Conrads, S. A. C. Bukhari, Q. Mehmood, and A. N. Ngomo, “How Representative Is a SPARQL Benchmark? An Analysis of RDF Triplestore Benchmarks.,” in WWW, 2019.
  [Bibtex]

  @inproceedings{www0001SCBMN19,
  author = {Muhammad Saleem and G\'abor Sz\'arnyas and Felix Conrads and Syed Ahmad Chan Bukhari and Qaiser Mehmood and Axel-Cyrille Ngonga Ngomo},
  title = {How Representative Is a SPARQL Benchmark? An Analysis of RDF Triplestore Benchmarks.},
  booktitle = {WWW},
  year = 2019,
  doi = {['https://doi.org/10.1145/3308558.3313556', 'https://www.wikidata.org/entity/Q130905920']},
  keywords = {BME and international and applied}
  }

2018

• D. Marx, M. Pilipczuk, and M. Pilipczuk, “On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs.,” in FOCS, 2018.
  [Bibtex]

  @inproceedings{focsMarxPP18,
  author = {D\'aniel Marx and Marcin Pilipczuk and Michal Pilipczuk},
  title = {On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs.},
  booktitle = {FOCS},
  year = 2018,
  doi = {['https://doi.org/10.1109/FOCS.2018.00052', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00052']},
  keywords = {SZTAKI and international and theory}
  }

• L. Chen and D. Marx, “Covering a tree with rooted subtrees – parameterized and approximation algorithms.,” in SODA, 2018.
  [Bibtex]

  @inproceedings{sodaChenM18,
  author = {Lin Chen and D\'aniel Marx},
  title = {Covering a tree with rooted subtrees - parameterized and approximation algorithms.},
  booktitle = {SODA},
  year = 2018,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975031.178'}},
  keywords = {SZTAKI and international and theory}
  }

• M. de Berg, H. L. Bodlaender, S. Kisfaludi-Bak, D. Marx, and T. C. van der Zanden, “A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.,” in STOC, 2018.
  [Bibtex]

  @inproceedings{stocBergBKMZ18,
  author = {Mark de Berg and Hans L. Bodlaender and S\'andor Kisfaludi-Bak and D\'aniel Marx and Tom C. van der Zanden},
  title = {A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.},
  booktitle = {STOC},
  year = 2018,
  doi = {['https://doi.org/10.1145/3188745.3188854', 'https://www.wikidata.org/entity/Q59567342']},
  keywords = {SZTAKI and international and theory}
  }

• D. Barath, “Five-Point Fundamental Matrix Estimation for Uncalibrated Cameras.,” in CVPR, 2018.
  [Bibtex]

  @inproceedings{cvprBarath18,
  author = {Daniel Barath},
  title = {Five-Point Fundamental Matrix Estimation for Uncalibrated Cameras.},
  booktitle = {CVPR},
  year = 2018,
  doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_cvpr_2018/html/Barath_Five-Point_Fundamental_Matrix_CVPR_2018_paper.html'}, 'https://doi.org/10.1109/CVPR.2018.00032', 'https://doi.ieeecomputersociety.org/10.1109/CVPR.2018.00032']},
  keywords = {SZTAKI and all_hungarian and applied}
  }

• D. Barath and J. Matas, “Graph-Cut RANSAC.,” in CVPR, 2018.
  [Bibtex]

  @inproceedings{cvprBarathM18,
  author = {Daniel Barath and Jiri Matas},
  title = {Graph-Cut RANSAC.},
  booktitle = {CVPR},
  year = 2018,
  doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_cvpr_2018/html/Barath_Graph-Cut_RANSAC_CVPR_2018_paper.html'}, 'https://doi.org/10.1109/CVPR.2018.00704', 'https://doi.ieeecomputersociety.org/10.1109/CVPR.2018.00704']},
  keywords = {SZTAKI and international and applied}
  }

• S. Z. Kiss, É. Hosszu, J. Tapolcai, L. Rónyai, and O. Rottenstreich, “Bloom Filter with a False Positive Free Zone.,” in INFOCOM, 2018.
  [Bibtex]

  @inproceedings{infocomKissHTRR18,
  author = {S\'andor Z. Kiss and \'Eva Hosszu and J\'anos Tapolcai and Lajos R\'onyai and Ori Rottenstreich},
  title = {Bloom Filter with a False Positive Free Zone.},
  booktitle = {INFOCOM},
  year = 2018,
  doi = {https://doi.org/10.1109/INFOCOM.2018.8486415},
  keywords = {BME and mostly_hungarian and applied}
  }

• J. Tapolcai, B. Vass, Z. Heszberger, J. Bíró, D. Hay, F. A. Kuipers, and L. Rónyai, “A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.,” in INFOCOM, 2018.
  [Bibtex]

  @inproceedings{infocomTapolcaiVHBHKR18,
  author = {J\'anos Tapolcai and B\'alazs Vass and Zal\'an Heszberger and J\'ozsef B\'ir\'o and David Hay and Fernando A. Kuipers and Lajos R\'onyai},
  title = {A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.},
  booktitle = {INFOCOM},
  year = 2018,
  doi = {https://doi.org/10.1109/INFOCOM.2018.8486218},
  keywords = {BME and mostly_hungarian and applied}
  }

• O. Semeráth, A. S. Nagy, and D. Varró, “A graph solver for the automated generation of consistent domain-specific models.,” in ICSE, 2018.
  [Bibtex]

  @inproceedings{icseSemerathNV18,
  author = {Oszk\'ar Semer\'ath and Andr\'as Szabolcs Nagy and D\'aniel Varr\'o},
  title = {A graph solver for the automated generation of consistent domain-specific models.},
  booktitle = {ICSE},
  year = 2018,
  doi = {['https://doi.org/10.1145/3180155.3180186', 'https://ieeexplore.ieee.org/document/8453176']},
  keywords = {BME and all_hungarian and applied}
  }

• R. Curticapean, N. Lindzey, and J. Nederlof, “A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.,” in SODA, 2018.
  [Bibtex]

  @inproceedings{sodaCurticapeanLN18,
  author = {Radu Curticapean and Nathan Lindzey and Jesper Nederlof},
  title = {A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.},
  booktitle = {SODA},
  year = 2018,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975031.70'}},
  keywords = {SZTAKI and international and theory}
  }

• G. Ivanyos and Y. Qiao, “Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing.,” in SODA, 2018.
  [Bibtex]

  @inproceedings{sodaIvanyosQ18,
  author = {G\'abor Ivanyos and Youming Qiao},
  title = {Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing.},
  booktitle = {SODA},
  year = 2018,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975031.152'}},
  keywords = {SZTAKI and international and theory}
  }

• B. Sonkoly, M. Szabo, B. Németh, A. Majdán, G. Pongrácz, and L. Toka, “FERO: Fast and Efficient Resource Orchestrator for a Data Plane Built on Docker and DPDK.,” in INFOCOM, 2018.
  [Bibtex]

  @inproceedings{infocomSonkolySNMPT18,
  author = {Bal\'azs Sonkoly and Marton Szabo and Bal\'azs N\'emeth and Andr\'as Majd\'an and Gergely Pongr\'acz and L\'aszl\'o Toka},
  title = {FERO: Fast and Efficient Resource Orchestrator for a Data Plane Built on Docker and DPDK.},
  booktitle = {INFOCOM},
  year = 2018,
  doi = {https://doi.org/10.1109/INFOCOM.2018.8485953},
  keywords = {BME and SZTAKI and Ericsson and all_hungarian and applied}
  }

• K. Bérczi, K. Chandrasekaran, T. Király, and V. Madan, “A tight -approximation for Linear 3-Cut.,” in SODA, 2018.
  [Bibtex]

  @inproceedings{sodaBercziCKM18,
  author = {Krist\'of B\'erczi and Karthekeyan Chandrasekaran and Tam\'as Kir\'aly and Vivek Madan},
  title = {A tight -approximation for Linear 3-Cut.},
  booktitle = {SODA},
  year = 2018,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975031.92'}},
  keywords = {ELTE and international and theory}
  }

2017

• R. Curticapean, H. Dell, and D. Marx, “Homomorphisms are a good basis for counting small subgraphs.,” in STOC, 2017.
  [Bibtex]

  @inproceedings{stocCurticapeanDM17,
  author = {Radu Curticapean and Holger Dell and D\'aniel Marx},
  title = {Homomorphisms are a good basis for counting small subgraphs.},
  booktitle = {STOC},
  year = 2017,
  doi = {https://doi.org/10.1145/3055399.3055502},
  keywords = {SZTAKI and mostly_hungarian and theory}
  }

• C. Keller, S. Smorodinsky, and G. Tardos, “On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers.,” in SODA, 2017.
  [Bibtex]

  @inproceedings{sodaKellerST17,
  author = {Chaya Keller and Shakhar Smorodinsky and G\'abor Tardos},
  title = {On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers.},
  booktitle = {SODA},
  year = 2017,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611974782.148'}, 'http://dl.acm.org/citation.cfm?id=3039834']},
  keywords = {Rényi and international and theory}
  }

• J. Tapolcai, L. Rónyai, B. Vass, and L. Gyimothi, “List of shared risk link groups representing regional failures with limited size.,” in INFOCOM, 2017.
  [Bibtex]

  @inproceedings{infocomTapolcaiRVG17,
  author = {J\'anos Tapolcai and Lajos R\'onyai and B\'alazs Vass and Laszlo Gyimothi},
  title = {List of shared risk link groups representing regional failures with limited size.},
  booktitle = {INFOCOM},
  year = 2017,
  doi = {https://doi.org/10.1109/INFOCOM.2017.8057040},
  keywords = {BME and all_hungarian and applied}
  }

• L. Toka, B. Lajtha, É. Hosszu, B. Formanek, D. Gehberger, and J. Tapolcai, “A resource-aware and time-critical IoT framework.,” in INFOCOM, 2017.
  [Bibtex]

  @inproceedings{infocomTokaLHFGT17,
  author = {L\'aszl\'o Toka and Bal\'azs Lajtha and \'Eva Hosszu and Bence Formanek and Daniel Gehberger and J\'anos Tapolcai},
  title = {A resource-aware and time-critical IoT framework.},
  booktitle = {INFOCOM},
  year = 2017,
  doi = {https://doi.org/10.1109/INFOCOM.2017.8057143},
  keywords = {BME and Ericsson and all_hungarian and applied}
  }

• R. Busa-Fekete, B. Szörényi, P. Weng, and S. Mannor, “Multi-objective Bandits: Optimizing the Generalized Gini Index.,” in ICML, 2017.
  [Bibtex]

  @inproceedings{icmlBusa-FeketeSWM17,
  author = {R\'obert Busa-Fekete and Bal\'azs Sz\"or\'enyi and Paul Weng and Shie Mannor},
  title = {Multi-objective Bandits: Optimizing the Generalized Gini Index.},
  booktitle = {ICML},
  year = 2017,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/busa-fekete17a.html'}},
  keywords = {SZTE and international and theory}
  }

• V. Bhargava, G. Ivanyos, R. Mittal, and N. Saxena, “Irreducibility and Deterministic r-th Root Finding over Finite Fields.,” in ISSAC, 2017.
  [Bibtex]

  @inproceedings{issacBhargavaIMS17,
  author = {Vishwas Bhargava and G\'abor Ivanyos and Rajat Mittal and Nitin Saxena},
  title = {Irreducibility and Deterministic r-th Root Finding over Finite Fields.},
  booktitle = {ISSAC},
  year = 2017,
  doi = {https://doi.org/10.1145/3087604.3087620},
  keywords = {SZTAKI and international and theory}
  }

• R. Pálovics and A. A. Benczúr, “Raising Graphs From Randomness to Reveal Information Networks.,” in WSDM, 2017.
  [Bibtex]

  @inproceedings{wsdmPalovicsB17,
  author = {R\'obert P\'alovics and Andr\'as A. Bencz\'ur},
  title = {Raising Graphs From Randomness to Reveal Information Networks.},
  booktitle = {WSDM},
  year = 2017,
  doi = {https://doi.org/10.1145/3018661.3018664},
  keywords = {SZTAKI and all_hungarian and applied}
  }

• H. Aziz, P. Biró, T. Fleiner, S. Gaspers, R. de Haan, N. Mattei, and B. Rastegari, “Stable Matching with Uncertain Pairwise Preferences.,” in AAMAS, 2017.
  [Bibtex]

  @inproceedings{atalAzizBFGHMR17,
  author = {Haris Aziz and P\'eter Bir\'o and Tam\'as Fleiner and Serge Gaspers and Ronald de Haan and Nicholas Mattei and Baharak Rastegari},
  title = {Stable Matching with Uncertain Pairwise Preferences.},
  booktitle = {AAMAS},
  year = 2017,
  doi = {http://dl.acm.org/citation.cfm?id=3091179},
  keywords = {Hungary and BME and international and theory}
  }

• G. Ács, L. Melis, C. Castelluccia, and E. D. Cristofaro, “Differentially Private Mixture of Generative Neural Networks.,” in ICDM, 2017.
  [Bibtex]

  @inproceedings{icdmAcsMCC17,
  author = {Gergely \'Acs and Luca Melis and Claude Castelluccia and Emiliano De Cristofaro},
  title = {Differentially Private Mixture of Generative Neural Networks.},
  booktitle = {ICDM},
  year = 2017,
  doi = {['https://doi.org/10.1109/ICDM.2017.81', 'https://doi.ieeecomputersociety.org/10.1109/ICDM.2017.81']},
  keywords = {BME and international and applied}
  }

• J. Szabó, S. Blandin, and C. Brett, “Data-Driven Simulation and Optimization for Incident Response in Urban Railway Networks.,” in AAMAS, 2017.
  [Bibtex]

  @inproceedings{atalSzaboBB17,
  author = {J\'acint Szab\'o and Sebastien Blandin and Charles Brett},
  title = {Data-Driven Simulation and Optimization for Incident Response in Urban Railway Networks.},
  booktitle = {AAMAS},
  year = 2017,
  doi = {http://dl.acm.org/citation.cfm?id=3091242},
  keywords = {ELTE and international and theory}
  }

2016

• F. V. Fomin, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh, “Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.,” in FOCS, 2016.
  [Bibtex]

  @inproceedings{focsFominLMPPS16,
  author = {Fedor V. Fomin and Daniel Lokshtanov and D\'aniel Marx and Marcin Pilipczuk and Michal Pilipczuk and Saket Saurabh},
  title = {Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.},
  booktitle = {FOCS},
  year = 2016,
  doi = {['https://doi.org/10.1109/FOCS.2016.62', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.62', 'https://www.wikidata.org/entity/Q60488381']},
  keywords = {SZTAKI and international and theory}
  }

• R. Curticapean and D. Marx, “Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.,” in SODA, 2016.
  [Bibtex]

  @inproceedings{sodaCurticapeanM16,
  author = {Radu Curticapean and D\'aniel Marx},
  title = {Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.},
  booktitle = {SODA},
  year = 2016,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611974331.ch113'}, 'http://dl.acm.org/citation.cfm?id=2884548']},
  keywords = {SZTAKI and all_hungarian and theory}
  }

• M. Bateni, E. D. Demaine, M. Hajiaghayi, and D. Marx, “A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting.,” in STOC, 2016.
  [Bibtex]

  @inproceedings{stocBateniDHM16,
  author = {MohammadHossein Bateni and Erik D. Demaine and MohammadTaghi Hajiaghayi and D\'aniel Marx},
  title = {A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting.},
  booktitle = {STOC},
  year = 2016,
  doi = {https://doi.org/10.1145/2897518.2897549},
  keywords = {SZTAKI and international and theory}
  }

• J. Pach, N. Rubin, and G. Tardos, “Beyond the Richter-Thomassen Conjecture.,” in SODA, 2016.
  [Bibtex]

  @inproceedings{sodaPachRT16,
  author = {J\'anos Pach and Natan Rubin and G\'abor Tardos},
  title = {Beyond the Richter-Thomassen Conjecture.},
  booktitle = {SODA},
  year = 2016,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611974331.ch68'}, 'http://dl.acm.org/citation.cfm?id=2884503']},
  keywords = {Rényi and international and theory}
  }

• N. Korda, B. Szörényi, and S. Li, “Distributed Clustering of Linear Bandits in Peer to Peer Networks.,” in ICML, 2016.
  [Bibtex]

  @inproceedings{icmlKordaSL16,
  author = {Nathan Korda and Bal\'azs Sz\"or\'enyi and Shuai Li},
  title = {Distributed Clustering of Linear Bandits in Peer to Peer Networks.},
  booktitle = {ICML},
  year = 2016,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/korda16.html'}},
  keywords = {SZTE and international and theory}
  }

• K. Jasinska, K. Dembczynski, R. Busa-Fekete, K. Pfannschmidt, T. Klerx, and E. Hüllermeier, “Extreme F-measure Maximization using Sparse Probability Estimates.,” in ICML, 2016.
  [Bibtex]

  @inproceedings{icmlJasinskaDBPKH16,
  author = {Kalina Jasinska and Krzysztof Dembczynski and R\'obert Busa-Fekete and Karlson Pfannschmidt and Timo Klerx and Eyke H\"ullermeier},
  title = {Extreme F-measure Maximization using Sparse Probability Estimates.},
  booktitle = {ICML},
  year = 2016,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/jasinska16.html'}},
  keywords = {SZTE and international and theory}
  }

• L. Molnár, G. Pongrácz, G. Enyedi, Z. L. Kis, L. Csikor, F. Juhász, A. Korösi, and G. Rétvári, “Dataplane Specialization for High-performance OpenFlow Software Switching.,” in SIGCOMM, 2016.
  [Bibtex]

  @inproceedings{sigcommMolnarPEKCJKR16,
  author = {L\'aszl\'o Moln\'ar and Gergely Pongr\'acz and G\'abor Enyedi and Zolt\'an Lajos Kis and Levente Csikor and Ferenc Juh\'asz and Attila Kor\"osi and G\'abor R\'etv\'ari},
  title = {Dataplane Specialization for High-performance OpenFlow Software Switching.},
  booktitle = {SIGCOMM},
  year = 2016,
  doi = {['https://doi.org/10.1145/2934872.2934887', 'https://www.wikidata.org/entity/Q131121827']},
  keywords = {BME and Ericsson and Hungary and mostly_hungarian and applied}
  }

• H. Aziz, P. Biró, J. Lang, J. Lesca, and J. Monnot, “Optimal Reallocation under Additive and Ordinal Preferences.,” in AAMAS, 2016.
  [Bibtex]

  @inproceedings{atalAzizBLLM16,
  author = {Haris Aziz and P\'eter Bir\'o and J\'erôme Lang and Julien Lesca and J\'erôme Monnot},
  title = {Optimal Reallocation under Additive and Ordinal Preferences.},
  booktitle = {AAMAS},
  year = 2016,
  doi = {http://dl.acm.org/citation.cfm?id=2936984},
  keywords = {Hungary and international and theory}
  }

• H. Aziz, I. Schlotter, and T. Walsh, “Control of Fair Division.,” in IJCAI, 2016.
  [Bibtex]

  @inproceedings{ijcaiAzizSW16,
  author = {Haris Aziz and Ildik\'o Schlotter and Toby Walsh},
  title = {Control of Fair Division.},
  booktitle = {IJCAI},
  year = 2016,
  doi = {{'@type': 'oa', '#text': 'http://www.ijcai.org/Abstract/16/017'}},
  keywords = {BME and international and theory}
  }

• A. Bernáth and T. Király, “‘i': ‘k’, ‘#text': ‘Blocking Optimal -Arborescences.’,” in SODA, 2016.
  [Bibtex]

  @inproceedings{sodaBernathK16,
  author = {Attila Bern\'ath and Tam\'as Kir\'aly},
  title = {{'i': 'k', '#text': 'Blocking Optimal -Arborescences.'}},
  booktitle = {SODA},
  year = 2016,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611974331.ch115'}, 'http://dl.acm.org/citation.cfm?id=2884550']},
  keywords = {ELTE and international and theory}
  }

2015

• B. M. P. Jansen and D. Marx, “Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.,” in SODA, 2015.
  [Bibtex]

  @inproceedings{sodaJansenM15,
  author = {Bart M. P. Jansen and D\'aniel Marx},
  title = {Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.},
  booktitle = {SODA},
  year = 2015,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973730.42'}},
  keywords = {SZTAKI and international and theory}
  }

• D. Marx and P. Wollan, “An exact characterization of tractable demand patterns for maximum disjoint path problems.,” in SODA, 2015.
  [Bibtex]

  @inproceedings{sodaMarxW15,
  author = {D\'aniel Marx and Paul Wollan},
  title = {An exact characterization of tractable demand patterns for maximum disjoint path problems.},
  booktitle = {SODA},
  year = 2015,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973730.44'}},
  keywords = {SZTAKI and international and theory}
  }

• J. Pach, N. Rubin, and G. Tardos, “On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.,” in SODA, 2015.
  [Bibtex]

  @inproceedings{sodaPachRT15,
  author = {J\'anos Pach and Natan Rubin and G\'abor Tardos},
  title = {On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.},
  booktitle = {SODA},
  year = 2015,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973730.99'}},
  keywords = {Rényi and international and theory}
  }

• G. Turán and J. Yaggie, “Characterizability in Belief Revision.,” in IJCAI, 2015.
  [Bibtex]

  @inproceedings{ijcaiTuranY15,
  author = {Gy\"orgy Tur\'an and Jon Yaggie},
  title = {Characterizability in Belief Revision.},
  booktitle = {IJCAI},
  year = 2015,
  doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Abstract/15/456'}},
  keywords = {Hungary and international and theory}
  }

• B. Szörényi, R. Busa-Fekete, P. Weng, and E. Hüllermeier, “Qualitative Multi-Armed Bandits: A Quantile-Based Approach.,” in ICML, 2015.
  [Bibtex]

  @inproceedings{icmlSzorenyiBWH15,
  author = {Bal\'azs Sz\"or\'enyi and R\'obert Busa-Fekete and Paul Weng and Eyke H\"ullermeier},
  title = {Qualitative Multi-Armed Bandits: A Quantile-Based Approach.},
  booktitle = {ICML},
  year = 2015,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v37/szorenyi15.html'}},
  keywords = {SZTE and international and theory}
  }

• A. Dosovitskiy, P. Fischer, E. Ilg, P. Häusser, C. Hazirbas, V. Golkov, P. van der Smagt, D. Cremers, and T. Brox, “FlowNet: Learning Optical Flow with Convolutional Networks.,” in ICCV, 2015.
  [Bibtex]

  @inproceedings{iccvDosovitskiyFIHH15,
  author = {Alexey Dosovitskiy and Philipp Fischer and Eddy Ilg and Philip Häusser and Caner Hazirbas and Vladimir Golkov and Patrick van der Smagt and Daniel Cremers and Thomas Brox},
  title = {FlowNet: Learning Optical Flow with Convolutional Networks.},
  booktitle = {ICCV},
  year = 2015,
  doi = {['https://doi.org/10.1109/ICCV.2015.316', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2015.316']},
  keywords = {Hungary and international and applied}
  }

• R. Curticapean and M. Xia, “Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k.,” in FOCS, 2015.
  [Bibtex]

  @inproceedings{focsCurticapeanX15,
  author = {Radu Curticapean and Mingji Xia},
  title = {Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k.},
  booktitle = {FOCS},
  year = 2015,
  doi = {['https://doi.org/10.1109/FOCS.2015.65', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.65']},
  keywords = {SZTAKI and international and theory}
  }

• M. Csernai, F. Ciucu, R. Braun, and A. Gulyás, “Towards 48-fold cabling complexity reduction in large flattened butterfly networks.,” in INFOCOM, 2015.
  [Bibtex]

  @inproceedings{infocomCsernaiCBG15,
  author = {M\'arton Csernai and Florin Ciucu and Ralf-Peter Braun and Andr\'as Guly\'as},
  title = {Towards 48-fold cabling complexity reduction in large flattened butterfly networks.},
  booktitle = {INFOCOM},
  year = 2015,
  doi = {https://doi.org/10.1109/INFOCOM.2015.7218373},
  keywords = {BME and international and applied}
  }

• J. Balogh, J. Békési, G. Dósa, J. Sgall, and R. van Stee, “The optimal absolute ratio for online bin packing.,” in SODA, 2015.
  [Bibtex]

  @inproceedings{sodaBaloghBDSS15,
  author = {J\'anos Balogh and J\'ozsef B\'ek\'esi and Gy\"orgy D\'osa and Jir\'i Sgall and Rob van Stee},
  title = {The optimal absolute ratio for online bin packing.},
  booktitle = {SODA},
  year = 2015,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973730.94'}},
  keywords = {SZTE and international and theory}
  }

2014

• R. Curticapean and D. Marx, “Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.,” in FOCS, 2014.
  [Bibtex]

  @inproceedings{focsCurticapeanM14,
  author = {Radu Curticapean and D\'aniel Marx},
  title = {Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.},
  booktitle = {FOCS},
  year = 2014,
  doi = {['https://doi.org/10.1109/FOCS.2014.22', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2014.22']},
  keywords = {SZTAKI and all_hungarian and theory}
  }

• S. Guillemot and D. Marx, “Finding small patterns in permutations in linear time.,” in SODA, 2014.
  [Bibtex]

  @inproceedings{sodaGuillemotM14,
  author = {Sylvain Guillemot and D\'aniel Marx},
  title = {Finding small patterns in permutations in linear time.},
  booktitle = {SODA},
  year = 2014,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973402.7'}, 'https://www.wikidata.org/entity/Q60638484']},
  keywords = {SZTAKI and all_hungarian and theory}
  }

• Y. Cao and D. Marx, “Interval Deletion is Fixed-Parameter Tractable.,” in SODA, 2014.
  [Bibtex]

  @inproceedings{sodaCaoM14,
  author = {Yixin Cao and D\'aniel Marx},
  title = {Interval Deletion is Fixed-Parameter Tractable.},
  booktitle = {SODA},
  year = 2014,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973402.9'}},
  keywords = {SZTAKI and international and theory}
  }

• R. H. Chitnis, M. Hajiaghayi, and D. Marx, “Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).,” in SODA, 2014.
  [Bibtex]

  @inproceedings{sodaChitnisHM14,
  author = {Rajesh Hemant Chitnis and MohammadTaghi Hajiaghayi and D\'aniel Marx},
  title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).},
  booktitle = {SODA},
  year = 2014,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973402.129'}},
  keywords = {SZTAKI and international and theory}
  }

• P. N. Klein and D. Marx, “A subexponential parameterized algorithm for Subset TSP on planar graphs.,” in SODA, 2014.
  [Bibtex]

  @inproceedings{sodaKleinM14,
  author = {Philip N. Klein and D\'aniel Marx},
  title = {A subexponential parameterized algorithm for Subset TSP on planar graphs.},
  booktitle = {SODA},
  year = 2014,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973402.131'}},
  keywords = {SZTAKI and international and theory}
  }

• J. Tapolcai, L. Rónyai, É. Hosszu, P. Ho, and S. Subramaniam, “Signaling free localization of node failures in all-optical networks.,” in INFOCOM, 2014.
  [Bibtex]

  @inproceedings{infocomTapolcaiRHHS14,
  author = {J\'anos Tapolcai and Lajos R\'onyai and \'Eva Hosszu and Pin-Han Ho and Suresh Subramaniam},
  title = {Signaling free localization of node failures in all-optical networks.},
  booktitle = {INFOCOM},
  year = 2014,
  doi = {['https://doi.org/10.1109/INFOCOM.2014.6848125', 'https://www.wikidata.org/entity/Q58033060']},
  keywords = {BME and mostly_hungarian and applied}
  }

• R. Busa-Fekete, B. Szörényi, and E. Hüllermeier, “PAC Rank Elicitation through Adaptive Sampling of Stochastic Pairwise Preferences.,” in AAAI, 2014.
  [Bibtex]

  @inproceedings{aaaiBusa-FeketeSH14,
  author = {R\'obert Busa-Fekete and Bal\'azs Sz\"or\'enyi and Eyke H\"ullermeier},
  title = {PAC Rank Elicitation through Adaptive Sampling of Stochastic Pairwise Preferences.},
  booktitle = {AAAI},
  year = 2014,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v28i1.8978'}},
  keywords = {SZTE and mostly_hungarian and theory}
  }

• R. Busa-Fekete, E. Hüllermeier, and B. Szörényi, “Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows.,” in ICML, 2014.
  [Bibtex]

  @inproceedings{icmlBusa-FeketeHS14,
  author = {R\'obert Busa-Fekete and Eyke H\"ullermeier and Bal\'azs Sz\"or\'enyi},
  title = {Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows.},
  booktitle = {ICML},
  year = 2014,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v32/busa-fekete14.html'}},
  keywords = {SZTE and mostly_hungarian and theory}
  }

• G. Ács and C. Castelluccia, “A case study: privacy preserving release of spatio-temporal density in paris.,” in KDD, 2014.
  [Bibtex]

  @inproceedings{kddAcsC14,
  author = {Gergely \'Acs and Claude Castelluccia},
  title = {A case study: privacy preserving release of spatio-temporal density in paris.},
  booktitle = {KDD},
  year = 2014,
  doi = {https://doi.org/10.1145/2623330.2623361},
  keywords = {BME and international and applied}
  }

2013

• M. Cygan, D. Marx, M. Pilipczuk, and M. Pilipczuk, “The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.,” in FOCS, 2013.
  [Bibtex]

  @inproceedings{focsCyganMPP13,
  author = {Marek Cygan and D\'aniel Marx and Marcin Pilipczuk and Michal Pilipczuk},
  title = {The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.},
  booktitle = {FOCS},
  year = 2013,
  doi = {['https://doi.org/10.1109/FOCS.2013.29', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.29']},
  keywords = {SZTAKI and international and theory}
  }

• M. Saglam and G. Tardos, “On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems.,” in FOCS, 2013.
  [Bibtex]

  @inproceedings{focsSaglamT13,
  author = {Mert Saglam and G\'abor Tardos},
  title = {On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems.},
  booktitle = {FOCS},
  year = 2013,
  doi = {['https://doi.org/10.1109/FOCS.2013.78', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.78']},
  keywords = {Rényi and international and theory}
  }

• L. Devroye, G. Lugosi, and G. Neu, “Prediction by random-walk perturbation.,” in COLT, 2013.
  [Bibtex]

  @inproceedings{coltDevroyeLN13,
  author = {Luc Devroye and G\'abor Lugosi and Gergely Neu},
  title = {Prediction by random-walk perturbation.},
  booktitle = {COLT},
  year = 2013,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v30/Devroye13.html'}},
  keywords = {BME and international and applied}
  }

• J. Tapolcai, P. Ho, P. Babarczi, and L. Rónyai, “On achieving all-optical failure restoration via monitoring trails.,” in INFOCOM, 2013.
  [Bibtex]

  @inproceedings{infocomTapolcaiHBR13,
  author = {J\'anos Tapolcai and Pin-Han Ho and P\'eter Babarczi and Lajos R\'onyai},
  title = {On achieving all-optical failure restoration via monitoring trails.},
  booktitle = {INFOCOM},
  year = 2013,
  doi = {['https://doi.org/10.1109/INFCOM.2013.6566799', 'https://www.wikidata.org/entity/Q58033085']},
  keywords = {BME and mostly_hungarian and applied}
  }

• J. Tapolcai and G. Rétvári, “Router virtualization for improving IP-level resilience.,” in INFOCOM, 2013.
  [Bibtex]

  @inproceedings{infocomTapolcaiR13,
  author = {J\'anos Tapolcai and G\'abor R\'etv\'ari},
  title = {Router virtualization for improving IP-level resilience.},
  booktitle = {INFOCOM},
  year = 2013,
  doi = {['https://doi.org/10.1109/INFCOM.2013.6566882', 'https://www.wikidata.org/entity/Q58033106']},
  keywords = {BME and all_hungarian and applied}
  }

• G. Rétvári, J. Tapolcai, A. Korösi, A. Majdán, and Z. Heszberger, “Compressing IP forwarding tables: towards entropy bounds and beyond.,” in SIGCOMM, 2013.
  [Bibtex]

  @inproceedings{sigcommRetvariTKMH13,
  author = {G\'abor R\'etv\'ari and J\'anos Tapolcai and Attila Kor\"osi and Andr\'as Majd\'an and Zal\'an Heszberger},
  title = {Compressing IP forwarding tables: towards entropy bounds and beyond.},
  booktitle = {SIGCOMM},
  year = 2013,
  doi = {['https://doi.org/10.1145/2486001.2486009', 'https://doi.org/10.1145/2534169.2486009', 'https://www.wikidata.org/entity/Q58033069']},
  keywords = {BME and all_hungarian and applied}
  }

• B. Szörényi, R. Busa-Fekete, I. Hegedüs, R. Ormándi, M. Jelasity, and B. Kégl, “Gossip-based distributed stochastic bandit algorithms.,” in ICML (3), 2013.
  [Bibtex]

  @inproceedings{icmlSzorenyiBHOJK13,
  author = {Bal\'azs Sz\"or\'enyi and R\'obert Busa-Fekete and Istv\'an Heged\"us and R\'obert Orm\'andi and M\'ark Jelasity and Bal\'azs K\'egl},
  title = {Gossip-based distributed stochastic bandit algorithms.},
  booktitle = {ICML (3)},
  year = 2013,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/szorenyi13.html'}},
  keywords = {SZTE and mostly_hungarian and applied}
  }

• R. Busa-Fekete, B. Szörényi, W. Cheng, P. Weng, and E. Hüllermeier, “Top-k Selection based on Adaptive Sampling of Noisy Preferences.,” in ICML (3), 2013.
  [Bibtex]

  @inproceedings{icmlBusa-FeketeSCWH13,
  author = {R\'obert Busa-Fekete and Bal\'azs Sz\"or\'enyi and Weiwei Cheng and Paul Weng and Eyke H\"ullermeier},
  title = {Top-k Selection based on Adaptive Sampling of Noisy Preferences.},
  booktitle = {ICML (3)},
  year = 2013,
  doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/busa-fekete13.html'}},
  keywords = {SZTE and international and theory}
  }

• V. Vincze, I. N. T., and R. Farkas, “Identifying English and Hungarian Light Verb Constructions: A Contrastive Approach.,” in ACL (2), 2013.
  [Bibtex]

  @inproceedings{aclVinczeTF13,
  author = {Veronika Vincze and Istv\'an Nagy T. and Rich\'ard Farkas},
  title = {Identifying English and Hungarian Light Verb Constructions: A Contrastive Approach.},
  booktitle = {ACL (2)},
  year = 2013,
  doi = {{'@type': 'oa', '#text': 'https://aclanthology.org/P13-2046/'}},
  keywords = {SZTE and all_hungarian and applied}
  }

2012

• H. Dell and D. Marx, “Kernelization of packing problems.,” in SODA, 2012.
  [Bibtex]

  @inproceedings{sodaDellM12,
  author = {Holger Dell and D\'aniel Marx},
  title = {Kernelization of packing problems.},
  booktitle = {SODA},
  year = 2012,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973099.6'}, 'https://dl.acm.org/citation.cfm?id=2095122']},
  keywords = {SZTAKI and international and theory}
  }

• R. H. Chitnis, M. Hajiaghayi, and D. Marx, “Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset.,” in SODA, 2012.
  [Bibtex]

  @inproceedings{sodaChitnisHM12,
  author = {Rajesh Hemant Chitnis and MohammadTaghi Hajiaghayi and D\'aniel Marx},
  title = {Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset.},
  booktitle = {SODA},
  year = 2012,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973099.136'}, 'https://dl.acm.org/citation.cfm?id=2095252']},
  keywords = {SZTAKI and international and theory}
  }

• M. Grohe and D. Marx, “Structure theorem and isomorphism test for graphs with excluded topological subgraphs.,” in STOC, 2012.
  [Bibtex]

  @inproceedings{stocGroheM12,
  author = {Martin Grohe and D\'aniel Marx},
  title = {Structure theorem and isomorphism test for graphs with excluded topological subgraphs.},
  booktitle = {STOC},
  year = 2012,
  doi = {https://doi.org/10.1145/2213977.2213996},
  keywords = {SZTAKI and international and theory}
  }

• R. Busa-Fekete, D. Benbouzid, and B. Kégl, “Fast classification using sparse decision DAGs.,” in ICML, 2012.
  [Bibtex]

  @inproceedings{icmlBusa-FeketeBK12,
  author = {R\'obert Busa-Fekete and Djalel Benbouzid and Bal\'azs K\'egl},
  title = {Fast classification using sparse decision DAGs.},
  booktitle = {ICML},
  year = 2012,
  doi = {{'@type': 'oa', '#text': 'http://icml.cc/2012/papers/501.pdf'}},
  keywords = {SZTE and international and theory}
  }

• L. Toka, P. Cataldi, M. Dell’Amico, and P. Michiardi, “Redundancy management for P2P backup.,” in INFOCOM, 2012.
  [Bibtex]

  @inproceedings{infocomTokaCDM12,
  author = {L\'aszl\'o Toka and Pasquale Cataldi and Matteo Dell'Amico and Pietro Michiardi},
  title = {Redundancy management for P2P backup.},
  booktitle = {INFOCOM},
  year = 2012,
  doi = {https://doi.org/10.1109/INFCOM.2012.6195743},
  keywords = {BME and international and applied}
  }

• R. Chen, G. Ács, and C. Castelluccia, “Differentially private sequential data publication via variable-length n-grams.,” in CCS, 2012.
  [Bibtex]

  @inproceedings{ccsChenAC12,
  author = {Rui Chen and Gergely \'Acs and Claude Castelluccia},
  title = {Differentially private sequential data publication via variable-length n-grams.},
  booktitle = {CCS},
  year = 2012,
  doi = {https://doi.org/10.1145/2382196.2382263},
  keywords = {BME and international and applied}
  }

• G. Ács, C. Castelluccia, and R. Chen, “Differentially Private Histogram Publishing through Lossy Compression.,” in ICDM, 2012.
  [Bibtex]

  @inproceedings{icdmAcsCC12,
  author = {Gergely \'Acs and Claude Castelluccia and Rui Chen},
  title = {Differentially Private Histogram Publishing through Lossy Compression.},
  booktitle = {ICDM},
  year = 2012,
  doi = {['https://doi.org/10.1109/ICDM.2012.80', 'https://doi.ieeecomputersociety.org/10.1109/ICDM.2012.80']},
  keywords = {BME and international and applied}
  }

• T. Fleiner and N. Kamiyama, “A matroid approach to stable matchings with lower quotas.,” in SODA, 2012.
  [Bibtex]

  @inproceedings{sodaFleinerK12,
  author = {Tam\'as Fleiner and Naoyuki Kamiyama},
  title = {A matroid approach to stable matchings with lower quotas.},
  booktitle = {SODA},
  year = 2012,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973099.12'}, 'https://dl.acm.org/citation.cfm?id=2095128']},
  keywords = {BME and international and theory}
  }

2011

• G. Rétvári, J. Tapolcai, G. Enyedi, and A. Császár, “IP fast ReRoute: Loop Free Alternates revisited.,” in INFOCOM, 2011.
  [Bibtex]

  @inproceedings{infocomRetvariTEC11,
  author = {G\'abor R\'etv\'ari and J\'anos Tapolcai and G\'abor Enyedi and Andr\'as Cs\'asz\'ar},
  title = {IP fast ReRoute: Loop Free Alternates revisited.},
  booktitle = {INFOCOM},
  year = 2011,
  doi = {['https://doi.org/10.1109/INFCOM.2011.5935135', 'https://www.wikidata.org/entity/Q58033175']},
  keywords = {BME and Ericsson and all_hungarian and applied}
  }

• G. Rétvári, A. Gulyás, Z. Heszberger, M. Csernai, and J. Bíró, “Compact policy routing.,” in PODC, 2011.
  [Bibtex]

  @inproceedings{podcRetvariGHCB11,
  author = {G\'abor R\'etv\'ari and Andr\'as Guly\'as and Zal\'an Heszberger and M\'arton Csernai and J\'ozsef B\'ir\'o},
  title = {Compact policy routing.},
  booktitle = {PODC},
  year = 2011,
  doi = {https://doi.org/10.1145/1993806.1993828},
  keywords = {BME and all_hungarian and applied}
  }

• I. Schlotter, P. Faliszewski, and E. Elkind, “Campaign Management under Approval-Driven Voting Rules.,” in AAAI, 2011.
  [Bibtex]

  @inproceedings{aaaiSchlotterFE11,
  author = {Ildik\'o Schlotter and Piotr Faliszewski and Edith Elkind},
  title = {Campaign Management under Approval-Driven Voting Rules.},
  booktitle = {AAAI},
  year = 2011,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v25i1.7870'}},
  keywords = {BME and international and theory}
  }

• F. Eisenbrand, Dömötör. Pálvölgyi, and T. Rothvoß, “Bin Packing via Discrepancy of Permutations.,” in SODA, 2011.
  [Bibtex]

  @inproceedings{sodaEisenbrandPR11,
  author = {Friedrich Eisenbrand and D\"om\"ot\"or P\'alv\"olgyi and Thomas Rothvoß},
  title = {Bin Packing via Discrepancy of Permutations.},
  booktitle = {SODA},
  year = 2011,
  doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.38'}, 'http://dl.acm.org/citation.cfm?id=2133074']},
  keywords = {ELTE and international and theory}
  }

• P. Mátray, P. Hága, S. Laki, I. Csabai, and G. Vattay, “On the network geography of the Internet.,” in INFOCOM, 2011.
  [Bibtex]

  @inproceedings{infocomMatrayHLCV11,
  author = {P\'eter M\'atray and P\'eter H\'aga and S\'andor Laki and Istv\'an Csabai and G\'abor Vattay},
  title = {On the network geography of the Internet.},
  booktitle = {INFOCOM},
  year = 2011,
  doi = {https://doi.org/10.1109/INFCOM.2011.5934909},
  keywords = {Ericsson and ELTE and all_hungarian and applied}
  }

• S. Laki, P. Mátray, P. Hága, T. Sebok, I. Csabai, and G. Vattay, “Spotter: A model based active geolocation service.,” in INFOCOM, 2011.
  [Bibtex]

  @inproceedings{infocomLakiMHSCV11,
  author = {S\'andor Laki and P\'eter M\'atray and P\'eter H\'aga and Tamas Sebok and Istv\'an Csabai and G\'abor Vattay},
  title = {Spotter: A model based active geolocation service.},
  booktitle = {INFOCOM},
  year = 2011,
  doi = {https://doi.org/10.1109/INFCOM.2011.5935165},
  keywords = {ELTE and Ericsson and all_hungarian and applied}
  }

• D. López-Pérez, Á. Ladányi, A. Jüttner, H. Rivano, and J. Zhang, “Optimization method for the joint allocation of modulation schemes, coding rates, resource blocks and power in self-organizing LTE networks.,” in INFOCOM, 2011.
  [Bibtex]

  @inproceedings{infocomLopez-PerezLJRZ11,
  author = {David L\'opez-P\'erez and \'Akos Lad\'anyi and Alp\'ar J\"uttner and Herv\'e Rivano and Jie Zhang},
  title = {Optimization method for the joint allocation of modulation schemes, coding rates, resource blocks and power in self-organizing LTE networks.},
  booktitle = {INFOCOM},
  year = 2011,
  doi = {https://doi.org/10.1109/INFCOM.2011.5934888},
  keywords = {ELTE and international and theory}
  }

2010

• G. Neu, A. György, and C. Szepesvári, “The Online Loop-free Stochastic Shortest-Path Problem.,” in COLT, 2010.
  [Bibtex]

  @inproceedings{coltNeuGS10,
  author = {Gergely Neu and Andr\'as Gy\"orgy and Csaba Szepesv\'ari},
  title = {The Online Loop-free Stochastic Shortest-Path Problem.},
  booktitle = {COLT},
  year = 2010,
  doi = {{'@type': 'archive', '#text': 'http://colt2010.haifa.il.ibm.com/papers/COLT2010proceedings.pdf#page=239'}},
  keywords = {BME and mostly_hungarian and applied}
  }

• A. Dasgupta, R. Kumar, and T. Sarlós, “A sparse Johnson: Lindenstrauss transform.,” in STOC, 2010.
  [Bibtex]

  @inproceedings{stocDasguptaKS10,
  author = {Anirban Dasgupta and Ravi Kumar and Tam\'as Sarl\'os},
  title = {A sparse Johnson: Lindenstrauss transform.},
  booktitle = {STOC},
  year = 2010,
  doi = {https://doi.org/10.1145/1806689.1806737},
  keywords = {SZTAKI and international and applied}
  }

• J. Tapolcai, L. Rónyai, and P. Ho, “Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks.,” in INFOCOM, 2010.
  [Bibtex]

  @inproceedings{infocomTapolcaiRH10,
  author = {J\'anos Tapolcai and Lajos R\'onyai and Pin-Han Ho},
  title = {Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks.},
  booktitle = {INFOCOM},
  year = 2010,
  doi = {['https://doi.org/10.1109/INFCOM.2010.5462251', 'https://www.wikidata.org/entity/Q58033212']},
  keywords = {BME and mostly_hungarian and applied}
  }

• R. Busa-Fekete and B. Kégl, “Fast boosting using adversarial bandits.,” in ICML, 2010.
  [Bibtex]

  @inproceedings{icmlBusa-FeketeK10,
  author = {R\'obert Busa-Fekete and Bal\'azs K\'egl},
  title = {Fast boosting using adversarial bandits.},
  booktitle = {ICML},
  year = 2010,
  doi = {{'@type': 'oa', '#text': 'https://icml.cc/Conferences/2010/papers/263.pdf'}},
  keywords = {SZTE and international and theory}
  }

• G. Rétvári and G. Németh, “Demand-Oblivious Routing: Distributed vs. Centralized Approaches.,” in INFOCOM, 2010.
  [Bibtex]

  @inproceedings{infocomRetvariN10,
  author = {G\'abor R\'etv\'ari and G\'abor N\'emeth},
  title = {Demand-Oblivious Routing: Distributed vs. Centralized Approaches.},
  booktitle = {INFOCOM},
  year = 2010,
  doi = {https://doi.org/10.1109/INFCOM.2010.5461925},
  keywords = {BME and all_hungarian and applied}
  }

• F. Eisenbrand, N. Hähnle, Dömötör. Pálvölgyi, and G. Shmonin, “Testing Additive Integrality Gaps.,” in SODA, 2010.
  [Bibtex]

  @inproceedings{sodaEisenbrandHPS10,
  author = {Friedrich Eisenbrand and Nicolai Hähnle and D\"om\"ot\"or P\'alv\"olgyi and Gennady Shmonin},
  title = {Testing Additive Integrality Gaps.},
  booktitle = {SODA},
  year = 2010,
  doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973075.98'}},
  keywords = {ELTE and international and theory}
  }

• A. Asemi, Z. S. Hosseini, and A. Asemi, “A survey on the library open source software in the University of Isfahan, Iran: Viewpoint of librarians.,” in ICIS, 2010.
  [Bibtex]

  @inproceedings{interactionAsemiHA10,
  author = {Asefeh Asemi and Zahra Sadat Hosseini and Adeleh Asemi},
  title = {A survey on the library open source software in the University of Isfahan, Iran: Viewpoint of librarians.},
  booktitle = {ICIS},
  year = 2010,
  doi = {https://doi.org/10.1109/ICICIS.2010.5534809},
  keywords = {Hungary and international and applied}
  }

2009

• J. Tapolcai, B. Wu, and P. Ho, “On Monitoring and Failure Localization in Mesh All-Optical Networks.,” in INFOCOM, 2009.
  [Bibtex]

  @inproceedings{infocomTapolcaiWH09,
  author = {J\'anos Tapolcai and Bin Wu and Pin-Han Ho},
  title = {On Monitoring and Failure Localization in Mesh All-Optical Networks.},
  booktitle = {INFOCOM},
  year = 2009,
  doi = {['https://doi.org/10.1109/INFCOM.2009.5062012', 'https://www.wikidata.org/entity/Q58033235']},
  keywords = {BME and international and applied}
  }

• B. Wu, P. Ho, K. L. Yeung, J. Tapolcai, and H. T. Mouftah, “CFP: Cooperative Fast Protection.,” in INFOCOM, 2009.
  [Bibtex]

  @inproceedings{infocomWuHYTM09,
  author = {Bin Wu and Pin-Han Ho and Kwan L. Yeung and J\'anos Tapolcai and Hussein T. Mouftah},
  title = {CFP: Cooperative Fast Protection.},
  booktitle = {INFOCOM},
  year = 2009,
  doi = {['https://doi.org/10.1109/INFCOM.2009.5062196', 'https://www.wikidata.org/entity/Q58033233']},
  keywords = {BME and international and applied}
  }

• B. Kégl and R. Busa-Fekete, “Boosting products of base classifiers.,” in ICML, 2009.
  [Bibtex]

  @inproceedings{icmlKeglB09,
  author = {Bal\'azs K\'egl and R\'obert Busa-Fekete},
  title = {Boosting products of base classifiers.},
  booktitle = {ICML},
  year = 2009,
  doi = {https://doi.org/10.1145/1553374.1553439},
  keywords = {SZTE and international and theory}
  }

• G. Enyedi, P. Szilágyi, G. Rétvári, and A. Császár, “IP Fast ReRoute: Lightweight Not-Via without Additional Addresses.,” in INFOCOM, 2009.
  [Bibtex]

  @inproceedings{infocomEnyediSRC09,
  author = {G\'abor Enyedi and P\'eter Szil\'agyi and G\'abor R\'etv\'ari and Andr\'as Cs\'asz\'ar},
  title = {IP Fast ReRoute: Lightweight Not-Via without Additional Addresses.},
  booktitle = {INFOCOM},
  year = 2009,
  doi = {https://doi.org/10.1109/INFCOM.2009.5062229},
  keywords = {Ericsson and BME and mostly_hungarian and applied}
  }

• I. Szita and A. Lörincz, “Optimistic initialization and greediness lead to polynomial time learning in factored MDPs.,” in ICML, 2009.
  [Bibtex]

  @inproceedings{icmlSzitaL09,
  author = {Istvan Szita and Andr\'as L\"orincz},
  title = {Optimistic initialization and greediness lead to polynomial time learning in factored MDPs.},
  booktitle = {ICML},
  year = 2009,
  doi = {https://doi.org/10.1145/1553374.1553502},
  keywords = {ELTE and international and applied}
  }

• G. Ivanyos, M. Karpinski, and N. Saxena, “Schemes for deterministic polynomial factoring.,” in ISSAC, 2009.
  [Bibtex]

  @inproceedings{issacIvanyosKS09,
  author = {G\'abor Ivanyos and Marek Karpinski and Nitin Saxena},
  title = {Schemes for deterministic polynomial factoring.},
  booktitle = {ISSAC},
  year = 2009,
  doi = {['https://doi.org/10.1145/1576702.1576730', 'https://www.wikidata.org/entity/Q56139159']},
  keywords = {SZTAKI and international and theory}
  }

• J. Németh, C. Domokos, and Z. Kato, “Recovering planar homographies between 2D shapes.,” in ICCV, 2009.
  [Bibtex]

  @inproceedings{iccvNemethDK09,
  author = {J\'ozsef N\'emeth and Csaba Domokos and Zoltan Kato},
  title = {Recovering planar homographies between 2D shapes.},
  booktitle = {ICCV},
  year = 2009,
  doi = {['https://doi.org/10.1109/ICCV.2009.5459474', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2009.5459474']},
  keywords = {SZTE and all_hungarian and applied}
  }

• A. Korösi, C. Lukovszki, B. Székely, and A. Császár, “High quality P2P-Video-on-Demand with download bandwidth limitation.,” in IWQoS, 2009.
  [Bibtex]

  @inproceedings{iwqosKorosiLSC09,
  author = {Attila Kor\"osi and Csaba Lukovszki and Bal\'azs Sz\'ekely and Andr\'as Cs\'asz\'ar},
  title = {High quality P2P-Video-on-Demand with download bandwidth limitation.},
  booktitle = {IWQoS},
  year = 2009,
  doi = {https://doi.org/10.1109/IWQoS.2009.5201392},
  keywords = {BME and Ericsson and international and applied}
  }

2008

• L. Babai, N. Nikolov, and L. Pyber, “Product growth and mixing in finite groups.,” in SODA, 2008.
  [Bibtex]

  @inproceedings{sodaBabaiNP08,
  author = {L\'aszl\'o Babai and Nikolay Nikolov and L\'aszl\'o Pyber},
  title = {Product growth and mixing in finite groups.},
  booktitle = {SODA},
  year = 2008,
  doi = {http://dl.acm.org/citation.cfm?id=1347082.1347110},
  keywords = {Rényi and international and theory}
  }

• A. György, G. Lugosi, and G. Ottucsák, “On-line Sequential Bin Packing.,” in COLT, 2008.
  [Bibtex]

  @inproceedings{coltGyorgyLO08,
  author = {Andr\'as Gy\"orgy and G\'abor Lugosi and Gy\"orgy Ottucs\'ak},
  title = {On-line Sequential Bin Packing.},
  booktitle = {COLT},
  year = 2008,
  doi = {{'@type': 'oa', '#text': 'http://colt2008.cs.helsinki.fi/papers/53-Gyorgy.pdf'}},
  keywords = {BME and international and theory}
  }

• I. Janovitz-Freireich, Á. Szántó, B. Mourrain, and L. Rónyai, “Moment matrices, trace matrices and the radical of ideals.,” in ISSAC, 2008.
  [Bibtex]

  @inproceedings{issacJanovitz-FreireichSMR08,
  author = {Itnuit Janovitz-Freireich and \'Agnes Sz\'ant\'o and Bernard Mourrain and Lajos R\'onyai},
  title = {Moment matrices, trace matrices and the radical of ideals.},
  booktitle = {ISSAC},
  year = 2008,
  doi = {https://doi.org/10.1145/1390768.1390788},
  keywords = {BME and international and theory}
  }

• I. Szita and A. Lörincz, “The many faces of optimism: a unifying approach.,” in ICML, 2008.
  [Bibtex]

  @inproceedings{icmlSzitaL08,
  author = {Istvan Szita and Andr\'as L\"orincz},
  title = {The many faces of optimism: a unifying approach.},
  booktitle = {ICML},
  year = 2008,
  doi = {https://doi.org/10.1145/1390156.1390288},
  keywords = {ELTE and all_hungarian and applied}
  }

• V. T. Nguyen and M. Telek, “Time Blocking Analysis in Time-Driven Switching Networks.,” in INFOCOM, 2008.
  [Bibtex]

  @inproceedings{infocomNguyenT08,
  author = {Viet Thang Nguyen and Mikl\'os Telek},
  title = {Time Blocking Analysis in Time-Driven Switching Networks.},
  booktitle = {INFOCOM},
  year = 2008,
  doi = {https://doi.org/10.1109/INFOCOM.2008.243},
  keywords = {BME and international and applied}
  }

• R. Ormándi, “Variance Minimization Least Squares Support Vector Machines for Time Series Analysis.,” in ICDM, 2008.
  [Bibtex]

  @inproceedings{icdmOrmandi08,
  author = {R\'obert Orm\'andi},
  title = {Variance Minimization Least Squares Support Vector Machines for Time Series Analysis.},
  booktitle = {ICDM},
  year = 2008,
  doi = {['https://doi.org/10.1109/ICDM.2008.79', 'https://doi.ieeecomputersociety.org/10.1109/ICDM.2008.79']},
  keywords = {SZTE and all_hungarian and applied}
  }

• B. Takács and Y. Demiris, “Balancing Spectral Clustering for Segmenting Spatio-temporal Observations of Multi-agent Systems.,” in ICDM, 2008.
  [Bibtex]

  @inproceedings{icdmTakacsD08,
  author = {B\'alint Tak\'acs and Yiannis Demiris},
  title = {Balancing Spectral Clustering for Segmenting Spatio-temporal Observations of Multi-agent Systems.},
  booktitle = {ICDM},
  year = 2008,
  doi = {['https://doi.org/10.1109/ICDM.2008.88', 'https://doi.ieeecomputersociety.org/10.1109/ICDM.2008.88']},
  keywords = {BME and international and theory}
  }

2007

• A. György, L. Kocsis, I. Szabó, and C. Szepesvári, “Continuous Time Associative Bandit Problems.,” in IJCAI, 2007.
  [Bibtex]

  @inproceedings{ijcaiGyorgyKSS07,
  author = {Andr\'as Gy\"orgy and Levente Kocsis and Ivett Szab\'o and Csaba Szepesv\'ari},
  title = {Continuous Time Associative Bandit Problems.},
  booktitle = {IJCAI},
  year = 2007,
  doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/07/Papers/133.pdf'}},
  keywords = {BME and SZTAKI and mostly_hungarian and theory}
  }

• G. Neu and C. Szepesvári, “Apprenticeship Learning using Inverse Reinforcement Learning and Gradient Methods.,” in UAI, 2007.
  [Bibtex]

  @inproceedings{uaiNeuS07,
  author = {Gergely Neu and Csaba Szepesv\'ari},
  title = {Apprenticeship Learning using Inverse Reinforcement Learning and Gradient Methods.},
  booktitle = {UAI},
  year = 2007,
  doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1702&proceeding_id=23'}},
  keywords = {BME and international and applied}
  }

• G. Rétvári, J. Bíró, and T. Cinkler, “Fairness in Capacitated Networks: A Polyhedral Approach.,” in INFOCOM, 2007.
  [Bibtex]

  @inproceedings{infocomRetvariBC07,
  author = {G\'abor R\'etv\'ari and J\'ozsef B\'ir\'o and Tibor Cinkler},
  title = {Fairness in Capacitated Networks: A Polyhedral Approach.},
  booktitle = {INFOCOM},
  year = 2007,
  doi = {https://doi.org/10.1109/INFCOM.2007.188},
  keywords = {BME and all_hungarian and applied}
  }

• R. Farkas, G. Szarvas, and R. Ormándi, “Improving a State-of-the-Art Named Entity Recognition System Using the World Wide Web.,” in ICDM, 2007.
  [Bibtex]

  @inproceedings{incdmFarkasSO07,
  author = {Rich\'ard Farkas and Gy\"orgy Szarvas and R\'obert Orm\'andi},
  title = {Improving a State-of-the-Art Named Entity Recognition System Using the World Wide Web.},
  booktitle = {ICDM},
  year = 2007,
  doi = {https://doi.org/10.1007/978-3-540-73435-2_13},
  keywords = {SZTE and mostly_hungarian and applied}
  }

• I. W. Tsang, A. Kocsor, and J. T. Kwok, “Simpler core vector machines with enclosing balls.,” in ICML, 2007.
  [Bibtex]

  @inproceedings{icmlTsangKK07,
  author = {Ivor W. Tsang and Andr\'as Kocsor and James T. Kwok},
  title = {Simpler core vector machines with enclosing balls.},
  booktitle = {ICML},
  year = 2007,
  doi = {['https://doi.org/10.1145/1273496.1273611', 'https://www.wikidata.org/entity/Q58827935']},
  keywords = {SZTE and international and applied}
  }

• Y. Cheng, M. Afanasyev, P. Verkaik, P. Benkö, J. Chiang, A. C. Snoeren, S. Savage, and G. M. Voelker, “Automating cross-layer diagnosis of enterprise wireless networks.,” in SIGCOMM, 2007.
  [Bibtex]

  @inproceedings{sigcommChengAVBCSSV07,
  author = {Yuchung Cheng and Mikhail Afanasyev and Patrick Verkaik and P\'eter Benk\"o and Jennifer Chiang and Alex C. Snoeren and Stefan Savage and Geoffrey M. Voelker},
  title = {Automating cross-layer diagnosis of enterprise wireless networks.},
  booktitle = {SIGCOMM},
  year = 2007,
  doi = {['https://doi.org/10.1145/1282380.1282384', 'https://doi.org/10.1145/1282427.1282384']},
  keywords = {Ericsson and international and applied}
  }

• G. Pap, “Some new results on node-capacitated packing of A-paths.,” in STOC, 2007.
  [Bibtex]

  @inproceedings{stocPap07,
  author = {Gyula Pap},
  title = {Some new results on node-capacitated packing of A-paths.},
  booktitle = {STOC},
  year = 2007,
  doi = {https://doi.org/10.1145/1250790.1250878},
  keywords = {ELTE and all_hungarian and theory}
  }

2006

• A. Antos, C. Szepesvári, and R. Munos, “Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path.,” in COLT, 2006.
  [Bibtex]

  @inproceedings{coltAntosSM06,
  author = {Andr\'as Antos and Csaba Szepesv\'ari and R\'emi Munos},
  title = {Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path.},
  booktitle = {COLT},
  year = 2006,
  doi = {https://doi.org/10.1007/11776420_42},
  keywords = {BME and SZTE and mostly_hungarian and theory}
  }

• A. György, T. Linder, and G. Ottucsák, “The Shortest Path Problem Under Partial Monitoring.,” in COLT, 2006.
  [Bibtex]

  @inproceedings{coltGyorgyLO06,
  author = {Andr\'as Gy\"orgy and Tam\'as Linder and Gy\"orgy Ottucs\'ak},
  title = {The Shortest Path Problem Under Partial Monitoring.},
  booktitle = {COLT},
  year = 2006,
  doi = {https://doi.org/10.1007/11776420_35},
  keywords = {BME and mostly_hungarian and theory}
  }

• B. Kusy, Á. Lédeczi, M. Maroti, and L. G. L. T. Meertens, “Node density independent localization.,” in IPSN, 2006.
  [Bibtex]

  @inproceedings{ipsnKusyLMM06,
  author = {Branislav Kusy and \'Akos L\'edeczi and Miklos Maroti and Lambert G. L. T. Meertens},
  title = {Node density independent localization.},
  booktitle = {IPSN},
  year = 2006,
  doi = {['https://doi.org/10.1145/1127777.1127844', 'https://doi.org/10.1109/IPSN.2006.243912']},
  keywords = {SZTE and international and theory}
  }

• L. Lovász and S. S. Vempala, “Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.,” in FOCS, 2006.
  [Bibtex]

  @inproceedings{focsLovaszV06,
  author = {L\'aszl\'o Lov\'asz and Santosh S. Vempala},
  title = {Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.},
  booktitle = {FOCS},
  year = 2006,
  doi = {['https://doi.org/10.1109/FOCS.2006.28', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2006.28']},
  keywords = {ELTE and international and theory}
  }

• S. Arora, L. Lovász, I. Newman, Y. Rabani, Y. Rabinovich, and S. S. Vempala, “Local versus global properties of metric spaces.,” in SODA, 2006.
  [Bibtex]

  @inproceedings{sodaAroraLNRRV06,
  author = {Sanjeev Arora and L\'aszl\'o Lov\'asz and Ilan Newman and Yuval Rabani and Yuri Rabinovich and Santosh S. Vempala},
  title = {Local versus global properties of metric spaces.},
  booktitle = {SODA},
  year = 2006,
  doi = {http://dl.acm.org/citation.cfm?id=1109557.1109563},
  keywords = {ELTE and international and theory}
  }

• C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, B. Szegedy, and K. Vesztergombi, “Graph limits and parameter testing.,” in STOC, 2006.
  [Bibtex]

  @inproceedings{stocBorgsCLSSV06,
  author = {Christian Borgs and Jennifer T. Chayes and L\'aszl\'o Lov\'asz and Vera T. S\'os and Bal\'azs Szegedy and Katalin Vesztergombi},
  title = {Graph limits and parameter testing.},
  booktitle = {STOC},
  year = 2006,
  doi = {['https://doi.org/10.1145/1132516.1132556', 'https://www.wikidata.org/entity/Q105584207']},
  keywords = {ELTE and Rényi and international and theory}
  }

• T. Sarlós, “Improved Approximation Algorithms for Large Matrices via Random Projections.,” in FOCS, 2006.
  [Bibtex]

  @inproceedings{focsSarlos06,
  author = {Tam\'as Sarl\'os},
  title = {Improved Approximation Algorithms for Large Matrices via Random Projections.},
  booktitle = {FOCS},
  year = 2006,
  doi = {['https://doi.org/10.1109/FOCS.2006.37', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2006.37']},
  keywords = {SZTAKI and all_hungarian and applied}
  }

• T. Sarlós, A. A. Benczúr, K. Csalogány, D. Fogaras, and B. Rácz, “To randomize or not to randomize: space optimal summaries for hyperlink analysis.,” in WWW, 2006.
  [Bibtex]

  @inproceedings{wwwSarlosBCFR06,
  author = {Tam\'as Sarl\'os and Andr\'as A. Bencz\'ur and K\'aroly Csalog\'any and D\'aniel Fogaras and Bal\'azs R\'acz},
  title = {To randomize or not to randomize: space optimal summaries for hyperlink analysis.},
  booktitle = {WWW},
  year = 2006,
  doi = {https://doi.org/10.1145/1135777.1135823},
  keywords = {SZTAKI and BME and all_hungarian and applied}
  }

• I. Janovitz-Freireich, L. Rónyai, and Á. Szántó, “Approximate radical of ideals with clusters of roots.,” in ISSAC, 2006.
  [Bibtex]

  @inproceedings{issacJanovitz-FreireichRS06,
  author = {Itnuit Janovitz-Freireich and Lajos R\'onyai and \'Agnes Sz\'ant\'o},
  title = {Approximate radical of ideals with clusters of roots.},
  booktitle = {ISSAC},
  year = 2006,
  doi = {https://doi.org/10.1145/1145768.1145796},
  keywords = {BME and international and theory}
  }

• G. Fodor, “Performance Analysis of a Reuse Partitioning Technique for OFDM Based Evolved UTRA.,” in IWQoS, 2006.
  [Bibtex]

  @inproceedings{iwqosFodor06,
  author = {G\'abor Fodor},
  title = {Performance Analysis of a Reuse Partitioning Technique for OFDM Based Evolved UTRA.},
  booktitle = {IWQoS},
  year = 2006,
  doi = {https://doi.org/10.1109/IWQOS.2006.250457},
  keywords = {BME and all_hungarian and applied}
  }

• T. Király and L. C. Lau, “Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs.,” in FOCS, 2006.
  [Bibtex]

  @inproceedings{focsKiralyL06,
  author = {Tam\'as Kir\'aly and Lap Chi Lau},
  title = {Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs.},
  booktitle = {FOCS},
  year = 2006,
  doi = {['https://doi.org/10.1109/FOCS.2006.12', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2006.12']},
  keywords = {ELTE and international and theory}
  }

• T. Horváth and P. Vojtás, “Ordinal Classification with Monotonicity Constraints.,” in ICDM, 2006.
  [Bibtex]

  @inproceedings{incdmHorvathV06,
  author = {Tom\'as Horv\'ath and Peter Vojt\'as},
  title = {Ordinal Classification with Monotonicity Constraints.},
  booktitle = {ICDM},
  year = 2006,
  doi = {https://doi.org/10.1007/11790853_17},
  keywords = {ELTE and international and applied}
  }

• I. W. Tsang, A. Kocsor, and J. T. Kwok, “Efficient kernel feature extraction for massive data sets.,” in KDD, 2006.
  [Bibtex]

  @inproceedings{kddTsangKK06,
  author = {Ivor W. Tsang and Andr\'as Kocsor and James T. Kwok},
  title = {Efficient kernel feature extraction for massive data sets.},
  booktitle = {KDD},
  year = 2006,
  doi = {https://doi.org/10.1145/1150402.1150494},
  keywords = {SZTE and international and applied}
  }

2005

• Z. Szamonek and C. Szepesvári, “X-mHMM: An Efficient Algorithm for Training Mixtures of HMMs When the Number of Mixtures Is Unknown.,” in ICDM, 2005.
  [Bibtex]

  @inproceedings{icdmSzamonekS05,
  author = {Zolt\'an Szamonek and Csaba Szepesv\'ari},
  title = {X-mHMM: An Efficient Algorithm for Training Mixtures of HMMs When the Number of Mixtures Is Unknown.},
  booktitle = {ICDM},
  year = 2005,
  doi = {['https://doi.org/10.1109/ICDM.2005.156', 'https://doi.ieeecomputersociety.org/10.1109/ICDM.2005.156']},
  keywords = {SZTE and international and theory}
  }

• C. Szepesvári and R. Munos, “Finite time bounds for sampling based fitted value iteration.,” in ICML, 2005.
  [Bibtex]

  @inproceedings{icmlSzepesvariM05,
  author = {Csaba Szepesv\'ari and R\'emi Munos},
  title = {Finite time bounds for sampling based fitted value iteration.},
  booktitle = {ICML},
  year = 2005,
  doi = {https://doi.org/10.1145/1102351.1102462},
  keywords = {SZTE and international and theory}
  }

• D. Marx, “The Closest Substring problem with small distances.,” in FOCS, 2005.
  [Bibtex]

  @inproceedings{focsMarx05,
  author = {D\'aniel Marx},
  title = {The Closest Substring problem with small distances.},
  booktitle = {FOCS},
  year = 2005,
  doi = {['https://doi.org/10.1109/SFCS.2005.70', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.70']},
  keywords = {SZTAKI and all_hungarian and theory}
  }

• B. Póczos and A. Lörincz, “Independent subspace analysis using geodesic spanning trees.,” in ICML, 2005.
  [Bibtex]

  @inproceedings{icmlPoczosL05,
  author = {Barnab\'as P\'oczos and Andr\'as L\"orincz},
  title = {Independent subspace analysis using geodesic spanning trees.},
  booktitle = {ICML},
  year = 2005,
  doi = {https://doi.org/10.1145/1102351.1102436},
  keywords = {ELTE and international and applied}
  }

• Á. Lédeczi, P. Völgyesi, M. Maroti, G. Simon, G. Balogh, A. Nádas, B. Kusy, and S. Dóra, “Multiple simultaneous acoustic source localization in urban terrain.,” in IPSN, 2005.
  [Bibtex]

  @inproceedings{ipsnLedecziVMSBNKD05,
  author = {\'Akos L\'edeczi and P\'eter V\"olgyesi and Miklos Maroti and Gyula Simon and Gy\"orgy Balogh and Andr\'as N\'adas and Branislav Kusy and Sebestyen D\'ora},
  title = {Multiple simultaneous acoustic source localization in urban terrain.},
  booktitle = {IPSN},
  year = 2005,
  doi = {['https://doi.org/10.1109/IPSN.2005.1440982', 'http://dl.acm.org/citation.cfm?id=1147771']},
  keywords = {SZTE and international and theory}
  }

• M. Maróti, P. Völgyesi, S. Dóra, B. Kusy, A. Nádas, Á. Lédeczi, G. Balogh, and K. Molnár, “Radio interferometric geolocation.,” in SenSys, 2005.
  [Bibtex]

  @inproceedings{sensysMarotiVDKNLBM05,
  author = {Mikl\'os Mar\'oti and P\'eter V\"olgyesi and Sebestyen D\'ora and Branislav Kusy and Andr\'as N\'adas and \'Akos L\'edeczi and Gy\"orgy Balogh and K\'aroly Moln\'ar},
  title = {Radio interferometric geolocation.},
  booktitle = {SenSys},
  year = 2005,
  doi = {https://doi.org/10.1145/1098918.1098920},
  keywords = {SZTE and international and applied}
  }

• L. A. Végh and A. A. Benczúr, “Primal-dual approach for directed vertex connectivity augmentation and generalizations.,” in SODA, 2005.
  [Bibtex]

  @inproceedings{sodaVeghB05,
  author = {L\'aszl\'o A. V\'egh and Andr\'as A. Bencz\'ur},
  title = {Primal-dual approach for directed vertex connectivity augmentation and generalizations.},
  booktitle = {SODA},
  year = 2005,
  doi = {http://dl.acm.org/citation.cfm?id=1070432.1070458},
  keywords = {SZTAKI and international and theory}
  }

• K. Friedl, G. Ivanyos, and M. Santha, “Efficient testing of groups.,” in STOC, 2005.
  [Bibtex]

  @inproceedings{stocFriedlIS05,
  author = {Katalin Friedl and G\'abor Ivanyos and Miklos Santha},
  title = {Efficient testing of groups.},
  booktitle = {STOC},
  year = 2005,
  doi = {https://doi.org/10.1145/1060590.1060614},
  keywords = {BME and SZTAKI and mostly_hungarian and theory}
  }

• G. Rétvári, J. Bíró, T. Cinkler, and T. Henk, “A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.,” in INFOCOM, 2005.
  [Bibtex]

  @inproceedings{infocomRetvariBCH05,
  author = {G\'abor R\'etv\'ari and J\'ozsef B\'ir\'o and Tibor Cinkler and Tam\'as Henk},
  title = {A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.},
  booktitle = {INFOCOM},
  year = 2005,
  doi = {https://doi.org/10.1109/INFCOM.2005.1497897},
  keywords = {BME and all_hungarian and applied}
  }

• A. Thümmler, P. Buchholz, and M. Telek, “A Novel Approach for Fitting Probability Distributions to Real Trace Data with the EM Algorithm.,” in DSN, 2005.
  [Bibtex]

  @inproceedings{dsnThummlerBT05,
  author = {Axel Th\"ummler and Peter Buchholz and Mikl\'os Telek},
  title = {A Novel Approach for Fitting Probability Distributions to Real Trace Data with the EM Algorithm.},
  booktitle = {DSN},
  year = 2005,
  doi = {['https://doi.org/10.1109/DSN.2005.11', 'https://doi.ieeecomputersociety.org/10.1109/DSN.2005.11']},
  keywords = {BME and international and applied}
  }

• I. Bárány, S. S. Vempala, and A. Vetta, “Nash Equilibria in Random Games.,” in FOCS, 2005.
  [Bibtex]

  @inproceedings{focsBaranyVV05,
  author = {Imre B\'ar\'any and Santosh S. Vempala and Adrian Vetta},
  title = {Nash Equilibria in Random Games.},
  booktitle = {FOCS},
  year = 2005,
  doi = {['https://doi.org/10.1109/SFCS.2005.52', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.52']},
  keywords = {Rényi and international and theory}
  }

• S. Rácz, T. Jakabfy, J. Farkas, and C. Antal, “Connection admission control for flow level QoS in bufferless models.,” in INFOCOM, 2005.
  [Bibtex]

  @inproceedings{infocomRaczJFA05,
  author = {S\'andor R\'acz and Tam\'as Jakabfy and J\'anos Farkas and Csaba Antal},
  title = {Connection admission control for flow level QoS in bufferless models.},
  booktitle = {INFOCOM},
  year = 2005,
  doi = {https://doi.org/10.1109/INFCOM.2005.1498353},
  keywords = {Ericsson and mostly_hungarian and applied}
  }

• A. Antos, “Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers.,” in COLT, 2005.
  [Bibtex]

  @inproceedings{coltAntos05,
  author = {Andr\'as Antos},
  title = {Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers.},
  booktitle = {COLT},
  year = 2005,
  doi = {https://doi.org/10.1007/11503415_36},
  keywords = {BME and all_hungarian and theory}
  }

• D. Fogaras and B. Rácz, “Scaling link-based similarity search.,” in WWW, 2005.
  [Bibtex]

  @inproceedings{wwwFogarasR05,
  author = {D\'aniel Fogaras and Bal\'azs R\'acz},
  title = {Scaling link-based similarity search.},
  booktitle = {WWW},
  year = 2005,
  doi = {https://doi.org/10.1145/1060745.1060839},
  keywords = {BME and SZTAKI and all_hungarian and applied}
  }

• A. Császár, A. Takács, and A. Báder, “A Practical Method for the Efficient Resolution of Congestion in an On-path Reduced-State Signalling Environment.,” in IWQoS, 2005.
  [Bibtex]

  @inproceedings{iwqosCsaszarTB05,
  author = {Andr\'as Cs\'asz\'ar and Attila Tak\'acs and Attila B\'ader},
  title = {A Practical Method for the Efficient Resolution of Congestion in an On-path Reduced-State Signalling Environment.},
  booktitle = {IWQoS},
  year = 2005,
  doi = {https://doi.org/10.1007/11499169_23},
  keywords = {Ericsson and mostly_hungarian and applied}
  }

2004

• C. Szepesvári and W. D. Smart, “Interpolation-based Q-learning.,” in ICML, 2004.
  [Bibtex]

  @inproceedings{icmlSzepesvariS04,
  author = {Csaba Szepesv\'ari and William D. Smart},
  title = {Interpolation-based Q-learning.},
  booktitle = {ICML},
  year = 2004,
  doi = {https://doi.org/10.1145/1015330.1015445},
  keywords = {SZTE and international and theory}
  }

• A. Montresor, M. Jelasity, and Ö. Babaoglu, “Robust Aggregation Protocols for Large-Scale Overlay Networks.,” in DSN, 2004.
  [Bibtex]

  @inproceedings{dsnMontresorJB04,
  author = {Alberto Montresor and M\'ark Jelasity and \"Ozalp Babaoglu},
  title = {Robust Aggregation Protocols for Large-Scale Overlay Networks.},
  booktitle = {DSN},
  year = 2004,
  doi = {['https://doi.org/10.1109/DSN.2004.1311873', 'https://doi.ieeecomputersociety.org/10.1109/DSN.2004.1311873']},
  keywords = {SZTE and international and applied}
  }

• P. Benkö, G. Malicskó, and A. Veres, “A Large-scale, Passive Analysis of End-to-End TCP Performance over GPRS.,” in INFOCOM, 2004.
  [Bibtex]

  @inproceedings{infocomBenkoMV04,
  author = {P\'eter Benk\"o and G\'abor Malicsk\'o and Andras Veres},
  title = {A Large-scale, Passive Analysis of End-to-End TCP Performance over GPRS.},
  booktitle = {INFOCOM},
  year = 2004,
  doi = {https://doi.org/10.1109/INFCOM.2004.1354598},
  keywords = {Corvinus and Ericsson and mostly_hungarian and applied}
  }

• S. Kumar, T. Lai, and J. Balogh, “On k-coverage in a mostly sleeping sensor network.,” in MobiCom, 2004.
  [Bibtex]

  @inproceedings{mobicomKumarLB04,
  author = {Santosh Kumar and Ten-Hwang Lai and J\'ozsef Balogh},
  title = {On k-coverage in a mostly sleeping sensor network.},
  booktitle = {MobiCom},
  year = 2004,
  doi = {https://doi.org/10.1145/1023720.1023735},
  keywords = {Hungary and international and theory}
  }

2003

• B. Aronov, J. Pach, M. Sharir, and G. Tardos, “Distinct distances in three and higher dimensions.,” in STOC, 2003.
  [Bibtex]

  @inproceedings{stocAronovPST03,
  author = {Boris Aronov and J\'anos Pach and Micha Sharir and G\'abor Tardos},
  title = {Distinct distances in three and higher dimensions.},
  booktitle = {STOC},
  year = 2003,
  doi = {https://doi.org/10.1145/780542.780621},
  keywords = {Rényi and international and theory}
  }

• G. Tardos, “Optimal probabilistic fingerprint codes.,” in STOC, 2003.
  [Bibtex]

  @inproceedings{stocTardo03,
  author = {G\'abor Tardos},
  title = {Optimal probabilistic fingerprint codes.},
  booktitle = {STOC},
  year = 2003,
  doi = {https://doi.org/10.1145/780542.780561},
  keywords = {Rényi and all_hungarian and theory}
  }

• K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen, “Hidden translation and orbit coset in quantum computing.,” in STOC, 2003.
  [Bibtex]

  @inproceedings{stocFriedlIMSS03,
  author = {Katalin Friedl and G\'abor Ivanyos and Fr\'ed\'eric Magniez and Miklos Santha and Pranab Sen},
  title = {Hidden translation and orbit coset in quantum computing.},
  booktitle = {STOC},
  year = 2003,
  doi = {['https://doi.org/10.1145/780542.780544', 'https://www.wikidata.org/entity/Q130926772']},
  keywords = {BME and SZTAKI and international and theory}
  }

• R. H. Sloan, B. Szörényi, and G. Turán, “Projective DNF Formulae and Their Revision.,” in COLT, 2003.
  [Bibtex]

  @inproceedings{coltSloanST03,
  author = {Robert H. Sloan and Bal\'azs Sz\"or\'enyi and Gy\"orgy Tur\'an},
  title = {Projective DNF Formulae and Their Revision.},
  booktitle = {COLT},
  year = 2003,
  doi = {https://doi.org/10.1007/978-3-540-45167-9_45},
  keywords = {SZTE and Hungary and mostly_hungarian and theory}
  }

• A. Jüttner, I. Szabó, and Á. Szentesi, “On Bandwidth Efficiency of the Hose Resource Management Model in Virtual Private Networks.,” in INFOCOM, 2003.
  [Bibtex]

  @inproceedings{infocomJuttnerSS03,
  author = {Alp\'ar J\"uttner and Istv\'an Szab\'o and \'Aron Szentesi},
  title = {On Bandwidth Efficiency of the Hose Resource Management Model in Virtual Private Networks.},
  booktitle = {INFOCOM},
  year = 2003,
  doi = {['https://doi.org/10.1109/INFCOM.2003.1208690', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2003.1208690']},
  keywords = {ELTE and BME and mostly_hungarian and applied}
  }

2002

• A. Bobbio, A. Horváth, and M. Telek, “The Scale Factor: A New Degree of Freedom in Phase Type Approximation.,” in DSN, 2002.
  [Bibtex]

  @inproceedings{dsnBobbioHT02a,
  author = {Andrea Bobbio and Andr\'as Horv\'ath and Mikl\'os Telek},
  title = {The Scale Factor: A New Degree of Freedom in Phase Type Approximation.},
  booktitle = {DSN},
  year = 2002,
  doi = {['https://doi.org/10.1109/DSN.2002.1029008', 'https://doi.ieeecomputersociety.org/10.1109/DSN.2002.1029008', 'https://www.wikidata.org/entity/Q62048508']},
  keywords = {BME and international and applied}
  }

2001

• J. Csirik, D. S. Johnson, and C. Kenyon, “Better approximation algorithms for bin covering.,” in SODA, 2001.
  [Bibtex]

  @inproceedings{sodaCsirikJK01,
  author = {J\'anos Csirik and David S. Johnson and Claire Kenyon},
  title = {Better approximation algorithms for bin covering.},
  booktitle = {SODA},
  year = 2001,
  doi = {http://dl.acm.org/citation.cfm?id=365411.365533},
  keywords = {SZTE and international and theory}
  }

• M. G. Barry, A. T. Campbell, and A. Veres, “Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks.,” in INFOCOM, 2001.
  [Bibtex]

  @inproceedings{infocomBarryCV01,
  author = {Michael G. Barry and Andrew T. Campbell and Andras Veres},
  title = {Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks.},
  booktitle = {INFOCOM},
  year = 2001,
  doi = {['https://doi.org/10.1109/INFCOM.2001.916786', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2001.916786']},
  keywords = {Ericsson and international and applied}
  }

• A. Jüttner, B. Szviatovszki, I. Mécs, and Z. Rajkó, “Lagrange Relaxation Based Method for the QoS Routing Problem.,” in INFOCOM, 2001.
  [Bibtex]

  @inproceedings{infocomJuttnerSMR01,
  author = {Alp\'ar J\"uttner and Bal\'azs Szviatovszki and Ildik\'o M\'ecs and Zsolt Rajk\'o},
  title = {Lagrange Relaxation Based Method for the QoS Routing Problem.},
  booktitle = {INFOCOM},
  year = 2001,
  doi = {['https://doi.org/10.1109/INFCOM.2001.916277', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2001.916277']},
  keywords = {ELTE and Ericsson and all_hungarian and applied}
  }

2000

• T. Cinkler, D. Marx, C. P. Larsen, and D. Fogaras, “Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks.,” in INFOCOM, 2000.
  [Bibtex]

  @inproceedings{infocomCinklerMLF00,
  author = {Tibor Cinkler and D\'aniel Marx and Claus Popp Larsen and D\'aniel Fogaras},
  title = {Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks.},
  booktitle = {INFOCOM},
  year = 2000,
  doi = {['https://doi.org/10.1109/INFCOM.2000.832275', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2000.832275']},
  keywords = {BME and SZTAKI and mostly_hungarian and applied}
  }

• J. Pach and G. Tardos, “On the boundary complexity of the union of fat triangles.,” in FOCS, 2000.
  [Bibtex]

  @inproceedings{focsPachT00,
  author = {J\'anos Pach and G\'abor Tardos},
  title = {On the boundary complexity of the union of fat triangles.},
  booktitle = {FOCS},
  year = 2000,
  doi = {['https://doi.org/10.1109/SFCS.2000.892130', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892130']},
  keywords = {Rényi and international and theory}
  }

• J. Goldsmith, R. H. Sloan, B. Szörényi, and G. Turán, “Improved Algorithms for Theory Revision with Queries.,” in COLT, 2000.
  [Bibtex]

  @inproceedings{coltGoldsmithSST00,
  author = {Judy Goldsmith and Robert H. Sloan and Bal\'azs Sz\"or\'enyi and Gy\"orgy Tur\'an},
  title = {Improved Algorithms for Theory Revision with Queries.},
  booktitle = {COLT},
  year = 2000,
  doi = {},
  keywords = {SZTE and Hungary and international and theory}
  }

• G. Ivanyos, “Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract).,” in ISSAC, 2000.
  [Bibtex]

  @inproceedings{issacIvanyos00,
  author = {G\'abor Ivanyos},
  title = {Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract).},
  booktitle = {ISSAC},
  year = 2000,
  doi = {https://doi.org/10.1145/345542.345620},
  keywords = {SZTAKI and all_hungarian and theory}
  }

• R. Szabó, P. Barta, F. Németh, and J. Bíró, “Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions.,” in INFOCOM, 2000.
  [Bibtex]

  @inproceedings{infocomSzaboBNB00,
  author = {R\'obert Szab\'o and Peter Barta and Felician N\'emeth and J\'ozsef B\'ir\'o},
  title = {Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions.},
  booktitle = {INFOCOM},
  year = 2000,
  doi = {['https://doi.org/10.1109/INFCOM.2000.832509', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2000.832509']},
  keywords = {BME and all_hungarian and applied}
  }

• J. Csirik, D. S. Johnson, C. Kenyon, J. B. Orlin, P. W. Shor, and R. R. Weber, “On the sum-of-squares algorithm for bin packing.,” in STOC, 2000.
  [Bibtex]

  @inproceedings{stocCsirikJKOSW00,
  author = {J\'anos Csirik and David S. Johnson and Claire Kenyon and James B. Orlin and Peter W. Shor and Richard R. Weber},
  title = {On the sum-of-squares algorithm for bin packing.},
  booktitle = {STOC},
  year = 2000,
  doi = {https://doi.org/10.1145/335305.335331},
  keywords = {SZTE and international and theory}
  }

• A. Veres and M. Boda, “The Chaotic Nature of TCP Congestion Control.,” in INFOCOM, 2000.
  [Bibtex]

  @inproceedings{infocomVeresB00,
  author = {Andras Veres and Mikl\'os Boda},
  title = {The Chaotic Nature of TCP Congestion Control.},
  booktitle = {INFOCOM},
  year = 2000,
  doi = {['https://doi.org/10.1109/INFCOM.2000.832571', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2000.832571']},
  keywords = {Ericsson and all_hungarian and applied}
  }

• A. Veres, Z. Kenesi, S. Molnár, and G. Vattay, “On the proagation of long-range dependence in the internet.,” in SIGCOMM, 2000.
  [Bibtex]

  @inproceedings{sigcommVeresKMV00,
  author = {Andras Veres and Zsolt Kenesi and S\'andor Moln\'ar and G\'abor Vattay},
  title = {On the proagation of long-range dependence in the internet.},
  booktitle = {SIGCOMM},
  year = 2000,
  doi = {['https://doi.org/10.1145/347059.347551', 'https://doi.org/10.1145/347057.347551']},
  keywords = {Ericsson and BME and ELTE and all_hungarian and applied}
  }

• A. Vidács and J. T. Virtamo, “Parameter Estimation of Geometrically Sampled Fractional Brownian Traffic.,” in INFOCOM, 2000.
  [Bibtex]

  @inproceedings{infocomVidacsV00,
  author = {Attila Vid\'acs and Jorma T. Virtamo},
  title = {Parameter Estimation of Geometrically Sampled Fractional Brownian Traffic.},
  booktitle = {INFOCOM},
  year = 2000,
  doi = {['https://doi.org/10.1109/INFCOM.2000.832579', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2000.832579']},
  keywords = {BME and international and applied}
  }

1999

• R. H. Sloan and G. Turán, “On Theory Revision with Queries.,” in COLT, 1999.
  [Bibtex]

  @inproceedings{coltSloanT99,
  author = {Robert H. Sloan and Gy\"orgy Tur\'an},
  title = {On Theory Revision with Queries.},
  booktitle = {COLT},
  year = 1999,
  doi = {https://doi.org/10.1145/307400.307411},
  keywords = {Hungary and international and theory}
  }

• A. Rácz, G. Fodor, and Z. R. Turányi, “Weighted Fair Early Packet Discard at an ATM Switch Output Port.,” in INFOCOM, 1999.
  [Bibtex]

  @inproceedings{infocomRaczFT99,
  author = {Andr\'as R\'acz and G\'abor Fodor and Zolt\'an Richard Tur\'anyi},
  title = {Weighted Fair Early Packet Discard at an ATM Switch Output Port.},
  booktitle = {INFOCOM},
  year = 1999,
  doi = {['https://doi.org/10.1109/INFCOM.1999.751672', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.1999.751672']},
  keywords = {Ericsson and BME and all_hungarian and applied}
  }

• H. N. Gabow and T. Jordán, “How to Make a Square Grid Framework with Cables Rigid.,” in SODA, 1999.
  [Bibtex]

  @inproceedings{sodaGabowJ99,
  author = {Harold N. Gabow and Tibor Jord\'an},
  title = {How to Make a Square Grid Framework with Cables Rigid.},
  booktitle = {SODA},
  year = 1999,
  doi = {http://dl.acm.org/citation.cfm?id=314500.314588},
  keywords = {ELTE and international and theory}
  }

1998

• Z. Gábor, Z. Kalmár, and C. Szepesvári, “Multi-criteria Reinforcement Learning.,” in ICML, 1998.
  [Bibtex]

  @inproceedings{icmlGaborKS98,
  author = {Zolt\'an G\'abor and Zsolt Kalm\'ar and Csaba Szepesv\'ari},
  title = {Multi-criteria Reinforcement Learning.},
  booktitle = {ICML},
  year = 1998,
  doi = {},
  keywords = {SZTE and international and theory}
  }

• J. Pach and G. Tóth, “Which Crossing Number is it, Anyway?,” in FOCS, 1998.
  [Bibtex]

  @inproceedings{focsPachT98,
  author = {J\'anos Pach and G\'eza T\'oth},
  title = {Which Crossing Number is it, Anyway?},
  booktitle = {FOCS},
  year = 1998,
  doi = {['https://doi.org/10.1109/SFCS.1998.743512', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743512', 'https://www.wikidata.org/entity/Q57255582']},
  keywords = {Rényi and international and theory}
  }

• A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, and M. Simonovits, “Approximation of Diameters: Randomization Doesn’t Help.,” in FOCS, 1998.
  [Bibtex]

  @inproceedings{focsBriedenGKKLS98,
  author = {Andreas Brieden and Peter Gritzmann and Ravi Kannan and Victor Klee and L\'aszl\'o Lov\'asz and Mikl\'os Simonovits},
  title = {Approximation of Diameters: Randomization Doesn't Help.},
  booktitle = {FOCS},
  year = 1998,
  doi = {['https://doi.org/10.1109/SFCS.1998.743451', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743451']},
  keywords = {Rényi and international and theory}
  }

• V. Grolmusz and G. Tardos, “Lower Bounds for (MOD p – MOD m) Circuits.,” in FOCS, 1998.
  [Bibtex]

  @inproceedings{focsGrolmuszT98,
  author = {Vince Grolmusz and G\'abor Tardos},
  title = {Lower Bounds for (MOD p - MOD m) Circuits.},
  booktitle = {FOCS},
  year = 1998,
  doi = {['https://doi.org/10.1109/SFCS.1998.743459', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743459']},
  keywords = {ELTE and Rényi and all_hungarian and theory}
  }

• I. Tsapara and G. Turán, “Learning Atomic Formulas with Prescribed Properties.,” in COLT, 1998.
  [Bibtex]

  @inproceedings{coltTsaparaT98,
  author = {Irene Tsapara and Gy\"orgy Tur\'an},
  title = {Learning Atomic Formulas with Prescribed Properties.},
  booktitle = {COLT},
  year = 1998,
  doi = {https://doi.org/10.1145/279943.279978},
  keywords = {Hungary and international and theory}
  }

• A. A. Benczúr and D. R. Karger, “‘sup': ‘2’, ‘#text': ‘Augmenting Undirected Edge Connectivity in Õ(n) Time.’,” in SODA, 1998.
  [Bibtex]

  @inproceedings{sodaBenczurK98,
  author = {Andr\'as A. Bencz\'ur and David R. Karger},
  title = {{'sup': '2', '#text': 'Augmenting Undirected Edge Connectivity in Õ(n) Time.'}},
  booktitle = {SODA},
  year = 1998,
  doi = {http://dl.acm.org/citation.cfm?id=314613.314835},
  keywords = {SZTAKI and international and theory}
  }

• J. Bang-Jensen, H. N. Gabow, T. Jordán, and Z. Szigeti, “Edge-Connectivity Augmentation with Partition Constraints.,” in SODA, 1998.
  [Bibtex]

  @inproceedings{sodaBang-JensenGJS98,
  author = {Jørgen Bang-Jensen and Harold N. Gabow and Tibor Jord\'an and Zolt\'an Szigeti},
  title = {Edge-Connectivity Augmentation with Partition Constraints.},
  booktitle = {SODA},
  year = 1998,
  doi = {http://dl.acm.org/citation.cfm?id=314613.314721},
  keywords = {ELTE and international and theory}
  }

1997

• N. Alon, M. Dietzfelbinger, P. B. Miltersen, E. Petrank, and G. Tardos, “Is Linear Hashing Good?,” in STOC, 1997.
  [Bibtex]

  @inproceedings{stocAlonDMPT97,
  author = {Noga Alon and Martin Dietzfelbinger and Peter Bro Miltersen and Erez Petrank and G\'abor Tardos},
  title = {Is Linear Hashing Good?},
  booktitle = {STOC},
  year = 1997,
  doi = {https://doi.org/10.1145/258533.258639},
  keywords = {Rényi and international and theory}
  }

• J. Kilian, E. Petrank, and G. Tardos, “Probabilistically Checkable Proofs with Zero Knowledge.,” in STOC, 1997.
  [Bibtex]

  @inproceedings{stocKilianPT97,
  author = {Joe Kilian and Erez Petrank and G\'abor Tardos},
  title = {Probabilistically Checkable Proofs with Zero Knowledge.},
  booktitle = {STOC},
  year = 1997,
  doi = {https://doi.org/10.1145/258533.258643},
  keywords = {Rényi and international and theory}
  }

• T. Horváth, R. H. Sloan, and G. Turán, “Learning Logic Programs by Using the Product Homomorphism Method.,” in COLT, 1997.
  [Bibtex]

  @inproceedings{coltHorvathST97,
  author = {Tam\'as Horv\'ath and Robert H. Sloan and Gy\"orgy Tur\'an},
  title = {Learning Logic Programs by Using the Product Homomorphism Method.},
  booktitle = {COLT},
  year = 1997,
  doi = {https://doi.org/10.1145/267460.267468},
  keywords = {Hungary and international and theory}
  }

• A. L. Chistov, G. Ivanyos, and M. Karpinski, “Polynomial Time Algorithms for Modules over Finite Dimensional Algebras.,” in ISSAC, 1997.
  [Bibtex]

  @inproceedings{issacChistovIK97,
  author = {Alexander L. Chistov and G\'abor Ivanyos and Marek Karpinski},
  title = {Polynomial Time Algorithms for Modules over Finite Dimensional Algebras.},
  booktitle = {ISSAC},
  year = 1997,
  doi = {https://doi.org/10.1145/258726.258751},
  keywords = {SZTAKI and international and theory}
  }

• I. Chlamtac, V. Elek, A. Fumagalli, and C. A. Szabó, “Scalable WDM Network Architecture Based on Photonic Slot Routing and Switched Delay Lines.,” in INFOCOM, 1997.
  [Bibtex]

  @inproceedings{infocomChlamtacEFS97,
  author = {Imrich Chlamtac and Vikt\'oria Elek and Andrea Fumagalli and Csaba A. Szab\'o},
  title = {Scalable WDM Network Architecture Based on Photonic Slot Routing and Switched Delay Lines.},
  booktitle = {INFOCOM},
  year = 1997,
  doi = {https://doi.org/10.1109/INFCOM.1997.644537},
  keywords = {BME and international and applied}
  }

• J. Bang-Jensen and T. Jordán, “Edge-Connectivity Augmentation Preserving Simplicity.,” in FOCS, 1997.
  [Bibtex]

  @inproceedings{focsBang-JensenJ97,
  author = {Jørgen Bang-Jensen and Tibor Jord\'an},
  title = {Edge-Connectivity Augmentation Preserving Simplicity.},
  booktitle = {FOCS},
  year = 1997,
  doi = {['https://doi.org/10.1109/SFCS.1997.646137', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1997.646137']},
  keywords = {ELTE and international and theory}
  }

1996

• M. L. Littman and C. Szepesvári, “A Generalized Reinforcement-Learning Model: Convergence and Applications.,” in ICML, 1996.
  [Bibtex]

  @inproceedings{icmlLittmanS96,
  author = {Michael L. Littman and Csaba Szepesv\'ari},
  title = {A Generalized Reinforcement-Learning Model: Convergence and Applications.},
  booktitle = {ICML},
  year = 1996,
  doi = {},
  keywords = {SZTE and international and theory}
  }

• L. Babai, R. Beals, J. Cai, G. Ivanyos, and E. M. Luks, “Multiplicative Equations over Commuting Matrices.,” in SODA, 1996.
  [Bibtex]

  @inproceedings{sodaBabaiBCIL96,
  author = {L\'aszl\'o Babai and Robert Beals and Jin-yi Cai and G\'abor Ivanyos and Eugene M. Luks},
  title = {Multiplicative Equations over Commuting Matrices.},
  booktitle = {SODA},
  year = 1996,
  doi = {http://dl.acm.org/citation.cfm?id=313852.314109},
  keywords = {SZTAKI and international and theory}
  }

• L. Babai, A. Gál, J. Kollár, L. Rónyai, T. Szabó, and A. Wigderson, “Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.,” in STOC, 1996.
  [Bibtex]

  @inproceedings{stocBabaiGKRSW96,
  author = {L\'aszl\'o Babai and Anna G\'al and J\'anos Koll\'ar and Lajos R\'onyai and Tibor Szab\'o and Avi Wigderson},
  title = {Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.},
  booktitle = {STOC},
  year = 1996,
  doi = {https://doi.org/10.1145/237814.238010},
  keywords = {BME and international and theory}
  }

• E. Petrank and G. Tardos, “On the Knowledge Complexity of NP.,” in FOCS, 1996.
  [Bibtex]

  @inproceedings{focsPetrankT96,
  author = {Erez Petrank and G\'abor Tardos},
  title = {On the Knowledge Complexity of NP.},
  booktitle = {FOCS},
  year = 1996,
  doi = {['https://doi.org/10.1109/SFCS.1996.548508', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548508']},
  keywords = {Rényi and international and theory}
  }

• A. Antos and G. Lugosi, “Strong Minimax Lower Bounds for Learning.,” in COLT, 1996.
  [Bibtex]

  @inproceedings{coltAntosL96,
  author = {Andr\'as Antos and G\'abor Lugosi},
  title = {Strong Minimax Lower Bounds for Learning.},
  booktitle = {COLT},
  year = 1996,
  doi = {https://doi.org/10.1145/238061.238160},
  keywords = {BME and international and theory}
  }

• J. Komlós, Y. Ma, and E. Szemerédi, “Matching Nuts and Bolts in O(n log n) Time (Extended Abstract).,” in SODA, 1996.
  [Bibtex]

  @inproceedings{sodaKomlosMS96,
  author = {J\'anos Koml\'os and Yuan Ma and Endre Szemer\'edi},
  title = {Matching Nuts and Bolts in O(n log n) Time (Extended Abstract).},
  booktitle = {SODA},
  year = 1996,
  doi = {http://dl.acm.org/citation.cfm?id=313852.314069},
  keywords = {Rényi and international and theory}
  }

• A. A. Benczúr and D. R. Karger, “‘i': [‘s-t’, ‘Õ’, ‘n’], ‘sup': ‘2’, ‘#text': ‘Approximating Minimum Cuts in () Time.’,” in STOC, 1996.
  [Bibtex]

  @inproceedings{stocBenczurK96,
  author = {Andr\'as A. Bencz\'ur and David R. Karger},
  title = {{'i': ['s-t', 'Õ', 'n'], 'sup': '2', '#text': 'Approximating Minimum Cuts in () Time.'}},
  booktitle = {STOC},
  year = 1996,
  doi = {https://doi.org/10.1145/237814.237827},
  keywords = {SZTAKI and international and theory}
  }

1995

• Z. Kato, J. Zerubia, and M. Berthod, “Unsupervised Parallel Image Classificiation Using a Hierarchical Markovian Model.,” in ICCV, 1995.
  [Bibtex]

  @inproceedings{iccvKateZB95,
  author = {Zoltan Kato and Josiane Zerubia and Marc Berthod},
  title = {Unsupervised Parallel Image Classificiation Using a Hierarchical Markovian Model.},
  booktitle = {ICCV},
  year = 1995,
  doi = {['https://doi.org/10.1109/ICCV.1995.466790', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.1995.466790']},
  keywords = {SZTE and international and applied}
  }

• A. A. Benczúr, “A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications.,” in FOCS, 1995.
  [Bibtex]

  @inproceedings{focsBenczur95,
  author = {Andr\'as A. Bencz\'ur},
  title = {A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications.},
  booktitle = {FOCS},
  year = 1995,
  doi = {['https://doi.org/10.1109/SFCS.1995.492466', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492466']},
  keywords = {SZTAKI and all_hungarian and theory}
  }

1994

• R. H. Sloan and G. Turán, “Learning with Queries but Incomplete Information (Extended Abstract).,” in COLT, 1994.
  [Bibtex]

  @inproceedings{coltSloanT94,
  author = {Robert H. Sloan and Gy\"orgy Tur\'an},
  title = {Learning with Queries but Incomplete Information (Extended Abstract).},
  booktitle = {COLT},
  year = 1994,
  doi = {https://doi.org/10.1145/180139.181128},
  keywords = {Hungary and international and theory}
  }

• G. Turán and F. Vatan, “On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract),” in FOCS, 1994.
  [Bibtex]

  @inproceedings{focsTuranV94,
  author = {Gy\"orgy Tur\'an and Farrokh Vatan},
  title = {On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)},
  booktitle = {FOCS},
  year = 1994,
  doi = {['https://doi.org/10.1109/SFCS.1994.365735', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365735']},
  keywords = {Hungary and international and theory}
  }

• K. Friedl, Z. Hátsági, and A. Shen, “Low-degree Tests.,” in SODA, 1994.
  [Bibtex]

  @inproceedings{sodaFriedlHS94,
  author = {Katalin Friedl and Zsolt H\'ats\'agi and Alexander Shen},
  title = {Low-degree Tests.},
  booktitle = {SODA},
  year = 1994,
  doi = {http://dl.acm.org/citation.cfm?id=314464.314479},
  keywords = {BME and international and theory}
  }

• V. Grolmusz, “A weight-size trade-off for circuits with MOD m gates.,” in STOC, 1994.
  [Bibtex]

  @inproceedings{stocGrolmusz94,
  author = {Vince Grolmusz},
  title = {A weight-size trade-off for circuits with MOD m gates.},
  booktitle = {STOC},
  year = 1994,
  doi = {https://doi.org/10.1145/195058.195108},
  keywords = {ELTE and all_hungarian and theory}
  }

1993

• L. Babai, K. Friedl, and M. Stricker, “Decomposition of *-closed Algebras in Polynomial Time.,” in ISSAC, 1993.
  [Bibtex]

  @inproceedings{issacBabaiFS93,
  author = {L\'aszl\'o Babai and Katalin Friedl and Markus Stricker},
  title = {Decomposition of *-closed Algebras in Polynomial Time.},
  booktitle = {ISSAC},
  year = 1993,
  doi = {https://doi.org/10.1145/164081.164098},
  keywords = {BME and international and theory}
  }

• G. Turán, “Lower Bounds for PAC Learning with Queries.,” in COLT, 1993.
  [Bibtex]

  @inproceedings{coltTuran93,
  author = {Gy\"orgy Tur\'an},
  title = {Lower Bounds for PAC Learning with Queries.},
  booktitle = {COLT},
  year = 1993,
  doi = {https://doi.org/10.1145/168304.168382},
  keywords = {Hungary and all_hungarian and theory}
  }

• Z. Kato, M. Berthod, and J. Zerubia, “Multiscale Markov random field models for parallel image classification.,” in ICCV, 1993.
  [Bibtex]

  @inproceedings{iccvKatoBZ93,
  author = {Zoltan Kato and Marc Berthod and Josiane Zerubia},
  title = {Multiscale Markov random field models for parallel image classification.},
  booktitle = {ICCV},
  year = 1993,
  doi = {['https://doi.org/10.1109/ICCV.1993.378210', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.1993.378210']},
  keywords = {SZTE and international and applied}
  }

1992

• M. Ajtai, J. Komlós, and E. Szemerédi, “Halvers and Expanders,” in FOCS, 1992.
  [Bibtex]

  @inproceedings{focsAjtaiKS92,
  author = {Mikl\'os Ajtai and J\'anos Koml\'os and Endre Szemer\'edi},
  title = {Halvers and Expanders},
  booktitle = {FOCS},
  year = 1992,
  doi = {['https://doi.org/10.1109/SFCS.1992.267782', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267782']},
  keywords = {Rényi and international and theory}
  }

• L. Lovász and M. Simonovits, “On the Randomized Complexity of Volume and Diameter,” in FOCS, 1992.
  [Bibtex]

  @inproceedings{focsLovaszS92,
  author = {L\'aszl\'o Lov\'asz and Mikl\'os Simonovits},
  title = {On the Randomized Complexity of Volume and Diameter},
  booktitle = {FOCS},
  year = 1992,
  doi = {['https://doi.org/10.1109/SFCS.1992.267803', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267803']},
  keywords = {Rényi and international and theory}
  }

• V. Grolmusz, “Separating the Communication Complexities of MOD m and MOD p Circuits,” in FOCS, 1992.
  [Bibtex]

  @inproceedings{focsGrolmusz92,
  author = {Vince Grolmusz},
  title = {Separating the Communication Complexities of MOD m and MOD p Circuits},
  booktitle = {FOCS},
  year = 1992,
  doi = {['https://doi.org/10.1109/SFCS.1992.267764', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267764']},
  keywords = {ELTE and all_hungarian and theory}
  }

1991

• L. Babai and K. Friedl, “Approximate Representation Theory of Finite Groups,” in FOCS, 1991.
  [Bibtex]

  @inproceedings{focsBabaiF91,
  author = {L\'aszl\'o Babai and Katalin Friedl},
  title = {Approximate Representation Theory of Finite Groups},
  booktitle = {FOCS},
  year = 1991,
  doi = {['https://doi.org/10.1109/SFCS.1991.185442', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185442']},
  keywords = {BME and international and theory}
  }

• P. Fritzson, T. Gyimóthy, M. Kamkar, and N. Shahmehri, “Generalized Algorithmic Debugging and Testing.,” in PLDI, 1991.
  [Bibtex]

  @inproceedings{pldiFritzsonGKS91,
  author = {Peter Fritzson and Tibor Gyim\'othy and Mariam Kamkar and Nahid Shahmehri},
  title = {Generalized Algorithmic Debugging and Testing.},
  booktitle = {PLDI},
  year = 1991,
  doi = {['https://doi.org/10.1145/113445.113472', 'https://doi.org/10.1145/113446.113472']},
  keywords = {SZTE and international and theory}
  }

• J. Csirik and D. S. Johnson, “Bounded Space On-Line Bin Packing: Best is Better than First.,” in SODA, 1991.
  [Bibtex]

  @inproceedings{sodaCsirikJ91,
  author = {J\'anos Csirik and David S. Johnson},
  title = {Bounded Space On-Line Bin Packing: Best is Better than First.},
  booktitle = {SODA},
  year = 1991,
  doi = {http://dl.acm.org/citation.cfm?id=127787.127846},
  keywords = {SZTE and international and theory}
  }

1990

• L. Lovász and M. Simonovits, “The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume,” in FOCS, 1990.
  [Bibtex]

  @inproceedings{focsLovaszS90,
  author = {L\'aszl\'o Lov\'asz and Mikl\'os Simonovits},
  title = {The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume},
  booktitle = {FOCS},
  year = 1990,
  doi = {['https://doi.org/10.1109/FSCS.1990.89553', 'https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89553']},
  keywords = {Rényi and international and theory}
  }

• P. Berman, H. J. Karloff, and G. Tardos, “A Competitive 3-Server Algorithm.,” in SODA, 1990.
  [Bibtex]

  @inproceedings{sodaBermanKT90,
  author = {Piotr Berman and Howard J. Karloff and G\'abor Tardos},
  title = {A Competitive 3-Server Algorithm.},
  booktitle = {SODA},
  year = 1990,
  doi = {http://dl.acm.org/citation.cfm?id=320176.320208},
  keywords = {Rényi and international and theory}
  }

• S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson, “On the Power of Randomization in Online Algorithms (Extended Abstract),” in STOC, 1990.
  [Bibtex]

  @inproceedings{stocBen-DavidBKTW90,
  author = {Shai Ben-David and Allan Borodin and Richard M. Karp and G\'abor Tardos and Avi Wigderson},
  title = {On the Power of Randomization in Online Algorithms (Extended Abstract)},
  booktitle = {STOC},
  year = 1990,
  doi = {https://doi.org/10.1145/100216.100268},
  keywords = {Rényi and international and theory}
  }

• W. Maass and G. Turán, “On the Complexity of Learning from Counterexamples and Membership Queries,” in FOCS, 1990.
  [Bibtex]

  @inproceedings{focsMaassT90,
  author = {Wolfgang Maass and Gy\"orgy Tur\'an},
  title = {On the Complexity of Learning from Counterexamples and Membership Queries},
  booktitle = {FOCS},
  year = 1990,
  doi = {['https://doi.org/10.1109/FSCS.1990.89539', 'https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89539']},
  keywords = {Hungary and international and theory}
  }

• A. Frank, “Augmenting Graphs to Meet Edge-Connectivity Requirements,” in FOCS, 1990.
  [Bibtex]

  @inproceedings{focsFrank90,
  author = {Andr\'as Frank},
  title = {Augmenting Graphs to Meet Edge-Connectivity Requirements},
  booktitle = {FOCS},
  year = 1990,
  doi = {['https://doi.org/10.1109/FSCS.1990.89593', 'https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89593']},
  keywords = {ELTE and all_hungarian and theory}
  }

1989

• L. Babai and L. Rónyai, “Computing Irreducible Representations of Finite Groups,” in FOCS, 1989.
  [Bibtex]

  @inproceedings{focsBabaiR89,
  author = {L\'aszl\'o Babai and Lajos R\'onyai},
  title = {Computing Irreducible Representations of Finite Groups},
  booktitle = {FOCS},
  year = 1989,
  doi = {['https://doi.org/10.1109/SFCS.1989.63461', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63461']},
  keywords = {BME and international and theory}
  }

• J. Pach, W. L. Steiger, and E. Szemerédi, “An Upper Bound on the Number of Planar k-Sets,” in FOCS, 1989.
  [Bibtex]

  @inproceedings{focsPachSS89,
  author = {J\'anos Pach and William L. Steiger and Endre Szemer\'edi},
  title = {An Upper Bound on the Number of Planar k-Sets},
  booktitle = {FOCS},
  year = 1989,
  doi = {['https://doi.org/10.1109/SFCS.1989.63458', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63458']},
  keywords = {Rényi and international and theory}
  }

• R. Impagliazzo and G. Tardos, “Decision Versus Search Problems in Super-Polynomial Time,” in FOCS, 1989.
  [Bibtex]

  @inproceedings{focsImpagliazzoT89,
  author = {Russell Impagliazzo and G\'abor Tardos},
  title = {Decision Versus Search Problems in Super-Polynomial Time},
  booktitle = {FOCS},
  year = 1989,
  doi = {['https://doi.org/10.1109/SFCS.1989.63482', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63482']},
  keywords = {Rényi and international and theory}
  }

• A. Fiat, S. Moses, A. Shamir, I. Shimshoni, and G. Tardos, “Planning and Learning in Permutation Groups,” in FOCS, 1989.
  [Bibtex]

  @inproceedings{focsFiatMSST89,
  author = {Amos Fiat and Shahar Moses and Adi Shamir and Ilan Shimshoni and G\'abor Tardos},
  title = {Planning and Learning in Permutation Groups},
  booktitle = {FOCS},
  year = 1989,
  doi = {['https://doi.org/10.1109/SFCS.1989.63490', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63490']},
  keywords = {Rényi and international and theory}
  }

• W. Maass and G. Turán, “On the Complexity of Learning From Counterexamples (Extended Abstract),” in FOCS, 1989.
  [Bibtex]

  @inproceedings{focsMaassT89,
  author = {Wolfgang Maass and Gy\"orgy Tur\'an},
  title = {On the Complexity of Learning From Counterexamples (Extended Abstract)},
  booktitle = {FOCS},
  year = 1989,
  doi = {['https://doi.org/10.1109/SFCS.1989.63488', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63488']},
  keywords = {Hungary and international and theory}
  }

• J. Friedman, J. Kahn, and E. Szemerédi, “On the Second Eigenvalue in Random Regular Graphs,” in STOC, 1989.
  [Bibtex]

  @inproceedings{stocFriedmanKS89,
  author = {Joel Friedman and Jeff Kahn and Endre Szemer\'edi},
  title = {On the Second Eigenvalue in Random Regular Graphs},
  booktitle = {STOC},
  year = 1989,
  doi = {https://doi.org/10.1145/73007.73063},
  keywords = {Rényi and international and theory}
  }

• L. Rónyai, “Galois Groups and Factoring Polynomials over Finite Fields,” in FOCS, 1989.
  [Bibtex]

  @inproceedings{focsRonyai89,
  author = {Lajos R\'onyai},
  title = {Galois Groups and Factoring Polynomials over Finite Fields},
  booktitle = {FOCS},
  year = 1989,
  doi = {['https://doi.org/10.1109/SFCS.1989.63462', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63462']},
  keywords = {BME and all_hungarian and theory}
  }

• J. Boyar, K. Friedl, and C. Lund, “Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.,” in EUROCRYPT, 1989.
  [Bibtex]

  @inproceedings{eurocryptBoyarFL89,
  author = {Joan Boyar and Katalin Friedl and Carsten Lund},
  title = {Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.},
  booktitle = {EUROCRYPT},
  year = 1989,
  doi = {https://doi.org/10.1007/3-540-46885-4_18},
  keywords = {BME and international and theory}
  }

1988

• A. Hajnal, W. Maass, and G. Turán, “On the Communication Complexity of Graph Properties,” in STOC, 1988.
  [Bibtex]

  @inproceedings{stocHajnalMT88,
  author = {Andr\'as Hajnal and Wolfgang Maass and Gy\"orgy Tur\'an},
  title = {On the Communication Complexity of Graph Properties},
  booktitle = {STOC},
  year = 1988,
  doi = {https://doi.org/10.1145/62212.62228},
  keywords = {Hungary and international and theory}
  }

• J. Pintz, W. L. Steiger, and E. Szemerédi, “Two Infinite Sets of Primes with Fast Primality Tests,” in STOC, 1988.
  [Bibtex]

  @inproceedings{stocPintzSS88,
  author = {Janos Pintz and William L. Steiger and Endre Szemer\'edi},
  title = {Two Infinite Sets of Primes with Fast Primality Tests},
  booktitle = {STOC},
  year = 1988,
  doi = {https://doi.org/10.1145/62212.62261},
  keywords = {Rényi and mostly_hungarian and theory}
  }

• J. Komlós and R. Paturi, “Effect of Connectivity in Associative Memory Models (Preliminary Version),” in FOCS, 1988.
  [Bibtex]

  @inproceedings{focsKomlosP88,
  author = {J\'anos Koml\'os and Ramamohan Paturi},
  title = {Effect of Connectivity in Associative Memory Models (Preliminary Version)},
  booktitle = {FOCS},
  year = 1988,
  doi = {['https://doi.org/10.1109/SFCS.1988.21932', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21932']},
  keywords = {Rényi and international and theory}
  }

• E. Dahlhaus, P. Hajnal, and M. Karpinski, “Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs,” in FOCS, 1988.
  [Bibtex]

  @inproceedings{focsDahlhausHK88,
  author = {Elias Dahlhaus and P\'eter Hajnal and Marek Karpinski},
  title = {Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs},
  booktitle = {FOCS},
  year = 1988,
  doi = {['https://doi.org/10.1109/SFCS.1988.21936', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21936']},
  keywords = {SZTE and international and theory}
  }

1987

• A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán, “Threshold circuits of bounded depth,” in FOCS, 1987.
  [Bibtex]

  @inproceedings{focsHajnalMPST87,
  author = {Andr\'as Hajnal and Wolfgang Maass and Pavel Pudl\'ak and Mario Szegedy and Gy\"orgy Tur\'an},
  title = {Threshold circuits of bounded depth},
  booktitle = {FOCS},
  year = 1987,
  doi = {['https://doi.org/10.1109/SFCS.1987.59', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.59']},
  keywords = {Hungary and international and theory}
  }

• M. Ajtai, J. Komlós, and E. Szemerédi, “Deterministic Simulation in LOGSPACE,” in STOC, 1987.
  [Bibtex]

  @inproceedings{stocAjtaiKS87,
  author = {Mikl\'os Ajtai and J\'anos Koml\'os and Endre Szemer\'edi},
  title = {Deterministic Simulation in LOGSPACE},
  booktitle = {STOC},
  year = 1987,
  doi = {['https://doi.org/10.1145/28395.28410', 'https://www.wikidata.org/entity/Q29028423']},
  keywords = {Rényi and mostly_hungarian and theory}
  }

• W. Maass, G. Schnitger, and E. Szemerédi, “Two Tapes Are Better than One for Off-Line Turing Machines,” in STOC, 1987.
  [Bibtex]

  @inproceedings{stocMaassSS87,
  author = {Wolfgang Maass and Georg Schnitger and Endre Szemer\'edi},
  title = {Two Tapes Are Better than One for Off-Line Turing Machines},
  booktitle = {STOC},
  year = 1987,
  doi = {['https://doi.org/10.1145/28395.28406', 'https://www.wikidata.org/entity/Q130990191']},
  keywords = {Rényi and international and theory}
  }

• L. Rónyai, “Factoring Polynomials over Finite Fields,” in FOCS, 1987.
  [Bibtex]

  @inproceedings{focsRonyai87,
  author = {Lajos R\'onyai},
  title = {Factoring Polynomials over Finite Fields},
  booktitle = {FOCS},
  year = 1987,
  doi = {['https://doi.org/10.1109/SFCS.1987.25', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.25']},
  keywords = {BME and all_hungarian and theory}
  }

• L. Rónyai, “Simple Algebras Are Difficult,” in STOC, 1987.
  [Bibtex]

  @inproceedings{stocRonyai87,
  author = {Lajos R\'onyai},
  title = {Simple Algebras Are Difficult},
  booktitle = {STOC},
  year = 1987,
  doi = {https://doi.org/10.1145/28395.28438},
  keywords = {BME and all_hungarian and theory}
  }

• V. Grolmusz and P. Ragde, “Incomparability in Parallel Computation,” in FOCS, 1987.
  [Bibtex]

  @inproceedings{focsGrolmuszR87,
  author = {Vince Grolmusz and Prabhakar Ragde},
  title = {Incomparability in Parallel Computation},
  booktitle = {FOCS},
  year = 1987,
  doi = {['https://doi.org/10.1109/SFCS.1987.34', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.34']},
  keywords = {ELTE and international and theory}
  }

• T. Gergely and Z. Szabó, “Inductive Inference on the Base of Fixed Point Theory.,” in IJCAI, 1987.
  [Bibtex]

  @inproceedings{ijcaiGergelyS87,
  author = {Tam\'as Gergely and Zolt\'an Szab\'o},
  title = {Inductive Inference on the Base of Fixed Point Theory.},
  booktitle = {IJCAI},
  year = 1987,
  doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/87-2/Papers/074.pdf'}},
  keywords = {Hungary and international and theory}
  }

• M. Barbuceanu, S. Trausan-Matu, and B. Molnár, “Integrating Declarative Knowledge Programming Styles and Tools in a Structured Object AI Environment.,” in IJCAI, 1987.
  [Bibtex]

  @inproceedings{ijcaiBarbuceanuTM87,
  author = {Mihai Barbuceanu and Stefan Trausan-Matu and B\'alint Moln\'ar},
  title = {Integrating Declarative Knowledge Programming Styles and Tools in a Structured Object AI Environment.},
  booktitle = {IJCAI},
  year = 1987,
  doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/87-1/Papers/112.pdf'}},
  keywords = {ELTE and international and theory}
  }

1986

• M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Pudlák, V. Rödl, E. Szemerédi, and G. Turán, “Two lower bounds for branching programs,” in STOC, 1986.
  [Bibtex]

  @inproceedings{stocAjtaiBHKPRST86,
  author = {Mikl\'os Ajtai and L\'aszl\'o Babai and P\'eter Hajnal and J\'anos Koml\'os and Pavel Pudl\'ak and Vojtech R\"odl and Endre Szemer\'edi and Gy\"orgy Tur\'an},
  title = {Two lower bounds for branching programs},
  booktitle = {STOC},
  year = 1986,
  doi = {https://doi.org/10.1145/12130.12134},
  keywords = {SZTE and Rényi and Hungary and international and theory}
  }

• M. Ajtai, J. Komlós, W. L. Steiger, and E. Szemerédi, “Deterministic Selection in O(log log N) Parallel Time,” in STOC, 1986.
  [Bibtex]

  @inproceedings{stocAjtaiKSS86,
  author = {Mikl\'os Ajtai and J\'anos Koml\'os and William L. Steiger and Endre Szemer\'edi},
  title = {Deterministic Selection in O(log log N) Parallel Time},
  booktitle = {STOC},
  year = 1986,
  doi = {https://doi.org/10.1145/12130.12149},
  keywords = {Rényi and international and theory}
  }

• Z. Galil, R. Kannan, and E. Szemerédi, “On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines,” in STOC, 1986.
  [Bibtex]

  @inproceedings{stocGalilKS86,
  author = {Zvi Galil and Ravi Kannan and Endre Szemer\'edi},
  title = {On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines},
  booktitle = {STOC},
  year = 1986,
  doi = {['https://doi.org/10.1145/12130.12135', 'https://www.wikidata.org/entity/Q130994386']},
  keywords = {Rényi and international and theory}
  }

• I. Bárány and Z. Füredi, “Computing the Volume Is Difficult,” in STOC, 1986.
  [Bibtex]

  @inproceedings{stocBaranyF86,
  author = {Imre B\'ar\'any and Zolt\'an F\"uredi},
  title = {Computing the Volume Is Difficult},
  booktitle = {STOC},
  year = 1986,
  doi = {['https://doi.org/10.1145/12130.12176', 'https://www.wikidata.org/entity/Q56288228']},
  keywords = {Rényi and international and theory}
  }

1985

• A. Frank and É. Tardos, “An Application of Simultaneous Approximation in Combinatorial Optimization,” in FOCS, 1985.
  [Bibtex]

  @inproceedings{focsFrankT85,
  author = {Andr\'as Frank and \'Eva Tardos},
  title = {An Application of Simultaneous Approximation in Combinatorial Optimization},
  booktitle = {FOCS},
  year = 1985,
  doi = {['https://doi.org/10.1109/SFCS.1985.8', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.8']},
  keywords = {ELTE and international and theory}
  }

• K. Friedl and L. Rónyai, “Polynomial Time Solutions of Some Problems in Computational Algebra,” in STOC, 1985.
  [Bibtex]

  @inproceedings{stocFriedlR85,
  author = {Katalin Friedl and Lajos R\'onyai},
  title = {Polynomial Time Solutions of Some Problems in Computational Algebra},
  booktitle = {STOC},
  year = 1985,
  doi = {https://doi.org/10.1145/22145.22162},
  keywords = {BME and all_hungarian and theory}
  }

1984

• L. Babai and E. Szemerédi, “On the Complexity of Matrix Group Problems I,” in FOCS, 1984.
  [Bibtex]

  @inproceedings{focsBabaiS84,
  author = {L\'aszl\'o Babai and Endre Szemer\'edi},
  title = {On the Complexity of Matrix Group Problems I},
  booktitle = {FOCS},
  year = 1984,
  doi = {['https://doi.org/10.1109/SFCS.1984.715919', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715919']},
  keywords = {Rényi and international and theory}
  }

• R. Kannan, A. K. Lenstra, and L. Lovász, “Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers,” in STOC, 1984.
  [Bibtex]

  @inproceedings{stocKannanLL84,
  author = {Ravindran Kannan and Arjen K. Lenstra and L\'aszl\'o Lov\'asz},
  title = {Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers},
  booktitle = {STOC},
  year = 1984,
  doi = {https://doi.org/10.1145/800057.808681},
  keywords = {ELTE and international and theory}
  }

• J. Komlós, “Linear Verification for Spanning Trees,” in FOCS, 1984.
  [Bibtex]

  @inproceedings{focsKomlos84,
  author = {J\'anos Koml\'os},
  title = {Linear Verification for Spanning Trees},
  booktitle = {FOCS},
  year = 1984,
  doi = {['https://doi.org/10.1109/SFCS.1984.715916', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715916']},
  keywords = {Rényi and all_hungarian and theory}
  }

1983

• M. Ajtai, M. L. Fredman, and J. Komlós, “Hash Functions for Priority Queues,” in FOCS, 1983.
  [Bibtex]

  @inproceedings{focsAjtaiFK83,
  author = {Mikl\'os Ajtai and Michael L. Fredman and J\'anos Koml\'os},
  title = {Hash Functions for Priority Queues},
  booktitle = {FOCS},
  year = 1983,
  doi = {['https://doi.org/10.1109/SFCS.1983.24', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.24']},
  keywords = {Rényi and international and theory}
  }

• M. Ajtai, J. Komlós, and E. Szemerédi, “An O(n log n) Sorting Network,” in STOC, 1983.
  [Bibtex]

  @inproceedings{stocAjtaiKS83,
  author = {Mikl\'os Ajtai and J\'anos Koml\'os and Endre Szemer\'edi},
  title = {An O(n log n) Sorting Network},
  booktitle = {STOC},
  year = 1983,
  doi = {['https://doi.org/10.1145/800061.808726', 'https://www.wikidata.org/entity/Q55878855']},
  keywords = {Rényi and mostly_hungarian and theory}
  }

• W. J. Paul, N. Pippenger, E. Szemerédi, and W. T. Trotter, “On Determinism versus Non-Determinism and Related Problems (Preliminary Version),” in FOCS, 1983.
  [Bibtex]

  @inproceedings{focsPaulPST83,
  author = {Wolfgang J. Paul and Nicholas Pippenger and Endre Szemer\'edi and William T. Trotter},
  title = {On Determinism versus Non-Determinism and Related Problems (Preliminary Version)},
  booktitle = {FOCS},
  year = 1983,
  doi = {['https://doi.org/10.1109/SFCS.1983.39', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.39', 'https://www.wikidata.org/entity/Q56387571']},
  keywords = {Rényi and international and theory}
  }

• T. Gergely and K. Vershinin, “Negative Hyper-Resolution for Proving Statements Containing Transitive Relations.,” in IJCAI, 1983.
  [Bibtex]

  @inproceedings{ijcaiGergelyV83,
  author = {Tam\'as Gergely and Konstantin Vershinin},
  title = {Negative Hyper-Resolution for Proving Statements Containing Transitive Relations.},
  booktitle = {IJCAI},
  year = 1983,
  doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/83-2/Papers/066.pdf'}},
  keywords = {Hungary and international and theory}
  }

1982

• M. L. Fredman, J. Komlós, and E. Szemerédi, “Storing a Sparse Table with O(1) Worst Case Access Time,” in FOCS, 1982.
  [Bibtex]

  @inproceedings{focsFredmanKS82,
  author = {Michael L. Fredman and J\'anos Koml\'os and Endre Szemer\'edi},
  title = {Storing a Sparse Table with O(1) Worst Case Access Time},
  booktitle = {FOCS},
  year = 1982,
  doi = {['https://doi.org/10.1109/SFCS.1982.39', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1982.39', 'https://www.wikidata.org/entity/Q63431194']},
  keywords = {Rényi and mostly_hungarian and theory}
  }

• L. Györfi and I. Kerekes, “Analysis of Multiple Access Channel using Multiple Level FSK.,” in EUROCRYPT, 1982.
  [Bibtex]

  @inproceedings{eurocryptGyorfiK82,
  author = {L\'aszl\'o Gy\"orfi and Istv\'an Kerekes},
  title = {Analysis of Multiple Access Channel using Multiple Level FSK.},
  booktitle = {EUROCRYPT},
  year = 1982,
  doi = {https://doi.org/10.1007/3-540-39466-4_10},
  keywords = {BME and international and theory}
  }

1976

• L. J. Guibas and E. Szemerédi, “The Analysis of Double Hashing (Extended Abstract),” in STOC, 1976.
  [Bibtex]

  @inproceedings{stocGuibasS76,
  author = {Leonidas J. Guibas and Endre Szemer\'edi},
  title = {The Analysis of Double Hashing (Extended Abstract)},
  booktitle = {STOC},
  year = 1976,
  doi = {https://doi.org/10.1145/800113.803647},
  keywords = {Rényi and international and theory}
  }

1975

• H. Andréka, T. Gergely, and I. Németi, “On the Role of Mathematical Language Concept in the Theory of Intelligent Systems.,” in IJCAI, 1975.
  [Bibtex]

  @inproceedings{ijcaiAndrekaGN75,
  author = {Hajnal Andr\'eka and Tam\'as Gergely and Istv\'an N\'emeti},
  title = {On the Role of Mathematical Language Concept in the Theory of Intelligent Systems.},
  booktitle = {IJCAI},
  year = 1975,
  doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/75/Papers/002.pdf'}},
  keywords = {Rényi and Hungary and all_hungarian and theory}
  }

• T. Gorgely, H. Andréka, and I. Németi, “Definition Theory as Basis for a Creative Problem Solver.,” in IJCAI, 1975.
  [Bibtex]

  @inproceedings{ijcaiGorgelyAN75,
  author = {T. Gorgely and Hajnal Andr\'eka and Istv\'an N\'emeti},
  title = {Definition Theory as Basis for a Creative Problem Solver.},
  booktitle = {IJCAI},
  year = 1975,
  doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/75/Papers/006a.pdf'}},
  keywords = {Rényi and mostly_hungarian and theory}
  }

About This List

The data comes from the DBLP database, and only includes papers that were:

• Officially published in the conference proceedings
• At least 6 pages long, or 4 pages for SODA, STOC, and FOCS

This page-length filtering helps exclude short papers, work-in-progress submissions, demos, extended abstracts, position papers, and posters, to ensure that only full accepted papers are listed.

Filtering Options

• By author: Only authors with at least 5 papers on the list are displayed
• By affiliation type:
  • all_hungarian – all authors are affiliated with Hungarian institutions
  • mostly_hungarian – at least half of the authors are Hungarian-affiliated
  • international – contains at least one Hungarian-affiliated author
• By institution: e.g. BME, ELTE, Rényi Institute, SZTE, etc.

How the List is Generated

The core of this list is a curated Hungarian researcher spreadsheet that records where each researcher is or was affiliated. If an affiliation includes a year, it is also processed to determine the relevant time interval.

A script uses this data to query DBLP and collect publication metadata. Only papers that meet the page and venue criteria are included in the final BibTeX list displayed here.

Want to Help?

If you’d like to help refine or expand the Hungarian researcher spreadsheet, you can suggest corrections or additions directly in the spreadsheet.
The spreadsheet is currently view-only, but you can leave comments. If you’d like editing access (e.g., for multiple changes), feel free to email me at janos.tapolcai [at] gmail.com.

If you know of a paper that should be on the list but is missing, please send me an email and I’ll investigate why it was missed during the data collection process.

See also this report about the project.