2025
-
S. Döring, D. Marx, and P. Wellnitz, “From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaDoringMW25, author = {Simon D\"oring and D\'aniel Marx and Philip Wellnitz}, title = {From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs.}, booktitle = {SODA}, year = 2025, doi = {https://doi.org/10.1137/1.9781611978322.121}, keywords = {} } -
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} } -
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} } -
A. Bakhtiari, T. Lattimore, and C. Szepesvári, “Thompson Sampling for Bandit Convex Optimisation.,” in COLT, 2025.
[Bibtex]@inproceedings{coltBakhtiariLS25, author = {Alireza Bakhtiari and Tor Lattimore and Csaba Szepesv\'ari}, title = {Thompson Sampling for Bandit Convex Optimisation.}, booktitle = {COLT}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v291/bakhtiari25a.html'}}, keywords = {} } -
S. D. Sarkar, O. Miksik, M. Pollefeys, D. Baráth, and I. Armeni, “CrossOver: 3D Scene Cross-Modal Alignment.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprSarkarMPBA25, author = {Sayan Deb Sarkar and Ondrej Miksik and Marc Pollefeys and D\'aniel Bar\'ath and Iro Armeni}, title = {CrossOver: 3D Scene Cross-Modal Alignment.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Sarkar_CrossOver_3D_Scene_Cross-Modal_Alignment_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00840']}, keywords = {} } -
N. Damblon, M. Pollefeys, and D. Baráth, “Learning to Filter Outlier Edges in Global SfM.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprDamblonPB25, author = {Nicole Damblon and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Learning to Filter Outlier Edges in Global SfM.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Damblon_Learning_to_Filter_Outlier_Edges_in_Global_SfM_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.01079']}, keywords = {} } -
H. Xu, S. Peng, F. Wang, H. Blum, D. Baráth, A. Geiger, and M. Pollefeys, “DepthSplat: Connecting Gaussian Splatting and Depth.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprXuPWBB0P25, author = {Haofei Xu and Songyou Peng and Fangjinhua Wang and Hermann Blum and D\'aniel Bar\'ath and Andreas Geiger and Marc Pollefeys}, title = {DepthSplat: Connecting Gaussian Splatting and Depth.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Xu_DepthSplat_Connecting_Gaussian_Splatting_and_Depth_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.01534']}, keywords = {} } -
C. Tzamos, V. Kocur, Y. Ding, D. Baráth, Z. B. Haladová, T. Sattler, and Z. Kukelova, “Practical Solutions to the Relative Pose of Three Calibrated Cameras.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprTzamosK0BHSK25, author = {Charalambos Tzamos and Viktor Kocur and Yaqing Ding and D\'aniel Bar\'ath and Zuzana Berger Haladov\'a and Torsten Sattler and Zuzana Kukelova}, title = {Practical Solutions to the Relative Pose of Three Calibrated Cameras.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Tzamos_Practical_Solutions_to_the_Relative_Pose_of_Three_Calibrated_Cameras_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.02041']}, keywords = {} } -
P. Sun, B. Guan, Z. Yu, Y. Shang, Q. Yu, and D. Baráth, “Learning Affine Correspondences by Integrating Geometric Constraints.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprSunGYSYB25, author = {Pengju Sun and Banglei Guan and Zhenbao Yu and Yang Shang and Qifeng Yu and D\'aniel Bar\'ath}, title = {Learning Affine Correspondences by Integrating Geometric Constraints.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Sun_Learning_Affine_Correspondences_by_Integrating_Geometric_Constraints_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.02518']}, keywords = {} } -
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} } -
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} } -
J. Zimmert, R. Busa-Fekete, A. György, L. Qiu, H. Choi, T. Sung, H. Shen, S. Subramaniam, and L. Xiao, “A Scalable Crawling Algorithm Utilizing Noisy Change-Indicating Signals.,” in WWW, 2025.
[Bibtex]@inproceedings{wwwZimmertB0QCSSSX25, author = {Julian Zimmert and R\'obert Busa-Fekete and Andr\'as Gy\"orgy and Linhai Qiu and Hyomin Choi and Tzu-Wei Sung and Hao Shen and Sharmila Subramaniam and Li Xiao}, title = {A Scalable Crawling Algorithm Utilizing Noisy Change-Indicating Signals.}, booktitle = {WWW}, year = 2025, doi = {https://doi.org/10.1145/3696410.3714692}, keywords = {} } -
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} } -
K. Bérczi, B. Gehér, A. Imolay, L. Lovász, B. Maga, and T. B. 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 Balazs Maga and Tamas Bence Schwarcz}, title = {Matroid Products via Submodular Coupling.}, booktitle = {STOC}, year = 2025, doi = {https://doi.org/10.1145/3717823.3718152}, keywords = {ELTE and mostly_hungarian and theory} } -
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} } -
A. Björklund, R. Curticapean, T. Husfeldt, P. Kaski, and K. Pratt, “Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaBjorklundCHKP25, author = {Andreas Bj\"orklund and Radu Curticapean and Thore Husfeldt and Petteri Kaski and Kevin Pratt}, title = {Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture.}, booktitle = {SODA}, year = 2025, doi = {https://doi.org/10.1137/1.9781611978322.91}, keywords = {} } -
R. Curticapean and D. Neuen, “Counting Small Induced Subgraphs: Hardness via Fourier Analysis.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaCurticapeanN25, author = {Radu Curticapean and Daniel Neuen}, title = {Counting Small Induced Subgraphs: Hardness via Fourier Analysis.}, booktitle = {SODA}, year = 2025, doi = {https://doi.org/10.1137/1.9781611978322.122}, keywords = {} } -
T. Liao and B. Póczos, “Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrLiaoP25, author = {Tongzhou Liao and Barnab\'as P\'oczos}, title = {Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=rEQqBZIz49'}}, keywords = {} } -
Y. Shen, C. Zhang, S. Fu, C. Zhou, N. Washburn, and B. Póczos, “Chemistry-Inspired Diffusion with Non-Differentiable Guidance.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrShenZFZWP25, author = {Yuchen Shen and Chenhao Zhang and Sijie Fu and Chenghui Zhou and Newell Washburn and Barnab\'as P\'oczos}, title = {Chemistry-Inspired Diffusion with Non-Differentiable Guidance.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=4dAgG8ma3B'}}, keywords = {} } -
F. Bártek, A. Bhayat, R. Coutelier, M. Hajdú, M. Hetzenberger, P. Hozzová, L. Kovács, J. Rath, M. Rawson, G. Reger, M. Suda, J. Schoisswohl, and A. Voronkov, “The Vampire Diary.,” in CAV (3), 2025.
[Bibtex]@inproceedings{cavBartekBCHHHKRRRSSV25, author = {Filip B\'artek and Ahmed Bhayat and Robin Coutelier and M\'arton Hajd\'u and Matthias Hetzenberger and Petra Hozzov\'a and Laura Kov\'acs and Jakob Rath and Michael Rawson and Giles Reger and Martin Suda and Johannes Schoisswohl and Andrei Voronkov}, title = {The Vampire Diary.}, booktitle = {CAV (3)}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-031-98682-6_4'}}, keywords = {} } -
B. Chan, X. Chen, A. György, and D. Schuurmans, “Toward Understanding In-context vs. In-weight Learning.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrChanC0S25, author = {Bryan Chan and Xinyi Chen and Andr\'as Gy\"orgy and Dale Schuurmans}, title = {Toward Understanding In-context vs. In-weight Learning.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=aKJr5NnN8U'}}, keywords = {} } -
A. Lewandowski, M. Bortkiewicz, S. Kumar, A. György, D. Schuurmans, M. Ostaszewski, and M. C. Machado, “Learning Continually by Spectral Regularization.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrLewandowskiB00S25, author = {Alex Lewandowski and Michal Bortkiewicz and Saurabh Kumar and Andr\'as Gy\"orgy and Dale Schuurmans and Mateusz Ostaszewski and Marlos C. Machado}, title = {Learning Continually by Spectral Regularization.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=Hcb2cgPbMg'}}, keywords = {} } -
A. Benechehab, Y. A. E. Hili, A. Odonnat, O. Zekri, A. Thomas, G. Paolo, M. Filippone, I. Redko, and B. Kégl, “Zero-shot Model-based Reinforcement Learning using Large Language Models.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrBenechehabHOZ0P25, author = {Abdelhakim Benechehab and Youssef Attia El Hili and Ambroise Odonnat and Oussama Zekri and Albert Thomas and Giuseppe Paolo and Maurizio Filippone and Ievgen Redko and Bal\'azs K\'egl}, title = {Zero-shot Model-based Reinforcement Learning using Large Language Models.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=uZFXpPrwSh'}}, keywords = {} } -
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} } -
D. X. Lin, D. Hall, G. Fikioris, S. Banerjee, and É. Tardos, “Online Resource Sharing: Better Robust Guarantees via Randomized Strategies.,” in IJCAI, 2025.
[Bibtex]@inproceedings{ijcaiLinHFBT25, author = {David X. Lin and Daniel Hall and Giannis Fikioris and Siddhartha Banerjee and \'Eva Tardos}, title = {Online Resource Sharing: Better Robust Guarantees via Randomized Strategies.}, booktitle = {IJCAI}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2025/21'}}, keywords = {} } -
G. Fikioris, S. Banerjee, and É. Tardos, “Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness.,” in EC, 2025.
[Bibtex]@inproceedings{sigecomFikiorisBT25, author = {Giannis Fikioris and Siddhartha Banerjee and \'Eva Tardos}, title = {Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness.}, booktitle = {EC}, year = 2025, doi = {https://doi.org/10.1145/3736252.3742501}, keywords = {} } -
G. Fikioris, R. Kleinberg, Y. Kolumbus, R. Kumar, Y. Mansour, and É. Tardos, “Learning in Budgeted Auctions with Spacing Objectives.,” in EC, 2025.
[Bibtex]@inproceedings{sigecomFikiorisKKKMT25, author = {Giannis Fikioris and Robert Kleinberg and Yoav Kolumbus and Raunak Kumar and Yishay Mansour and \'Eva Tardos}, title = {Learning in Budgeted Auctions with Spacing Objectives.}, booktitle = {EC}, year = 2025, doi = {https://doi.org/10.1145/3736252.3742512}, keywords = {} } -
D. A. Easley, Y. Kolumbus, and É. Tardos, “Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners.,” in EC, 2025.
[Bibtex]@inproceedings{sigecomEasleyKT25, author = {David A. Easley and Yoav Kolumbus and \'Eva Tardos}, title = {Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners.}, booktitle = {EC}, year = 2025, doi = {https://doi.org/10.1145/3736252.3742595}, keywords = {} } -
A. Moulin, G. Neu, and L. Viano, “Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning.,” in COLT, 2025.
[Bibtex]@inproceedings{coltMoulinNV25, author = {Antoine Moulin and Gergely Neu and Luca Viano}, title = {Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning.}, booktitle = {COLT}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v291/moulin25a.html'}}, keywords = {} } -
L. Gerlach, T. Winkler, E. Ábrahám, B. Bonakdarpour, and S. Junges, “Efficient Probabilistic Model Checking for Relational Reachability.,” in CAV (1), 2025.
[Bibtex]@inproceedings{cavGerlachWABJ25, author = {Lina Gerlach and Tobias Winkler and Erika \'Abrah\'am and Borzoo Bonakdarpour and Sebastian Junges}, title = {Efficient Probabilistic Model Checking for Relational Reachability.}, booktitle = {CAV (1)}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-031-98668-0_6'}}, keywords = {} } -
P. Kobialka, L. Gerlach, F. Leofante, E. Ábrahám, S. L. T. Tarifa, and E. B. Johnsen, “Counterfactual Strategies for Markov Decision Processes.,” in IJCAI, 2025.
[Bibtex]@inproceedings{ijcaiKobialkaGLATJ25, author = {Paul Kobialka and Lina Gerlach and Francesco Leofante and Erika \'Abrah\'am and Silvia Lizeth Tapia Tarifa and Einar Broch Johnsen}, title = {Counterfactual Strategies for Markov Decision Processes.}, booktitle = {IJCAI}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2025/47'}}, keywords = {} } -
P. Antal, T. Peni, and R. Toth, “Hook-Based Aerial Payload Grasping from a Moving Platform.,” in ICRA, 2025.
[Bibtex]@inproceedings{icraAntalPT25, author = {Peter Antal and Tamas Peni and Roland Toth}, 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} } -
E. Bonnet, “Treewidth Inapproximability and Tight ETH Lower Bound.,” in STOC, 2025.
[Bibtex]@inproceedings{stocBonnet25, author = {Edouard Bonnet}, title = {Treewidth Inapproximability and Tight ETH Lower Bound.}, booktitle = {STOC}, year = 2025, doi = {['https://doi.org/10.1145/3717823.3718117', 'https://www.wikidata.org/entity/Q135685346']}, keywords = {} } -
J. Romeo, M. Raglianti, C. Nagy, and M. Lanza, “UML is Back. Or is it? Investigating the Past, Present, and Future of UML in Open Source Software.,” in ICSE, 2025.
[Bibtex]@inproceedings{icseRomeoRNL25, author = {Joseph Romeo and Marco Raglianti and Csaba Nagy and Michele Lanza}, title = {UML is Back. Or is it? Investigating the Past, Present, and Future of UML in Open Source Software.}, booktitle = {ICSE}, year = 2025, doi = {https://doi.org/10.1109/ICSE55347.2025.00155}, keywords = {} } -
K. Kazari, A. Kanellopoulos, and G. Dán, “Quickest Detection of Adversarial Attacks Against Correlated Equilibria.,” in AAAI, 2025.
[Bibtex]@inproceedings{aaaiKazariKD25, author = {Kiarash Kazari and Aris Kanellopoulos and Gy\"orgy D\'an}, title = {Quickest Detection of Adversarial Attacks Against Correlated Equilibria.}, booktitle = {AAAI}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v39i13.33527'}}, keywords = {} } -
M. B. Victorica, G. Dán, and H. Sandberg, “Saliuitl: Ensemble Salience Guided Recovery of Adversarial Patches against CNNs.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprVictoricaDS25, author = {Mauricio Byrd Victorica and Gy\"orgy D\'an and Henrik Sandberg}, title = {Saliuitl: Ensemble Salience Guided Recovery of Adversarial Patches against CNNs.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Victorica_Saliuitl_Ensemble_Salience_Guided_Recovery_of_Adversarial_Patches_against_CNNs_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.01896']}, keywords = {} } -
C. Huang, B. Maneechotesuwan, S. Chopra, and Z. Kira, “FRAMES-VQA: Benchmarking Fine-Tuning Robustness across Multi-Modal Shifts in Visual Question Answering.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprHuangMCK25, author = {Chengyue Huang and Brisa Maneechotesuwan and Shivang Chopra and Zsolt Kira}, title = {FRAMES-VQA: Benchmarking Fine-Tuning Robustness across Multi-Modal Shifts in Visual Question Answering.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Huang_FRAMES-VQA_Benchmarking_Fine-Tuning_Robustness_across_Multi-Modal_Shifts_in_Visual_Question_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00370']}, keywords = {} } -
V. Rathore, S. B, S. Dutta, S. Mehrotra, Z. Kira, and B. Banerjee, “When Domain Generalization meets Generalized Category Discovery: An Adaptive Task-Arithmetic Driven Approach.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprRathoreBDMKB25, author = {Vaibhav Rathore and Shubhranil B and Saikat Dutta and Sarthak Mehrotra and Zsolt Kira and Biplab Banerjee}, title = {When Domain Generalization meets Generalized Category Discovery: An Adaptive Task-Arithmetic Driven Approach.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Rathore_When_Domain_Generalization_meets_Generalized_Category_Discovery_An_Adaptive_Task-Arithmetic_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00462']}, keywords = {} } -
A. Szot, B. Mazoure, O. Attia, A. Timofeev, H. Agrawal, D. R. Hjelm, Z. Gan, Z. Kira, and A. Toshev, “From Multimodal LLMs to Generalist Embodied Agents: Methods and Lessons.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprSzotMATAHGKT25, author = {Andrew Szot and Bogdan Mazoure and Omar Attia and Aleksei Timofeev and Harsh Agrawal and R. Devon Hjelm and Zhe Gan and Zsolt Kira and Alexander Toshev}, title = {From Multimodal LLMs to Generalist Embodied Agents: Methods and Lessons.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Szot_From_Multimodal_LLMs_to_Generalist_Embodied_Agents_Methods_and_Lessons_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00995']}, keywords = {} } -
A. Kumar, Z. Kira, and Y. S. Rawat, “Contextual Self-paced Learning for Weakly Supervised Spatio-Temporal Video Grounding.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclr0016KR25, author = {Akash Kumar and Zsolt Kira and Yogesh S. Rawat}, title = {Contextual Self-paced Learning for Weakly Supervised Spatio-Temporal Video Grounding.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=yHj6EunfVQ'}}, keywords = {} } -
C. Huang, J. Tian, B. Maneechotesuwan, S. Chopra, and Z. Kira, “Directional Gradient Projection for Robust Fine-Tuning of Foundation Models.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrHuangTMCK25, author = {Chengyue Huang and Junjiao Tian and Brisa Maneechotesuwan and Shivang Chopra and Zsolt Kira}, title = {Directional Gradient Projection for Robust Fine-Tuning of Foundation Models.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=goBaGHLAdP'}}, keywords = {} } -
M. Hull, H. Wang, M. Lau, A. Helbling, M. Phute, C. Zhang, Z. Kira, W. T. Lunardi, M. Andreoni, W. Lee, and D. H. Chau, “RenderBender: A Survey on Adversarial Attacks Using Differentiable Rendering.,” in IJCAI, 2025.
[Bibtex]@inproceedings{ijcaiHullWLHPZKLALC25, author = {Matthew Hull and Haoran Wang and Matthew Lau and Alec Helbling and Mansi Phute and Chao Zhang and Zsolt Kira and Willian T. Lunardi and Martin Andreoni and Wenke Lee and Duen Horng Chau}, title = {RenderBender: A Survey on Adversarial Attacks Using Differentiable Rendering.}, booktitle = {IJCAI}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2025/1163'}}, keywords = {} } -
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 = {} } -
Y. Cabon, L. Stoffl, L. Antsfeld, G. Csurka, B. Chidlovskii, J. Revaud, and V. Leroy, “MUSt3R: Multi-view Network for Stereo 3D Reconstruction.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprCabonSACCR025, author = {Yohann Cabon and Lucas Stoffl and Leonid Antsfeld and Gabriela Csurka and Boris Chidlovskii and J\'erôme Revaud and Vincent Leroy}, title = {MUSt3R: Multi-view Network for Stereo 3D Reconstruction.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Cabon_MUSt3R_Multi-view_Network_for_Stereo_3D_Reconstruction_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00106']}, keywords = {} } -
M. Pietrantoni, G. Csurka, and T. Sattler, “Gaussian Splatting Feature Fields for (Privacy-Preserving) Visual Localization.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprPietrantoniCS25, author = {Maxime Pietrantoni and Gabriela Csurka and Torsten Sattler}, title = {Gaussian Splatting Feature Fields for (Privacy-Preserving) Visual Localization.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Pietrantoni_Gaussian_Splatting_Feature_Fields_for_Privacy-Preserving_Visual_Localization_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00109']}, keywords = {} } -
J. Gao, C. Zheng, L. A. Jeni, and Z. Erickson, “DiSRT-In-Bed: Diffusion-Based Sim-to-Real Transfer Framework for In-Bed Human Mesh Recovery.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprGaoZJE25, author = {Jing Gao and Ce Zheng and L\'aszl\'o A. Jeni and Zackory Erickson}, title = {DiSRT-In-Bed: Diffusion-Based Sim-to-Real Transfer Framework for In-Bed Human Mesh Recovery.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Gao_DiSRT-In-Bed_Diffusion-Based_Sim-to-Real_Transfer_Framework_for_In-Bed_Human_Mesh_Recovery_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00177']}, keywords = {} } -
L. Xie, J. Julin, K. Niinuma, and L. A. Jeni, “Gaussian Splatting Lucas-Kanade.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrXieJNJ25, author = {Liuyue Xie and Joel Julin and Koichiro Niinuma and L\'aszl\'o A. Jeni}, title = {Gaussian Splatting Lucas-Kanade.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=dkrEoT68by'}}, keywords = {} } -
S. An, Y. Chang, K. Cho, O. Kwon, M. Lee, E. Oh, and H. Shin, “Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs.,” in AAAI, 2025.
[Bibtex]@inproceedings{aaaiAnCCKL0S25, author = {Shinwoo An and Yeonsu Chang and Kyungjin Cho and O-joung Kwon and Myounghwan Lee and Eunjin Oh and Hyeonjun Shin}, title = {Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs.}, booktitle = {AAAI}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v39i25.34893'}}, keywords = {} } -
J. Ahn, P. J. Gollin, T. Huynh, and O. Kwon, “A coarse Erdős-Pósa theorem.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaAhnGHK25, author = {Jungho Ahn and J. Pascal Gollin and Tony Huynh and O-joung Kwon}, title = {A coarse Erdős-Pósa theorem.}, booktitle = {SODA}, year = 2025, doi = {https://doi.org/10.1137/1.9781611978322.109}, keywords = {} } -
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} } -
J. Garg, Y. Tao, and L. A. Végh, “Approximating Competitive Equilibrium by Nash Welfare.,” in SODA, 2025.
[Bibtex]@inproceedings{sodaGargTV25, author = {Jugal Garg and Yixin Tao and L\'aszl\'o A. V\'egh}, title = {Approximating Competitive Equilibrium by Nash Welfare.}, booktitle = {SODA}, year = 2025, doi = {https://doi.org/10.1137/1.9781611978322.83}, keywords = {} } -
R. Heitjohann, J. von der Heyden, and T. Jager, “Rerandomizable Garbling, Revisited.,” in CRYPTO (4), 2025.
[Bibtex]@inproceedings{cryptoHeitjohannHJ25, author = {Raphael Heitjohann and Jonas von der Heyden and Tibor Jager}, title = {Rerandomizable Garbling, Revisited.}, booktitle = {CRYPTO (4)}, year = 2025, doi = {https://doi.org/10.1007/978-3-032-01884-7_20}, keywords = {} } -
A. Tschand, A. T. R. Rajan, S. Idgunji, A. Ghosh, J. Holleman, C. Király, P. Ambalkar, R. Borkar, R. Chukka, T. Cockrell, O. Curtis, G. Fursin, M. Hodak, H. Kassa, A. Lokhmotov, D. Miskovic, Y. Pan, M. P. Manmathan, L. Raymond, T. S. John, A. Suresh, R. Taubitz, S. Zhan, S. Wasson, D. Kanter, and V. J. Reddi, “MLPerf Power: Benchmarking the Energy Efficiency of Machine Learning Systems from μWatts to MWatts for Sustainable AI.,” in HPCA, 2025.
[Bibtex]@inproceedings{hpcaTschandRIGH0ABC25, author = {Arya Tschand and Arun Tejusve Raghunath Rajan and Sachin Idgunji and Anirban Ghosh and Jeremy Holleman and Csaba Kir\'aly and Pawan Ambalkar and Ritika Borkar and Ramesh Chukka and Trevor Cockrell and Oliver Curtis and Grigori Fursin and Miro Hodak and Hiwot Kassa and Anton Lokhmotov and Dejan Miskovic and Yuechao Pan and Manu Prasad Manmathan and Liz Raymond and Tom St. John and Arjun Suresh and Rowan Taubitz and Sean Zhan and Scott Wasson and David Kanter and Vijay Janapa Reddi}, title = {MLPerf Power: Benchmarking the Energy Efficiency of Machine Learning Systems from μWatts to MWatts for Sustainable AI.}, booktitle = {HPCA}, year = 2025, doi = {https://doi.org/10.1109/HPCA61900.2025.00092}, keywords = {} } -
Z. Zhang, P. Karkus, M. Igl, W. Ding, Y. Chen, B. Ivanovic, and M. Pavone, “Closed-Loop Supervised Fine-Tuning of Tokenized Traffic Models.,” in CVPR, 2025.
[Bibtex]@inproceedings{cvprZhangKID0I025, author = {Zhejun Zhang and P\'eter Karkus and Maximilian Igl and Wenhao Ding and Yuxiao Chen and Boris Ivanovic and Marco Pavone}, title = {Closed-Loop Supervised Fine-Tuning of Tokenized Traffic Models.}, booktitle = {CVPR}, year = 2025, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2025/html/Zhang_Closed-Loop_Supervised_Fine-Tuning_of_Tokenized_Traffic_Models_CVPR_2025_paper.html'}, 'https://doi.org/10.1109/CVPR52734.2025.00510']}, keywords = {} } -
J. Yang, J. Huang, B. Ivanovic, Y. Chen, Y. Wang, B. Li, Y. You, A. Sharma, M. Igl, P. Karkus, D. Xu, Y. Wang, and M. Pavone, “STORM: Spatio-TempOral Reconstruction Model For Large-Scale Outdoor Scenes.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclr0002HI00LYSIKX025, author = {Jiawei Yang and Jiahui Huang and Boris Ivanovic and Yuxiao Chen and Yan Wang and Boyi Li and Yurong You and Apoorva Sharma and Maximilian Igl and P\'eter Karkus and Danfei Xu and Yue Wang and Marco Pavone}, title = {STORM: Spatio-TempOral Reconstruction Model For Large-Scale Outdoor Scenes.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=M2NFWRPMUd'}}, keywords = {} } -
C. Diehl, P. Karkus, S. Veer, M. Pavone, and T. Bertram, “LoRD: Adapting Differentiable Driving Policies to Distribution Shifts.,” in ICRA, 2025.
[Bibtex]@inproceedings{icraDiehlKVPB25, author = {Christopher Diehl and P\'eter Karkus and Sushant Veer and Marco Pavone and Torsten Bertram}, title = {LoRD: Adapting Differentiable Driving Policies to Distribution Shifts.}, booktitle = {ICRA}, year = 2025, doi = {https://doi.org/10.1109/ICRA55743.2025.11128750}, keywords = {} } -
P. Reizinger, S. Guo, F. Huszar, B. Schölkopf, and W. Brendel, “Identifiable Exchangeable Mechanisms for Causal Structure and Representation Learning.,” in ICLR, 2025.
[Bibtex]@inproceedings{iclrReizingerGHSB25, author = {Patrik Reizinger and Siyuan Guo and Ferenc Huszar and Bernhard Sch\"olkopf and Wieland Brendel}, title = {Identifiable Exchangeable Mechanisms for Causal Structure and Representation Learning.}, booktitle = {ICLR}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=k03mB41vyM'}}, keywords = {} } -
D. Pedreschi, L. Pappalardo, E. Ferragina, R. Baeza-Yates, A. Barabási, F. Dignum, V. Dignum, T. Eliassi-Rad, F. Giannotti, J. Kertész, A. Knott, Y. E. Ioannidis, P. Lukowicz, A. Passarella, A. ‘. Pentland, J. Shawe-Taylor, and A. Vespignani, “Human-AI Coevolution (Abstract Reprint).,” in IJCAI, 2025.
[Bibtex]@inproceedings{ijcaiPedreschiPFBBDD25, author = {Dino Pedreschi and Luca Pappalardo and Emanuele Ferragina and Ricardo Baeza-Yates and Albert-L\'aszl\'o Barab\'asi and Frank Dignum and Virginia Dignum and Tina Eliassi-Rad and Fosca Giannotti and J\'anos Kert\'esz and Alistair Knott and Yannis E. Ioannidis and Paul Lukowicz and Andrea Passarella and Alex 'Sandy' Pentland and John Shawe-Taylor and Alessandro Vespignani}, title = {Human-AI Coevolution (Abstract Reprint).}, booktitle = {IJCAI}, year = 2025, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2025/1231'}}, keywords = {} }
2024
-
B. C. Esmer, A. Kulik, D. Marx, D. Neuen, and R. Sharma, “Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.,” in SODA, 2024.
[Bibtex]@inproceedings{sodaEsmerKMNS24, author = {Baris Can Esmer and Ariel Kulik and D\'aniel Marx and Daniel Neuen and Roohani Sharma}, title = {Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.}, booktitle = {SODA}, year = 2024, doi = {https://doi.org/10.1137/1.9781611977912.13}, keywords = {} } -
S. Döring, D. Marx, and P. Wellnitz, “Counting Small Induced Subgraphs with Edge-Monotone Properties.,” in STOC, 2024.
[Bibtex]@inproceedings{stocDoringMW24, author = {Simon D\"oring and D\'aniel Marx and Philip Wellnitz}, title = {Counting Small Induced Subgraphs with Edge-Monotone Properties.}, booktitle = {STOC}, year = 2024, doi = {https://doi.org/10.1145/3618260.3649644}, keywords = {} } -
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} } -
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} } -
J. A. Lin, S. Padhy, J. Antorán, A. Tripp, A. Terenin, C. Szepesvári, J. M. Hernández-Lobato, and D. Janz, “Stochastic Gradient Descent for Gaussian Processes Done Right.,” in ICLR, 2024.
[Bibtex]@inproceedings{iclrLinPATTSHJ24, author = {Jihao Andreas Lin and Shreyas Padhy and Javier Antor\'an and Austin Tripp and Alexander Terenin and Csaba Szepesv\'ari and Jos\'e Miguel Hern\'andez-Lobato and David Janz}, title = {Stochastic Gradient Descent for Gaussian Processes Done Right.}, booktitle = {ICLR}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=fj2E5OcLFn'}}, keywords = {} } -
A. Ayoub, K. Wang, V. Liu, S. Robertson, J. McInerney, D. Liang, N. Kallus, and C. Szepesvári, “Switching the Loss Reduces the Cost in Batch Reinforcement Learning.,” in ICML, 2024.
[Bibtex]@inproceedings{icmlAyoubWLRMLKS24, author = {Alex Ayoub and Kaiwen Wang and Vincent Liu and Samuel Robertson and James McInerney and Dawen Liang and Nathan Kallus and Csaba Szepesv\'ari}, title = {Switching the Loss Reduces the Cost in Batch Reinforcement Learning.}, booktitle = {ICML}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=7PXSc5fURu'}}, keywords = {} } -
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} } -
S. Jin, I. Armeni, M. Pollefeys, and D. Baráth, “Multiway Point Cloud Mosaicking with Diffusion and Global Optimization.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprJinAPB24, author = {Shengze Jin and Iro Armeni and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Multiway Point Cloud Mosaicking with Diffusion and Global Optimization.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01969}, keywords = {} } -
J. Ventura, Z. Kukelova, T. Sattler, and D. Baráth, “Absolute Pose from One or Two Scaled and Oriented Features.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprVenturaKSB24, author = {Jonathan Ventura and Zuzana Kukelova and Torsten Sattler and D\'aniel Bar\'ath}, title = {Absolute Pose from One or Two Scaled and Oriented Features.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01972}, keywords = {} } -
S. Wang, J. Kannala, and D. Baráth, “DGC-GNN: Leveraging Geometry and Color Cues for Visual Descriptor-Free 2D-3D Matching.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprWangKB24, author = {Shuzhe Wang and Juho Kannala and D\'aniel Bar\'ath}, title = {DGC-GNN: Leveraging Geometry and Color Cues for Visual Descriptor-Free 2D-3D Matching.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01973}, keywords = {} } -
P. Hruby, M. Pollefeys, and D. Baráth, “Semicalibrated Relative Pose from an Affine Correspondence and Monodepth.,” in ECCV (40), 2024.
[Bibtex]@inproceedings{eccvHrubyPB24, author = {Petr Hruby and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Semicalibrated Relative Pose from an Affine Correspondence and Monodepth.}, booktitle = {ECCV (40)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73661-2_3}, keywords = {} } -
L. Pan, D. Baráth, M. Pollefeys, and J. L. Schönberger, “Global Structure-from-Motion Revisited.,” in ECCV (40), 2024.
[Bibtex]@inproceedings{eccvPanBPS24, author = {Linfei Pan and D\'aniel Bar\'ath and Marc Pollefeys and Johannes L. Sch\"onberger}, title = {Global Structure-from-Motion Revisited.}, booktitle = {ECCV (40)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73661-2_4}, keywords = {} } -
L. Pan, M. Pollefeys, and D. Baráth, “Gravity-Aligned Rotation Averaging with Circular Regression.,” in ECCV (40), 2024.
[Bibtex]@inproceedings{eccvPanPB24, author = {Linfei Pan and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Gravity-Aligned Rotation Averaging with Circular Regression.}, booktitle = {ECCV (40)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73661-2_6}, keywords = {} } -
Y. Miao, F. Engelmann, O. Vysotska, F. Tombari, M. Pollefeys, and D. Baráth, “SceneGraphLoc: Cross-Modal Coarse Visual Localization on 3D Scene Graphs.,” in ECCV (8), 2024.
[Bibtex]@inproceedings{eccvMiaoEVTPB24, author = {Yang Miao and Francis Engelmann and Olga Vysotska and Federico Tombari and Marc Pollefeys and D\'aniel Bar\'ath}, title = {SceneGraphLoc: Cross-Modal Coarse Visual Localization on 3D Scene Graphs.}, booktitle = {ECCV (8)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73242-3_8}, keywords = {} } -
L. D. Giammarino, B. Sun, G. Grisetti, M. Pollefeys, H. Blum, and D. Baráth, “Learning Where to Look: Self-supervised Viewpoint Selection for Active Localization Using Geometrical Information.,” in ECCV (86), 2024.
[Bibtex]@inproceedings{eccvGiammarinoSGPBB24, author = {Luca Di Giammarino and Boyang Sun and Giorgio Grisetti and Marc Pollefeys and Hermann Blum and D\'aniel Bar\'ath}, title = {Learning Where to Look: Self-supervised Viewpoint Selection for Active Localization Using Geometrical Information.}, booktitle = {ECCV (86)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73016-0_12}, keywords = {} } -
J. Chen, D. Baráth, I. Armeni, M. Pollefeys, and H. Blum, “"Where am I?" Scene Retrieval with Language.,” in ECCV (37), 2024.
[Bibtex]@inproceedings{eccvChenBAPB24, author = {Jiaqi Chen and D\'aniel Bar\'ath and Iro Armeni and Marc Pollefeys and Hermann Blum}, title = {"Where am I?" Scene Retrieval with Language.}, booktitle = {ECCV (37)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-72913-3_12}, keywords = {} } -
J. Zheng, D. Baráth, M. Pollefeys, and I. Armeni, “MAP-ADAPT: Real-Time Quality-Adaptive Semantic 3D Maps.,” in ECCV (39), 2024.
[Bibtex]@inproceedings{eccvZhengBPA24, author = {Jianhao Zheng and D\'aniel Bar\'ath and Marc Pollefeys and Iro Armeni}, title = {MAP-ADAPT: Real-Time Quality-Adaptive Semantic 3D Maps.}, booktitle = {ECCV (39)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-72933-1_13}, keywords = {} } -
S. Kim, M. Pollefeys, and D. Baráth, “Learning to Make Keypoints Sub-pixel Accurate.,” in ECCV (78), 2024.
[Bibtex]@inproceedings{eccvKimPB24, author = {Shinjeong Kim and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Learning to Make Keypoints Sub-pixel Accurate.}, booktitle = {ECCV (78)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73229-4_24}, keywords = {} } -
D. Baráth, D. Mishkin, L. Cavalli, P. Sarlin, P. Hruby, and M. Pollefeys, “StereoGlue: Robust Estimation with Single-Point Solvers.,” in ECCV (57), 2024.
[Bibtex]@inproceedings{eccvBarathMCSHP24, author = {D\'aniel Bar\'ath and Dmytro Mishkin and Luca Cavalli and Paul-Edouard Sarlin and Petr Hruby and Marc Pollefeys}, title = {StereoGlue: Robust Estimation with Single-Point Solvers.}, booktitle = {ECCV (57)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-72998-0_24}, keywords = {} } -
O. Ilter, I. Armeni, M. Pollefeys, and D. Baráth, “Semantically Guided Feature Matching for Visual SLAM.,” in ICRA, 2024.
[Bibtex]@inproceedings{icraIlterAPB24, author = {Oguzhan Ilter and Iro Armeni and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Semantically Guided Feature Matching for Visual SLAM.}, booktitle = {ICRA}, year = 2024, doi = {https://doi.org/10.1109/ICRA57147.2024.10610238}, keywords = {} } -
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} } -
M. Benedek, P. Biró, G. Kál. Csáji, M. Johnson, D. Paulusma, and X. Ye, “Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded.,” in AAMAS, 2024.
[Bibtex]@inproceedings{atalBenedek0C0PY24, author = {M\'arton Benedek and P\'eter Bir\'o and Gergely K\'al Cs\'aji and Matthew Johnson and Daniël Paulusma and Xin Ye}, title = {Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded.}, booktitle = {AAMAS}, year = 2024, doi = {https://dl.acm.org/doi/10.5555/3635637.3663091}, keywords = {Corvinus and Hungary and ELTE and international and theory} } -
R. Curticapean, “Count on CFI graphs for #P-hardness.,” in SODA, 2024.
[Bibtex]@inproceedings{sodaCurticapean24, author = {Radu Curticapean}, title = {Count on CFI graphs for #P-hardness.}, booktitle = {SODA}, year = 2024, doi = {https://doi.org/10.1137/1.9781611977912.74}, keywords = {} } -
H. Le, S. Solomon, C. Than, C. D. Tóth, and T. Zhang, “Towards Instance-Optimal Euclidean Spanners.,” in FOCS, 2024.
[Bibtex]@inproceedings{focs0001STTZ24, author = {Hung Le and Shay Solomon and Cuong Than and Csaba D. T\'oth and Tianyi Zhang}, title = {Towards Instance-Optimal Euclidean Spanners.}, booktitle = {FOCS}, year = 2024, doi = {https://doi.org/10.1109/FOCS61266.2024.00099}, keywords = {} } -
S. Bhore, A. Filtser, and C. D. Tóth, “Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings.,” in SODA, 2024.
[Bibtex]@inproceedings{sodaBhoreFT24, author = {Sujoy Bhore and Arnold Filtser and Csaba D. T\'oth}, title = {Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings.}, booktitle = {SODA}, year = 2024, doi = {https://doi.org/10.1137/1.9781611977912.162}, keywords = {} } -
G. Kál. 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 K\'al 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. Kál. 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 K\'al 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. Kál. 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 K\'al 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. Kál. Csáji, “Popular and Dominant Matchings with Uncertain and Multimodal Preferences.,” in IJCAI, 2024.
[Bibtex]@inproceedings{ijcaiCsaji24, author = {Gergely K\'al 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} } -
S. Jeanteur, L. Kovács, M. Maffei, and M. Rawson, “CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model.,” in SP, 2024.
[Bibtex]@inproceedings{spJeanteurKMR24, author = {Simon Jeanteur and Laura Kov\'acs and Matteo Maffei and Michael Rawson}, title = {CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model.}, booktitle = {SP}, year = 2024, doi = {https://doi.org/10.1109/SP54263.2024.00246}, keywords = {} } -
K. Bérczi, B. Mátravölgyi, and T. B. 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 Tamas Bence 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} } -
I. Gemp, M. Lanctot, L. Marris, Y. Mao, E. A. Duéñez-Guzmán, S. Perrin, A. György, R. Elie, G. Piliouras, M. Kaisers, D. Hennes, K. Bullard, K. Larson, and Y. Bachrach, “Approximating the Core via Iterative Coalition Sampling.,” in AAMAS, 2024.
[Bibtex]@inproceedings{atalGempLMMDPGEPKHB24, author = {Ian Gemp and Marc Lanctot and Luke Marris and Yiran Mao and Edgar A. Du\'eñez-Guzm\'an and Sarah Perrin and Andr\'as Gy\"orgy and Romuald Elie and Georgios Piliouras and Michael Kaisers and Daniel Hennes and Kalesha Bullard and Kate Larson and Yoram Bachrach}, title = {Approximating the Core via Iterative Coalition Sampling.}, booktitle = {AAMAS}, year = 2024, doi = {https://dl.acm.org/doi/10.5555/3635637.3662919}, keywords = {} } -
G. Paolo, J. Gonzalez-Billandon, and B. Kégl, “Position: A Call for Embodied AI.,” in ICML, 2024.
[Bibtex]@inproceedings{icmlPaoloGK24, author = {Giuseppe Paolo and Jonas Gonzalez-Billandon and Bal\'azs K\'egl}, title = {Position: A Call for Embodied AI.}, booktitle = {ICML}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=e5admkWKgV'}}, keywords = {} } -
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} } -
J. M. Kleinberg, S. Oren, E. Ryu, and É. Tardos, “Modeling reputation-based behavioral biases in school choice.,” in EC, 2024.
[Bibtex]@inproceedings{sigecomKleinbergORT24, author = {Jon M. Kleinberg and Sigal Oren and Emily Ryu and \'Eva Tardos}, title = {Modeling reputation-based behavioral biases in school choice.}, booktitle = {EC}, year = 2024, doi = {https://doi.org/10.1145/3670865.3673609}, keywords = {} } -
G. Neu, M. Papini, and L. Schwartz, “Optimistic Information Directed Sampling.,” in COLT, 2024.
[Bibtex]@inproceedings{coltNeuPS24, author = {Gergely Neu and Matteo Papini and Ludovic Schwartz}, title = {Optimistic Information Directed Sampling.}, booktitle = {COLT}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v247/neu24a.html'}}, keywords = {} } -
G. Neu and N. Okolo, “Dealing With Unbounded Gradients in Stochastic Saddle-point Optimization.,” in ICML, 2024.
[Bibtex]@inproceedings{icmlNeuO24, author = {Gergely Neu and Nneka Okolo}, title = {Dealing With Unbounded Gradients in Stochastic Saddle-point Optimization.}, booktitle = {ICML}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=RPMTNGMq0O'}}, keywords = {} } -
E. Bonnet, R. Bourneuf, C. Geniet, and S. Thomassé, “Factoring Pattern-Free Permutations into Separable ones.,” in SODA, 2024.
[Bibtex]@inproceedings{sodaBonnetBGT24, author = {Edouard Bonnet and Romain Bourneuf and Colin Geniet and St\'ephan Thomass\'e}, title = {Factoring Pattern-Free Permutations into Separable ones.}, booktitle = {SODA}, year = 2024, doi = {https://doi.org/10.1137/1.9781611977912.30}, keywords = {} } -
E. Bonnet, J. Duron, J. Sylvester, V. Zamaraev, and M. Zhukovskii, “Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.,” in SODA, 2024.
[Bibtex]@inproceedings{sodaBonnetDSZZ24, author = {Edouard Bonnet and Julien Duron and John Sylvester and Viktor Zamaraev and Maksim Zhukovskii}, title = {Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.}, booktitle = {SODA}, year = 2024, doi = {https://doi.org/10.1137/1.9781611977912.44}, keywords = {} } -
J. Tian, L. Aggarwal, A. Colaco, Z. Kira, and M. González-Franco, “Diffuse, Attend, and Segment: Unsupervised Zero-Shot Segmentation using Stable Diffusion.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprTianACKG24, author = {Junjiao Tian and Lavisha Aggarwal and Andrea Colaco and Zsolt Kira and Mar Gonz\'alez-Franco}, title = {Diffuse, Attend, and Segment: Unsupervised Zero-Shot Segmentation using Stable Diffusion.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.00341}, keywords = {} } -
R. Ramrakhya, A. Kembhavi, D. Batra, Z. Kira, K. Zeng, and L. Weihs, “Seeing the Unseen: Visual Common Sense for Semantic Placement.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprRamrakhyaKBKZW24, author = {Ram Ramrakhya and Aniruddha Kembhavi and Dhruv Batra and Zsolt Kira and Kuo-Hao Zeng and Luca Weihs}, title = {Seeing the Unseen: Visual Common Sense for Semantic Placement.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01540}, keywords = {} } -
M. Khanna, R. Ramrakhya, G. Chhablani, S. Yenamandra, T. Gervet, M. Chang, Z. Kira, D. S. Chaplot, D. Batra, and R. Mottaghi, “GOAT-Bench: A Benchmark for Multi-Modal Lifelong Navigation.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprKhannaRCYGCKCBM24, author = {Mukul Khanna and Ram Ramrakhya and Gunjan Chhablani and Sriram Yenamandra and Th\'eophile Gervet and Matthew Chang and Zsolt Kira and Devendra Singh Chaplot and Dhruv Batra and Roozbeh Mottaghi}, title = {GOAT-Bench: A Benchmark for Multi-Modal Lifelong Navigation.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01549}, keywords = {} } -
A. N. Harish, L. Heck, J. P. Hanna, Z. Kira, and A. Szot, “Reinforcement Learning via Auxiliary Task Distillation.,” in ECCV (81), 2024.
[Bibtex]@inproceedings{eccvHarishHHKS24, author = {Abhinav Narayan Harish and Larry Heck and Josiah P. Hanna and Zsolt Kira and Andrew Szot}, title = {Reinforcement Learning via Auxiliary Task Distillation.}, booktitle = {ECCV (81)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73004-7_13}, keywords = {} } -
M. Z. Irshad, S. Zakharov, V. Guizilini, A. Gaidon, Z. Kira, and R. Ambrus, “NeRF-MAE: Masked AutoEncoders for Self-supervised 3D Representation Learning for Neural Radiance Fields.,” in ECCV (88), 2024.
[Bibtex]@inproceedings{eccvIrshadZGGKA24, author = {Muhammad Zubair Irshad and Sergey Zakharov and Vitor Guizilini and Adrien Gaidon and Zsolt Kira and Rares Ambrus}, title = {NeRF-MAE: Masked AutoEncoders for Self-supervised 3D Representation Learning for Neural Radiance Fields.}, booktitle = {ECCV (88)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73223-2_24}, keywords = {} } -
X. Puig, E. Undersander, A. Szot, M. D. Cote, T. Yang, R. Partsey, R. Desai, A. Clegg, M. Hlavac, S. Y. Min, V. Vondrus, T. Gervet, V. Berges, J. M. Turner, O. Maksymets, Z. Kira, M. Kalakrishnan, J. Malik, D. S. Chaplot, U. Jain, D. Batra, A. Rai, and R. Mottaghi, “Habitat 3.0: A Co-Habitat for Humans, Avatars, and Robots.,” in ICLR, 2024.
[Bibtex]@inproceedings{iclrPuigUSCYPDCHMVG24, author = {Xavier Puig and Eric Undersander and Andrew Szot and Mikael Dallaire Cote and Tsung-Yen Yang and Ruslan Partsey and Ruta Desai and Alexander Clegg and Michal Hlavac and So Yeon Min and Vladimir Vondrus and Th\'eophile Gervet and Vincent-Pierre Berges and John M. Turner and Oleksandr Maksymets and Zsolt Kira and Mrinal Kalakrishnan and Jitendra Malik and Devendra Singh Chaplot and Unnat Jain and Dhruv Batra and Akshara Rai and Roozbeh Mottaghi}, title = {Habitat 3.0: A Co-Habitat for Humans, Avatars, and Robots.}, booktitle = {ICLR}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=4znwzG92CE'}}, keywords = {} } -
M. Lunayach, S. Zakharov, D. Chen, R. Ambrus, Z. Kira, and M. Z. Irshad, “FSD: Fast Self-Supervised Single RGB-D to Categorical 3D Objects.,” in ICRA, 2024.
[Bibtex]@inproceedings{icraLunayachZ0AKI24, author = {Mayank Lunayach and Sergey Zakharov and Dian Chen and Rares Ambrus and Zsolt Kira and Muhammad Zubair Irshad}, title = {FSD: Fast Self-Supervised Single RGB-D to Categorical 3D Objects.}, booktitle = {ICRA}, year = 2024, doi = {https://doi.org/10.1109/ICRA57147.2024.10611012}, keywords = {} } -
N. M. Glaser, R. Ravi, and Z. Kira, “N-QR: Natural Quick Response Codes for Multi-Robot Instance Correspondence.,” in ICRA, 2024.
[Bibtex]@inproceedings{icraGlaserRK24, author = {Nathaniel Moore Glaser and Rajashree Ravi and Zsolt Kira}, title = {N-QR: Natural Quick Response Codes for Multi-Robot Instance Correspondence.}, booktitle = {ICRA}, year = 2024, doi = {https://doi.org/10.1109/ICRA57147.2024.10611236}, keywords = {} } -
E. Cohen, X. Lyu, J. Nelson, T. Sarlós, and U. Stemmer, “Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries.,” in COLT, 2024.
[Bibtex]@inproceedings{coltCohen0NSS24, author = {Edith Cohen and Xin Lyu and Jelani Nelson and Tam\'as Sarl\'os and Uri Stemmer}, title = {Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries.}, booktitle = {COLT}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v247/cohen24b.html'}}, keywords = {} } -
I. Leal, K. Choromanski, D. Jain, A. Dubey, J. Varley, M. S. Ryoo, Y. Lu, F. Liu, V. Sindhwani, Q. Vuong, T. Sarlós, K. Oslund, K. Hausman, and K. Rao, “SARA-RT: Scaling up Robotics Transformers with Self-Adaptive Robust Attention.,” in ICRA, 2024.
[Bibtex]@inproceedings{icraLealCJDVR0LSVSO24, author = {Isabel Leal and Krzysztof Choromanski and Deepali Jain and Avinava Dubey and Jake Varley and Michael S. Ryoo and Yao Lu and Frederick Liu and Vikas Sindhwani and Quan Vuong and Tam\'as Sarl\'os and Ken Oslund and Karol Hausman and Kanishka Rao}, title = {SARA-RT: Scaling up Robotics Transformers with Self-Adaptive Robust Attention.}, booktitle = {ICRA}, year = 2024, doi = {https://doi.org/10.1109/ICRA57147.2024.10611597}, keywords = {} } -
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 = {} } -
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 = {} } -
M. Liu, T. L. Hayes, E. Ricci, G. Csurka, and R. Volpi, “SHiNe: Semantic Hierarchy Nexus for Open-Vocabulary Object Detection.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprLiuH0CV24, author = {Mingxuan Liu and Tyler L. Hayes and Elisa Ricci and Gabriela Csurka and Riccardo Volpi}, title = {SHiNe: Semantic Hierarchy Nexus for Open-Vocabulary Object Detection.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01574}, keywords = {} } -
Y. Kalantidis, M. B. Sariyildiz, R. S. Rezende, P. Weinzaepfel, D. Larlus, and G. Csurka, “Weatherproofing Retrieval for Localization with Generative AI and Geometric Consistency.,” in ICLR, 2024.
[Bibtex]@inproceedings{iclrKalantidisSRWLC24, author = {Yannis Kalantidis and Mert B\"ulent Sariyildiz and Rafael S. Rezende and Philippe Weinzaepfel and Diane Larlus and Gabriela Csurka}, title = {Weatherproofing Retrieval for Localization with Generative AI and Geometric Consistency.}, booktitle = {ICLR}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=5EniAcsO7f'}}, keywords = {} } -
M. Dabhi, L. A. Jeni, and S. Lucey, “3D-LFM: Lifting Foundation Model.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprDabhiJL24, author = {Mosam Dabhi and L\'aszl\'o A. Jeni and Simon Lucey}, title = {3D-LFM: Lifting Foundation Model.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.00996}, keywords = {} } -
H. Yu, J. Julin, Z. Ádám. Milacski, K. Niinuma, and L. A. Jeni, “CoGS: Controllable Gaussian Splatting.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprYuJMNJ24, author = {Heng Yu and Joel Julin and Zolt\'an \'Ad\'am Milacski and Koichiro Niinuma and L\'aszl\'o A. Jeni}, title = {CoGS: Controllable Gaussian Splatting.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.02043}, keywords = {} } -
R. Choudhury, K. Niinuma, K. M. Kitani, and L. A. Jeni, “Video Question Answering with Procedural Programs.,” in ECCV (38), 2024.
[Bibtex]@inproceedings{eccvChoudhuryNKJ24, author = {Rohan Choudhury and Koichiro Niinuma and Kris M. Kitani and L\'aszl\'o A. Jeni}, title = {Video Question Answering with Procedural Programs.}, booktitle = {ECCV (38)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-72920-1_18}, keywords = {} } -
H. Yang, M. S. Steinbach, G. B. Melton, V. Kumar, and G. J. Simon, “Combining Self-Supervision and Privileged Information for Representation Learning from Tabular Data.,” in ICDM, 2024.
[Bibtex]@inproceedings{icdmYangSM0S24, author = {Haoyu Yang and Michael S. Steinbach and Genevieve B. Melton and Vipin Kumar and Gy\"orgy J. Simon}, title = {Combining Self-Supervision and Privileged Information for Representation Learning from Tabular Data.}, booktitle = {ICDM}, year = 2024, doi = {https://doi.org/10.1109/ICDM59182.2024.00062}, keywords = {} } -
M. Madhyastha, T. Budavari, V. Braverman, J. T. Vogelstein, and R. C. Burns, “T-Rex (Tree-Rectangles): Reformulating Decision Tree Traversal as Hyperrectangle Enclosure.,” in ICDE, 2024.
[Bibtex]@inproceedings{icdeMadhyasthaBBVB24, author = {Meghana Madhyastha and Tamas Budavari and Vladimir Braverman and Joshua T. Vogelstein and Randal C. Burns}, title = {T-Rex (Tree-Rectangles): Reformulating Decision Tree Traversal as Hyperrectangle Enclosure.}, booktitle = {ICDE}, year = 2024, doi = {https://doi.org/10.1109/ICDE60146.2024.00145}, keywords = {} } -
D. Dadush, Z. K. Koh, B. Natura, N. Olver, and L. A. Végh, “A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column.,” in STOC, 2024.
[Bibtex]@inproceedings{stocDadushKNOV24, author = {Daniel Dadush and Zhuan Khye Koh and Bento Natura and Neil Olver and L\'aszl\'o A. V\'egh}, title = {A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column.}, booktitle = {STOC}, year = 2024, doi = {['https://doi.org/10.1145/3618260.3649764', 'https://www.wikidata.org/entity/Q130916031']}, keywords = {} } -
D. Eringis, J. Leth, Z. Tan, R. Wisniewski, and M. Petreczky, “PAC-Bayes Generalisation Bounds for Dynamical Systems including Stable RNNs.,” in AAAI, 2024.
[Bibtex]@inproceedings{aaaiEringisLTWP24, author = {Deividas Eringis and John Leth and Zheng-Hua Tan and Rafael Wisniewski and Mih\'aly Petreczky}, title = {PAC-Bayes Generalisation Bounds for Dynamical Systems including Stable RNNs.}, booktitle = {AAAI}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v38i11.29076'}}, keywords = {} } -
D. Eringis, J. Leth, Z. Tan, R. Wisniewski, and M. Petreczky, “PAC-Bayesian Error Bound, via Rényi Divergence, for a Class of Linear Time-Invariant State-Space Models.,” in ICML, 2024.
[Bibtex]@inproceedings{icmlEringisLTWP24, author = {Deividas Eringis and John Leth and Zheng-Hua Tan and Rafal Wisniewski and Mih\'aly Petreczky}, title = {PAC-Bayesian Error Bound, via Rényi Divergence, for a Class of Linear Time-Invariant State-Space Models.}, booktitle = {ICML}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=a1Olc2QhPv'}}, keywords = {} } -
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} } -
D. Distefano, M. Marescotti, C. Åhs, S. Cela, G. C. Sampaio, R. Grigore, Á. Hajdu, T. Kapus, K. Mao, and T. Suzanne, “Enhancing Compositional Static Analysis with Dynamic Analysis.,” in ASE, 2024.
[Bibtex]@inproceedings{kbseDistefanoMACSGH24, author = {Dino Distefano and Matteo Marescotti and Cons Åhs and Sopot Cela and Gabriela Cunha Sampaio and Radu Grigore and \'Akos Hajdu and Timotej Kapus and Ke Mao and Thibault Suzanne}, title = {Enhancing Compositional Static Analysis with Dynamic Analysis.}, booktitle = {ASE}, year = 2024, doi = {https://doi.org/10.1145/3691620.3695599}, keywords = {} } -
M. Oldenhof, E. D. Brouwer, A. Arany, and Y. Moreau, “Atom-Level Optical Chemical Structure Recognition with Limited Supervision.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprOldenhofBAM24, author = {Martijn Oldenhof and Edward De Brouwer and Adam Arany and Yves Moreau}, title = {Atom-Level Optical Chemical Structure Recognition with Limited Supervision.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01673}, keywords = {} } -
A. Biere, T. Faller, K. Fazekas, M. Fleury, N. Froleyks, and F. Pollitt, “CaDiCaL 2.0.,” in CAV (1), 2024.
[Bibtex]@inproceedings{cavBiereFFFFP24, author = {Armin Biere and Tobias Faller and Katalin Fazekas and Mathias Fleury and Nils Froleyks and Florian Pollitt}, title = {CaDiCaL 2.0.}, booktitle = {CAV (1)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-65627-9_7}, keywords = {} } -
C. Györgyi, K. G. Larsen, S. Schmid, and J. Srba, “SyPer: Synthesis of Perfectly Resilient Local Fast Re-Routing Rules for Highly Dependable Networks.,” in INFOCOM, 2024.
[Bibtex]@inproceedings{infocomGyorgyiL0S24, author = {Csaba Gy\"orgyi and Kim G. Larsen and Stefan Schmid and Jir\'i Srba}, title = {SyPer: Synthesis of Perfectly Resilient Local Fast Re-Routing Rules for Highly Dependable Networks.}, booktitle = {INFOCOM}, year = 2024, doi = {https://doi.org/10.1109/INFOCOM52122.2024.10621323}, keywords = {} } -
Z. Huang, P. Karkus, B. Ivanovic, Y. Chen, M. Pavone, and C. Lv, “DTPP: Differentiable Joint Conditional Prediction and Cost Evaluation for Tree Policy Planning in Autonomous Driving.,” in ICRA, 2024.
[Bibtex]@inproceedings{icraHuangKI00L24, author = {Zhiyu Huang and P\'eter Karkus and Boris Ivanovic and Yuxiao Chen and Marco Pavone and Chen Lv}, title = {DTPP: Differentiable Joint Conditional Prediction and Cost Evaluation for Tree Policy Planning in Autonomous Driving.}, booktitle = {ICRA}, year = 2024, doi = {https://doi.org/10.1109/ICRA57147.2024.10610550}, keywords = {} } -
S. H. Chan, H. K. Weerasooriya, W. Zhang, P. Abshire, I. Gyöngy, and R. K. Henderson, “Resolution Limit of Single-Photon LiDAR.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprChanWZAGH24, author = {Stanley H. Chan and Hashan K. Weerasooriya and Weijian Zhang and Pamela Abshire and Istv\'an Gy\"ongy and Robert K. Henderson}, title = {Resolution Limit of Single-Photon LiDAR.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.02391}, keywords = {} } -
P. Chennuri, Y. Chi, E. Jiang, D. G. M. Godaliyadda, A. Gnanasambandam, H. R. Sheikh, I. Gyöngy, and S. H. Chan, “Quanta Video Restoration.,” in ECCV (40), 2024.
[Bibtex]@inproceedings{eccvChennuriCJGGSGC24, author = {Prateek Chennuri and Yiheng Chi and Enze Jiang and G. M. Dilshan Godaliyadda and Abhiram Gnanasambandam and Hamid R. Sheikh and Istv\'an Gy\"ongy and Stanley H. Chan}, title = {Quanta Video Restoration.}, booktitle = {ECCV (40)}, year = 2024, doi = {https://doi.org/10.1007/978-3-031-73661-2_9}, keywords = {} } -
X. Huang, G. Sóti, C. Ledermann, B. Hein, and T. Kröger, “Planning with Learned Subgoals Selected by Temporal Information.,” in ICRA, 2024.
[Bibtex]@inproceedings{icraHuangSLHK24, author = {Xi Huang and Gergely S\'oti and Christoph Ledermann and Bj\"orn Hein and Torsten Kr\"oger}, title = {Planning with Learned Subgoals Selected by Temporal Information.}, booktitle = {ICRA}, year = 2024, doi = {https://doi.org/10.1109/ICRA57147.2024.10610538}, keywords = {} } -
G. Sóti, X. Huang, C. Wurll, and B. Hein, “6-DoF Grasp Pose Evaluation and Optimization via Transfer Learning from NeRFs.,” in ICRA, 2024.
[Bibtex]@inproceedings{icraSotiHWH24, author = {Gergely S\'oti and Xi Huang and Christian Wurll and Bj\"orn Hein}, title = {6-DoF Grasp Pose Evaluation and Optimization via Transfer Learning from NeRFs.}, booktitle = {ICRA}, year = 2024, doi = {https://doi.org/10.1109/ICRA57147.2024.10610402}, keywords = {} } -
R. Lee, J. Fernández-Marqués, S. X. Hu, D. Li, S. Laskaridis, L. Dudziak, T. M. Hospedales, F. Huszar, and N. D. Lane, “Recurrent Early Exits for Federated Learning with Heterogeneous Clients.,” in ICML, 2024.
[Bibtex]@inproceedings{icmlLeeFH0LDHHL24, author = {Royson Lee and Javier Fern\'andez-Marqu\'es and Shell Xu Hu and Da Li and Stefanos Laskaridis and Lukasz Dudziak and Timothy M. Hospedales and Ferenc Huszar and Nicholas Donald Lane}, title = {Recurrent Early Exits for Federated Learning with Heterogeneous Clients.}, booktitle = {ICML}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=w4B42sxNq3'}}, keywords = {} } -
P. Reizinger, S. Ujváry, A. Mészáros, A. Kerekes, W. Brendel, and F. Huszar, “Position: Understanding LLMs Requires More Than Statistical Generalization.,” in ICML, 2024.
[Bibtex]@inproceedings{icmlReizingerUMKBH24, author = {Patrik Reizinger and Szilvia Ujv\'ary and Anna M\'esz\'aros and Anna Kerekes and Wieland Brendel and Ferenc Huszar}, title = {Position: Understanding LLMs Requires More Than Statistical Generalization.}, booktitle = {ICML}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=pVyOchWUBa'}}, keywords = {} } -
J. He, G. Flamich, Z. Guo, and J. M. Hernández-Lobato, “RECOMBINER: Robust and Enhanced Compression with Bayesian Implicit Neural Representations.,” in ICLR, 2024.
[Bibtex]@inproceedings{iclr0003FGH24, author = {Jiajun He and Gergely Flamich and Zongyu Guo and Jos\'e Miguel Hern\'andez-Lobato}, title = {RECOMBINER: Robust and Enhanced Compression with Bayesian Implicit Neural Representations.}, booktitle = {ICLR}, year = 2024, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=VkWbxFrCC8'}}, keywords = {} } -
D. Rozenberszki, O. Litany, and A. Dai, “UnScene3D: Unsupervised 3D Instance Segmentation for Indoor Scenes.,” in CVPR, 2024.
[Bibtex]@inproceedings{cvprRozenberszkiLD24, author = {D\'avid Rozenberszki and Or Litany and Angela Dai}, title = {UnScene3D: Unsupervised 3D Instance Segmentation for Indoor Scenes.}, booktitle = {CVPR}, year = 2024, doi = {https://doi.org/10.1109/CVPR52733.2024.01886}, keywords = {} }
2023
-
F. Abbasi, S. Banerjee, J. Byrka, P. Chalermsook, A. Gadekar, K. Khodamoradi, D. Marx, R. Sharma, and J. Spoerhase, “Parameterized Approximation Schemes for Clustering with General Norm Objectives.,” in FOCS, 2023.
[Bibtex]@inproceedings{focsAbbasiBBCGKMSS23, author = {Fateme Abbasi and Sandip Banerjee and Jaroslaw Byrka and Parinya Chalermsook and Ameet Gadekar and Kamyar Khodamoradi and D\'aniel Marx and Roohani Sharma and Joachim Spoerhase}, title = {Parameterized Approximation Schemes for Clustering with General Norm Objectives.}, booktitle = {FOCS}, year = 2023, doi = {https://doi.org/10.1109/FOCS57990.2023.00085}, keywords = {} } -
A. Agrawal, D. Marx, D. Neuen, and J. Slusallek, “Computing Square Colorings on Bounded-Treewidth and Planar Graphs.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaAgrawalMNS23, author = {Akanksha Agrawal and D\'aniel Marx and Daniel Neuen and Jasper Slusallek}, title = {Computing Square Colorings on Bounded-Treewidth and Planar Graphs.}, booktitle = {SODA}, year = 2023, doi = {https://doi.org/10.1137/1.9781611977554.ch80}, keywords = {} } -
J. Focke, D. Marx, F. M. Inerney, D. Neuen, G. S. Sankar, P. Schepper, and P. Wellnitz, “Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaFockeMINSSW23, author = {Jacob Focke and D\'aniel Marx and Fionn Mc Inerney and Daniel Neuen and Govind S. Sankar and Philipp Schepper and Philip Wellnitz}, title = {Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.}, booktitle = {SODA}, year = 2023, doi = {https://doi.org/10.1137/1.9781611977554.ch140}, keywords = {} } -
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} } -
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} } -
S. Liu, G. Mahajan, D. Kane, S. Lovett, G. Weisz, and C. Szepesvári, “Exponential Hardness of Reinforcement Learning with Linear Function Approximation.,” in COLT, 2023.
[Bibtex]@inproceedings{coltLiuMKLWS23, author = {Sihan Liu and Gaurav Mahajan and Daniel Kane and Shachar Lovett and Gell\'ert Weisz and Csaba Szepesv\'ari}, title = {Exponential Hardness of Reinforcement Learning with Linear Function Approximation.}, booktitle = {COLT}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v195/liu23b.html'}}, keywords = {} } -
S. Zheng, L. Wang, S. Qiu, Z. Fu, Z. Yang, C. Szepesvári, and Z. Wang, “Optimistic Exploration with Learned Features Provably Solves Markov Decision Processes with Neural Dynamics.,” in ICLR, 2023.
[Bibtex]@inproceedings{iclrZheng0QFYSW23, author = {Sirui Zheng and Lingxiao Wang and Shuang Qiu and Zuyue Fu and Zhuoran Yang and Csaba Szepesv\'ari and Zhaoran Wang}, title = {Optimistic Exploration with Learned Features Provably Solves Markov Decision Processes with Neural Dynamics.}, booktitle = {ICLR}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=9kBCMNb5mc'}}, keywords = {} } -
P. Amortila, N. Jiang, and C. Szepesvári, “The Optimal Approximation Factors in Misspecified Off-Policy Value Function Estimation.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlAmortila0S23, author = {Philip Amortila and Nan Jiang and Csaba Szepesv\'ari}, title = {The Optimal Approximation Factors in Misspecified Off-Policy Value Function Estimation.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/amortila23a.html'}}, keywords = {} } -
T. Kitamura, T. Kozuno, Y. Tang, N. Vieillard, M. Valko, W. Yang, J. Mei, P. Ménard, M. G. Azar, R. Munos, O. Pietquin, M. Geist, C. Szepesvári, W. Kumagai, and Y. Matsuo, “Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlKitamuraKTVVYMM23, author = {Toshinori Kitamura and Tadashi Kozuno and Yunhao Tang and Nino Vieillard and Michal Valko and Wenhao Yang and Jincheng Mei and Pierre M\'enard and Mohammad Gheshlaghi Azar and R\'emi Munos and Olivier Pietquin and Matthieu Geist and Csaba Szepesv\'ari and Wataru Kumagai and Yutaka Matsuo}, title = {Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/kitamura23a.html'}}, keywords = {} } -
J. Mei, Z. Zhong, B. Dai, A. Agarwal, C. Szepesvári, and D. Schuurmans, “Stochastic Gradient Succeeds for Bandits.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlMeiZ0ASS23, author = {Jincheng Mei and Zixin Zhong and Bo Dai and Alekh Agarwal and Csaba Szepesv\'ari and Dale Schuurmans}, title = {Stochastic Gradient Succeeds for Bandits.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/mei23a.html'}}, keywords = {} } -
Y. Zhao, C. Stephens, C. Szepesvári, and K. Jun, “Revisiting Simple Regret: Fast Rates for Returning a Good Arm.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlZhaoSSJ23, author = {Yao Zhao and Connor Stephens and Csaba Szepesv\'ari and Kwang-Sung Jun}, title = {Revisiting Simple Regret: Fast Rates for Returning a Good Arm.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/zhao23g.html'}}, keywords = {} } -
Q. Liu, P. Netrapalli, C. Szepesvári, and C. Jin, “Optimistic MLE: A Generic Model-Based Algorithm for Partially Observable Sequential Decision Making.,” in STOC, 2023.
[Bibtex]@inproceedings{stocLiuNS023, author = {Qinghua Liu and Praneeth Netrapalli and Csaba Szepesv\'ari and Chi Jin}, title = {Optimistic MLE: A Generic Model-Based Algorithm for Partially Observable Sequential Decision Making.}, booktitle = {STOC}, year = 2023, doi = {['https://doi.org/10.1145/3564246.3585161', 'https://www.wikidata.org/entity/Q130928901']}, keywords = {} } -
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. Baráth, 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 = {D\'aniel Bar\'ath 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} } -
G. Zhang, V. Larsson, and D. Baráth, “Revisiting Rotation Averaging: Uncertainties and Robust Losses.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprZhangLB23, author = {Ganlin Zhang and Viktor Larsson and D\'aniel Bar\'ath}, title = {Revisiting Rotation Averaging: Uncertainties and Robust Losses.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.01651}, keywords = {} } -
R. Pautrat, D. Baráth, V. Larsson, M. R. Oswald, and M. Pollefeys, “DeepLSD: Line Segment Detection and Refinement with Deep Image Gradients.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprPautratBLOP23, author = {R\'emi Pautrat and D\'aniel Bar\'ath and Viktor Larsson and Martin R. Oswald and Marc Pollefeys}, title = {DeepLSD: Line Segment Detection and Refinement with Deep Image Gradients.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.01662}, keywords = {} } -
D. Baráth, D. Mishkin, M. Polic, W. Förstner, and J. Matas, “A Large-Scale Homography Benchmark.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprBarathMPFM23, author = {D\'aniel Bar\'ath and Dmytro Mishkin and Michal Polic and Wolfgang F\"orstner and Jiri Matas}, title = {A Large-Scale Homography Benchmark.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.02046}, keywords = {} } -
L. Hajder, L. Lóczi, and D. Baráth, “Fast Globally Optimal Surface Normal from an Affine Correspondence.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvHajderLB23, author = {Levente Hajder and Lajos L\'oczi and D\'aniel Bar\'ath}, 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} } -
R. Pautrat, S. Liu, P. Hruby, M. Pollefeys, and D. Baráth, “Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvPautratLHPB23, author = {R\'emi Pautrat and Shaohui Liu and Petr Hruby and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.01298}, keywords = {} } -
T. Wei, Y. Patel, A. Shekhovtsov, J. Matas, and D. Baráth, “Generalized Differentiable RANSAC.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvWeiPSMB23, author = {Tong Wei and Yash Patel and Alexander Shekhovtsov and Jir\'i Matas and D\'aniel Bar\'ath}, title = {Generalized Differentiable RANSAC.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.01618}, keywords = {} } -
S. Wang, J. Kannala, M. Pollefeys, and D. Baráth, “Guiding Local Feature Matching with Surface Curvature.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvWangKPB23, author = {Shuzhe Wang and Juho Kannala and Marc Pollefeys and D\'aniel Bar\'ath}, title = {Guiding Local Feature Matching with Surface Curvature.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.01648}, keywords = {} } -
T. Wei, J. Matas, and D. Baráth, “Adaptive Reordering Sampler with Neurally Guided MAGSAC.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvWeiMB23, author = {Tong Wei and Jir\'i Matas and D\'aniel Bar\'ath}, title = {Adaptive Reordering Sampler with Neurally Guided MAGSAC.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.01665}, keywords = {} } -
J. Ventura, Z. Kukelova, T. Sattler, and D. Baráth, “P1AC: Revisiting Absolute Pose From a Single Affine Correspondence.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvVenturaKSB23, author = {Jonathan Ventura and Zuzana Kukelova and Torsten Sattler and D\'aniel Bar\'ath}, title = {P1AC: Revisiting Absolute Pose From a Single Affine Correspondence.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.01809}, keywords = {} } -
S. D. Sarkar, O. Miksik, M. Pollefeys, D. Baráth, and I. Armeni, “SGAligner: 3D Scene Alignment with Scene Graphs.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvSarkarMPBA23, author = {Sayan Deb Sarkar and Ondrej Miksik and Marc Pollefeys and D\'aniel Bar\'ath and Iro Armeni}, title = {SGAligner: 3D Scene Alignment with Scene Graphs.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.02004}, keywords = {} } -
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} } -
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} } -
R. Busa-Fekete, A. M. Medina, U. Syed, and S. Vassilvitskii, “Label differential privacy and private training data release.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlBusa-FeketeMSV23, author = {R\'obert Busa-Fekete and Andr\'es Muñoz Medina and Umar Syed and Sergei Vassilvitskii}, title = {Label differential privacy and private training data release.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/busa-fekete23a.html'}}, keywords = {} } -
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. Chen, G. Kál. 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 K\'al 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} } -
J. Chen and G. Kál. Csáji, “Optimal Capacity Modification for Many-To-One Matching Problems.,” in AAMAS, 2023.
[Bibtex]@inproceedings{atal0001C23, author = {Jiehua Chen and Gergely K\'al Cs\'aji}, title = {Optimal Capacity Modification for Many-To-One Matching Problems.}, booktitle = {AAMAS}, year = 2023, doi = {https://dl.acm.org/doi/10.5555/3545946.3599110}, keywords = {ELTE and international and theory} } -
L. S. Brugger, L. Kovács, A. P. Komel, S. Rain, and M. Rawson, “CheckMate: Automated Game-Theoretic Security Reasoning.,” in CCS, 2023.
[Bibtex]@inproceedings{ccsBruggerKKR023, author = {Lea Salome Brugger and Laura Kov\'acs and Anja Petkovic Komel and Sophie Rain and Michael Rawson}, title = {CheckMate: Automated Game-Theoretic Security Reasoning.}, booktitle = {CCS}, year = 2023, doi = {['https://doi.org/10.1145/3576915.3623183', 'https://www.wikidata.org/entity/Q131110483']}, keywords = {} } -
T. Lattimore and A. György, “A Second-Order Method for Stochastic Bandit Convex Optimisation.,” in COLT, 2023.
[Bibtex]@inproceedings{coltLattimore023, author = {Tor Lattimore and Andr\'as Gy\"orgy}, title = {A Second-Order Method for Stochastic Bandit Convex Optimisation.}, booktitle = {COLT}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v195/lattimore23a.html'}}, keywords = {} } -
S. Amani, T. Lattimore, A. György, and L. Yang, “Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlAmaniL0023, author = {Sanae Amani and Tor Lattimore and Andr\'as Gy\"orgy and Lin Yang}, title = {Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/amani23a.html'}}, keywords = {} } -
Y. Tang, Z. D. Guo, P. H. Richemond, B. Á. Pires, Y. Chandak, R. Munos, M. Rowland, M. G. Azar, C. L. Lan, C. Lyle, A. György, S. Thakoor, W. Dabney, B. Piot, D. Calandriello, and M. Valko, “Understanding Self-Predictive Learning for Reinforcement Learning.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlTangGRPCMRALL0T23, author = {Yunhao Tang and Zhaohan Daniel Guo and Pierre Harvey Richemond and Bernardo \'Avila Pires and Yash Chandak and R\'emi Munos and Mark Rowland and Mohammad Gheshlaghi Azar and Charline Le Lan and Clare Lyle and Andr\'as Gy\"orgy and Shantanu Thakoor and Will Dabney and Bilal Piot and Daniele Calandriello and Michal Valko}, title = {Understanding Self-Predictive Learning for Reinforcement Learning.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/tang23d.html'}}, keywords = {} } -
D. Haider, M. Ehler, and P. Balázs, “Convex Geometry of ReLU-layers, Injectivity on the Ball and Local Reconstruction.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlHaiderEB23, author = {Daniel Haider and Martin Ehler and P\'eter Bal\'azs}, title = {Convex Geometry of ReLU-layers, Injectivity on the Ball and Local Reconstruction.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/haider23a.html'}}, keywords = {} } -
G. Fikioris and É. Tardos, “Approximately Stationary Bandits with Knapsacks.,” in COLT, 2023.
[Bibtex]@inproceedings{coltFikiorisT23, author = {Giannis Fikioris and \'Eva Tardos}, title = {Approximately Stationary Bandits with Knapsacks.}, booktitle = {COLT}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v195/fikioris23a.html'}}, keywords = {} } -
M. Vuppalapati, G. Fikioris, R. Agarwal, A. Cidon, A. Khandelwal, and É. Tardos, “Karma: Resource Allocation for Dynamic Demands.,” in OSDI, 2023.
[Bibtex]@inproceedings{osdiVuppalapatiF0CK23, author = {Midhul Vuppalapati and Giannis Fikioris and Rachit Agarwal and Asaf Cidon and Anurag Khandelwal and \'Eva Tardos}, title = {Karma: Resource Allocation for Dynamic Demands.}, booktitle = {OSDI}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://www.usenix.org/conference/osdi23/presentation/vuppalapati'}}, keywords = {} } -
S. Banerjee, G. Fikioris, and É. Tardos, “Robust Pseudo-Markets for Reusable Public Resources.,” in EC, 2023.
[Bibtex]@inproceedings{sigecomBanerjeeFT23, author = {Siddhartha Banerjee and Giannis Fikioris and \'Eva Tardos}, title = {Robust Pseudo-Markets for Reusable Public Resources.}, booktitle = {EC}, year = 2023, doi = {https://doi.org/10.1145/3580507.3597723}, keywords = {} } -
G. Fikioris and É. Tardos, “Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions.,” in EC, 2023.
[Bibtex]@inproceedings{sigecomFikiorisT23, author = {Giannis Fikioris and \'Eva Tardos}, title = {Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions.}, booktitle = {EC}, year = 2023, doi = {https://doi.org/10.1145/3580507.3597772}, keywords = {} } -
A. Moulin and G. Neu, “Optimistic Planning by Regularized Dynamic Programming.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlMoulinN23, author = {Antoine Moulin and Gergely Neu}, title = {Optimistic Planning by Regularized Dynamic Programming.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/moulin23a.html'}}, keywords = {} } -
G. I. Beintema, M. Schoukens, and R. Toth, “Continuous-time identification of dynamic state-space models by deep subspace encoding.,” in ICLR, 2023.
[Bibtex]@inproceedings{iclrBeintemaST23, author = {Gerben Izaak Beintema and Maarten Schoukens and Roland Toth}, title = {Continuous-time identification of dynamic state-space models by deep subspace encoding.}, booktitle = {ICLR}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=_4n3k3d1ob'}}, keywords = {} } -
M. Bonamy, E. Bonnet, H. Déprés, L. Esperet, C. Geniet, C. Hilaire, S. Thomassé, and A. Wesolek, “Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaBonamyBDEGHTW23, author = {Marthe Bonamy and Edouard Bonnet and Hugues D\'epr\'es and Louis Esperet and Colin Geniet and Claire Hilaire and St\'ephan Thomass\'e and Alexandra Wesolek}, title = {Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.}, booktitle = {SODA}, year = 2023, doi = {https://doi.org/10.1137/1.9781611977554.ch116}, keywords = {} } -
K. Kazari, E. Shereen, and G. Dán, “Decentralized Anomaly Detection in Cooperative Multi-Agent Reinforcement Learning.,” in IJCAI, 2023.
[Bibtex]@inproceedings{ijcaiKazariSD23, author = {Kiarash Kazari and Ezzeldin Shereen and Gy\"orgy D\'an}, title = {Decentralized Anomaly Detection in Cooperative Multi-Agent Reinforcement Learning.}, booktitle = {IJCAI}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2023/19'}}, keywords = {} } -
J. Tian, X. Dai, C. Ma, Z. He, Y. Liu, and Z. Kira, “Trainable Projected Gradient Method for Robust Fine-Tuning.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprTianDMHLK23, author = {Junjiao Tian and Xiaoliang Dai and Chih-Yao Ma and Zecheng He and Yen-Cheng Liu and Zsolt Kira}, title = {Trainable Projected Gradient Method for Robust Fine-Tuning.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.00757}, keywords = {} } -
C. Kuo and Z. Kira, “HAAV: Hierarchical Aggregation of Augmented Views for Image Captioning.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprKuoK23, author = {Chia-Wen Kuo and Zsolt Kira}, title = {HAAV: Hierarchical Aggregation of Augmented Views for Image Captioning.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.01062}, keywords = {} } -
J. S. Smith, L. Karlinsky, V. Gutta, P. Cascante-Bonilla, D. Kim, A. Arbelle, R. Panda, R. Feris, and Z. Kira, “CODA-Prompt: COntinual Decomposed Attention-Based Prompting for Rehearsal-Free Continual Learning.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprSmithKGCKAPFK23, author = {James Seale Smith and Leonid Karlinsky and Vyshnavi Gutta and Paola Cascante-Bonilla and Donghyun Kim and Assaf Arbelle and Rameswar Panda and Rog\'erio Feris and Zsolt Kira}, title = {CODA-Prompt: COntinual Decomposed Attention-Based Prompting for Rehearsal-Free Continual Learning.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.01146}, keywords = {} } -
J. S. Smith, P. Cascante-Bonilla, A. Arbelle, D. Kim, R. Panda, D. D. Cox, D. Yang, Z. Kira, R. Feris, and L. Karlinsky, “ConStruct-VL: Data-Free Continual Structured VL Concepts Learning.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprSmithCAKPCYKFK23, author = {James Seale Smith and Paola Cascante-Bonilla and Assaf Arbelle and Donghyun Kim and Rameswar Panda and David D. Cox and Diyi Yang and Zsolt Kira and Rog\'erio Feris and Leonid Karlinsky}, title = {ConStruct-VL: Data-Free Continual Structured VL Concepts Learning.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.01440}, keywords = {} } -
M. Z. Irshad, S. Zakharov, K. Liu, V. Guizilini, T. Kollar, A. Gaidon, Z. Kira, and R. Ambrus, “NeO 360: Neural Fields for Sparse View Synthesis of Outdoor Scenes.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvIrshadZLGKGKA23, author = {Muhammad Zubair Irshad and Sergey Zakharov and Katherine Liu and Vitor Guizilini and Thomas Kollar and Adrien Gaidon and Zsolt Kira and Rares Ambrus}, title = {NeO 360: Neural Fields for Sparse View Synthesis of Outdoor Scenes.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.00843}, keywords = {} } -
A. Szot, A. Zhang, D. Batra, Z. Kira, and F. Meier, “BC-IRL: Learning Generalizable Reward Functions from Demonstrations.,” in ICLR, 2023.
[Bibtex]@inproceedings{iclrSzot0BKM23, author = {Andrew Szot and Amy Zhang and Dhruv Batra and Zsolt Kira and Franziska Meier}, title = {BC-IRL: Learning Generalizable Reward Functions from Demonstrations.}, booktitle = {ICLR}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=Ovnwe_sDQW'}}, keywords = {} } -
A. Szot, U. Jain, D. Batra, Z. Kira, R. Desai, and A. Rai, “Adaptive Coordination in Social Embodied Rearrangement.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlSzotJBKDR23, author = {Andrew Szot and Unnat Jain and Dhruv Batra and Zsolt Kira and Ruta Desai and Akshara Rai}, title = {Adaptive Coordination in Social Embodied Rearrangement.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/szot23a.html'}}, keywords = {} } -
N. M. Glaser and Z. Kira, “Communication-Critical Planning via Multi-Agent Trajectory Exchange.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraGlaserK23, author = {Nathaniel Moore Glaser and Zsolt Kira}, title = {Communication-Critical Planning via Multi-Agent Trajectory Exchange.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10160880}, keywords = {} } -
E. Cohen, J. Nelson, T. Sarlós, and U. Stemmer, “Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs.,” in AAAI, 2023.
[Bibtex]@inproceedings{aaaiCohenNSS23, author = {Edith Cohen and Jelani Nelson and Tam\'as Sarl\'os and Uri Stemmer}, title = {Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs.}, booktitle = {AAAI}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v37i6.25882'}}, keywords = {} } -
K. M. Choromanski, A. Sehanobish, H. Lin, Y. Zhao, E. Berger, T. Parshakova, A. Pan, D. Watkins, T. Zhang, V. Likhosherstov, S. B. R. Chowdhury, K. A. Dubey, D. Jain, T. Sarlós, S. Chaturvedi, and A. Weller, “Efficient Graph Field Integrators Meet Point Clouds.,” in ICML, 2023.
[Bibtex]@inproceedings{icmlChoromanskiSLZB23, author = {Krzysztof Marcin Choromanski and Arijit Sehanobish and Han Lin and Yunfan Zhao and Eli Berger and Tetiana Parshakova and Alvin Pan and David Watkins and Tianyi Zhang and Valerii Likhosherstov and Somnath Basu Roy Chowdhury and Kumar Avinava Dubey and Deepali Jain and Tam\'as Sarl\'os and Snigdha Chaturvedi and Adrian Weller}, title = {Efficient Graph Field Integrators Meet Point Clouds.}, booktitle = {ICML}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v202/choromanski23b.html'}}, keywords = {} } -
E. Cohen, X. Lyu, J. Nelson, T. Sarlós, and U. Stemmer, “Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization.,” in STOC, 2023.
[Bibtex]@inproceedings{stocCohen0NSS23, author = {Edith Cohen and Xin Lyu and Jelani Nelson and Tam\'as Sarl\'os and Uri Stemmer}, title = {Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization.}, booktitle = {STOC}, year = 2023, doi = {['https://doi.org/10.1145/3564246.3585148', 'https://www.wikidata.org/entity/Q131197060']}, keywords = {} } -
M. Pietrantoni, M. Humenberger, T. Sattler, and G. Csurka, “SegLoc: Learning Segmentation-Based Representations for Privacy-Preserving Visual Localization.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprPietrantoniHSC23, author = {Maxime Pietrantoni and Martin Humenberger and Torsten Sattler and Gabriela Csurka}, title = {SegLoc: Learning Segmentation-Based Representations for Privacy-Preserving Visual Localization.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.01476}, keywords = {} } -
P. Weinzaepfel, T. Lucas, V. Leroy, Y. Cabon, V. Arora, R. Brégier, G. Csurka, L. Antsfeld, B. Chidlovskii, and J. Revaud, “CroCo v2: Improved Cross-view Completion Pre-training for Stereo Matching and Optical Flow.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvWeinzaepfel00CA23, author = {Philippe Weinzaepfel and Thomas Lucas and Vincent Leroy and Yohann Cabon and Vaibhav Arora and Romain Br\'egier and Gabriela Csurka and Leonid Antsfeld and Boris Chidlovskii and J\'erôme Revaud}, title = {CroCo v2: Improved Cross-view Completion Pre-training for Stereo Matching and Optical Flow.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.01647}, keywords = {} } -
H. Yu, J. Julin, Z. Ádám. Milacski, K. Niinuma, and L. A. Jeni, “DyLiN: Making Light Field Networks Dynamic.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprYuJMNJ23, author = {Heng Yu and Joel Julin and Zolt\'an \'Ad\'am Milacski and Koichiro Niinuma and L\'aszl\'o A. Jeni}, title = {DyLiN: Making Light Field Networks Dynamic.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.01193}, keywords = {} } -
C. Wang, L. E. MacDonald, L. A. Jeni, and S. Lucey, “Flow Supervision for Deformable NeRF.,” in CVPR, 2023.
[Bibtex]@inproceedings{cvprWangMJL23, author = {Chaoyang Wang and Lachlan Ewen MacDonald and L\'aszl\'o A. Jeni and Simon Lucey}, title = {Flow Supervision for Deformable NeRF.}, booktitle = {CVPR}, year = 2023, doi = {https://doi.org/10.1109/CVPR52729.2023.02024}, keywords = {} } -
R. Choudhury, K. M. Kitani, and L. A. Jeni, “TEMPO: Efficient Multi-View Pose Estimation, Tracking, and Forecasting.,” in ICCV, 2023.
[Bibtex]@inproceedings{iccvChoudhuryKJ23, author = {Rohan Choudhury and Kris M. Kitani and L\'aszl\'o A. Jeni}, title = {TEMPO: Efficient Multi-View Pose Estimation, Tracking, and Forecasting.}, booktitle = {ICCV}, year = 2023, doi = {https://doi.org/10.1109/ICCV51070.2023.01355}, keywords = {} } -
K. Kawarabayashi, S. Kreutzer, O. Kwon, and Q. Xie, “A half-integral Erdős-Pósa theorem for directed odd cycles.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaKawarabayashiKK23, author = {Ken-ichi Kawarabayashi and Stephan Kreutzer and O-joung Kwon and Qiqin Xie}, title = {A half-integral Erdős-Pósa theorem for directed odd cycles.}, booktitle = {SODA}, year = 2023, doi = {https://doi.org/10.1137/1.9781611977554.ch118}, keywords = {} } -
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. Garg, E. Husic, W. Li, L. A. Végh, and J. Vondrák, “Approximating Nash Social Welfare by Matching and Local Search.,” in STOC, 2023.
[Bibtex]@inproceedings{stocGargHLVV23, author = {Jugal Garg and Edin Husic and Wenzheng Li and L\'aszl\'o A. V\'egh and Jan Vondr\'ak}, title = {Approximating Nash Social Welfare by Matching and Local Search.}, booktitle = {STOC}, year = 2023, doi = {https://doi.org/10.1145/3564246.3585255}, keywords = {} } -
K. Gellert, K. Gjøsteen, H. Jacobsen, and T. Jager, “On Optimal Tightness for Key Exchange with Full Forward Secrecy via Key Confirmation.,” in CRYPTO (4), 2023.
[Bibtex]@inproceedings{cryptoGellertGJJ23, author = {Kai Gellert and Kristian Gjøsteen and Håkon Jacobsen and Tibor Jager}, title = {On Optimal Tightness for Key Exchange with Full Forward Secrecy via Key Confirmation.}, booktitle = {CRYPTO (4)}, year = 2023, doi = {https://doi.org/10.1007/978-3-031-38551-3_10}, keywords = {} } -
G. T. Davies, S. H. Faller, K. Gellert, T. Handirk, J. Hesse, Máté. Horváth, and T. Jager, “Security Analysis of the WhatsApp End-to-End Encrypted Backup Protocol.,” in CRYPTO (4), 2023.
[Bibtex]@inproceedings{cryptoDaviesFGHHHJ23, author = {Gareth T. Davies and Sebastian H. Faller and Kai Gellert and Tobias Handirk and Julia Hesse and M\'at\'e Horv\'ath and Tibor Jager}, title = {Security Analysis of the WhatsApp End-to-End Encrypted Backup Protocol.}, booktitle = {CRYPTO (4)}, year = 2023, doi = {https://doi.org/10.1007/978-3-031-38551-3_11}, keywords = {} } -
C. A. Braun, L. Haide, L. Fischer, S. Kille, B. Varga, S. Rothfuss, and S. Hohmann, “Using a Collaborative Robotic Arm as Human-Machine Interface: System Setup and Application to Pose Control Tasks.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraBraunHFKVRH23, author = {Christian Alexander Braun and Ludwig Haide and Lars Fischer and Sean Kille and B\'alint Varga and Simon Rothfuss and S\"oren Hohmann}, title = {Using a Collaborative Robotic Arm as Human-Machine Interface: System Setup and Application to Pose Control Tasks.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10161348}, keywords = {} } -
Á. Cseh, P. Führlich, and P. Lenzner, “The Swiss Gambit.,” in AAMAS, 2023.
[Bibtex]@inproceedings{atalCsehFL23, author = {\'Agnes Cseh and Pascal F\"uhrlich and Pascal Lenzner}, title = {The Swiss Gambit.}, booktitle = {AAMAS}, year = 2023, doi = {https://dl.acm.org/doi/10.5555/3545946.3598983}, keywords = {} } -
M. Oldenhof, A. Arany, Y. Moreau, and E. D. Brouwer, “Weakly Supervised Knowledge Transfer with Probabilistic Logical Reasoning for Object Detection.,” in ICLR, 2023.
[Bibtex]@inproceedings{iclrOldenhofAMB23, author = {Martijn Oldenhof and Adam Arany and Yves Moreau and Edward De Brouwer}, title = {Weakly Supervised Knowledge Transfer with Probabilistic Logical Reasoning for Object Detection.}, booktitle = {ICLR}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=4yqxDCbzS98'}}, keywords = {} } -
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} } -
O. Parczyk, S. Pokutta, C. Spiegel, and T. Szabó, “Fully Computer-Assisted Proofs in Extremal Combinatorics.,” in AAAI, 2023.
[Bibtex]@inproceedings{aaaiParczykP0S23, author = {Olaf Parczyk and Sebastian Pokutta and Christoph Spiegel and Tibor Szab\'o}, title = {Fully Computer-Assisted Proofs in Extremal Combinatorics.}, booktitle = {AAAI}, year = 2023, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v37i10.26470'}}, keywords = {} } -
P. Haxell and T. Szabó, “Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaHaxellS23, author = {Penny Haxell and Tibor Szab\'o}, title = {Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole.}, booktitle = {SODA}, year = 2023, doi = {https://doi.org/10.1137/1.9781611977554.ch109}, keywords = {} } -
W. Pryor, L. J. Wang, A. Chatterjee, B. P. Vágvölgyi, A. Deguet, S. Léonard, L. L. Whitcomb, and P. Kazanzides, “A Virtual Reality Planning Environment for High-Risk, High-Latency Teleoperation.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraPryorWCVDLWK23, author = {Will Pryor and Liam J. Wang and Arko Chatterjee and Bal\'azs P. V\'agv\"olgyi and Anton Deguet and Simon L\'eonard and Louis L. Whitcomb and Peter Kazanzides}, title = {A Virtual Reality Planning Environment for High-Risk, High-Latency Teleoperation.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10161029}, keywords = {} } -
P. Anderson, E. B. Aranas, Y. Assaf, R. Behrendt, R. Black, M. Caballero, P. Cameron, B. Canakci, T. D. Carvalho, A. Chatzieleftheriou, R. S. Clarke, J. Clegg, D. Cletheroe, B. Cooper, T. Deegan, A. Donnelly, R. Drevinskas, A. L. Gaunt, C. Gkantsidis, A. G. Diaz, I. Haller, F. Hong, T. Ilieva, S. Joshi, R. Joyce, M. Kunkel, D. Lara, S. Legtchenko, F. L. Liu, B. Magalhães, A. Marzoev, M. McNett, J. Mohan, M. Myrah, T. Nguyen, S. Nowozin, A. Ogus, H. Overweg, A. I. T. Rowstron, M. Sah, M. Sakakura, P. Scholtz, N. Schreiner, O. Sella, A. Smith, I. A. Stefanovici, D. Sweeney, B. Thomsen, G. Verkes, P. Wainman, J. Westcott, L. Weston, C. Whittaker, P. W. Berenguer, H. Williams, T. Winkler, and S. Winzeck, “Project Silica: Towards Sustainable Cloud Archival Storage in Glass.,” in SOSP, 2023.
[Bibtex]@inproceedings{sosp0001AABBCCCCCCC23, author = {Patrick Anderson and Erika Blancada Aranas and Youssef Assaf and Raphael Behrendt and Richard Black and Marco Caballero and Pashmina Cameron and Burcu Canakci and Thales De Carvalho and Andromachi Chatzieleftheriou and Rebekah Storan Clarke and James Clegg and Daniel Cletheroe and Bridgette Cooper and Tim Deegan and Austin Donnelly and Rokas Drevinskas and Alexander L. Gaunt and Christos Gkantsidis and Ariel Gomez Diaz and Istv\'an Haller and Freddie Hong and Teodora Ilieva and Shashidhar Joshi and Russell Joyce and Mint Kunkel and David Lara and Sergey Legtchenko and Fanglin Linda Liu and Bruno Magalhães and Alana Marzoev and Marvin McNett and Jayashree Mohan and Michael Myrah and Truong Nguyen and Sebastian Nowozin and Aaron Ogus and Hiske Overweg and Antony I. T. Rowstron and Maneesh Sah and Masaaki Sakakura and Peter Scholtz and Nina Schreiner and Omer Sella and Adam Smith and Ioan A. Stefanovici and David Sweeney and Benn Thomsen and Govert Verkes and Phil Wainman and Jonathan Westcott and Luke Weston and Charles Whittaker and Pablo Wilke Berenguer and Hugh Williams and Thomas Winkler and Stefan Winzeck}, title = {Project Silica: Towards Sustainable Cloud Archival Storage in Glass.}, booktitle = {SOSP}, year = 2023, doi = {['https://doi.org/10.1145/3600006.3613208', 'https://www.wikidata.org/entity/Q130930442']}, keywords = {} } -
S. Veer, K. Leung, R. K. Cosner, Y. Chen, P. Karkus, and M. Pavone, “Receding Horizon Planning with Rule Hierarchies for Autonomous Vehicles.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraVeerLCCKP23, author = {Sushant Veer and Karen Leung and Ryan K. Cosner and Yuxiao Chen and P\'eter Karkus and Marco Pavone}, title = {Receding Horizon Planning with Rule Hierarchies for Autonomous Vehicles.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10160622}, keywords = {} } -
F. Christianos, P. Karkus, B. Ivanovic, S. V. Albrecht, and M. Pavone, “Planning with Occluded Traffic Agents using Bi-Level Variational Occlusion Models.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraChristianosKIAP23, author = {Filippos Christianos and P\'eter Karkus and Boris Ivanovic and Stefano V. Albrecht and Marco Pavone}, title = {Planning with Occluded Traffic Agents using Bi-Level Variational Occlusion Models.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10160604}, keywords = {} } -
Y. Chen, P. Karkus, B. Ivanovic, X. Weng, and M. Pavone, “Tree-structured Policy Planning with Learned Behavior Models.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraChenKIWP23, author = {Yuxiao Chen and P\'eter Karkus and Boris Ivanovic and Xinshuo Weng and Marco Pavone}, title = {Tree-structured Policy Planning with Learned Behavior Models.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10161419}, keywords = {} } -
R. Pradeep, K. Hui, J. Gupta, D. Ádám. Lelkes, H. Zhuang, J. Lin, D. Metzler, and V. Q. Tran, “How Does Generative Retrieval Scale to Millions of Passages?,” in EMNLP, 2023.
[Bibtex]@inproceedings{emnlpPradeep0GLZLM023, author = {Ronak Pradeep and Kai Hui and Jai Gupta and \'Ad\'am D\'aniel Lelkes and Honglei Zhuang and Jimmy Lin and Donald Metzler and Vinh Q. Tran}, title = {How Does Generative Retrieval Scale to Millions of Passages?}, booktitle = {EMNLP}, year = 2023, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.18653/v1/2023.emnlp-main.83'}, {'@type': 'oa', '#text': 'https://aclanthology.org/2023.emnlp-main.83'}]}, keywords = {} } -
J. Krieglstein, G. Held, B. A. Bálint, F. Nägele, and W. Kraus, “Skill-based Robot Programming in Mixed Reality with Ad-hoc Validation Using a Force-enabled Digital Twin.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraKrieglsteinHBNK23, author = {Jan Krieglstein and Gesche Held and Bal\'azs Andr\'as B\'alint and Frank Nägele and Werner Kraus}, title = {Skill-based Robot Programming in Mixed Reality with Ad-hoc Validation Using a Force-enabled Digital Twin.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10161095}, keywords = {} } -
L. Espín-Noboa, J. Kertész, and M. Karsai, “Interpreting wealth distribution via poverty map inference using multimodal data.,” in WWW, 2023.
[Bibtex]@inproceedings{wwwEspin-NoboaKK23, author = {Lisette Esp\'in-Noboa and J\'anos Kert\'esz and M\'arton Karsai}, title = {Interpreting wealth distribution via poverty map inference using multimodal data.}, booktitle = {WWW}, year = 2023, doi = {['https://doi.org/10.1145/3543507.3583862', 'https://www.wikidata.org/entity/Q130903056']}, keywords = {} } -
T. Schneider, R. Schmid, S. Vissicchio, and L. Vanbever, “Taming the transient while reconfiguring BGP.,” in SIGCOMM, 2023.
[Bibtex]@inproceedings{sigcommSchneiderSVV23, author = {Tibor Schneider and Roland Schmid and Stefano Vissicchio and Laurent Vanbever}, title = {Taming the transient while reconfiguring BGP.}, booktitle = {SIGCOMM}, year = 2023, doi = {https://doi.org/10.1145/3603269.3604855}, keywords = {} } -
G. Sóti, X. Huang, C. Wurll, and B. Hein, “Train What You Know – Precise Pick-and-Place with Transporter Networks.,” in ICRA, 2023.
[Bibtex]@inproceedings{icraSotiHWH23, author = {Gergely S\'oti and Xi Huang and Christian Wurll and Bj\"orn Hein}, title = {Train What You Know - Precise Pick-and-Place with Transporter Networks.}, booktitle = {ICRA}, year = 2023, doi = {https://doi.org/10.1109/ICRA48891.2023.10161242}, keywords = {} } -
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 = {} } -
O. Janzer, B. Sudakov, and I. Tomon, “Small subgraphs with large average degree.,” in SODA, 2023.
[Bibtex]@inproceedings{sodaJanzerST23, author = {Oliver Janzer and Benny Sudakov and Istv\'an Tomon}, title = {Small subgraphs with large average degree.}, booktitle = {SODA}, year = 2023, doi = {https://doi.org/10.1137/1.9781611977554.ch90}, keywords = {} } -
B. I. Kovács, I. Erb, H. Kaufmann, and P. Ferschin, “MR.Sketch. Immediate 3D Sketching via Mixed Reality Drawing Canvases.,” in ISMAR, 2023.
[Bibtex]@inproceedings{ismarKovacsEKF23, author = {B\'alint Istv\'an Kov\'acs and Ingrid Erb and Hannes Kaufmann and Peter Ferschin}, title = {MR.Sketch. Immediate 3D Sketching via Mixed Reality Drawing Canvases.}, booktitle = {ISMAR}, year = 2023, doi = {https://doi.org/10.1109/ISMAR59233.2023.00015}, keywords = {} }
2022
-
J. Focke, D. Marx, and P. Rzazewski, “Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.,” in SODA, 2022.
[Bibtex]@inproceedings{sodaFockeMR22, author = {Jacob Focke and D\'aniel Marx and Pawel Rzazewski}, title = {Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.}, booktitle = {SODA}, year = 2022, doi = {https://doi.org/10.1137/1.9781611977073.22}, keywords = {} } -
D. Marx, P. Misra, D. Neuen, and P. Tale, “A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.,” in SODA, 2022.
[Bibtex]@inproceedings{sodaMarxMNT22, author = {D\'aniel Marx and Pranabendu Misra and Daniel Neuen and Prafullkumar Tale}, title = {A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.}, booktitle = {SODA}, year = 2022, doi = {https://doi.org/10.1137/1.9781611977073.83}, keywords = {} } -
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} } -
Q. Liu, A. Chung, C. Szepesvári, and C. Jin, “When Is Partially Observable Reinforcement Learning Not Scary?,” in COLT, 2022.
[Bibtex]@inproceedings{coltLiuCSJ22, author = {Qinghua Liu and Alan Chung and Csaba Szepesv\'ari and Chi Jin}, title = {When Is Partially Observable Reinforcement Learning Not Scary?}, booktitle = {COLT}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v178/liu22f.html'}}, keywords = {} } -
T. Ren, T. Zhang, C. Szepesvári, and B. Dai, “A free lunch from the noise: Provable and practical exploration for representation learning.,” in UAI, 2022.
[Bibtex]@inproceedings{uaiRenZSD22, author = {Tongzheng Ren and Tianjun Zhang and Csaba Szepesv\'ari and Bo Dai}, title = {A free lunch from the noise: Provable and practical exploration for representation learning.}, booktitle = {UAI}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v180/ren22a.html'}}, keywords = {} } -
Y. Ding, D. Baráth, J. Yang, and Z. Kukelova, “Relative Pose from a Calibrated and an Uncalibrated Smartphone Image.,” in CVPR, 2022.
[Bibtex]@inproceedings{cvpr0001B0K22, author = {Yaqing Ding and D\'aniel Bar\'ath and Jian Yang and Zuzana Kukelova}, title = {Relative Pose from a Calibrated and an Uncalibrated Smartphone Image.}, booktitle = {CVPR}, year = 2022, doi = {https://doi.org/10.1109/CVPR52688.2022.01243}, keywords = {} } -
D. Baráth, L. Cavalli, and M. Pollefeys, “Learning to Find Good Models in RANSAC.,” in CVPR, 2022.
[Bibtex]@inproceedings{cvprBarathCP22, author = {D\'aniel Bar\'ath and Luca Cavalli and Marc Pollefeys}, title = {Learning to Find Good Models in RANSAC.}, booktitle = {CVPR}, year = 2022, doi = {https://doi.org/10.1109/CVPR52688.2022.01529}, keywords = {} } -
L. Cavalli, M. Pollefeys, and D. Baráth, “NeFSAC: Neurally Filtered Minimal Samples.,” in ECCV (32), 2022.
[Bibtex]@inproceedings{eccvCavalliPB22, author = {Luca Cavalli and Marc Pollefeys and D\'aniel Bar\'ath}, title = {NeFSAC: Neurally Filtered Minimal Samples.}, booktitle = {ECCV (32)}, year = 2022, doi = {https://doi.org/10.1007/978-3-031-19824-3_21}, keywords = {} } -
D. Baráth and Z. Kukelova, “Relative Pose from SIFT Features.,” in ECCV (32), 2022.
[Bibtex]@inproceedings{eccvBarathK22, author = {D\'aniel Bar\'ath and Zuzana Kukelova}, title = {Relative Pose from SIFT Features.}, booktitle = {ECCV (32)}, year = 2022, doi = {https://doi.org/10.1007/978-3-031-19824-3_27}, keywords = {} } -
D. Baráth and G. Valasek, “Space-Partitioning RANSAC.,” in ECCV (32), 2022.
[Bibtex]@inproceedings{eccvBarathV22, author = {D\'aniel Bar\'ath 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 = {} } -
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} } -
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} } -
A. Coglio, E. McCarthy, S. J. Westfold, D. Balasubramanian, A. Dubey, and G. Karsai, “Syntheto: A Surface Language for APT and ACL2.,” in ACL2, 2022.
[Bibtex]@inproceedings{journalscorrabs-2205-11706, author = {Alessandro Coglio and Eric McCarthy and Stephen J. Westfold and Daniel Balasubramanian and Abhishek Dubey and Gabor Karsai}, title = {Syntheto: A Surface Language for APT and ACL2.}, booktitle = {ACL2}, year = 2022, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.4204/EPTCS.359.13'}, {'@type': 'oa', '#text': 'https://doi.org/10.48550/arXiv.2205.11706'}]}, keywords = {} } -
L. Alvarez, I. Gransbury, V. Cateté, T. Barnes, Á. Lédeczi, and S. Grover, “A Socially Relevant Focused AI Curriculum Designed for Female High School Students.,” in AAAI, 2022.
[Bibtex]@inproceedings{aaaiAlvarezGCBLG22, author = {Lauren Alvarez and Isabella Gransbury and Veronica Catet\'e and Tiffany Barnes and \'Akos L\'edeczi and Shuchi Grover}, title = {A Socially Relevant Focused AI Curriculum Designed for Female High School Students.}, booktitle = {AAAI}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v36i11.21546'}}, keywords = {} } -
M. Ajtai, V. Braverman, T. S. Jayram, S. Silwal, A. Sun, D. P. Woodruff, and S. Zhou, “The White-Box Adversarial Data Stream Model.,” in PODS, 2022.
[Bibtex]@inproceedings{podsAjtaiBJSSWZ22, author = {Mikl\'os Ajtai and Vladimir Braverman and T. S. Jayram and Sandeep Silwal and Alec Sun and David P. Woodruff and Samson Zhou}, title = {The White-Box Adversarial Data Stream Model.}, booktitle = {PODS}, year = 2022, doi = {https://doi.org/10.1145/3517804.3526228}, keywords = {} } -
D. A. Calian, F. Stimberg, O. Wiles, S. Rebuffi, A. György, T. A. Mann, and S. Gowal, “Defending Against Image Corruptions Through Adversarial Augmentations.,” in ICLR, 2022.
[Bibtex]@inproceedings{iclrCalianSWR0MG22, author = {Dan Andrei Calian and Florian Stimberg and Olivia Wiles and Sylvestre-Alvise Rebuffi and Andr\'as Gy\"orgy and Timothy A. Mann and Sven Gowal}, title = {Defending Against Image Corruptions Through Adversarial Augmentations.}, booktitle = {ICLR}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=jJOjjiZHy3h'}}, keywords = {} } -
T. Galanti, A. György, and M. Hutter, “On the Role of Neural Collapse in Transfer Learning.,” in ICLR, 2022.
[Bibtex]@inproceedings{iclrGalanti0H22, author = {Tomer Galanti and Andr\'as Gy\"orgy and Marcus Hutter}, title = {On the Role of Neural Collapse in Transfer Learning.}, booktitle = {ICLR}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=SwIp410B6aQ'}}, keywords = {} } -
G. Lugosi and G. Neu, “Generalization Bounds via Convex Analysis.,” in COLT, 2022.
[Bibtex]@inproceedings{coltLugosiN22, author = {G\'abor Lugosi and Gergely Neu}, title = {Generalization Bounds via Convex Analysis.}, booktitle = {COLT}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v178/lugosi22a.html'}}, keywords = {} } -
E. Bonnet, J. Dreier, J. Gajarský, S. Kreutzer, N. Mählmann, P. Simon, and S. Torunczyk, “Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.,” in LICS, 2022.
[Bibtex]@inproceedings{licsBonnetDGKMST22, author = {Edouard Bonnet and Jan Dreier and Jakub Gajarský and Stephan Kreutzer and Nikolas Mählmann and Pierre Simon and Szymon Torunczyk}, title = {Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.}, booktitle = {LICS}, year = 2022, doi = {https://doi.org/10.1145/3531130.3533367}, keywords = {} } -
E. Bonnet, E. J. Kim, A. Reinald, and S. Thomassé, “Twin-width VI: the lens of contraction sequences.,” in SODA, 2022.
[Bibtex]@inproceedings{sodaBonnetKRT22, author = {Edouard Bonnet and Eun Jung Kim and Amadeus Reinald and St\'ephan Thomass\'e}, title = {Twin-width VI: the lens of contraction sequences.}, booktitle = {SODA}, year = 2022, doi = {https://doi.org/10.1137/1.9781611977073.45}, keywords = {} } -
E. Bonnet, U. Giocanti, P. O. de Mendez, P. Simon, S. Thomassé, and S. Torunczyk, “Twin-width IV: ordered graphs and matrices.,” in STOC, 2022.
[Bibtex]@inproceedings{stocBonnetGMSTT22, author = {Edouard Bonnet and Ugo Giocanti and Patrice Ossona de Mendez and Pierre Simon and St\'ephan Thomass\'e and Szymon Torunczyk}, title = {Twin-width IV: ordered graphs and matrices.}, booktitle = {STOC}, year = 2022, doi = {https://doi.org/10.1145/3519935.3520037}, keywords = {} } -
Y. Liu, C. Ma, and Z. Kira, “Unbiased Teacher v2: Semi-supervised Object Detection for Anchor-free and Anchor-based Detectors.,” in CVPR, 2022.
[Bibtex]@inproceedings{cvprLiuMK22, author = {Yen-Cheng Liu and Chih-Yao Ma and Zsolt Kira}, title = {Unbiased Teacher v2: Semi-supervised Object Detection for Anchor-free and Anchor-based Detectors.}, booktitle = {CVPR}, year = 2022, doi = {https://doi.org/10.1109/CVPR52688.2022.00959}, keywords = {} } -
C. Kuo and Z. Kira, “Beyond a Pre-Trained Object Detector: Cross-Modal Textual and Visual Context for Image Captioning.,” in CVPR, 2022.
[Bibtex]@inproceedings{cvprKuoK22, author = {Chia-Wen Kuo and Zsolt Kira}, title = {Beyond a Pre-Trained Object Detector: Cross-Modal Textual and Visual Context for Image Captioning.}, booktitle = {CVPR}, year = 2022, doi = {https://doi.org/10.1109/CVPR52688.2022.01744}, keywords = {} } -
Y. Liu, C. Ma, X. Dai, J. Tian, P. Vajda, Z. He, and Z. Kira, “Open-Set Semi-Supervised Object Detection.,” in ECCV (30), 2022.
[Bibtex]@inproceedings{eccvLiuMDTVHK22, author = {Yen-Cheng Liu and Chih-Yao Ma and Xiaoliang Dai and Junjiao Tian and Peter Vajda and Zijian He and Zsolt Kira}, title = {Open-Set Semi-Supervised Object Detection.}, booktitle = {ECCV (30)}, year = 2022, doi = {https://doi.org/10.1007/978-3-031-20056-4_9}, keywords = {} } -
M. Z. Irshad, S. Zakharov, R. Ambrus, T. Kollar, Z. Kira, and A. Gaidon, “ShAPO: Implicit Representations for Multi-object Shape, Appearance, and Pose Optimization.,” in ECCV (2), 2022.
[Bibtex]@inproceedings{eccvIrshadZAKKG22, author = {Muhammad Zubair Irshad and Sergey Zakharov and Rares Ambrus and Thomas Kollar and Zsolt Kira and Adrien Gaidon}, title = {ShAPO: Implicit Representations for Multi-object Shape, Appearance, and Pose Optimization.}, booktitle = {ECCV (2)}, year = 2022, doi = {https://doi.org/10.1007/978-3-031-20086-1_16}, keywords = {} } -
K. Choromanski, H. Lin, H. Chen, T. Zhang, A. Sehanobish, V. Likhosherstov, J. Parker-Holder, T. Sarlós, A. Weller, and T. Weingarten, “From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers.,” in ICML, 2022.
[Bibtex]@inproceedings{icmlChoromanskiLCZS22, author = {Krzysztof Choromanski and Han Lin and Haoxian Chen and Tianyi Zhang and Arijit Sehanobish and Valerii Likhosherstov and Jack Parker-Holder and Tam\'as Sarl\'os and Adrian Weller and Thomas Weingarten}, title = {From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers.}, booktitle = {ICML}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v162/choromanski22a.html'}}, keywords = {} } -
E. Cohen, X. Lyu, J. Nelson, T. Sarlós, M. Shechner, and U. Stemmer, “On the Robustness of CountSketch to Adaptive Inputs.,” in ICML, 2022.
[Bibtex]@inproceedings{icmlCohen0NSSS22, author = {Edith Cohen and Xin Lyu and Jelani Nelson and Tam\'as Sarl\'os and Moshe Shechner and Uri Stemmer}, title = {On the Robustness of CountSketch to Adaptive Inputs.}, booktitle = {ICML}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v162/cohen22a.html'}}, keywords = {} } -
G. M. Berton, R. Mereu, G. Trivigno, C. Masone, G. Csurka, T. Sattler, and B. Caputo, “Deep Visual Geo-localization Benchmark.,” in CVPR, 2022.
[Bibtex]@inproceedings{cvprBertonMTMCSC22, author = {Gabriele Moreno Berton and Riccardo Mereu and Gabriele Trivigno and Carlo Masone and Gabriela Csurka and Torsten Sattler and Barbara Caputo}, title = {Deep Visual Geo-localization Benchmark.}, booktitle = {CVPR}, year = 2022, doi = {https://doi.org/10.1109/CVPR52688.2022.00532}, keywords = {} } -
R. Volpi, P. de Jorge, D. Larlus, and G. Csurka, “On the Road to Online Adaptation for Semantic Image Segmentation.,” in CVPR, 2022.
[Bibtex]@inproceedings{cvprVolpiJLC22, author = {Riccardo Volpi and Pau de Jorge and Diane Larlus and Gabriela Csurka}, title = {On the Road to Online Adaptation for Semantic Image Segmentation.}, booktitle = {CVPR}, year = 2022, doi = {https://doi.org/10.1109/CVPR52688.2022.01859}, keywords = {} } -
G. Delmas, R. S. de Rezende, G. Csurka, and D. Larlus, “ARTEMIS: Attention-based Retrieval with Text-Explicit Matching and Implicit Similarity.,” in ICLR, 2022.
[Bibtex]@inproceedings{iclrDelmasRCL22, author = {Ginger Delmas and Rafael Sampaio de Rezende and Gabriela Csurka and Diane Larlus}, title = {ARTEMIS: Attention-based Retrieval with Text-Explicit Matching and Implicit Similarity.}, booktitle = {ICLR}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=CVfLvQq9gLo'}}, keywords = {} } -
A. C. Giannopoulou, K. Kawarabayashi, S. Kreutzer, and O. Kwon, “Directed Tangle Tree-Decompositions and Applications.,” in SODA, 2022.
[Bibtex]@inproceedings{sodaGiannopoulouKKK22, author = {Archontia C. Giannopoulou and Ken-ichi Kawarabayashi and Stephan Kreutzer and O-joung Kwon}, title = {Directed Tangle Tree-Decompositions and Applications.}, booktitle = {SODA}, year = 2022, doi = {https://doi.org/10.1137/1.9781611977073.19}, keywords = {} } -
J. Pei, C. Wang, and G. Szarvas, “Transformer Uncertainty Estimation with Hierarchical Stochastic Attention.,” in AAAI, 2022.
[Bibtex]@inproceedings{aaaiPeiWS22, author = {Jiahuan Pei and Cheng Wang and Gy\"orgy Szarvas}, title = {Transformer Uncertainty Estimation with Hierarchical Stochastic Attention.}, booktitle = {AAAI}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v36i10.21364'}}, keywords = {} } -
X. Allamigeon, D. Dadush, G. Loho, B. Natura, and L. A. Végh, “Interior point methods are not worse than Simplex.,” in FOCS, 2022.
[Bibtex]@inproceedings{focsAllamigeonDLNV22, author = {Xavier Allamigeon and Daniel Dadush and Georg Loho and Bento Natura and L\'aszl\'o A. V\'egh}, title = {Interior point methods are not worse than Simplex.}, booktitle = {FOCS}, year = 2022, doi = {https://doi.org/10.1109/FOCS54457.2022.00032}, keywords = {} } -
E. Husic, G. Loho, B. Smith, and L. A. Végh, “On complete classes of valuated matroids.,” in SODA, 2022.
[Bibtex]@inproceedings{sodaHusicLSV22, author = {Edin Husic and Georg Loho and Ben Smith and L\'aszl\'o A. V\'egh}, title = {On complete classes of valuated matroids.}, booktitle = {SODA}, year = 2022, doi = {https://doi.org/10.1137/1.9781611977073.41}, keywords = {} } -
J. Garg, Y. Tao, and L. A. Végh, “Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets.,” in SODA, 2022.
[Bibtex]@inproceedings{sodaGargTV22, author = {Jugal Garg and Yixin Tao and L\'aszl\'o A. V\'egh}, title = {Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets.}, booktitle = {SODA}, year = 2022, doi = {https://doi.org/10.1137/1.9781611977073.91}, keywords = {} } -
D. Dadush, L. A. Végh, and G. Zambelli, “On finding exact solutions of linear programs in the oracle model.,” in SODA, 2022.
[Bibtex]@inproceedings{sodaDadushVZ22, author = {Daniel Dadush and L\'aszl\'o A. V\'egh and Giacomo Zambelli}, title = {On finding exact solutions of linear programs in the oracle model.}, booktitle = {SODA}, year = 2022, doi = {https://doi.org/10.1137/1.9781611977073.106}, keywords = {} } -
O. Zendel, M. Schörghuber, B. Rainer, M. Murschitz, and C. Beleznai, “Unifying Panoptic Segmentation for Autonomous Driving.,” in CVPR, 2022.
[Bibtex]@inproceedings{cvprZendelSRMB22, author = {Oliver Zendel and Matthias Sch\"orghuber and Bernhard Rainer and Markus Murschitz and Csaba Beleznai}, title = {Unifying Panoptic Segmentation for Autonomous Driving.}, booktitle = {CVPR}, year = 2022, doi = {https://doi.org/10.1109/CVPR52688.2022.02066}, keywords = {} } -
M. Massri, Z. Miklós, P. R. Parvédy, and P. Meye, “Clock-G: A temporal graph management system with space-efficient storage technique.,” in ICDE, 2022.
[Bibtex]@inproceedings{icdeMassriMPM22, author = {Maria Massri and Zolt\'an Mikl\'os and Philippe Raipin Parv\'edy and Pierre Meye}, title = {Clock-G: A temporal graph management system with space-efficient storage technique.}, booktitle = {ICDE}, year = 2022, doi = {https://doi.org/10.1109/ICDE53745.2022.00215}, keywords = {} } -
Á. Cseh, T. Friedrich, and J. Peters, “Pareto Optimal and Popular House Allocation with Lower and Upper Quotas.,” in AAMAS, 2022.
[Bibtex]@inproceedings{atalCseh0022, author = {\'Agnes Cseh and Tobias Friedrich and Jannik Peters}, title = {Pareto Optimal and Popular House Allocation with Lower and Upper Quotas.}, booktitle = {AAMAS}, year = 2022, doi = {[{'@type': 'oa', '#text': 'https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p300.pdf'}, 'https://dl.acm.org/doi/10.5555/3535850.3535885']}, keywords = {} } -
Á. Cseh and J. Peters, “Three-Dimensional Popular Matching with Cyclic Preferences.,” in AAMAS, 2022.
[Bibtex]@inproceedings{atalCseh022, author = {\'Agnes Cseh and Jannik Peters}, title = {Three-Dimensional Popular Matching with Cyclic Preferences.}, booktitle = {AAMAS}, year = 2022, doi = {[{'@type': 'oa', '#text': 'https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p309.pdf'}, 'https://dl.acm.org/doi/10.5555/3535850.3535886']}, keywords = {} } -
B. Rozemberczki, S. Bonner, A. Nikolov, M. Ughetto, S. Nilsson, and E. Papa, “A Unified View of Relational Deep Learning for Drug Pair Scoring.,” in IJCAI, 2022.
[Bibtex]@inproceedings{ijcaiRozemberczkiBNU22, author = {Benedek Rozemberczki and Stephen Bonner and Andriy Nikolov and Michaël Ughetto and Sebastian Nilsson and Eliseo Papa}, title = {A Unified View of Relational Deep Learning for Drug Pair Scoring.}, booktitle = {IJCAI}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2022/777'}}, keywords = {} } -
B. Rozemberczki, L. Watson, P. Bayer, H. Yang, O. Kiss, S. Nilsson, and R. Sarkar, “The Shapley Value in Machine Learning.,” in IJCAI, 2022.
[Bibtex]@inproceedings{ijcaiRozemberczkiWBY22, author = {Benedek Rozemberczki and Lauren Watson and P\'eter Bayer and Hao-Tsung Yang and Oliver Kiss and Sebastian Nilsson and Rik Sarkar}, title = {The Shapley Value in Machine Learning.}, booktitle = {IJCAI}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2022/778'}}, keywords = {} } -
B. Rozemberczki, C. T. Hoyt, A. Gogleva, P. Grabowski, K. Karis, A. Lamov, A. Nikolov, S. Nilsson, M. Ughetto, Y. Wang, T. Derr, and B. M. Gyori, “ChemicalX: A Deep Learning Library for Drug Pair Scoring.,” in KDD, 2022.
[Bibtex]@inproceedings{kddRozemberczkiHGG22, author = {Benedek Rozemberczki and Charles Tapley Hoyt and Anna Gogleva and Piotr Grabowski and Klas Karis and Andrej Lamov and Andriy Nikolov and Sebastian Nilsson and Michaël Ughetto and Yu Wang and Tyler Derr and Benjamin M. Gyori}, title = {ChemicalX: A Deep Learning Library for Drug Pair Scoring.}, booktitle = {KDD}, year = 2022, doi = {['https://doi.org/10.1145/3534678.3539023', 'https://www.wikidata.org/entity/Q118774118']}, keywords = {} } -
H. Xia, D. Zhang, W. Liu, I. Haller, B. Sherwin, and D. Chisnall, “A Secret-Free Hypervisor: Rethinking Isolation in the Age of Speculative Vulnerabilities.,” in SP, 2022.
[Bibtex]@inproceedings{spXiaZLHSC22, author = {Hongyan Xia and David Zhang and Wei Liu and Istv\'an Haller and Bruce Sherwin and David Chisnall}, title = {A Secret-Free Hypervisor: Rethinking Isolation in the Age of Speculative Vulnerabilities.}, booktitle = {SP}, year = 2022, doi = {https://doi.org/10.1109/SP46214.2022.9833726}, keywords = {} } -
J. Gaudio, M. Z. Rácz, and A. Sridhar, “Exact Community Recovery in Correlated Stochastic Block Models.,” in COLT, 2022.
[Bibtex]@inproceedings{coltGaudioRS22, author = {Julia Gaudio and Mikl\'os Z. R\'acz and Anirudh Sridhar}, title = {Exact Community Recovery in Correlated Stochastic Block Models.}, booktitle = {COLT}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v178/gaudio22a.html'}}, keywords = {} } -
G. Flamich, S. Markou, and J. M. Hernández-Lobato, “Fast Relative Entropy Coding with A* coding.,” in ICML, 2022.
[Bibtex]@inproceedings{icmlFlamichMH22, author = {Gergely Flamich and Stratis Markou and Jos\'e Miguel Hern\'andez-Lobato}, title = {Fast Relative Entropy Coding with A* coding.}, booktitle = {ICML}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v162/flamich22a.html'}}, keywords = {} } -
D. Rozenberszki, O. Litany, and A. Dai, “Language-Grounded Indoor 3D Semantic Segmentation in the Wild.,” in ECCV (33), 2022.
[Bibtex]@inproceedings{eccvRozenberszkiLD22, author = {D\'avid Rozenberszki and Or Litany and Angela Dai}, title = {Language-Grounded Indoor 3D Semantic Segmentation in the Wild.}, booktitle = {ECCV (33)}, year = 2022, doi = {https://doi.org/10.1007/978-3-031-19827-4_8}, keywords = {} } -
M. Erdős, S. Ainsworth, and T. M. Jones, “MineSweeper: a "clean sweep" for drop-in use-after-free prevention.,” in ASPLOS, 2022.
[Bibtex]@inproceedings{asplosErdosA022, author = {M\'arton Erd\H{o}s and Sam Ainsworth and Timothy M. Jones}, title = {MineSweeper: a "clean sweep" for drop-in use-after-free prevention.}, booktitle = {ASPLOS}, year = 2022, doi = {['https://doi.org/10.1145/3503222.3507712', 'https://www.wikidata.org/entity/Q131132582']}, keywords = {} } -
M. Böhme, L. Szekeres, and J. Metzman, “On the Reliability of Coverage-Based Fuzzer Benchmarking.,” in ICSE, 2022.
[Bibtex]@inproceedings{icseBohmeSM22, author = {Marcel B\"ohme and L\'aszl\'o Szekeres and Jonathan Metzman}, title = {On the Reliability of Coverage-Based Fuzzer Benchmarking.}, booktitle = {ICSE}, year = 2022, doi = {https://doi.org/10.1145/3510003.3510230}, keywords = {} } -
O. Pastor-Serrano and Z. Perkó, “Learning the Physics of Particle Transport via Transformers.,” in AAAI, 2022.
[Bibtex]@inproceedings{aaaiPastor-SerranoP22, author = {Oscar Pastor-Serrano and Zolt\'an Perk\'o}, title = {Learning the Physics of Particle Transport via Transformers.}, booktitle = {AAAI}, year = 2022, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v36i11.21466'}}, keywords = {} }
2021
-
D. Marx, “Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction.,” in PODS, 2021.
[Bibtex]@inproceedings{podsMarx21, author = {D\'aniel Marx}, title = {Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction.}, booktitle = {PODS}, year = 2021, doi = {['https://doi.org/10.1145/3452021.3458814', 'https://www.wikidata.org/entity/Q130820824']}, keywords = {} } -
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. Kirschner, T. Lattimore, C. Vernade, and C. Szepesvári, “Asymptotically Optimal Information-Directed Sampling.,” in COLT, 2021.
[Bibtex]@inproceedings{coltKirschnerLVS21, author = {Johannes Kirschner and Tor Lattimore and Claire Vernade and Csaba Szepesv\'ari}, title = {Asymptotically Optimal Information-Directed Sampling.}, booktitle = {COLT}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v134/kirschner21a.html'}}, keywords = {} } -
I. Kuzborskij and C. Szepesvári, “Nonparametric Regression with Shallow Overparameterized Neural Networks Trained by GD with Early Stopping.,” in COLT, 2021.
[Bibtex]@inproceedings{coltKuzborskijS21, author = {Ilja Kuzborskij and Csaba Szepesv\'ari}, title = {Nonparametric Regression with Shallow Overparameterized Neural Networks Trained by GD with Early Stopping.}, booktitle = {COLT}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v134/kuzborskij21a.html'}}, keywords = {} } -
G. Weisz, P. Amortila, B. Janzer, Y. Abbasi-Yadkori, N. Jiang, and C. Szepesvári, “On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function.,” in COLT, 2021.
[Bibtex]@inproceedings{coltWeiszAJAJS21, author = {Gell\'ert Weisz and Philip Amortila and Barnab\'as Janzer and Yasin Abbasi-Yadkori and Nan Jiang and Csaba Szepesv\'ari}, title = {On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function.}, booktitle = {COLT}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v134/weisz21a.html'}}, keywords = {} } -
D. Zhou, Q. Gu, and C. Szepesvári, “Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes.,” in COLT, 2021.
[Bibtex]@inproceedings{coltZhouGS21, author = {Dongruo Zhou and Quanquan Gu and Csaba Szepesv\'ari}, title = {Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes.}, booktitle = {COLT}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v134/zhou21a.html'}}, keywords = {} } -
B. Hao, Y. Duan, T. Lattimore, C. Szepesvári, and M. Wang, “Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient.,” in ICML, 2021.
[Bibtex]@inproceedings{icmlHaoDLSW21, author = {Botao Hao and Yaqi Duan and Tor Lattimore and Csaba Szepesv\'ari and Mengdi Wang}, title = {Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/hao21a.html'}}, keywords = {} } -
B. Hao, X. Ji, Y. Duan, H. Lu, C. Szepesvári, and M. Wang, “Bootstrapping Fitted Q-Evaluation for Off-Policy Inference.,” in ICML, 2021.
[Bibtex]@inproceedings{icmlHaoJDLSW21, author = {Botao Hao and Xiang Ji and Yaqi Duan and Hao Lu and Csaba Szepesv\'ari and Mengdi Wang}, title = {Bootstrapping Fitted Q-Evaluation for Off-Policy Inference.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/hao21b.html'}}, keywords = {} } -
M. Konobeev, I. Kuzborskij, and C. Szepesvári, “A Distribution-dependent Analysis of Meta Learning.,” in ICML, 2021.
[Bibtex]@inproceedings{icmlKonobeevKS21, author = {Mikhail Konobeev and Ilja Kuzborskij and Csaba Szepesv\'ari}, title = {A Distribution-dependent Analysis of Meta Learning.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/konobeev21a.html'}}, keywords = {} } -
B. Kveton, M. Konobeev, M. Zaheer, C. Hsu, M. Mladenov, C. Boutilier, and C. Szepesvári, “Meta-Thompson Sampling.,” in ICML, 2021.
[Bibtex]@inproceedings{icmlKvetonKZHMBS21, author = {Branislav Kveton and Mikhail Konobeev and Manzil Zaheer and Chih-Wei Hsu and Martin Mladenov and Craig Boutilier and Csaba Szepesv\'ari}, title = {Meta-Thompson Sampling.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/kveton21a.html'}}, keywords = {} } -
N. Lazic, D. Yin, Y. Abbasi-Yadkori, and C. Szepesvári, “Improved Regret Bound and Experience Replay in Regularized Policy Iteration.,” in ICML, 2021.
[Bibtex]@inproceedings{icmlLazicYAS21, author = {Nevena Lazic and Dong Yin and Yasin Abbasi-Yadkori and Csaba Szepesv\'ari}, title = {Improved Regret Bound and Experience Replay in Regularized Policy Iteration.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/lazic21a.html'}}, keywords = {} } -
J. Mei, Y. Gao, B. Dai, C. Szepesvári, and D. Schuurmans, “Leveraging Non-uniformity in First-order Non-convex Optimization.,” in ICML, 2021.
[Bibtex]@inproceedings{icmlMeiGDSS21, author = {Jincheng Mei and Yue Gao and Bo Dai and Csaba Szepesv\'ari and Dale Schuurmans}, title = {Leveraging Non-uniformity in First-order Non-convex Optimization.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/mei21a.html'}}, keywords = {} } -
C. Xiao, Y. Wu, J. Mei, B. Dai, T. Lattimore, L. Li, C. Szepesvári, and D. Schuurmans, “On the Optimality of Batch Policy Optimization Algorithms.,” in ICML, 2021.
[Bibtex]@inproceedings{icmlXiaoWMDL0SS21, author = {Chenjun Xiao and Yifan Wu and Jincheng Mei and Bo Dai and Tor Lattimore and Lihong Li and Csaba Szepesv\'ari and Dale Schuurmans}, title = {On the Optimality of Batch Policy Optimization Algorithms.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/xiao21b.html'}}, keywords = {} } -
Y. Ding, D. Baráth, J. Yang, H. Kong, and Z. Kukelova, “Globally Optimal Relative Pose Estimation With Gravity Prior.,” in CVPR, 2021.
[Bibtex]@inproceedings{cvprDingB0KK21, author = {Yaqing Ding and D\'aniel Bar\'ath and Jian Yang and Hui Kong and Zuzana Kukelova}, title = {Globally Optimal Relative Pose Estimation With Gravity Prior.}, booktitle = {CVPR}, year = 2021, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2021/html/Ding_Globally_Optimal_Relative_Pose_Estimation_With_Gravity_Prior_CVPR_2021_paper.html'}, 'https://doi.org/10.1109/CVPR46437.2021.00046']}, keywords = {} } -
D. Baráth, D. Mishkin, I. Eichhardt, I. Shipachev, and J. Matas, “Efficient Initial Pose-Graph Generation for Global SfM.,” in CVPR, 2021.
[Bibtex]@inproceedings{cvprBarathMESM21, author = {D\'aniel Bar\'ath 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} } -
Y. Ding, D. Baráth, and Z. Kukelova, “Minimal Solutions for Panoramic Stitching Given Gravity Prior.,” in ICCV, 2021.
[Bibtex]@inproceedings{iccvDingBK21, author = {Yaqing Ding and D\'aniel Bar\'ath and Zuzana Kukelova}, title = {Minimal Solutions for Panoramic Stitching Given Gravity Prior.}, booktitle = {ICCV}, year = 2021, doi = {https://doi.org/10.1109/ICCV48922.2021.00553}, keywords = {} } -
S. Bhayani, T. Sattler, D. Baráth, P. Beliansky, J. Heikkilä, and Z. Kukelova, “Calibrated and Partially Calibrated Semi-Generalized Homographies.,” in ICCV, 2021.
[Bibtex]@inproceedings{iccvBhayaniSBBHK21, author = {Snehal Bhayani and Torsten Sattler and D\'aniel Bar\'ath and Patrik Beliansky and Janne Heikkilä and Zuzana Kukelova}, title = {Calibrated and Partially Calibrated Semi-Generalized Homographies.}, booktitle = {ICCV}, year = 2021, doi = {https://doi.org/10.1109/ICCV48922.2021.00588}, keywords = {} } -
B. Guan, J. Zhao, D. Baráth, and F. Fraundorfer, “Minimal Cases for Computing the Generalized Relative Pose using Affine Correspondences.,” in ICCV, 2021.
[Bibtex]@inproceedings{iccvGuan0BF21, author = {Banglei Guan and Ji Zhao and D\'aniel Bar\'ath and Friedrich Fraundorfer}, title = {Minimal Cases for Computing the Generalized Relative Pose using Affine Correspondences.}, booktitle = {ICCV}, year = 2021, doi = {https://doi.org/10.1109/ICCV48922.2021.00601}, keywords = {} } -
M. Ivashechkin, D. Baráth, and J. Matas, “VSAC: Efficient and Accurate Estimator for H and F.,” in ICCV, 2021.
[Bibtex]@inproceedings{iccvIvashechkinBM21, author = {Maksym Ivashechkin and D\'aniel Bar\'ath and Jir\'i Matas}, title = {VSAC: Efficient and Accurate Estimator for H and F.}, booktitle = {ICCV}, year = 2021, doi = {https://doi.org/10.1109/ICCV48922.2021.01496}, keywords = {} } -
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} } -
A. Epasto, A. M. Medina, S. Avery, Y. Bai, R. Busa-Fekete, C. Carey, Y. Gao, D. Guthrie, S. Ghosh, J. Ioannidis, J. Jiao, J. Lacki, J. Lee, A. Mauser, B. Milch, V. S. Mirrokni, D. Ravichandran, W. Shi, M. Spero, Y. Sun, U. Syed, S. Vassilvitskii, and S. Wang, “Clustering for Private Interest-based Advertising.,” in KDD, 2021.
[Bibtex]@inproceedings{kddEpastoMABBCGGGI21, author = {Alessandro Epasto and Andr\'es Muñoz Medina and Steven Avery and Yijian Bai and R\'obert Busa-Fekete and CJ Carey and Ya Gao and David Guthrie and Subham Ghosh and James Ioannidis and Junyi Jiao and Jakub Lacki and Jason Lee and Arne Mauser and Brian Milch and Vahab S. Mirrokni and Deepak Ravichandran and Wei Shi and Max Spero and Yunting Sun and Umar Syed and Sergei Vassilvitskii and Shuo Wang}, title = {Clustering for Private Interest-based Advertising.}, booktitle = {KDD}, year = 2021, doi = {['https://doi.org/10.1145/3447548.3467180', 'https://www.wikidata.org/entity/Q131136488']}, keywords = {} } -
D. C. Jean, G. Stein, and Á. Lédeczi, “Hands-On IoT Education with Mobile Devices: Demo Abstract.,” in IPSN, 2021.
[Bibtex]@inproceedings{ipsnJeanSL21, author = {Devin C. Jean and Gordon Stein and \'Akos L\'edeczi}, title = {Hands-On IoT Education with Mobile Devices: Demo Abstract.}, booktitle = {IPSN}, year = 2021, doi = {https://doi.org/10.1145/3412382.3458778}, keywords = {} } -
G. Stein, D. C. Jean, and Á. Lédeczi, “Distributed Virtual CPS Environment for K12: Demo Abstract.,” in IPSN, 2021.
[Bibtex]@inproceedings{ipsnSteinJL21, author = {Gordon Stein and Devin C. Jean and \'Akos L\'edeczi}, title = {Distributed Virtual CPS Environment for K12: Demo Abstract.}, booktitle = {IPSN}, year = 2021, doi = {['https://doi.org/10.1145/3412382.3458780', 'https://www.wikidata.org/entity/Q130891551']}, keywords = {} } -
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. Curticapean, “A full complexity dichotomy for immanant families.,” in STOC, 2021.
[Bibtex]@inproceedings{stocCurticapean21, author = {Radu Curticapean}, title = {A full complexity dichotomy for immanant families.}, booktitle = {STOC}, year = 2021, doi = {https://doi.org/10.1145/3406325.3451124}, keywords = {} } -
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} } -
G. Stoica, E. A. Platanios, and B. Póczos, “Re-TACRED: Addressing Shortcomings of the TACRED Dataset.,” in AAAI, 2021.
[Bibtex]@inproceedings{aaaiStoicaPP21, author = {George Stoica and Emmanouil Antonios Platanios and Barnab\'as P\'oczos}, title = {Re-TACRED: Addressing Shortcomings of the TACRED Dataset.}, booktitle = {AAAI}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v35i15.17631'}}, keywords = {} } -
C. Zhou, C. Li, and B. Póczos, “Unsupervised program synthesis for images by sampling without replacement.,” in UAI, 2021.
[Bibtex]@inproceedings{uaiZhouLP21, author = {Chenghui Zhou and Chun-Liang Li and Barnab\'as P\'oczos}, title = {Unsupervised program synthesis for images by sampling without replacement.}, booktitle = {UAI}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://proceedings.mlr.press/v161/zhou21b.html'}}, keywords = {} } -
N. Elad, S. Rain, N. Immerman, L. Kovács, and M. Sagiv, “Summing up Smart Transitions.,” in CAV (1), 2021.
[Bibtex]@inproceedings{cavEladRIKS21, author = {Neta Elad and Sophie Rain and Neil Immerman and Laura Kov\'acs and Mooly Sagiv}, title = {Summing up Smart Transitions.}, booktitle = {CAV (1)}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-030-81685-8_15'}}, keywords = {} } -
T. Lattimore and A. György, “Improved Regret for Zeroth-Order Stochastic Convex Bandits.,” in COLT, 2021.
[Bibtex]@inproceedings{coltLattimore021, author = {Tor Lattimore and Andr\'as Gy\"orgy}, title = {Improved Regret for Zeroth-Order Stochastic Convex Bandits.}, booktitle = {COLT}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v134/lattimore21a.html'}}, keywords = {} } -
T. Lattimore and A. György, “Mirror Descent and the Information Ratio.,” in COLT, 2021.
[Bibtex]@inproceedings{coltLattimore021a, author = {Tor Lattimore and Andr\'as Gy\"orgy}, title = {Mirror Descent and the Information Ratio.}, booktitle = {COLT}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v134/lattimore21b.html'}}, keywords = {} } -
A. György and P. Joulani, “Adapting to Delays and Data in Adversarial Multi-Armed Bandits.,” in ICML, 2021.
[Bibtex]@inproceedings{icml0001J21, author = {Andr\'as Gy\"orgy and Pooria Joulani}, title = {Adapting to Delays and Data in Adversarial Multi-Armed Bandits.}, booktitle = {ICML}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v139/gyorgy21a.html'}}, keywords = {} } -
T. Lee, M. Santha, and S. Zhang, “Quantum algorithms for graph problems with cut queries.,” in SODA, 2021.
[Bibtex]@inproceedings{sodaLeeSZ21, author = {Troy Lee and Miklos Santha and Shengyu Zhang}, title = {Quantum algorithms for graph problems with cut queries.}, booktitle = {SODA}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611976465.59'}}, keywords = {} } -
B. Kégl, G. Hurtado, and A. Thomas, “Model-based micro-data reinforcement learning: what are the crucial model properties and which model to choose?,” in ICLR, 2021.
[Bibtex]@inproceedings{iclrKeglHT21, author = {Bal\'azs K\'egl and Gabriel Hurtado and Albert Thomas}, title = {Model-based micro-data reinforcement learning: what are the crucial model properties and which model to choose?}, booktitle = {ICLR}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=p5uylG94S68'}}, keywords = {} } -
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} } -
G. Neu, “Information-Theoretic Generalization Bounds for Stochastic Gradient Descent.,” in COLT, 2021.
[Bibtex]@inproceedings{coltNeu21, author = {Gergely Neu}, title = {Information-Theoretic Generalization Bounds for Stochastic Gradient Descent.}, booktitle = {COLT}, year = 2021, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v134/neu21a.html'}}, keywords = {} } -
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} } -
E. Bonnet, C. Geniet, E. J. Kim, S. Thomassé, and R. Watrigant, “Twin-width II: small classes.,” in SODA, 2021.
[Bibtex]@inproceedings{sodaBonnetGKTW21, author = {Edouard Bonnet and Colin Geniet and Eun Jung Kim and St\'ephan Thomass\'e and R\'emi Watrigant}, title = {Twin-width II: small classes.}, booktitle = {SODA}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611976465.118'}}, keywords = {} } -
F. Wen, E. Aghajani, C. Nagy, M. Lanza, and G. Bavota, “Siri, Write the Next Method.,” in ICSE, 2021.
[Bibtex]@inproceedings{icseWenA0LB21, author = {Fengcai Wen and Emad Aghajani and Csaba Nagy and Michele Lanza and Gabriele Bavota}, title = {Siri, Write the Next Method.}, booktitle = {ICSE}, year = 2021, doi = {https://doi.org/10.1109/ICSE43902.2021.00025}, keywords = {} } -
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. S. Smith, Y. Hsu, J. Balloch, Y. Shen, H. Jin, and Z. Kira, “Always Be Dreaming: A New Approach for Data-Free Class-Incremental Learning.,” in ICCV, 2021.
[Bibtex]@inproceedings{iccvSmithHBSJK21, author = {James Seale Smith and Yen-Chang Hsu and Jonathan Balloch and Yilin Shen and Hongxia Jin and Zsolt Kira}, title = {Always Be Dreaming: A New Approach for Data-Free Class-Incremental Learning.}, booktitle = {ICCV}, year = 2021, doi = {https://doi.org/10.1109/ICCV48922.2021.00924}, keywords = {} } -
Y. Liu, C. Ma, Z. He, C. Kuo, K. Chen, P. Zhang, B. Wu, Z. Kira, and P. Vajda, “Unbiased Teacher for Semi-Supervised Object Detection.,” in ICLR, 2021.
[Bibtex]@inproceedings{iclrLiuMHKCZWKV21, author = {Yen-Cheng Liu and Chih-Yao Ma and Zijian He and Chia-Wen Kuo and Kan Chen and Peizhao Zhang and Bichen Wu and Zsolt Kira and Peter Vajda}, title = {Unbiased Teacher for Semi-Supervised Object Detection.}, booktitle = {ICLR}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=MJIve1zgR_'}}, keywords = {} } -
K. M. Choromanski, V. Likhosherstov, D. Dohan, X. Song, A. Gane, T. Sarlós, P. Hawkins, J. Q. Davis, A. Mohiuddin, L. Kaiser, D. B. Belanger, L. J. Colwell, and A. Weller, “Rethinking Attention with Performers.,” in ICLR, 2021.
[Bibtex]@inproceedings{iclrChoromanskiLDSG21, author = {Krzysztof Marcin Choromanski and Valerii Likhosherstov and David Dohan and Xingyou Song and Andreea Gane and Tam\'as Sarl\'os and Peter Hawkins and Jared Quincy Davis and Afroz Mohiuddin and Lukasz Kaiser and David Benjamin Belanger and Lucy J. Colwell and Adrian Weller}, title = {Rethinking Attention with Performers.}, booktitle = {ICLR}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=Ua6zuk0WRH'}}, keywords = {} } -
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 = {} } -
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 = {} } -
D. Lee, S. Ryu, S. Yeon, Y. Lee, D. Kim, C. Han, Y. Cabon, P. Weinzaepfel, N. Guérin, G. Csurka, and M. Humenberger, “Large-Scale Localization Datasets in Crowded Indoor Spaces.,” in CVPR, 2021.
[Bibtex]@inproceedings{cvprLeeRYLKHCWGCH21, author = {Donghwan Lee and Soo-Hyun Ryu and Suyong Yeon and Yonghan Lee and Deokhwa Kim and Cheolho Han and Yohann Cabon and Philippe Weinzaepfel and Nicolas Gu\'erin and Gabriela Csurka and Martin Humenberger}, title = {Large-Scale Localization Datasets in Crowded Indoor Spaces.}, booktitle = {CVPR}, year = 2021, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2021/html/Lee_Large-Scale_Localization_Datasets_in_Crowded_Indoor_Spaces_CVPR_2021_paper.html'}, 'https://doi.org/10.1109/CVPR46437.2021.00324']}, keywords = {} } -
R. Venkatesh, T. Karmali, S. Sharma, A. Ghosh, V. R. Babu, L. A. Jeni, and M. Singh, “Deep Implicit Surface Point Prediction Networks.,” in ICCV, 2021.
[Bibtex]@inproceedings{iccvVenkateshKSGBJ021, author = {Rahul Venkatesh and Tejan Karmali and Sarthak Sharma and Aurobrata Ghosh and R. Venkatesh Babu and L\'aszl\'o A. Jeni and Maneesh Singh}, title = {Deep Implicit Surface Point Prediction Networks.}, booktitle = {ICCV}, year = 2021, doi = {https://doi.org/10.1109/ICCV48922.2021.01242}, keywords = {} } -
S. Erdweg, T. Szabó, and A. Pacak, “Concise, type-safe, and efficient structural diffing.,” in PLDI, 2021.
[Bibtex]@inproceedings{pldiErdwegSP21, author = {Sebastian Erdweg and Tam\'as Szab\'o and Andr\'e Pacak}, title = {Concise, type-safe, and efficient structural diffing.}, booktitle = {PLDI}, year = 2021, doi = {https://doi.org/10.1145/3453483.3454052}, keywords = {} } -
A. Gilyén, M. B. Hastings, and U. V. Vazirani, “(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem.,” in STOC, 2021.
[Bibtex]@inproceedings{stocGilyenHV21, author = {Andr\'as Gily\'en and Matthew B. Hastings and Umesh V. Vazirani}, title = {(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem.}, booktitle = {STOC}, year = 2021, doi = {['https://doi.org/10.1145/3406325.3451060', 'https://www.wikidata.org/entity/Q130910727']}, keywords = {} } -
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} } -
J. B. Orlin and L. A. Végh, “Directed Shortest Paths via Approximate Cost Balancing.,” in SODA, 2021.
[Bibtex]@inproceedings{sodaOrlinV21, author = {James B. Orlin and L\'aszl\'o A. V\'egh}, title = {Directed Shortest Paths via Approximate Cost Balancing.}, booktitle = {SODA}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611976465.16'}}, keywords = {} } -
J. Garg, E. Husic, and L. A. Végh, “Approximating Nash social welfare under rado valuations.,” in STOC, 2021.
[Bibtex]@inproceedings{stocGargHV21, author = {Jugal Garg and Edin Husic and L\'aszl\'o A. V\'egh}, title = {Approximating Nash social welfare under rado valuations.}, booktitle = {STOC}, year = 2021, doi = {https://doi.org/10.1145/3406325.3451031}, keywords = {} } -
S. Kisfaludi-Bak, J. Nederlof, and K. Wegrzycki, “A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.,” in FOCS, 2021.
[Bibtex]@inproceedings{focsKisfaludi-BakNW21, author = {S\'andor Kisfaludi-Bak and Jesper Nederlof and Karol Wegrzycki}, title = {A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.}, booktitle = {FOCS}, year = 2021, doi = {['https://doi.org/10.1109/FOCS52979.2021.00043', 'https://www.wikidata.org/entity/Q112313928']}, keywords = {} } -
S. Han, T. Jager, E. Kiltz, S. Liu, J. Pan, D. Riepel, and S. Schäge, “Authenticated Key Exchange and Signatures with Tight Security in the Standard Model.,” in CRYPTO (4), 2021.
[Bibtex]@inproceedings{cryptoHanJKLPRS21, author = {Shuai Han and Tibor Jager and Eike Kiltz and Shengli Liu and Jiaxin Pan and Doreen Riepel and Sven Schäge}, title = {Authenticated Key Exchange and Signatures with Tight Security in the Standard Model.}, booktitle = {CRYPTO (4)}, year = 2021, doi = {['https://doi.org/10.1007/978-3-030-84259-8_23', 'https://www.wikidata.org/entity/Q126176071']}, keywords = {} } -
H. Aziz, Á. Cseh, J. P. Dickerson, and D. C. McElfresh, “Optimal Kidney Exchange with Immunosuppressants.,” in AAAI, 2021.
[Bibtex]@inproceedings{aaai0001CDM21, author = {Haris Aziz and \'Agnes Cseh and John P. Dickerson and Duncan C. McElfresh}, title = {Optimal Kidney Exchange with Immunosuppressants.}, booktitle = {AAAI}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v35i1.16073'}}, keywords = {} } -
H. Aziz, H. Chan, Á. Cseh, B. Li, F. Ramezani, and C. Wang, “Multi-Robot Task Allocation-Complexity and Approximation.,” in AAMAS, 2021.
[Bibtex]@inproceedings{atal0001CC0RW21, author = {Haris Aziz and Hau Chan and \'Agnes Cseh and Bo Li and Fahimeh Ramezani and Chenhao Wang}, title = {Multi-Robot Task Allocation-Complexity and Approximation.}, booktitle = {AAMAS}, year = 2021, doi = {[{'@type': 'oa', '#text': 'https://www.ifaamas.org/Proceedings/aamas2021/pdfs/p133.pdf'}, 'https://dl.acm.org/doi/10.5555/3463952.3463974']}, keywords = {} } -
S. Kraiczy, Á. Cseh, and D. F. Manlove, “On Weakly and Strongly Popular Rankings.,” in AAMAS, 2021.
[Bibtex]@inproceedings{atalKraiczyCM21, author = {Sonja Kraiczy and \'Agnes Cseh and David F. Manlove}, title = {On Weakly and Strongly Popular Rankings.}, booktitle = {AAMAS}, year = 2021, doi = {[{'@type': 'oa', '#text': 'https://www.ifaamas.org/Proceedings/aamas2021/pdfs/p1563.pdf'}, 'https://dl.acm.org/doi/10.5555/3463952.3464160']}, keywords = {} } -
E. D. Brouwer, A. Arany, J. Simm, and Y. Moreau, “Latent Convergent Cross Mapping.,” in ICLR, 2021.
[Bibtex]@inproceedings{iclrBrouwerASM21, author = {Edward De Brouwer and Adam Arany and Jaak Simm and Yves Moreau}, title = {Latent Convergent Cross Mapping.}, booktitle = {ICLR}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=4TSiOTkKe5P'}}, keywords = {} } -
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} } -
T. Miltzow and R. F. Schmiermann, “On Classifying Continuous Constraint Satisfaction problems.,” in FOCS, 2021.
[Bibtex]@inproceedings{focsMiltzowS21, author = {Tillmann Miltzow and Reinier F. Schmiermann}, title = {On Classifying Continuous Constraint Satisfaction problems.}, booktitle = {FOCS}, year = 2021, doi = {https://doi.org/10.1109/FOCS52979.2021.00081}, keywords = {} } -
B. Rozemberczki, P. Englert, A. Kapoor, M. Blais, and B. Perozzi, “Pathfinder Discovery Networks for Neural Message Passing.,” in WWW, 2021.
[Bibtex]@inproceedings{wwwRozemberczkiEKB21, author = {Benedek Rozemberczki and Peter Englert and Amol Kapoor and Martin Blais and Bryan Perozzi}, title = {Pathfinder Discovery Networks for Neural Message Passing.}, booktitle = {WWW}, year = 2021, doi = {https://doi.org/10.1145/3442381.3449882}, keywords = {} } -
P. Karkus, S. Cai, and D. Hsu, “Differentiable SLAM-Net: Learning Particle SLAM for Visual Navigation.,” in CVPR, 2021.
[Bibtex]@inproceedings{cvprKarkusCH21, author = {P\'eter Karkus and Shaojun Cai and David Hsu}, title = {Differentiable SLAM-Net: Learning Particle SLAM for Visual Navigation.}, booktitle = {CVPR}, year = 2021, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content/CVPR2021/html/Karkus_Differentiable_SLAM-Net_Learning_Particle_SLAM_for_Visual_Navigation_CVPR_2021_paper.html'}, 'https://doi.org/10.1109/CVPR46437.2021.00284']}, keywords = {} } -
D. Ádám. Lelkes, V. Q. Tran, and C. Yu, “Quiz-Style Question Generation for News Stories.,” in WWW, 2021.
[Bibtex]@inproceedings{wwwLelkesTY21, author = {\'Ad\'am D\'aniel Lelkes and Vinh Q. Tran and Cong Yu}, title = {Quiz-Style Question Generation for News Stories.}, booktitle = {WWW}, year = 2021, doi = {https://doi.org/10.1145/3442381.3449892}, keywords = {} } -
T. Schneider, R. Birkner, and L. Vanbever, “Snowcap: synthesizing network-wide configuration updates.,” in SIGCOMM, 2021.
[Bibtex]@inproceedings{sigcommSchneiderBV21, author = {Tibor Schneider and R\"udiger Birkner and Laurent Vanbever}, title = {Snowcap: synthesizing network-wide configuration updates.}, booktitle = {SIGCOMM}, year = 2021, doi = {https://doi.org/10.1145/3452296.3472915}, keywords = {} } -
T. Moskovitz, M. Arbel, F. Huszar, and A. Gretton, “Efficient Wasserstein Natural Gradients for Reinforcement Learning.,” in ICLR, 2021.
[Bibtex]@inproceedings{iclrMoskovitzAHG21, author = {Ted Moskovitz and Michael Arbel and Ferenc Huszar and Arthur Gretton}, title = {Efficient Wasserstein Natural Gradients for Reinforcement Learning.}, booktitle = {ICLR}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=OHgnfSrn2jv'}}, keywords = {} } -
B. F. Mezei, M. Wrochna, and S. Zivný, “PTAS for Sparse General-Valued CSPs.,” in LICS, 2021.
[Bibtex]@inproceedings{licsMezeiWZ21, author = {Bal\'azs F. Mezei and Marcin Wrochna and Stanislav Zivný}, title = {PTAS for Sparse General-Valued CSPs.}, booktitle = {LICS}, year = 2021, doi = {https://doi.org/10.1109/LICS52264.2021.9470599}, keywords = {} } -
D. Tsarkov, T. Tihon, N. Scales, N. Momchev, D. Sinopalnikov, and N. Schärli, “*-CFQ: Analyzing the Scalability of Machine Learning on a Compositional Task.,” in AAAI, 2021.
[Bibtex]@inproceedings{aaaiTsarkovTSMSS21, author = {Dmitry Tsarkov and Tibor Tihon and Nathan Scales and Nikola Momchev and Danila Sinopalnikov and Nathanael Schärli}, title = {*-CFQ: Analyzing the Scalability of Machine Learning on a Compositional Task.}, booktitle = {AAAI}, year = 2021, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v35i11.17195'}}, keywords = {} } -
A. Shukla, K. N. Hudemann, Z. Vági, L. Hügerich, G. Smaragdakis, A. Hecker, S. Schmid, and A. Feldmann, “Fix with P6: Verifying Programmable Switches at Runtime.,” in INFOCOM, 2021.
[Bibtex]@inproceedings{infocomShuklaHVHSH0F21, author = {Apoorv Shukla and Kevin Nico Hudemann and Zsolt V\'agi and Lily H\"ugerich and Georgios Smaragdakis and Artur Hecker and Stefan Schmid and Anja Feldmann}, title = {Fix with P6: Verifying Programmable Switches at Runtime.}, booktitle = {INFOCOM}, year = 2021, doi = {https://doi.org/10.1109/INFOCOM42981.2021.9488772}, keywords = {} }
2020
-
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} } -
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} } -
T. Lattimore and C. Szepesvári, “Exploration by Optimisation in Partial Monitoring.,” in COLT, 2020.
[Bibtex]@inproceedings{coltLattimoreS20, author = {Tor Lattimore and Csaba Szepesv\'ari}, title = {Exploration by Optimisation in Partial Monitoring.}, booktitle = {COLT}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v125/lattimore20a.html'}}, keywords = {} } -
I. Osband, Y. Doron, M. Hessel, J. Aslanides, E. Sezener, A. Saraiva, K. McKinney, T. Lattimore, C. Szepesvári, S. Singh, B. V. Roy, R. S. Sutton, D. Silver, and H. van Hasselt, “Behaviour Suite for Reinforcement Learning.,” in ICLR, 2020.
[Bibtex]@inproceedings{iclrOsbandDHASSMLSS20, author = {Ian Osband and Yotam Doron and Matteo Hessel and John Aslanides and Eren Sezener and Andre Saraiva and Katrina McKinney and Tor Lattimore and Csaba Szepesv\'ari and Satinder Singh and Benjamin Van Roy and Richard S. Sutton and David Silver and Hado van Hasselt}, title = {Behaviour Suite for Reinforcement Learning.}, booktitle = {ICLR}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=rygf-kSYwH'}}, keywords = {} } -
A. Ayoub, Z. Jia, C. Szepesvári, M. Wang, and L. Yang, “Model-Based Reinforcement Learning with Value-Targeted Regression.,” in ICML, 2020.
[Bibtex]@inproceedings{icmlAyoubJSWY20, author = {Alex Ayoub and Zeyu Jia and Csaba Szepesv\'ari and Mengdi Wang and Lin Yang}, title = {Model-Based Reinforcement Learning with Value-Targeted Regression.}, booktitle = {ICML}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/ayoub20a.html'}}, keywords = {} } -
P. Joulani, A. Raj, A. György, and C. Szepesvári, “A simpler approach to accelerated optimization: iterative averaging meets optimism.,” in ICML, 2020.
[Bibtex]@inproceedings{icmlJoulaniRGS20, author = {Pooria Joulani and Anant Raj and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {A simpler approach to accelerated optimization: iterative averaging meets optimism.}, booktitle = {ICML}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/joulani20a.html'}}, keywords = {} } -
T. Lattimore, C. Szepesvári, and G. Weisz, “Learning with Good Feature Representations in Bandits and in RL with a Generative Model.,” in ICML, 2020.
[Bibtex]@inproceedings{icmlLattimoreSW20, author = {Tor Lattimore and Csaba Szepesv\'ari and Gell\'ert Weisz}, title = {Learning with Good Feature Representations in Bandits and in RL with a Generative Model.}, booktitle = {ICML}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/lattimore20a.html'}}, keywords = {} } -
J. Mei, C. Xiao, C. Szepesvári, and D. Schuurmans, “On the Global Convergence Rates of Softmax Policy Gradient Methods.,” in ICML, 2020.
[Bibtex]@inproceedings{icmlMeiXSS20, author = {Jincheng Mei and Chenjun Xiao and Csaba Szepesv\'ari and Dale Schuurmans}, title = {On the Global Convergence Rates of Softmax Policy Gradient Methods.}, booktitle = {ICML}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/mei20b.html'}}, keywords = {} } -
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} } -
G. Dalal, B. Szörényi, and G. Thoppe, “A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiDalalST20, author = {Gal Dalal and Bal\'azs Sz\"or\'enyi and Gugan Thoppe}, title = {A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound.}, booktitle = {AAAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i04.5779'}}, keywords = {} } -
U. Upadhyay, R. Busa-Fekete, W. Kotlowski, D. Pál, and B. Szörényi, “Learning to Crawl.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiUpadhyayBKPS20, author = {Utkarsh Upadhyay and R\'obert Busa-Fekete and Wojciech Kotlowski and D\'avid P\'al and Bal\'azs Sz\"or\'enyi}, title = {Learning to Crawl.}, booktitle = {AAAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i04.6067'}}, keywords = {} } -
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} } -
A. Dumitrescu and C. D. Tóth, “On the Cover of the Rolling Stone.,” in SODA, 2020.
[Bibtex]@inproceedings{sodaDumitrescuT20, author = {Adrian Dumitrescu and Csaba D. T\'oth}, title = {On the Cover of the Rolling Stone.}, booktitle = {SODA}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975994.157'}}, keywords = {} } -
R. Fulek and C. D. Tóth, “Atomic Embeddability, Clustered Planarity, and Thickenability.,” in SODA, 2020.
[Bibtex]@inproceedings{sodaFulekT20, author = {Radoslav Fulek and Csaba D. T\'oth}, title = {Atomic Embeddability, Clustered Planarity, and Thickenability.}, booktitle = {SODA}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975994.175'}}, keywords = {} } -
G. Stoica, O. Stretcu, E. A. Platanios, T. M. Mitchell, and B. Póczos, “Contextual Parameter Generation for Knowledge Graph Link Prediction.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiStoicaSPMP20, author = {George Stoica and Otilia Stretcu and Emmanouil Antonios Platanios and Tom M. Mitchell and Barnab\'as P\'oczos}, title = {Contextual Parameter Generation for Knowledge Graph Link Prediction.}, booktitle = {AAAI}, year = 2020, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i03.5693'}, 'https://www.wikidata.org/entity/Q113233286']}, keywords = {} } -
A. Madaan, A. Setlur, T. Parekh, B. Póczos, G. Neubig, Y. Yang, R. Salakhutdinov, A. W. Black, and S. Prabhumoye, “Politeness Transfer: A Tag and Generate Approach.,” in ACL, 2020.
[Bibtex]@inproceedings{aclMadaanSPPNYSBP20, author = {Aman Madaan and Amrith Setlur and Tanmay Parekh and Barnab\'as P\'oczos and Graham Neubig and Yiming Yang and Ruslan Salakhutdinov and Alan W. Black and Shrimai Prabhumoye}, title = {Politeness Transfer: A Tag and Generate Approach.}, booktitle = {ACL}, year = 2020, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.18653/v1/2020.acl-main.169'}, {'@type': 'oa', '#text': 'https://aclanthology.org/2020.acl-main.169/'}]}, keywords = {} } -
B. Paria, C. Yeh, I. E. Yen, N. Xu, P. Ravikumar, and B. Póczos, “Minimizing FLOPs to Learn Efficient Sparse Representations.,” in ICLR, 2020.
[Bibtex]@inproceedings{iclrPariaYYXRP20, author = {Biswajit Paria and Chih-Kuan Yeh and Ian En-Hsu Yen and Ning Xu and Pradeep Ravikumar and Barnab\'as P\'oczos}, title = {Minimizing FLOPs to Learn Efficient Sparse Representations.}, booktitle = {ICLR}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=SygpC6Ntvr'}}, keywords = {} } -
B. Gleiss, L. Kovács, and J. Rath, “Subsumption Demodulation in First-Order Theorem Proving.,” in IJCAR (1), 2020.
[Bibtex]@inproceedings{cadeGleissKR20, author = {Bernhard Gleiss and Laura Kov\'acs and Jakob Rath}, title = {Subsumption Demodulation in First-Order Theorem Proving.}, booktitle = {IJCAR (1)}, year = 2020, doi = {https://doi.org/10.1007/978-3-030-51074-9_17}, keywords = {} } -
K. (. Dvijotham, J. Hayes, B. Balle, Z. J. Kolter, C. Qin, A. György, K. Xiao, S. Gowal, and P. Kohli, “A Framework for robustness Certification of Smoothed Classifiers using F-Divergences.,” in ICLR, 2020.
[Bibtex]@inproceedings{iclrDvijothamHBKQGX20, author = {Krishnamurthy (Dj) Dvijotham and Jamie Hayes and Borja Balle and J. Zico Kolter and Chongli Qin and Andr\'as Gy\"orgy and Kai Xiao and Sven Gowal and Pushmeet Kohli}, title = {A Framework for robustness Certification of Smoothed Classifiers using F-Divergences.}, booktitle = {ICLR}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=SJlKrkSFPH'}}, keywords = {} } -
C. Vernade, A. György, and T. A. Mann, “Non-Stationary Delayed Bandits with Intermediate Observations.,” in ICML, 2020.
[Bibtex]@inproceedings{icmlVernade0M20, author = {Claire Vernade and Andr\'as Gy\"orgy and Timothy A. Mann}, title = {Non-Stationary Delayed Bandits with Intermediate Observations.}, booktitle = {ICML}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/vernade20b.html'}}, keywords = {} } -
G. Neu and N. Zhivotovskiy, “Fast Rates for Online Prediction with Abstention.,” in COLT, 2020.
[Bibtex]@inproceedings{coltNeuZ20, author = {Gergely Neu and Nikita Zhivotovskiy}, title = {Fast Rates for Online Prediction with Abstention.}, booktitle = {COLT}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v125/neu20a.html'}}, keywords = {} } -
G. Neu and J. Olkhovskaya, “Efficient and robust algorithms for adversarial linear contextual bandits.,” in COLT, 2020.
[Bibtex]@inproceedings{coltNeuO20, author = {Gergely Neu and Julia Olkhovskaya}, title = {Efficient and robust algorithms for adversarial linear contextual bandits.}, booktitle = {COLT}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v125/neu20b.html'}}, keywords = {} } -
F. Leofante, E. Giunchiglia, E. Ábrahám, and A. Tacchella, “Optimal Planning Modulo Theories.,” in IJCAI, 2020.
[Bibtex]@inproceedings{ijcaiLeofanteGAT20, author = {Francesco Leofante and Enrico Giunchiglia and Erika \'Abrah\'am and Armando Tacchella}, title = {Optimal Planning Modulo Theories.}, booktitle = {IJCAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2020/571'}}, keywords = {} } -
Z. Zhang, Z. Zhan, D. Balasubramanian, B. Li, P. Völgyesi, and X. D. Koutsoukos, “Leveraging EM Side-Channel Information to Detect Rowhammer Attacks.,” in SP, 2020.
[Bibtex]@inproceedings{spZhangZBLVK20, author = {Zhenkai Zhang and Zihao Zhan and Daniel Balasubramanian and Bo Li and P\'eter V\"olgyesi and Xenofon D. Koutsoukos}, title = {Leveraging EM Side-Channel Information to Detect Rowhammer Attacks.}, booktitle = {SP}, year = 2020, doi = {https://doi.org/10.1109/SP40000.2020.00060}, keywords = {} } -
E. Bonnet, E. J. Kim, S. Thomassé, and R. Watrigant, “Twin-width I: tractable FO model checking.,” in FOCS, 2020.
[Bibtex]@inproceedings{focsBonnet0TW20, author = {Edouard Bonnet and Eun Jung Kim and St\'ephan Thomass\'e and R\'emi Watrigant}, title = {Twin-width I: tractable FO model checking.}, booktitle = {FOCS}, year = 2020, doi = {https://doi.org/10.1109/FOCS46700.2020.00062}, keywords = {} } -
E. Aghajani, C. Nagy, M. Linares-Vásquez, L. Moreno, G. Bavota, M. Lanza, and D. C. Shepherd, “Software documentation: the practitioners’ perspective.,” in ICSE, 2020.
[Bibtex]@inproceedings{icseAghajani0LMBLS20, author = {Emad Aghajani and Csaba Nagy and Mario Linares-V\'asquez and Laura Moreno and Gabriele Bavota and Michele Lanza and David C. Shepherd}, title = {Software documentation: the practitioners' perspective.}, booktitle = {ICSE}, year = 2020, doi = {['https://doi.org/10.1145/3377811.3380405', 'https://ieeexplore.ieee.org/document/9284065', 'https://www.wikidata.org/entity/Q130898373']}, keywords = {} } -
A. Kovacs and A. Kaposi, “Large and Infinitary Quotient Inductive-Inductive Types.,” in LICS, 2020.
[Bibtex]@inproceedings{licsKovacsK20, author = {Andras Kovacs and Ambrus Kaposi}, title = {Large and Infinitary Quotient Inductive-Inductive Types.}, booktitle = {LICS}, year = 2020, doi = {https://doi.org/10.1145/3373718.3394770}, keywords = {ELTE and international and applied} } -
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} } -
W. Liu, A. A. Daruna, Z. Kira, and S. Chernova, “Path Ranking with Attention to Type Hierarchies.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiLiuDKC20, author = {Weiyu Liu and Angel Andres Daruna and Zsolt Kira and Sonia Chernova}, title = {Path Ranking with Attention to Type Hierarchies.}, booktitle = {AAAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i03.5680'}}, keywords = {} } -
Y. Liu, J. Tian, N. Glaser, and Z. Kira, “When2com: Multi-Agent Perception via Communication Graph Grouping.,” in CVPR, 2020.
[Bibtex]@inproceedings{cvprLiuTGK20, author = {Yen-Cheng Liu and Junjiao Tian and Nathaniel Glaser and Zsolt Kira}, title = {When2com: Multi-Agent Perception via Communication Graph Grouping.}, booktitle = {CVPR}, year = 2020, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content_CVPR_2020/html/Liu_When2com_Multi-Agent_Perception_via_Communication_Graph_Grouping_CVPR_2020_paper.html'}, 'https://doi.org/10.1109/CVPR42600.2020.00416']}, keywords = {} } -
M. Chen, B. Li, Y. Bao, G. AlRegib, and Z. Kira, “Action Segmentation With Joint Self-Supervised Temporal Domain Adaptation.,” in CVPR, 2020.
[Bibtex]@inproceedings{cvprChenLBAK20, author = {Min-Hung Chen and Baopu Li and Yingze Bao and Ghassan AlRegib and Zsolt Kira}, title = {Action Segmentation With Joint Self-Supervised Temporal Domain Adaptation.}, booktitle = {CVPR}, year = 2020, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content_CVPR_2020/html/Chen_Action_Segmentation_With_Joint_Self-Supervised_Temporal_Domain_Adaptation_CVPR_2020_paper.html'}, 'https://doi.org/10.1109/CVPR42600.2020.00947']}, keywords = {} } -
Y. Hsu, Y. Shen, H. Jin, and Z. Kira, “Generalized ODIN: Detecting Out-of-Distribution Image Without Learning From Out-of-Distribution Data.,” in CVPR, 2020.
[Bibtex]@inproceedings{cvprHsuSJK20, author = {Yen-Chang Hsu and Yilin Shen and Hongxia Jin and Zsolt Kira}, title = {Generalized ODIN: Detecting Out-of-Distribution Image Without Learning From Out-of-Distribution Data.}, booktitle = {CVPR}, year = 2020, doi = {[{'@type': 'oa', '#text': 'https://openaccess.thecvf.com/content_CVPR_2020/html/Hsu_Generalized_ODIN_Detecting_Out-of-Distribution_Image_Without_Learning_From_Out-of-Distribution_Data_CVPR_2020_paper.html'}, 'https://doi.org/10.1109/CVPR42600.2020.01096']}, keywords = {} } -
K. Choromanski, D. Cheikhi, J. Davis, V. Likhosherstov, A. Nazaret, A. Bahamou, X. Song, M. Akarte, J. Parker-Holder, J. Bergquist, Y. Gao, A. Pacchiano, T. Sarlós, A. Weller, and V. Sindhwani, “Stochastic Flows and Geometric Optimization on the Orthogonal Group.,” in ICML, 2020.
[Bibtex]@inproceedings{icmlChoromanskiCDLN20, author = {Krzysztof Choromanski and David Cheikhi and Jared Davis and Valerii Likhosherstov and Achille Nazaret and Achraf Bahamou and Xingyou Song and Mrugank Akarte and Jack Parker-Holder and Jacob Bergquist and Yuan Gao and Aldo Pacchiano and Tam\'as Sarl\'os and Adrian Weller and Vikas Sindhwani}, title = {Stochastic Flows and Geometric Optimization on the Orthogonal Group.}, booktitle = {ICML}, year = 2020, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v119/choromanski20a.html'}}, keywords = {} } -
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} } -
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 = {} } -
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 = {} } -
A. Mantzaflaris, B. Mourrain, and Á. Szántó, “Punctual Hilbert scheme and certified approximate singularities.,” in ISSAC, 2020.
[Bibtex]@inproceedings{issacMantzaflarisMS20, author = {Angelos Mantzaflaris and Bernard Mourrain and \'Agnes Sz\'ant\'o}, title = {Punctual Hilbert scheme and certified approximate singularities.}, booktitle = {ISSAC}, year = 2020, doi = {['https://doi.org/10.1145/3373207.3404024', 'https://www.wikidata.org/entity/Q131130147']}, keywords = {} } -
A. C. Giannopoulou, K. Kawarabayashi, S. Kreutzer, and O. Kwon, “The Directed Flat Wall Theorem.,” in SODA, 2020.
[Bibtex]@inproceedings{sodaGiannopoulouKKK20, author = {Archontia C. Giannopoulou and Ken-ichi Kawarabayashi and Stephan Kreutzer and O-joung Kwon}, title = {The Directed Flat Wall Theorem.}, booktitle = {SODA}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975994.15'}}, keywords = {} } -
P. Wang, D. Stepanova, C. Domokos, and Z. J. Kolter, “Differentiable learning of numerical rules in knowledge graphs.,” in ICLR, 2020.
[Bibtex]@inproceedings{iclrWangSDK20, author = {Po-Wei Wang and Daria Stepanova and Csaba Domokos and J. Zico Kolter}, title = {Differentiable learning of numerical rules in knowledge graphs.}, booktitle = {ICLR}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=rJleKgrKwS'}}, keywords = {} } -
S. Ben-David, A. M. Childs, A. Gilyén, W. Kretschmer, S. Podder, and D. Wang, “Symmetries, Graph Properties, and Quantum Speedups.,” in FOCS, 2020.
[Bibtex]@inproceedings{focsBen-DavidCGKPW20, author = {Shalev Ben-David and Andrew M. Childs and Andr\'as Gily\'en and William Kretschmer and Supartha Podder and Daochen Wang}, title = {Symmetries, Graph Properties, and Quantum Speedups.}, booktitle = {FOCS}, year = 2020, doi = {https://doi.org/10.1109/FOCS46700.2020.00066}, keywords = {} } -
N. Chia, A. Gilyén, T. Li, H. Lin, E. Tang, and C. Wang, “Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning.,” in STOC, 2020.
[Bibtex]@inproceedings{stocChiaGLLTW20, author = {Nai-Hui Chia and Andr\'as Gily\'en and Tongyang Li and Han-Hsuan Lin and Ewin Tang and Chunhao Wang}, title = {Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning.}, booktitle = {STOC}, year = 2020, doi = {['https://doi.org/10.1145/3357713.3384314', 'https://www.wikidata.org/entity/Q130916948']}, keywords = {} } -
A. Ambainis, A. Gilyén, S. Jeffery, and M. Kokainis, “Quadratic speedup for finding marked vertices by quantum walks.,” in STOC, 2020.
[Bibtex]@inproceedings{stocAmbainisGJK20, author = {Andris Ambainis and Andr\'as Gily\'en and Stacey Jeffery and Martins Kokainis}, title = {Quadratic speedup for finding marked vertices by quantum walks.}, booktitle = {STOC}, year = 2020, doi = {['https://doi.org/10.1145/3357713.3384252', 'https://www.wikidata.org/entity/Q130915743']}, keywords = {} } -
D. Dadush, B. Natura, and L. A. Végh, “Revisiting Tardos’s Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers.,” in FOCS, 2020.
[Bibtex]@inproceedings{focsDadushNV20, author = {Daniel Dadush and Bento Natura and L\'aszl\'o A. V\'egh}, title = {Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers.}, booktitle = {FOCS}, year = 2020, doi = {https://doi.org/10.1109/FOCS46700.2020.00091}, keywords = {} } -
D. Dadush, S. Huiberts, B. Natura, and L. A. Végh, “A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.,” in STOC, 2020.
[Bibtex]@inproceedings{stocDadushHNV20, author = {Daniel Dadush and Sophie Huiberts and Bento Natura and L\'aszl\'o A. V\'egh}, title = {A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.}, booktitle = {STOC}, year = 2020, doi = {https://doi.org/10.1145/3357713.3384326}, keywords = {} } -
S. Kisfaludi-Bak, “Hyperbolic intersection graphs and (quasi)-polynomial time.,” in SODA, 2020.
[Bibtex]@inproceedings{sodaKisfaludi-Bak20, author = {S\'andor Kisfaludi-Bak}, title = {Hyperbolic intersection graphs and (quasi)-polynomial time.}, booktitle = {SODA}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975994.100'}}, keywords = {} } -
V. Shalaeva, A. F. Esfahani, P. Germain, and M. Petreczky, “Improved PAC-Bayesian Bounds for Linear Regression.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiShalaevaEGP20, author = {Vera Shalaeva and Alireza Fakhrizadeh Esfahani and Pascal Germain and Mih\'aly Petreczky}, title = {Improved PAC-Bayesian Bounds for Linear Regression.}, booktitle = {AAAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i04.6020'}}, keywords = {} } -
M. Abrahamsen, T. Miltzow, and N. Seiferth, “Framework for ER-Completeness of Two-Dimensional Packing Problems.,” in FOCS, 2020.
[Bibtex]@inproceedings{focsAbrahamsenMS20, author = {Mikkel Abrahamsen and Tillmann Miltzow and Nadja Seiferth}, title = {Framework for ER-Completeness of Two-Dimensional Packing Problems.}, booktitle = {FOCS}, year = 2020, doi = {https://doi.org/10.1109/FOCS46700.2020.00098}, keywords = {} } -
J. Erickson, I. van der Hoog, and T. Miltzow, “Smoothing the gap between NP and ER.,” in FOCS, 2020.
[Bibtex]@inproceedings{focs0001HM20, author = {Jeff Erickson and Ivor van der Hoog and Tillmann Miltzow}, title = {Smoothing the gap between NP and ER.}, booktitle = {FOCS}, year = 2020, doi = {https://doi.org/10.1109/FOCS46700.2020.00099}, keywords = {} } -
A. Bojchevski, J. Klicpera, B. Perozzi, A. Kapoor, M. Blais, B. Rozemberczki, M. Lukasik, and S. Günnemann, “Scaling Graph Neural Networks with Approximate PageRank.,” in KDD, 2020.
[Bibtex]@inproceedings{kddBojchevskiKPKBR20, author = {Aleksandar Bojchevski and Johannes Klicpera and Bryan Perozzi and Amol Kapoor and Martin Blais and Benedek Rozemberczki and Michal Lukasik and Stephan G\"unnemann}, title = {Scaling Graph Neural Networks with Approximate PageRank.}, booktitle = {KDD}, year = 2020, doi = {https://doi.org/10.1145/3394486.3403296}, keywords = {} } -
H. Ballani, P. Costa, R. Behrendt, D. Cletheroe, I. Haller, K. Jozwik, F. Karinou, S. Lange, K. Shi, B. Thomsen, and H. Williams, “Sirius: A Flat Datacenter Network with Nanosecond Optical Switching.,” in SIGCOMM, 2020.
[Bibtex]@inproceedings{sigcommBallaniCBCHJKLS20, author = {Hitesh Ballani and Paolo Costa and Raphael Behrendt and Daniel Cletheroe and Istv\'an Haller and Krzysztof Jozwik and Fotini Karinou and Sophie Lange and Kai Shi and Benn Thomsen and Hugh Williams}, title = {Sirius: A Flat Datacenter Network with Nanosecond Optical Switching.}, booktitle = {SIGCOMM}, year = 2020, doi = {https://doi.org/10.1145/3387514.3406221}, keywords = {} } -
X. Ma, P. Karkus, D. Hsu, and W. S. Lee, “Particle Filter Recurrent Neural Networks.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiMaKHL20, author = {Xiao Ma and P\'eter Karkus and David Hsu and Wee Sun Lee}, title = {Particle Filter Recurrent Neural Networks.}, booktitle = {AAAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i04.5952'}}, keywords = {} } -
X. Ma, P. Karkus, D. Hsu, W. S. Lee, and N. Ye, “Discriminative Particle Filter Reinforcement Learning for Complex Partial observations.,” in ICLR, 2020.
[Bibtex]@inproceedings{iclrMaKHLY20, author = {Xiao Ma and P\'eter Karkus and David Hsu and Wee Sun Lee and Nan Ye}, title = {Discriminative Particle Filter Reinforcement Learning for Complex Partial observations.}, booktitle = {ICLR}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=HJl8_eHYvS'}}, keywords = {} } -
K. C. Gall, B. Cserna, and W. Ruml, “Envelope-Based Approaches to Real-Time Heuristic Search.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiGallCR20, author = {Kevin C. Gall and Bence Cserna and Wheeler Ruml}, title = {Envelope-Based Approaches to Real-Time Heuristic Search.}, booktitle = {AAAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i03.5614'}}, keywords = {} } -
D. Keysers, N. Schärli, N. Scales, H. Buisman, D. Furrer, S. Kashubin, N. Momchev, D. Sinopalnikov, L. Stafiniak, T. Tihon, D. Tsarkov, X. Wang, M. van Zee, and O. Bousquet, “Measuring Compositional Generalization: A Comprehensive Method on Realistic Data.,” in ICLR, 2020.
[Bibtex]@inproceedings{iclrKeysersSSBFKMSS20, author = {Daniel Keysers and Nathanael Schärli and Nathan Scales and Hylke Buisman and Daniel Furrer and Sergii Kashubin and Nikola Momchev and Danila Sinopalnikov and Lukasz Stafiniak and Tibor Tihon and Dmitry Tsarkov and Xiao Wang and Marc van Zee and Olivier Bousquet}, title = {Measuring Compositional Generalization: A Comprehensive Method on Realistic Data.}, booktitle = {ICLR}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=SygcCnNKwr'}}, keywords = {} } -
A. Ray, P. Aggarwal, C. Hadhazi, G. Dasgupta, and A. M. Paradkar, “Question Quality Improvement: Deep Question Understanding for Incident Management in Technical Support Domain.,” in AAAI, 2020.
[Bibtex]@inproceedings{aaaiRayAHDP20, author = {Anupama Ray and Pooja Aggarwal and Csaba Hadhazi and Gargi Dasgupta and Amit M. Paradkar}, title = {Question Quality Improvement: Deep Question Understanding for Incident Management in Technical Support Domain.}, booktitle = {AAAI}, year = 2020, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v34i08.7024'}}, keywords = {} }
2019
-
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} } -
K. T. Abou-Moustafa and C. Szepesvári, “An Exponential Tail Bound for the Deleted Estimate.,” in AAAI, 2019.
[Bibtex]@inproceedings{aaaiAbou-MoustafaS19, author = {Karim T. Abou-Moustafa and Csaba Szepesv\'ari}, title = {An Exponential Tail Bound for the Deleted Estimate.}, booktitle = {AAAI}, year = 2019, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v33i01.33013143'}, 'https://www.wikidata.org/entity/Q115512413']}, keywords = {} } -
I. Kuzborskij, N. Cesa-Bianchi, and C. Szepesvári, “Distribution-Dependent Analysis of Gibbs-ERM Principle.,” in COLT, 2019.
[Bibtex]@inproceedings{coltKuzborskijCS19, author = {Ilja Kuzborskij and Nicolò Cesa-Bianchi and Csaba Szepesv\'ari}, title = {Distribution-Dependent Analysis of Gibbs-ERM Principle.}, booktitle = {COLT}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v99/kuzborskij19a.html'}}, keywords = {} } -
T. Lattimore and C. Szepesvári, “An Information-Theoretic Approach to Minimax Regret in Partial Monitoring.,” in COLT, 2019.
[Bibtex]@inproceedings{coltLattimoreS19, author = {Tor Lattimore and Csaba Szepesv\'ari}, title = {An Information-Theoretic Approach to Minimax Regret in Partial Monitoring.}, booktitle = {COLT}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v99/lattimore19a.html'}}, keywords = {} } -
B. Kveton, C. Szepesvári, S. Vaswani, Z. Wen, T. Lattimore, and M. Ghavamzadeh, “Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlKvetonSVWLG19, author = {Branislav Kveton and Csaba Szepesv\'ari and Sharan Vaswani and Zheng Wen and Tor Lattimore and Mohammad Ghavamzadeh}, title = {Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/kveton19a.html'}}, keywords = {} } -
“POLITEX: Regret Bounds for Policy Iteration using Expert Prediction.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlX19, author = {}, title = {POLITEX: Regret Bounds for Policy Iteration using Expert Prediction.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/lazic19a.html'}}, keywords = {} } -
S. Li, T. Lattimore, and C. Szepesvári, “Online Learning to Rank with Features.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlLiLS19, author = {Shuai Li and Tor Lattimore and Csaba Szepesv\'ari}, title = {Online Learning to Rank with Features.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/li19f.html'}}, keywords = {} } -
G. Weisz, A. György, and C. Szepesvári, “CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlWeiszGS19, author = {Gell\'ert Weisz and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/weisz19a.html'}}, keywords = {} } -
B. Kveton, C. Szepesvári, M. Ghavamzadeh, and C. Boutilier, “Perturbed-History Exploration in Stochastic Multi-Armed Bandits.,” in IJCAI, 2019.
[Bibtex]@inproceedings{ijcaiKvetonSGB19, author = {Branislav Kveton and Csaba Szepesv\'ari and Mohammad Ghavamzadeh and Craig Boutilier}, title = {Perturbed-History Exploration in Stochastic Multi-Armed Bandits.}, booktitle = {IJCAI}, year = 2019, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2019/386'}}, keywords = {} } -
C. Li, B. Kveton, T. Lattimore, I. Markov, M. de Rijke, C. Szepesvári, and M. Zoghi, “BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback.,” in UAI, 2019.
[Bibtex]@inproceedings{uai0003KLMRSZ19, author = {Chang Li and Branislav Kveton and Tor Lattimore and Ilya Markov and Maarten de Rijke and Csaba Szepesv\'ari and Masrour Zoghi}, title = {BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback.}, booktitle = {UAI}, year = 2019, doi = {[{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v115/li20b.html'}, {'@type': 'oa', '#text': 'http://auai.org/uai2019/proceedings/papers/47.pdf'}]}, keywords = {} } -
B. Kveton, C. Szepesvári, M. Ghavamzadeh, and C. Boutilier, “Perturbed-History Exploration in Stochastic Linear Bandits.,” in UAI, 2019.
[Bibtex]@inproceedings{uaiKvetonSGB19, author = {Branislav Kveton and Csaba Szepesv\'ari and Mohammad Ghavamzadeh and Craig Boutilier}, title = {Perturbed-History Exploration in Stochastic Linear Bandits.}, booktitle = {UAI}, year = 2019, doi = {[{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v115/kveton20a.html'}, {'@type': 'oa', '#text': 'http://auai.org/uai2019/proceedings/papers/176.pdf'}]}, keywords = {} } -
D. Baráth, J. Matas, and J. Noskova, “MAGSAC: Marginalizing Sample Consensus.,” in CVPR, 2019.
[Bibtex]@inproceedings{cvprBarathMN19, author = {D\'aniel Bar\'ath 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} } -
R. Busa-Fekete, D. Fotakis, B. Szörényi, and M. Zampetakis, “Optimal Learning of Mallows Block Model.,” in COLT, 2019.
[Bibtex]@inproceedings{coltBusa-FeketeFSZ19, author = {R\'obert Busa-Fekete and Dimitris Fotakis and Bal\'azs Sz\"or\'enyi and Manolis Zampetakis}, title = {Optimal Learning of Mallows Block Model.}, booktitle = {COLT}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v99/busa-fekete19a.html'}}, keywords = {} } -
A. Beygelzimer, D. Pál, B. Szörényi, D. Thiruvenkatachari, C. Wei, and C. Zhang, “Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlBeygelzimerPSTW19, author = {Alina Beygelzimer and D\'avid P\'al and Bal\'azs Sz\"or\'enyi and Devanathan Thiruvenkatachari and Chen-Yu Wei and Chicheng Zhang}, title = {Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/beygelzimer19a.html'}}, keywords = {} } -
A. Golovnev, D. Pál, and B. Szörényi, “The information-theoretic value of unlabeled data in semi-supervised learning.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlGolovnevPS19, author = {Alexander Golovnev and D\'avid P\'al and Bal\'azs Sz\"or\'enyi}, title = {The information-theoretic value of unlabeled data in semi-supervised learning.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/golovnev19a.html'}}, keywords = {} } -
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} } -
L. Babai, “Canonical form for graphs in quasipolynomial time: preliminary report.,” in STOC, 2019.
[Bibtex]@inproceedings{stocBabai19, author = {L\'aszl\'o Babai}, title = {Canonical form for graphs in quasipolynomial time: preliminary report.}, booktitle = {STOC}, year = 2019, doi = {https://doi.org/10.1145/3313276.3316356}, keywords = {} } -
H. Pham, P. P. Liang, T. Manzini, L. Morency, and B. Póczos, “Found in Translation: Learning Robust Joint Representations by Cyclic Translations between Modalities.,” in AAAI, 2019.
[Bibtex]@inproceedings{aaaiPhamLMMP19, author = {Hai Pham and Paul Pu Liang and Thomas Manzini and Louis-Philippe Morency and Barnab\'as P\'oczos}, title = {Found in Translation: Learning Robust Joint Representations by Cyclic Translations between Modalities.}, booktitle = {AAAI}, year = 2019, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v33i01.33016892'}}, keywords = {} } -
Z. Wang, Z. Dai, B. Póczos, and J. G. Carbonell, “Characterizing and Avoiding Negative Transfer.,” in CVPR, 2019.
[Bibtex]@inproceedings{cvprWangDPC19, author = {Zirui Wang and Zihang Dai and Barnab\'as P\'oczos and Jaime G. Carbonell}, title = {Characterizing and Avoiding Negative Transfer.}, booktitle = {CVPR}, year = 2019, doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_CVPR_2019/html/Wang_Characterizing_and_Avoiding_Negative_Transfer_CVPR_2019_paper.html'}, 'https://doi.org/10.1109/CVPR.2019.01155']}, keywords = {} } -
C. Li, T. Simon, J. M. Saragih, B. Póczos, and Y. Sheikh, “LBS Autoencoder: Self-Supervised Fitting of Articulated Meshes to Point Clouds.,” in CVPR, 2019.
[Bibtex]@inproceedings{cvprLiSSPS19, author = {Chun-Liang Li and Tomas Simon and Jason M. Saragih and Barnab\'as P\'oczos and Yaser Sheikh}, title = {LBS Autoencoder: Self-Supervised Fitting of Articulated Meshes to Point Clouds.}, booktitle = {CVPR}, year = 2019, doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_CVPR_2019/html/Li_LBS_Autoencoder_Self-Supervised_Fitting_of_Articulated_Meshes_to_Point_Clouds_CVPR_2019_paper.html'}, 'https://doi.org/10.1109/CVPR.2019.01224']}, keywords = {} } -
K. Kandasamy, W. Neiswanger, R. Zhang, A. Krishnamurthy, J. Schneider, and B. Póczos, “Myopic Posterior Sampling for Adaptive Goal Oriented Design of Experiments.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlKandasamyNZKSP19, author = {Kirthevasan Kandasamy and Willie Neiswanger and Reed Zhang and Akshay Krishnamurthy and Jeff Schneider and Barnab\'as P\'oczos}, title = {Myopic Posterior Sampling for Adaptive Goal Oriented Design of Experiments.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/kandasamy19a.html'}}, keywords = {} } -
B. Paria, K. Kandasamy, and B. Póczos, “A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizations.,” in UAI, 2019.
[Bibtex]@inproceedings{uaiPariaKP19, author = {Biswajit Paria and Kirthevasan Kandasamy and Barnab\'as P\'oczos}, title = {A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizations.}, booktitle = {UAI}, year = 2019, doi = {[{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v115/paria20a.html'}, {'@type': 'oa', '#text': 'http://auai.org/uai2019/proceedings/papers/267.pdf'}]}, keywords = {} } -
T. A. Mann, S. Gowal, A. György, H. Hu, R. Jiang, B. Lakshminarayanan, and P. Srinivasan, “Learning from Delayed Outcomes via Proxies with Applications to Recommender Systems.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlMannGGHJLS19, author = {Timothy A. Mann and Sven Gowal and Andr\'as Gy\"orgy and Huiyi Hu and Ray Jiang and Balaji Lakshminarayanan and Prav Srinivasan}, title = {Learning from Delayed Outcomes via Proxies with Applications to Recommender Systems.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/mann19a.html'}}, keywords = {} } -
W. Kotlowski and G. Neu, “Bandit Principal Component Analysis.,” in COLT, 2019.
[Bibtex]@inproceedings{coltKotlowskiN19, author = {Wojciech Kotlowski and Gergely Neu}, title = {Bandit Principal Component Analysis.}, booktitle = {COLT}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v99/kotlowski19a.html'}}, keywords = {} } -
E. Aghajani, C. Nagy, O. L. Vega-Márquez, M. Linares-Vásquez, L. Moreno, G. Bavota, and M. Lanza, “Software documentation issues unveiled.,” in ICSE, 2019.
[Bibtex]@inproceedings{icseAghajaniNVLMBL19, author = {Emad Aghajani and Csaba Nagy and Olga Lucero Vega-M\'arquez and Mario Linares-V\'asquez and Laura Moreno and Gabriele Bavota and Michele Lanza}, title = {Software documentation issues unveiled.}, booktitle = {ICSE}, year = 2019, doi = {['https://doi.org/10.1109/ICSE.2019.00122', 'https://dl.acm.org/citation.cfm?id=3339655', 'https://www.wikidata.org/entity/Q131120420']}, keywords = {} } -
S. Josilo and G. Dán, “Wireless and Computing Resource Allocation for Selfish Computation Offloading in Edge Computing.,” in INFOCOM, 2019.
[Bibtex]@inproceedings{infocomJosiloD19, author = {Sladana Josilo and Gy\"orgy D\'an}, title = {Wireless and Computing Resource Allocation for Selfish Computation Offloading in Edge Computing.}, booktitle = {INFOCOM}, year = 2019, doi = {https://doi.org/10.1109/INFOCOM.2019.8737480}, keywords = {} } -
C. Ma, Z. Wu, G. AlRegib, C. Xiong, and Z. Kira, “The Regretful Agent: Heuristic-Aided Navigation Through Progress Estimation.,” in CVPR, 2019.
[Bibtex]@inproceedings{cvprMaWAXK19, author = {Chih-Yao Ma and Zuxuan Wu and Ghassan AlRegib and Caiming Xiong and Zsolt Kira}, title = {The Regretful Agent: Heuristic-Aided Navigation Through Progress Estimation.}, booktitle = {CVPR}, year = 2019, doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_CVPR_2019/html/Ma_The_Regretful_Agent_Heuristic-Aided_Navigation_Through_Progress_Estimation_CVPR_2019_paper.html'}, 'https://doi.org/10.1109/CVPR.2019.00689']}, keywords = {} } -
M. Chen, Z. Kira, G. Alregib, J. Yoo, R. Chen, and J. Zheng, “Temporal Attentive Alignment for Large-Scale Video Domain Adaptation.,” in ICCV, 2019.
[Bibtex]@inproceedings{iccvChenKAYCZ19, author = {Min-Hung Chen and Zsolt Kira and Ghassan Alregib and Jaekwon Yoo and Ruxin Chen and Jian Zheng}, title = {Temporal Attentive Alignment for Large-Scale Video Domain Adaptation.}, booktitle = {ICCV}, year = 2019, doi = {https://doi.org/10.1109/ICCV.2019.00642}, keywords = {} } -
A. Cutkosky and T. Sarlós, “Matrix-Free Preconditioning in Online Learning.,” in ICML, 2019.
[Bibtex]@inproceedings{icmlCutkoskyS19, author = {Ashok Cutkosky and Tam\'as Sarl\'os}, title = {Matrix-Free Preconditioning in Online Learning.}, booktitle = {ICML}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v97/cutkosky19b.html'}}, keywords = {} } -
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 = {} } -
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 = {} } -
P. Weinzaepfel, G. Csurka, Y. Cabon, and M. Humenberger, “Visual Localization by Learning Objects-Of-Interest Dense Match Regression.,” in CVPR, 2019.
[Bibtex]@inproceedings{cvprWeinzaepfelCCH19, author = {Philippe Weinzaepfel and Gabriela Csurka and Yohann Cabon and Martin Humenberger}, title = {Visual Localization by Learning Objects-Of-Interest Dense Match Regression.}, booktitle = {CVPR}, year = 2019, doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_CVPR_2019/html/Weinzaepfel_Visual_Localization_by_Learning_Objects-Of-Interest_Dense_Match_Regression_CVPR_2019_paper.html'}, 'https://doi.org/10.1109/CVPR.2019.00578']}, keywords = {} } -
M. Wray, G. Csurka, D. Larlus, and D. Damen, “Fine-Grained Action Retrieval Through Multiple Parts-of-Speech Embeddings.,” in ICCV, 2019.
[Bibtex]@inproceedings{iccvWrayCLD19, author = {Michael Wray and Gabriela Csurka and Diane Larlus and Dima Damen}, title = {Fine-Grained Action Retrieval Through Multiple Parts-of-Speech Embeddings.}, booktitle = {ICCV}, year = 2019, doi = {https://doi.org/10.1109/ICCV.2019.00054}, keywords = {} } -
A. Gilyén, S. Arunachalam, and N. Wiebe, “Optimizing quantum optimization algorithms via faster quantum gradient computation.,” in SODA, 2019.
[Bibtex]@inproceedings{sodaGilyenAW19, author = {Andr\'as Gily\'en and Srinivasan Arunachalam and Nathan Wiebe}, title = {Optimizing quantum optimization algorithms via faster quantum gradient computation.}, booktitle = {SODA}, year = 2019, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975482.87'}, 'https://dl.acm.org/citation.cfm?id=3310522']}, keywords = {} } -
A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, “Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics.,” in STOC, 2019.
[Bibtex]@inproceedings{stocGilyenSLW19, author = {Andr\'as Gily\'en and Yuan Su and Guang Hao Low and Nathan Wiebe}, title = {Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics.}, booktitle = {STOC}, year = 2019, doi = {['https://doi.org/10.1145/3313276.3316366', 'https://www.wikidata.org/entity/Q130915788']}, keywords = {} } -
J. Garg and L. A. Végh, “A strongly polynomial algorithm for linear exchange markets.,” in STOC, 2019.
[Bibtex]@inproceedings{stocGargV19, author = {Jugal Garg and L\'aszl\'o A. V\'egh}, title = {A strongly polynomial algorithm for linear exchange markets.}, booktitle = {STOC}, year = 2019, doi = {https://doi.org/10.1145/3313276.3316340}, keywords = {} } -
S. Kisfaludi-Bak, J. Nederlof, and E. J. van Leeuwen, “Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces.,” in SODA, 2019.
[Bibtex]@inproceedings{sodaKisfaludi-BakNL19, author = {S\'andor Kisfaludi-Bak and Jesper Nederlof and Erik Jan van Leeuwen}, title = {Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces.}, booktitle = {SODA}, year = 2019, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975482.63'}, 'https://dl.acm.org/citation.cfm?id=3310498']}, keywords = {} } -
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} } -
K. Cohn-Gordon, C. Cremers, K. Gjøsteen, H. Jacobsen, and T. Jager, “Highly Efficient Key Exchange Protocols with Optimal Tightness.,” in CRYPTO (3), 2019.
[Bibtex]@inproceedings{cryptoCohn-GordonCGJJ19, author = {Katriel Cohn-Gordon and Cas Cremers and Kristian Gjøsteen and Håkon Jacobsen and Tibor Jager}, title = {Highly Efficient Key Exchange Protocols with Optimal Tightness.}, booktitle = {CRYPTO (3)}, year = 2019, doi = {https://doi.org/10.1007/978-3-030-26954-8_25}, keywords = {} } -
S. Davies, M. Z. Rácz, and C. Rashtchian, “Reconstructing Trees from Traces.,” in COLT, 2019.
[Bibtex]@inproceedings{coltDaviesRR19, author = {Sami Davies and Mikl\'os Z. R\'acz and Cyrus Rashtchian}, title = {Reconstructing Trees from Traces.}, booktitle = {COLT}, year = 2019, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v99/davies19a.html'}}, keywords = {} } -
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} } -
S. S. Shperberg, A. Coles, B. Cserna, E. Karpas, W. Ruml, and S. E. Shimony, “Allocating Planning Effort When Actions Expire.,” in AAAI, 2019.
[Bibtex]@inproceedings{aaaiShperbergCCKRS19, author = {Shahaf S. Shperberg and Andrew Coles and Bence Cserna and Erez Karpas and Wheeler Ruml and Solomon Eyal Shimony}, title = {Allocating Planning Effort When Actions Expire.}, booktitle = {AAAI}, year = 2019, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v33i01.33012371'}}, keywords = {} } -
M. Cashmore, A. Coles, B. Cserna, E. Karpas, D. Magazzeni, and W. Ruml, “Replanning for Situated Robots.,” in ICAPS, 2019.
[Bibtex]@inproceedings{aipsCashmoreCCKMR19, author = {Michael Cashmore and Andrew Coles and Bence Cserna and Erez Karpas and Daniele Magazzeni and Wheeler Ruml}, title = {Replanning for Situated Robots.}, booktitle = {ICAPS}, year = 2019, doi = {{'@type': 'oa', '#text': 'https://ojs.aaai.org/index.php/ICAPS/article/view/3534'}}, keywords = {} } -
Z. Bartha, N. Sun, and Y. Zhang, “Breaking of 1RSB in Random Regular MAX-NAE-SAT.,” in FOCS, 2019.
[Bibtex]@inproceedings{focsBarthaSZ19, author = {Zsolt Bartha and Nike Sun and Yumeng Zhang}, title = {Breaking of 1RSB in Random Regular MAX-NAE-SAT.}, booktitle = {FOCS}, year = 2019, doi = {https://doi.org/10.1109/FOCS.2019.00086}, keywords = {} }
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} } -
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 Bal\'azs 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} } -
Y. Ma, A. Olshevsky, C. Szepesvári, and V. Saligrama, “Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers.,” in ICML, 2018.
[Bibtex]@inproceedings{icmlMaOSS18, author = {Yao Ma and Alexander Olshevsky and Csaba Szepesv\'ari and Venkatesh Saligrama}, title = {Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers.}, booktitle = {ICML}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v80/ma18b.html'}}, keywords = {} } -
C. Pike-Burke, S. Agrawal, C. Szepesvári, and S. Grünewälder, “Bandits with Delayed, Aggregated Anonymous Feedback.,” in ICML, 2018.
[Bibtex]@inproceedings{icmlPike-Burke0SG18, author = {Ciara Pike-Burke and Shipra Agrawal and Csaba Szepesv\'ari and Steffen Gr\"unewälder}, title = {Bandits with Delayed, Aggregated Anonymous Feedback.}, booktitle = {ICML}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v80/pike-burke18a.html'}}, keywords = {} } -
G. Weisz, A. György, and C. Szepesvári, “LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration.,” in ICML, 2018.
[Bibtex]@inproceedings{icmlWeiszGS18, author = {Gell\'ert Weisz and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration.}, booktitle = {ICML}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v80/weisz18a.html'}}, keywords = {} } -
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} } -
D. Baráth, “Five-Point Fundamental Matrix Estimation for Uncalibrated Cameras.,” in CVPR, 2018.
[Bibtex]@inproceedings{cvprBarath18, author = {D\'aniel Bar\'ath}, 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. Baráth and J. Matas, “Graph-Cut RANSAC.,” in CVPR, 2018.
[Bibtex]@inproceedings{cvprBarathM18, author = {D\'aniel Bar\'ath 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} } -
G. Dalal, B. Szörényi, G. Thoppe, and S. Mannor, “Finite Sample Analyses for TD(0) With Function Approximation.,” in AAAI, 2018.
[Bibtex]@inproceedings{aaaiDalalSTM18, author = {Gal Dalal and Bal\'azs Sz\"or\'enyi and Gugan Thoppe and Shie Mannor}, title = {Finite Sample Analyses for TD(0) With Function Approximation.}, booktitle = {AAAI}, year = 2018, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v32i1.12079'}}, keywords = {} } -
G. Dalal, G. Thoppe, B. Szörényi, and S. Mannor, “Finite Sample Analysis of Two-Timescale Stochastic Approximation with Applications to Reinforcement Learning.,” in COLT, 2018.
[Bibtex]@inproceedings{coltDalalTSM18, author = {Gal Dalal and Gugan Thoppe and Bal\'azs Sz\"or\'enyi and Shie Mannor}, title = {Finite Sample Analysis of Two-Timescale Stochastic Approximation with Applications to Reinforcement Learning.}, booktitle = {COLT}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v75/dalal18a.html'}}, keywords = {} } -
A. E. Mesaoudi-Paul, E. Hüllermeier, and R. Busa-Fekete, “Ranking Distributions based on Noisy Sorting.,” in ICML, 2018.
[Bibtex]@inproceedings{icmlMesaoudi-PaulHB18, author = {Adil El Mesaoudi-Paul and Eyke H\"ullermeier and R\'obert Busa-Fekete}, title = {Ranking Distributions based on Noisy Sorting.}, booktitle = {ICML}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v80/mesaoudi-paul18a.html'}}, keywords = {} } -
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} } -
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} } -
H. A. Akitaya, R. Fulek, and C. D. Tóth, “Recognizing Weak Embeddings of Graphs.,” in SODA, 2018.
[Bibtex]@inproceedings{sodaAkitayaFT18, author = {Hugo A. Akitaya and Radoslav Fulek and Csaba D. T\'oth}, title = {Recognizing Weak Embeddings of Graphs.}, booktitle = {SODA}, year = 2018, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975031.20'}}, keywords = {} } -
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} } -
S. S. Du, J. D. Lee, Y. Tian, A. Singh, and B. Póczos, “Gradient Descent Learns One-hidden-layer CNN: Don’t be Afraid of Spurious Local Minima.,” in ICML, 2018.
[Bibtex]@inproceedings{icmlDuLTSP18, author = {Simon S. Du and Jason D. Lee and Yuandong Tian and Aarti Singh and Barnab\'as P\'oczos}, title = {Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minima.}, booktitle = {ICML}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v80/du18b.html'}}, keywords = {} } -
J. B. Oliva, A. Dubey, M. Zaheer, B. Póczos, R. Salakhutdinov, E. P. Xing, and J. Schneider, “Transformation Autoregressive Networks.,” in ICML, 2018.
[Bibtex]@inproceedings{icmlOlivaDZPSXS18, author = {Junier B. Oliva and Avinava Dubey and Manzil Zaheer and Barnab\'as P\'oczos and Ruslan Salakhutdinov and Eric P. Xing and Jeff Schneider}, title = {Transformation Autoregressive Networks.}, booktitle = {ICML}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v80/oliva18a.html'}}, keywords = {} } -
E. Kotelnikov, L. Kovács, and A. Voronkov, “A FOOLish Encoding of the Next State Relations of Imperative Programs.,” in IJCAR, 2018.
[Bibtex]@inproceedings{cadeKotelnikovKV18, author = {Evgenii Kotelnikov and Laura Kov\'acs and Andrei Voronkov}, title = {A FOOLish Encoding of the Next State Relations of Imperative Programs.}, booktitle = {IJCAR}, year = 2018, doi = {https://doi.org/10.1007/978-3-319-94205-6_27}, keywords = {} } -
D. Aggarwal, A. Joux, A. Prakash, and M. Santha, “A New Public-Key Cryptosystem via Mersenne Numbers.,” in CRYPTO (3), 2018.
[Bibtex]@inproceedings{cryptoAggarwalJPS18, author = {Divesh Aggarwal and Antoine Joux and Anupam Prakash and Miklos Santha}, title = {A New Public-Key Cryptosystem via Mersenne Numbers.}, booktitle = {CRYPTO (3)}, year = 2018, doi = {https://doi.org/10.1007/978-3-319-96878-0_16}, keywords = {} } -
T. Lykouris, K. Sridharan, and É. Tardos, “Small-loss bounds for online learning with partial information.,” in COLT, 2018.
[Bibtex]@inproceedings{coltLykourisST18, author = {Thodoris Lykouris and Karthik Sridharan and \'Eva Tardos}, title = {Small-loss bounds for online learning with partial information.}, booktitle = {COLT}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v75/lykouris18a.html'}}, keywords = {} } -
G. Neu and L. Rosasco, “Iterate Averaging as Regularization for Stochastic Gradient Descent.,” in COLT, 2018.
[Bibtex]@inproceedings{coltNeuR18, author = {Gergely Neu and Lorenzo Rosasco}, title = {Iterate Averaging as Regularization for Stochastic Gradient Descent.}, booktitle = {COLT}, year = 2018, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v75/neu18a.html'}}, keywords = {} } -
M. Bonamy, E. Bonnet, N. Bousquet, P. Charbit, and S. Thomassé, “EPTAS for Max Clique on Disks and Unit Balls.,” in FOCS, 2018.
[Bibtex]@inproceedings{focsBonamyBBCT18, author = {Marthe Bonamy and Edouard Bonnet and Nicolas Bousquet and Pierre Charbit and St\'ephan Thomass\'e}, title = {EPTAS for Max Clique on Disks and Unit Balls.}, booktitle = {FOCS}, year = 2018, doi = {['https://doi.org/10.1109/FOCS.2018.00060', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00060']}, keywords = {} } -
C. Ma, A. Kadav, I. Melvin, Z. Kira, G. AlRegib, and H. P. Graf, “Attend and Interact: Higher-Order Object Interactions for Video Understanding.,” in CVPR, 2018.
[Bibtex]@inproceedings{cvprMaKMKAG18, author = {Chih-Yao Ma and Asim Kadav and Iain Melvin and Zsolt Kira and Ghassan AlRegib and Hans Peter Graf}, title = {Attend and Interact: Higher-Order Object Interactions for Video Understanding.}, booktitle = {CVPR}, year = 2018, doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_cvpr_2018/html/Ma_Attend_and_Interact_CVPR_2018_paper.html'}, 'https://doi.org/10.1109/CVPR.2018.00710', 'https://doi.ieeecomputersociety.org/10.1109/CVPR.2018.00710']}, keywords = {} } -
Z. Friggstad, S. Gollapudi, K. Kollias, T. Sarlós, C. Swamy, and A. Tomkins, “Orienteering Algorithms for Generating Travel Itineraries.,” in WSDM, 2018.
[Bibtex]@inproceedings{wsdmFriggstadGKSST18, author = {Zachary Friggstad and Sreenivas Gollapudi and Kostas Kollias and Tam\'as Sarl\'os and Chaitanya Swamy and Andrew Tomkins}, title = {Orienteering Algorithms for Generating Travel Itineraries.}, booktitle = {WSDM}, year = 2018, doi = {https://doi.org/10.1145/3159652.3159697}, keywords = {} } -
G. Pogudin and Á. Szántó, “Irredundant Triangular Decomposition.,” in ISSAC, 2018.
[Bibtex]@inproceedings{issacPogudinS18, author = {Gleb Pogudin and \'Agnes Sz\'ant\'o}, title = {Irredundant Triangular Decomposition.}, booktitle = {ISSAC}, year = 2018, doi = {['https://doi.org/10.1145/3208976.3208996', 'https://www.wikidata.org/entity/Q131136634']}, keywords = {} } -
M. Li, L. A. Jeni, and D. Ramanan, “Brute-Force Facial Landmark Analysis With a 140, 000-Way Classifier.,” in AAAI, 2018.
[Bibtex]@inproceedings{aaaiLiJR18, author = {Mengtian Li and L\'aszl\'o A. Jeni and Deva Ramanan}, title = {Brute-Force Facial Landmark Analysis With a 140, 000-Way Classifier.}, booktitle = {AAAI}, year = 2018, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v32i1.12311'}}, keywords = {} } -
E. J. Kim and O. Kwon, “Erdős-Pósa property of chordless cycles and its applications.,” in SODA, 2018.
[Bibtex]@inproceedings{sodaKimK18, author = {Eun Jung Kim and O-joung Kwon}, title = {Erdős-Pósa property of chordless cycles and its applications.}, booktitle = {SODA}, year = 2018, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975031.109'}}, keywords = {} } -
E. Laude, J. Lange, J. Schüpfer, C. Domokos, L. Leal-Taixé, F. R. Schmidt, B. Andres, and D. Cremers, “Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs.,” in CVPR, 2018.
[Bibtex]@inproceedings{cvprLaudeLSDLSAC18, author = {Emanuel Laude and Jan-Hendrik Lange and Jonas Sch\"upfer and Csaba Domokos and Laura Leal-Taix\'e and Frank R. Schmidt and Bjoern Andres and Daniel Cremers}, title = {Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs.}, booktitle = {CVPR}, year = 2018, doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_cvpr_2018/html/Laude_Discrete-Continuous_ADMM_for_CVPR_2018_paper.html'}, 'https://doi.org/10.1109/CVPR.2018.00174', 'https://doi.ieeecomputersociety.org/10.1109/CVPR.2018.00174']}, keywords = {} } -
B. Pejó, Q. Tang, and G. Biczók, “The Price of Privacy in Collaborative Learning.,” in CCS, 2018.
[Bibtex]@inproceedings{ccsPejo0B18, author = {Bal\'azs Pej\'o and Qiang Tang and Gergely Bicz\'ok}, title = {The Price of Privacy in Collaborative Learning.}, booktitle = {CCS}, year = 2018, doi = {https://doi.org/10.1145/3243734.3278525}, keywords = {BME and mostly_hungarian and applied} } -
D. Dadush, L. A. Végh, and G. Zambelli, “Geometric Rescaling Algorithms for Submodular Function Minimization.,” in SODA, 2018.
[Bibtex]@inproceedings{sodaDadushVZ18, author = {Daniel Dadush and L\'aszl\'o A. V\'egh and Giacomo Zambelli}, title = {Geometric Rescaling Algorithms for Submodular Function Minimization.}, booktitle = {SODA}, year = 2018, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611975031.54'}}, keywords = {} } -
O. Svensson, J. Tarnawski, and L. A. Végh, “A constant-factor approximation algorithm for the asymmetric traveling salesman problem.,” in STOC, 2018.
[Bibtex]@inproceedings{stocSvenssonTV18, author = {Ola Svensson and Jakub Tarnawski and L\'aszl\'o A. V\'egh}, title = {A constant-factor approximation algorithm for the asymmetric traveling salesman problem.}, booktitle = {STOC}, year = 2018, doi = {https://doi.org/10.1145/3188745.3188824}, keywords = {} } -
M. de Berg, H. L. Bodlaender, S. Kisfaludi-Bak, and S. Kolay, “An ETH-Tight Exact Algorithm for Euclidean TSP.,” in FOCS, 2018.
[Bibtex]@inproceedings{focsBergBKK18, author = {Mark de Berg and Hans L. Bodlaender and S\'andor Kisfaludi-Bak and Sudeshna Kolay}, title = {An ETH-Tight Exact Algorithm for Euclidean TSP.}, booktitle = {FOCS}, year = 2018, doi = {['https://doi.org/10.1109/FOCS.2018.00050', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00050']}, keywords = {} } -
T. Jager, S. A. Kakvi, and A. May, “On the Security of the PKCS#1 v1.5 Signature Scheme.,” in CCS, 2018.
[Bibtex]@inproceedings{ccsJagerK018, author = {Tibor Jager and Saqib A. Kakvi and Alexander May}, title = {On the Security of the PKCS#1 v1.5 Signature Scheme.}, booktitle = {CCS}, year = 2018, doi = {https://doi.org/10.1145/3243734.3243798}, keywords = {} } -
K. Gjøsteen and T. Jager, “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.,” in CRYPTO (2), 2018.
[Bibtex]@inproceedings{cryptoGjosteenJ18, author = {Kristian Gjøsteen and Tibor Jager}, title = {Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.}, booktitle = {CRYPTO (2)}, year = 2018, doi = {https://doi.org/10.1007/978-3-319-96881-0_4}, keywords = {} } -
M. Abrahamsen, A. Adamaszek, and T. Miltzow, “The art gallery problem is ∃ ℝ-complete.,” in STOC, 2018.
[Bibtex]@inproceedings{stocAbrahamsenAM18, author = {Mikkel Abrahamsen and Anna Adamaszek and Tillmann Miltzow}, title = {The art gallery problem is ∃ ℝ-complete.}, booktitle = {STOC}, year = 2018, doi = {['https://doi.org/10.1145/3188745.3188868', 'https://www.wikidata.org/entity/Q130966490']}, keywords = {} } -
L. Chen, R. Ma, A. Hannák, and C. Wilson, “Investigating the Impact of Gender on Rank in Resume Search Engines.,” in CHI, 2018.
[Bibtex]@inproceedings{chiChenMHW18, author = {Le Chen and Ruijun Ma and Anik\'o Hann\'ak and Christo Wilson}, title = {Investigating the Impact of Gender on Rank in Resume Search Engines.}, booktitle = {CHI}, year = 2018, doi = {https://doi.org/10.1145/3173574.3174225}, keywords = {} } -
K. Fazekas, F. Bacchus, and A. Biere, “Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories.,” in IJCAR, 2018.
[Bibtex]@inproceedings{cadeFazekasBB18, author = {Katalin Fazekas and Fahiem Bacchus and Armin Biere}, title = {Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories.}, booktitle = {IJCAR}, year = 2018, doi = {https://doi.org/10.1007/978-3-319-94205-6_10}, keywords = {} } -
J. L. Abitbol, M. Karsai, J. Magué, J. Chevrot, and E. Fleury, “Socioeconomic Dependencies of Linguistic Patterns in Twitter: a Multivariate Analysis.,” in WWW, 2018.
[Bibtex]@inproceedings{wwwAbitbolKMCF18, author = {Jacob Levy Abitbol and M\'arton Karsai and Jean-Philippe Magu\'e and Jean-Pierre Chevrot and Eric Fleury}, title = {Socioeconomic Dependencies of Linguistic Patterns in Twitter: a Multivariate Analysis.}, booktitle = {WWW}, year = 2018, doi = {https://doi.org/10.1145/3178876.3186011}, keywords = {} } -
T. C. Ferreira, D. Moussallem, Á. Kádár, S. Wubben, and E. Krahmer, “NeuralREG: An end-to-end approach to referring expression generation.,” in ACL (1), 2018.
[Bibtex]@inproceedings{aclKrahmerFWKM18, author = {Thiago Castro Ferreira and Diego Moussallem and \'Akos K\'ad\'ar and Sander Wubben and Emiel Krahmer}, title = {NeuralREG: An end-to-end approach to referring expression generation.}, booktitle = {ACL (1)}, year = 2018, doi = {[{'@type': 'oa', '#text': 'https://aclanthology.org/P18-1182/'}, {'@type': 'oa', '#text': 'https://doi.org/10.18653/v1/P18-1182'}]}, keywords = {} } -
B. Cserna, W. J. Doyle, J. S. Ramsdell, and W. Ruml, “Avoiding Dead Ends in Real-Time Heuristic Search.,” in AAAI, 2018.
[Bibtex]@inproceedings{aaaiCsernaDRR18, author = {Bence Cserna and William J. Doyle and Jordan S. Ramsdell and Wheeler Ruml}, title = {Avoiding Dead Ends in Real-Time Heuristic Search.}, booktitle = {AAAI}, year = 2018, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v32i1.11533'}}, keywords = {} } -
M. Cashmore, A. Coles, B. Cserna, E. Karpas, D. Magazzeni, and W. Ruml, “Temporal Planning while the Clock Ticks.,” in ICAPS, 2018.
[Bibtex]@inproceedings{aipsCashmoreCCKMR18, author = {Michael Cashmore and Andrew Coles and Bence Cserna and Erez Karpas and Daniele Magazzeni and Wheeler Ruml}, title = {Temporal Planning while the Clock Ticks.}, booktitle = {ICAPS}, year = 2018, doi = {https://aaai.org/ocs/index.php/ICAPS/ICAPS18/paper/view/17724}, keywords = {} } -
G. Máttyus and R. Urtasun, “Matching Adversarial Networks.,” in CVPR, 2018.
[Bibtex]@inproceedings{cvprMattyusU18, author = {Gell\'ert M\'attyus and Raquel Urtasun}, title = {Matching Adversarial Networks.}, booktitle = {CVPR}, year = 2018, doi = {[{'@type': 'oa', '#text': 'http://openaccess.thecvf.com/content_cvpr_2018/html/Mattyus_Matching_Adversarial_Networks_CVPR_2018_paper.html'}, 'https://doi.org/10.1109/CVPR.2018.00837', 'https://doi.ieeecomputersociety.org/10.1109/CVPR.2018.00837']}, keywords = {} }
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} } -
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 Bal\'azs Vass and L\'aszl\'o 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} } -
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} } -
M. Zoghi, T. Tunys, M. Ghavamzadeh, B. Kveton, C. Szepesvári, and Z. Wen, “Online Learning to Rank in Stochastic Click Models.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlZoghiTGKSW17, author = {Masrour Zoghi and Tom\'as Tunys and Mohammad Ghavamzadeh and Branislav Kveton and Csaba Szepesv\'ari and Zheng Wen}, title = {Online Learning to Rank in Stochastic Click Models.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/zoghi17a.html'}}, keywords = {} } -
S. Katariya, B. Kveton, C. Szepesvári, C. Vernade, and Z. Wen, “Bernoulli Rank-1 Bandits for Click Feedback.,” in IJCAI, 2017.
[Bibtex]@inproceedings{ijcaiKatariyaKSVW17, author = {Sumeet Katariya and Branislav Kveton and Csaba Szepesv\'ari and Claire Vernade and Zheng Wen}, title = {Bernoulli Rank-1 Bandits for Click Feedback.}, booktitle = {IJCAI}, year = 2017, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2017/278'}}, keywords = {} } -
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} } -
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} } -
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} } -
S. Ravanbakhsh, F. Lanusse, R. Mandelbaum, J. G. Schneider, and B. Póczos, “Enabling Dark Energy Science with Deep Generative Models of Galaxy Images.,” in AAAI, 2017.
[Bibtex]@inproceedings{aaaiRavanbakhshLMSP17, author = {Siamak Ravanbakhsh and François Lanusse and Rachel Mandelbaum and Jeff G. Schneider and Barnab\'as P\'oczos}, title = {Enabling Dark Energy Science with Deep Generative Models of Galaxy Images.}, booktitle = {AAAI}, year = 2017, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v31i1.10755'}}, keywords = {} } -
J. R. Chang, C. Li, B. Póczos, and V. B. V. K. Kumar, “One Network to Solve Them All – Solving Linear Inverse Problems Using Deep Projection Models.,” in ICCV, 2017.
[Bibtex]@inproceedings{iccvChangLPK17, author = {Jen-Hao Rick Chang and Chun-Liang Li and Barnab\'as P\'oczos and B. V. K. Vijaya Kumar}, title = {One Network to Solve Them All - Solving Linear Inverse Problems Using Deep Projection Models.}, booktitle = {ICCV}, year = 2017, doi = {['https://doi.org/10.1109/ICCV.2017.627', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2017.627']}, keywords = {} } -
K. Kandasamy, G. Dasarathy, J. G. Schneider, and B. Póczos, “Multi-fidelity Bayesian Optimisation with Continuous Approximations.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlKandasamyDSP17, author = {Kirthevasan Kandasamy and Gautam Dasarathy and Jeff G. Schneider and Barnab\'as P\'oczos}, title = {Multi-fidelity Bayesian Optimisation with Continuous Approximations.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/kandasamy17a.html'}}, keywords = {} } -
J. B. Oliva, B. Póczos, and J. G. Schneider, “The Statistical Recurrent Unit.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlOlivaPS17, author = {Junier B. Oliva and Barnab\'as P\'oczos and Jeff G. Schneider}, title = {The Statistical Recurrent Unit.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/oliva17a.html'}}, keywords = {} } -
S. Ravanbakhsh, J. G. Schneider, and B. Póczos, “Equivariance Through Parameter-Sharing.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlRavanbakhshSP17, author = {Siamak Ravanbakhsh and Jeff G. Schneider and Barnab\'as P\'oczos}, title = {Equivariance Through Parameter-Sharing.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/ravanbakhsh17a.html'}}, keywords = {} } -
S. Singh and B. Póczos, “Nonparanormal Information Estimation.,” in ICML, 2017.
[Bibtex]@inproceedings{icml0005P17, author = {Shashank Singh and Barnab\'as P\'oczos}, title = {Nonparanormal Information Estimation.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/singh17a.html'}}, keywords = {} } -
W. Chang, C. Li, Y. Yang, and B. Póczos, “Data-driven Random Fourier Features using Stein Effect.,” in IJCAI, 2017.
[Bibtex]@inproceedings{ijcaiChangLYP17, author = {Wei-Cheng Chang and Chun-Liang Li and Yiming Yang and Barnab\'as P\'oczos}, title = {Data-driven Random Fourier Features using Stein Effect.}, booktitle = {IJCAI}, year = 2017, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.24963/ijcai.2017/207'}}, keywords = {} } -
P. Xie, B. Póczos, and E. P. Xing, “Near-Orthogonality Regularization in Kernel Methods.,” in UAI, 2017.
[Bibtex]@inproceedings{uaiXiePX17, author = {Pengtao Xie and Barnab\'as P\'oczos and Eric P. Xing}, title = {Near-Orthogonality Regularization in Kernel Methods.}, booktitle = {UAI}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://auai.org/uai2017/proceedings/papers/6.pdf'}}, keywords = {} } -
A. Humenberger, M. Jaroschek, and L. Kovács, “Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences.,” in ISSAC, 2017.
[Bibtex]@inproceedings{issacHumenbergerJK17, author = {Andreas Humenberger and Maximilian Jaroschek and Laura Kov\'acs}, title = {Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences.}, booktitle = {ISSAC}, year = 2017, doi = {https://doi.org/10.1145/3087604.3087623}, keywords = {} } -
L. Kovács, S. Robillard, and A. Voronkov, “Coming to terms with quantified reasoning.,” in POPL, 2017.
[Bibtex]@inproceedings{poplKovacsRV17, author = {Laura Kov\'acs and Simon Robillard and Andrei Voronkov}, title = {Coming to terms with quantified reasoning.}, booktitle = {POPL}, year = 2017, doi = {['https://doi.org/10.1145/3009837.3009887', 'https://doi.org/10.1145/3093333.3009887']}, keywords = {} } -
G. Neu and V. Gómez, “Fast rates for online learning in Linearly Solvable Markov Decision Processes.,” in COLT, 2017.
[Bibtex]@inproceedings{coltNeuG17, author = {Gergely Neu and Vicenç G\'omez}, title = {Fast rates for online learning in Linearly Solvable Markov Decision Processes.}, booktitle = {COLT}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v65/neu17a.html'}}, keywords = {} } -
T. Liu, G. Lugosi, G. Neu, and D. Tao, “Algorithmic Stability and Hypothesis Complexity.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlLiuLNT17, author = {Tongliang Liu and G\'abor Lugosi and Gergely Neu and Dacheng Tao}, title = {Algorithmic Stability and Hypothesis Complexity.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/liu17c.html'}}, keywords = {} } -
S. Josilo and G. Dán, “A game theoretic analysis of selfish mobile computation offloading.,” in INFOCOM, 2017.
[Bibtex]@inproceedings{infocomJosiloD17, author = {Sladana Josilo and Gy\"orgy D\'an}, title = {A game theoretic analysis of selfish mobile computation offloading.}, booktitle = {INFOCOM}, year = 2017, doi = {https://doi.org/10.1109/INFOCOM.2017.8057148}, keywords = {} } -
Y. Seldin and G. Lugosi, “An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits.,” in COLT, 2017.
[Bibtex]@inproceedings{coltSeldinL17, author = {Yevgeny Seldin and G\'abor Lugosi}, title = {An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits.}, booktitle = {COLT}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v65/seldin17a.html'}}, keywords = {} } -
R. Kumar, M. Raghu, T. Sarlós, and A. Tomkins, “Linear Additive Markov Processes.,” in WWW, 2017.
[Bibtex]@inproceedings{www0001RST17, author = {Ravi Kumar and Maithra Raghu and Tam\'as Sarl\'os and Andrew Tomkins}, title = {Linear Additive Markov Processes.}, booktitle = {WWW}, year = 2017, doi = {https://doi.org/10.1145/3038912.3052644}, keywords = {} } -
W. Jitkrittum, Z. Szabó, and A. Gretton, “An Adaptive Test of Independence with Analytic Kernel Embeddings.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlJitkrittum0G17, author = {Wittawat Jitkrittum and Zolt\'an Szab\'o and Arthur Gretton}, title = {An Adaptive Test of Independence with Analytic Kernel Embeddings.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/jitkrittum17a.html'}}, keywords = {} } -
J. van Apeldoorn, A. Gilyén, S. Gribling, and R. de Wolf, “Quantum SDP-Solvers: Better Upper and Lower Bounds.,” in FOCS, 2017.
[Bibtex]@inproceedings{focsApeldoornGGW17, author = {Joran van Apeldoorn and Andr\'as Gily\'en and Sander Gribling and Ronald de Wolf}, title = {Quantum SDP-Solvers: Better Upper and Lower Bounds.}, booktitle = {FOCS}, year = 2017, doi = {['https://doi.org/10.1109/FOCS.2017.44', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.44']}, keywords = {} } -
A. Gilyén and O. Sattath, “On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local Lemma.,” in FOCS, 2017.
[Bibtex]@inproceedings{focsGilyenS17, author = {Andr\'as Gily\'en and Or Sattath}, title = {On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local Lemma.}, booktitle = {FOCS}, year = 2017, doi = {['https://doi.org/10.1109/FOCS.2017.47', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.47']}, keywords = {} } -
N. Olver and L. A. Végh, “A simpler and faster strongly polynomial algorithm for generalized flow maximization.,” in STOC, 2017.
[Bibtex]@inproceedings{stocOlverV17, author = {Neil Olver and L\'aszl\'o A. V\'egh}, title = {A simpler and faster strongly polynomial algorithm for generalized flow maximization.}, booktitle = {STOC}, year = 2017, doi = {https://doi.org/10.1145/3055399.3055439}, keywords = {} } -
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} } -
S. Kale, Z. S. Karnin, T. Liang, and D. Pál, “Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP.,” in ICML, 2017.
[Bibtex]@inproceedings{icmlKaleKLP17, author = {Satyen Kale and Zohar S. Karnin and Tengyuan Liang and D\'avid P\'al}, title = {Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP.}, booktitle = {ICML}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v70/kale17a.html'}}, keywords = {} } -
C. K. Sønderby, J. Caballero, L. Theis, W. Shi, and F. Huszar, “Amortised MAP Inference for Image Super-resolution.,” in ICLR, 2017.
[Bibtex]@inproceedings{iclrSonderbyCTSH17, author = {Casper Kaae Sønderby and Jose Caballero and Lucas Theis and Wenzhe Shi and Ferenc Huszar}, title = {Amortised MAP Inference for Image Super-resolution.}, booktitle = {ICLR}, year = 2017, doi = {{'@type': 'oa', '#text': 'https://openreview.net/forum?id=S1RP6GLle'}}, keywords = {} } -
B. Cserna, W. Ruml, and J. Frank, “Planning Time to Think: Metareasoning for On-Line Planning with Durative Actions.,” in ICAPS, 2017.
[Bibtex]@inproceedings{aipsCsernaRF17, author = {Bence Cserna and Wheeler Ruml and Jeremy Frank}, title = {Planning Time to Think: Metareasoning for On-Line Planning with Durative Actions.}, booktitle = {ICAPS}, year = 2017, doi = {https://aaai.org/ocs/index.php/ICAPS/ICAPS17/paper/view/15753}, keywords = {} } -
B. Cserna, M. Petrik, R. H. Russel, and W. Ruml, “Value Directed Exploration in Multi-Armed Bandits with Structured Priors.,” in UAI, 2017.
[Bibtex]@inproceedings{uaiCsernaPRR17, author = {Bence Cserna and Marek Petrik and Reazul Hasan Russel and Wheeler Ruml}, title = {Value Directed Exploration in Multi-Armed Bandits with Structured Priors.}, booktitle = {UAI}, year = 2017, doi = {{'@type': 'oa', '#text': 'http://auai.org/uai2017/proceedings/papers/162.pdf'}}, keywords = {} } -
J. Fox and L. M. Lovász, “A tight bound for Green’s arithmetic triangle removal lemma in vector spaces.,” in SODA, 2017.
[Bibtex]@inproceedings{sodaFoxL17, author = {Jacob Fox and L\'aszl\'o Mikl\'os Lov\'asz}, title = {A tight bound for Green's arithmetic triangle removal lemma in vector spaces.}, booktitle = {SODA}, year = 2017, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611974782.106'}, 'http://dl.acm.org/citation.cfm?id=3039792']}, keywords = {} } -
B. Tillman, A. Markopoulou, C. T. Butts, and M. Gjoka, “Construction of Directed 2K Graphs.,” in KDD, 2017.
[Bibtex]@inproceedings{kddTillmanMBG17, author = {B\'alint Tillman and Athina Markopoulou and Carter T. Butts and Minas Gjoka}, title = {Construction of Directed 2K Graphs.}, booktitle = {KDD}, year = 2017, doi = {https://doi.org/10.1145/3097983.3098119}, keywords = {} } -
S. Wang, M. Bai, G. Máttyus, H. Chu, W. Luo, B. Yang, J. Liang, J. Cheverie, S. Fidler, and R. Urtasun, “TorontoCity: Seeing the World with a Million Eyes.,” in ICCV, 2017.
[Bibtex]@inproceedings{iccvWangBMCLYLCFU17, author = {Shenlong Wang and Min Bai and Gell\'ert M\'attyus and Hang Chu and Wenjie Luo and Bin Yang and Justin Liang and Joel Cheverie and Sanja Fidler and Raquel Urtasun}, title = {TorontoCity: Seeing the World with a Million Eyes.}, booktitle = {ICCV}, year = 2017, doi = {['https://doi.org/10.1109/ICCV.2017.327', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2017.327']}, keywords = {} } -
G. Máttyus, W. Luo, and R. Urtasun, “DeepRoadMapper: Extracting Road Topology from Aerial Images.,” in ICCV, 2017.
[Bibtex]@inproceedings{iccvMattyusLU17, author = {Gell\'ert M\'attyus and Wenjie Luo and Raquel Urtasun}, title = {DeepRoadMapper: Extracting Road Topology from Aerial Images.}, booktitle = {ICCV}, year = 2017, doi = {['https://doi.org/10.1109/ICCV.2017.372', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2017.372']}, keywords = {} }
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} } -
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} } -
P. Joulani, A. György, and C. Szepesvári, “Delay-Tolerant Online Convex Optimization: Unified Analysis and Adaptive-Gradient Algorithms.,” in AAAI, 2016.
[Bibtex]@inproceedings{aaaiJoulaniGS16, author = {Pooria Joulani and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {Delay-Tolerant Online Convex Optimization: Unified Analysis and Adaptive-Gradient Algorithms.}, booktitle = {AAAI}, year = 2016, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v30i1.10320'}}, keywords = {} } -
G. Lever, J. Shawe-Taylor, R. Stafford, and C. Szepesvári, “Compressed Conditional Mean Embeddings for Model-Based Reinforcement Learning.,” in AAAI, 2016.
[Bibtex]@inproceedings{aaaiLeverSSS16, author = {Guy Lever and John Shawe-Taylor and Ronnie Stafford and Csaba Szepesv\'ari}, title = {Compressed Conditional Mean Embeddings for Model-Based Reinforcement Learning.}, booktitle = {AAAI}, year = 2016, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v30i1.10304'}}, keywords = {} } -
S. Katariya, B. Kveton, C. Szepesvári, and Z. Wen, “DCM Bandits: Learning to Rank with Multiple Clicks.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlKatariyaKSW16, author = {Sumeet Katariya and Branislav Kveton and Csaba Szepesv\'ari and Zheng Wen}, title = {DCM Bandits: Learning to Rank with Multiple Clicks.}, booktitle = {ICML}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/katariya16.html'}}, keywords = {} } -
Y. Wu, R. Shariff, T. Lattimore, and C. Szepesvári, “Conservative Bandits.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlWuSLS16, author = {Yifan Wu and Roshan Shariff and Tor Lattimore and Csaba Szepesv\'ari}, title = {Conservative Bandits.}, booktitle = {ICML}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/wu16.html'}}, keywords = {} } -
P. L. A., C. Jie, M. C. Fu, S. I. Marcus, and C. Szepesvári, “Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Control.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlAJFMS16, author = {Prashanth L. A. and Cheng Jie and Michael C. Fu and Steven I. Marcus and Csaba Szepesv\'ari}, title = {Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Control.}, booktitle = {ICML}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/la16.html'}}, keywords = {} } -
A. György and C. Szepesvári, “Shifting Regret, Mirror Descent, and Matrices.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlGyorgyS16, author = {Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {Shifting Regret, Mirror Descent, and Matrices.}, booktitle = {ICML}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/gyorgy16.html'}}, keywords = {} } -
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} } -
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} } -
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} } -
L. Babai, “Graph isomorphism in quasipolynomial time [extended abstract].,” in STOC, 2016.
[Bibtex]@inproceedings{stocBabai16, author = {L\'aszl\'o Babai}, title = {Graph isomorphism in quasipolynomial time [extended abstract].}, booktitle = {STOC}, year = 2016, doi = {https://doi.org/10.1145/2897518.2897542}, keywords = {} } -
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} } -
D. J. Sutherland, J. B. Oliva, B. Póczos, and J. G. Schneider, “Linear-Time Learning on Distributions with Approximate Kernel Embeddings.,” in AAAI, 2016.
[Bibtex]@inproceedings{aaaiSutherlandOPS16, author = {Danica J. Sutherland and Junier B. Oliva and Barnab\'as P\'oczos and Jeff G. Schneider}, title = {Linear-Time Learning on Distributions with Approximate Kernel Embeddings.}, booktitle = {AAAI}, year = 2016, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v30i1.10308'}}, keywords = {} } -
S. J. Reddi, A. Hefny, S. Sra, B. Póczos, and A. J. Smola, “Stochastic Variance Reduction for Nonconvex Optimization.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlReddiHSPS16, author = {Sashank J. Reddi and Ahmed Hefny and Suvrit Sra and Barnab\'as P\'oczos and Alexander J. Smola}, title = {Stochastic Variance Reduction for Nonconvex Optimization.}, booktitle = {ICML}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/reddi16.html'}}, keywords = {} } -
S. Ravanbakhsh, B. Póczos, and R. Greiner, “Boolean Matrix Factorization and Noisy Completion via Message Passing.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlRavanbakhshPG16, author = {Siamak Ravanbakhsh and Barnab\'as P\'oczos and Russell Greiner}, title = {Boolean Matrix Factorization and Noisy Completion via Message Passing.}, booktitle = {ICML}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/ravanbakhsha16.html'}}, keywords = {} } -
S. Ravanbakhsh, J. B. Oliva, S. Fromenteau, L. Price, S. Ho, J. G. Schneider, and B. Póczos, “Estimating Cosmological Parameters from the Dark Matter Distribution.,” in ICML, 2016.
[Bibtex]@inproceedings{icmlRavanbakhshOFPH16, author = {Siamak Ravanbakhsh and Junier B. Oliva and Sebastian Fromenteau and Layne Price and Shirley Ho and Jeff G. Schneider and Barnab\'as P\'oczos}, title = {Estimating Cosmological Parameters from the Dark Matter Distribution.}, booktitle = {ICML}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v48/ravanbakhshb16.html'}}, keywords = {} } -
X. Wang, J. B. Oliva, J. G. Schneider, and B. Póczos, “Nonparametric Risk and Stability Analysis for Multi-Task Learning Problems.,” in IJCAI, 2016.
[Bibtex]@inproceedings{ijcaiWangOSP16, author = {Xuezhi Wang and Junier B. Oliva and Jeff G. Schneider and Barnab\'as P\'oczos}, title = {Nonparametric Risk and Stability Analysis for Multi-Task Learning Problems.}, booktitle = {IJCAI}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://www.ijcai.org/Abstract/16/306'}}, keywords = {} } -
C. Li and B. Póczos, “Utilize Old Coordinates: Faster Doubly Stochastic Gradients for Kernel Methods.,” in UAI, 2016.
[Bibtex]@inproceedings{uaiLiP16, author = {Chun-Liang Li and Barnab\'as P\'oczos}, title = {Utilize Old Coordinates: Faster Doubly Stochastic Gradients for Kernel Methods.}, booktitle = {UAI}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://auai.org/uai2016/proceedings/papers/105.pdf'}}, keywords = {} } -
A. Anshu, A. Belovs, S. Ben-David, M. Göös, R. Jain, R. Kothari, T. Lee, and M. Santha, “Separations in Communication Complexity Using Cheat Sheets and Information Complexity.,” in FOCS, 2016.
[Bibtex]@inproceedings{focsAnshuBBG0KLS16, author = {Anurag Anshu and Aleksandrs Belovs and Shalev Ben-David and Mika G\"o\"os and Rahul Jain and Robin Kothari and Troy Lee and Miklos Santha}, title = {Separations in Communication Complexity Using Cheat Sheets and Information Complexity.}, booktitle = {FOCS}, year = 2016, doi = {['https://doi.org/10.1109/FOCS.2016.66', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.66']}, keywords = {} } -
A. Ambainis, K. Balodis, A. Belovs, T. Lee, M. Santha, and J. Smotrovs, “Separations in query complexity based on pointer functions.,” in STOC, 2016.
[Bibtex]@inproceedings{stocAmbainisBBLSS16, author = {Andris Ambainis and Kaspars Balodis and Aleksandrs Belovs and Troy Lee and Miklos Santha and Juris Smotrovs}, title = {Separations in query complexity based on pointer functions.}, booktitle = {STOC}, year = 2016, doi = {https://doi.org/10.1145/2897518.2897524}, keywords = {} } -
V. Vincze, G. Gosztolya, L. Tóth, I. Hoffmann, G. Szatlóczki, Z. Bánréti, M. Pákáski, and J. Kálmán, “Detecting Mild Cognitive Impairment by Exploiting Linguistic Information from Transcripts.,” in ACL (2), 2016.
[Bibtex]@inproceedings{aclVinczeGTHSBPK16, author = {Veronika Vincze and G\'abor Gosztolya and L\'aszl\'o T\'oth and Ildik\'o Hoffmann and Gr\'eta Szatl\'oczki and Zolt\'an B\'anr\'eti and Magdolna P\'ak\'aski and J\'anos K\'alm\'an}, title = {Detecting Mild Cognitive Impairment by Exploiting Linguistic Information from Transcripts.}, booktitle = {ACL (2)}, year = 2016, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.18653/v1/p16-2030'}, {'@type': 'oa', '#text': 'https://aclanthology.org/P16-2030/'}]}, keywords = {SZTE and mostly_hungarian and applied} } -
S. Laki, D. Horpácsi, P. Vörös, R. Kitlei, D. Leskó, and Máté. Tejfel, “High speed packet forwarding compiled from protocol independent data plane specifications.,” in SIGCOMM, 2016.
[Bibtex]@inproceedings{sigcommLakiHVKLT16, author = {S\'andor Laki and D\'aniel Horp\'acsi and P\'eter V\"or\"os and R\'obert Kitlei and D\'aniel Lesk\'o and M\'at\'e Tejfel}, title = {High speed packet forwarding compiled from protocol independent data plane specifications.}, booktitle = {SIGCOMM}, year = 2016, doi = {['https://doi.org/10.1145/2934872.2959080', 'https://www.wikidata.org/entity/Q130888900']}, keywords = {ELTE and mostly_hungarian and applied} } -
T. Lykouris, V. Syrgkanis, and É. Tardos, “Learning and Efficiency in Games with Dynamic Population.,” in SODA, 2016.
[Bibtex]@inproceedings{sodaLykourisST16, author = {Thodoris Lykouris and Vasilis Syrgkanis and \'Eva Tardos}, title = {Learning and Efficiency in Games with Dynamic Population.}, booktitle = {SODA}, year = 2016, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611974331.ch9'}, 'http://dl.acm.org/citation.cfm?id=2884444']}, keywords = {} } -
T. Kocák, G. Neu, and M. Valko, “Online learning with Erdos-Renyi side-observation graphs.,” in UAI, 2016.
[Bibtex]@inproceedings{uaiKocakNV16, author = {Tom\'as Koc\'ak and Gergely Neu and Michal Valko}, title = {Online learning with Erdos-Renyi side-observation graphs.}, booktitle = {UAI}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://auai.org/uai2016/proceedings/papers/212.pdf'}}, keywords = {} } -
E. Bonnet, “The Complexity of Playing Durak.,” in IJCAI, 2016.
[Bibtex]@inproceedings{ijcaiBonnet16, author = {Edouard Bonnet}, title = {The Complexity of Playing Durak.}, booktitle = {IJCAI}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://www.ijcai.org/Abstract/16/023'}}, keywords = {} } -
G. P. Patra, C. E. Rothenberg, and G. Pongrácz, “MACSAD: Multi-Architecture Compiler System for Abstract Dataplanes (aka Partnering P4 with ODP).,” in SIGCOMM, 2016.
[Bibtex]@inproceedings{sigcommPatraRP16, author = {P. Gyanesh Patra and Christian Esteve Rothenberg and Gergely Pongr\'acz}, title = {MACSAD: Multi-Architecture Compiler System for Abstract Dataplanes (aka Partnering P4 with ODP).}, booktitle = {SIGCOMM}, year = 2016, doi = {['https://doi.org/10.1145/2934872.2959077', 'https://www.wikidata.org/entity/Q130883894']}, keywords = {Ericsson and international and applied} } -
F. Chierichetti, A. Dasgupta, R. Kumar, S. Lattanzi, and T. Sarlós, “On Sampling Nodes in a Network.,” in WWW, 2016.
[Bibtex]@inproceedings{wwwChierichetti0KL16, author = {Flavio Chierichetti and Anirban Dasgupta and Ravi Kumar and Silvio Lattanzi and Tam\'as Sarl\'os}, title = {On Sampling Nodes in a Network.}, booktitle = {WWW}, year = 2016, doi = {https://doi.org/10.1145/2872427.2883045}, keywords = {} } -
S. Clinchant, G. Csurka, and B. Chidlovskii, “A Domain Adaptation Regularization for Denoising Autoencoders.,” in ACL (2), 2016.
[Bibtex]@inproceedings{aclClinchantCC16, author = {St\'ephane Clinchant and Gabriela Csurka and Boris Chidlovskii}, title = {A Domain Adaptation Regularization for Denoising Autoencoders.}, booktitle = {ACL (2)}, year = 2016, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.18653/v1/p16-2005'}, {'@type': 'oa', '#text': 'https://aclanthology.org/P16-2005/'}]}, keywords = {} } -
S. Clinchant, B. Chidlovskii, and G. Csurka, “Transductive Adaptation of Black Box Predictions.,” in ACL (2), 2016.
[Bibtex]@inproceedings{aclClinchantCC16a, author = {St\'ephane Clinchant and Boris Chidlovskii and Gabriela Csurka}, title = {Transductive Adaptation of Black Box Predictions.}, booktitle = {ACL (2)}, year = 2016, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.18653/v1/p16-2053'}, {'@type': 'oa', '#text': 'https://aclanthology.org/P16-2053/'}]}, keywords = {} } -
B. Chidlovskii, S. Clinchant, and G. Csurka, “Domain Adaptation in the Absence of Source Domain Data.,” in KDD, 2016.
[Bibtex]@inproceedings{kddChidlovskiiCC16, author = {Boris Chidlovskii and St\'ephane Clinchant and Gabriela Csurka}, title = {Domain Adaptation in the Absence of Source Domain Data.}, booktitle = {KDD}, year = 2016, doi = {https://doi.org/10.1145/2939672.2939716}, keywords = {} } -
P. Mavridis, D. Gross-Amblard, and Z. Miklós, “Using Hierarchical Skills for Optimized Task Assignment in Knowledge-Intensive Crowdsourcing.,” in WWW, 2016.
[Bibtex]@inproceedings{wwwMavridisGM16, author = {Panagiotis Mavridis and David Gross-Amblard and Zolt\'an Mikl\'os}, title = {Using Hierarchical Skills for Optimized Task Assignment in Knowledge-Intensive Crowdsourcing.}, booktitle = {WWW}, year = 2016, doi = {https://doi.org/10.1145/2872427.2883070}, keywords = {} } -
J. O. Winkler, F. Balint-Benczedi, T. Wiedemeyer, M. Beetz, N. Vaskevicius, C. A. Mueller, T. Fromm, and A. Birk, “Knowledge-Enabled Robotic Agents for Shelf Replenishment in Cluttered Retail Environments: (Extended Abstract).,” in AAMAS, 2016.
[Bibtex]@inproceedings{atalWinklerBWBVMF016, author = {Jan Oliver Winkler and Ferenc Balint-Benczedi and Thiemo Wiedemeyer and Michael Beetz and Narunas Vaskevicius and Christian A. Mueller and Tobias Fromm and Andreas Birk}, title = {Knowledge-Enabled Robotic Agents for Shelf Replenishment in Cluttered Retail Environments: (Extended Abstract).}, booktitle = {AAMAS}, year = 2016, doi = {http://dl.acm.org/citation.cfm?id=2937190}, keywords = {} } -
F. Orabona and D. Pál, “Open Problem: Parameter-Free and Scale-Free Online Algorithms.,” in COLT, 2016.
[Bibtex]@inproceedings{coltOrabonaP16, author = {Francesco Orabona and D\'avid P\'al}, title = {Open Problem: Parameter-Free and Scale-Free Online Algorithms.}, booktitle = {COLT}, year = 2016, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v49/orabona16.html'}}, keywords = {} } -
A. Sebo and A. van Zuylen, “The Salesman’s Improved Paths: A 3/2+1/34 Approximation.,” in FOCS, 2016.
[Bibtex]@inproceedings{focsSeboZ16, author = {Andras Sebo and Anke van Zuylen}, title = {The Salesman's Improved Paths: A 3/2+1/34 Approximation.}, booktitle = {FOCS}, year = 2016, doi = {['https://doi.org/10.1109/FOCS.2016.21', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.21']}, keywords = {} } -
I. Haller, Y. Jeon, H. Peng, M. Payer, C. Giuffrida, H. Bos, and E. van der Kouwe, “TypeSan: Practical Type Confusion Detection.,” in CCS, 2016.
[Bibtex]@inproceedings{ccsHallerJPPGBK16, author = {Istv\'an Haller and Yuseok Jeon and Hui Peng and Mathias Payer and Cristiano Giuffrida and Herbert Bos and Erik van der Kouwe}, title = {TypeSan: Practical Type Confusion Detection.}, booktitle = {CCS}, year = 2016, doi = {https://doi.org/10.1145/2976749.2978405}, keywords = {} } -
A. Kannan, K. Kurach, S. Ravi, T. Kaufmann, A. Tomkins, B. Miklos, G. Corrado, L. Lukács, M. Ganea, P. Young, and V. Ramavajjala, “Smart Reply: Automated Response Suggestion for Email.,” in KDD, 2016.
[Bibtex]@inproceedings{kddKannanKRKTMCLGY16, author = {Anjuli Kannan and Karol Kurach and Sujith Ravi and Tobias Kaufmann and Andrew Tomkins and Balint Miklos and Greg Corrado and L\'aszl\'o Luk\'acs and Marina Ganea and Peter Young and Vivek Ramavajjala}, title = {Smart Reply: Automated Response Suggestion for Email.}, booktitle = {KDD}, year = 2016, doi = {https://doi.org/10.1145/2939672.2939801}, keywords = {} }
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} } -
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} } -
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} } -
N. Bard, D. Nicholas, C. Szepesvári, and M. H. Bowling, “Decision-theoretic Clustering of Strategies.,” in AAMAS, 2015.
[Bibtex]@inproceedings{atalBardNSB15, author = {Nolan Bard and Deon Nicholas and Csaba Szepesv\'ari and Michael H. Bowling}, title = {Decision-theoretic Clustering of Strategies.}, booktitle = {AAMAS}, year = 2015, doi = {http://dl.acm.org/citation.cfm?id=2772886}, keywords = {} } -
B. Kveton, C. Szepesvári, Z. Wen, and A. Ashkan, “Cascading Bandits: Learning to Rank in the Cascade Model.,” in ICML, 2015.
[Bibtex]@inproceedings{icmlKvetonSWA15, author = {Branislav Kveton and Csaba Szepesv\'ari and Zheng Wen and Azin Ashkan}, title = {Cascading Bandits: Learning to Rank in the Cascade Model.}, booktitle = {ICML}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v37/kveton15.html'}}, keywords = {} } -
Y. Wu, A. György, and C. Szepesvári, “On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments.,” in ICML, 2015.
[Bibtex]@inproceedings{icmlWuGS15, author = {Yifan Wu and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments.}, booktitle = {ICML}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v37/wub15.html'}}, keywords = {} } -
R. Huang, A. György, and C. Szepesvári, “Deterministic Independent Component Analysis.,” in ICML, 2015.
[Bibtex]@inproceedings{icmlHuangGS15, author = {Ruitong Huang and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {Deterministic Independent Component Analysis.}, booktitle = {ICML}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v37/huangb15.html'}}, keywords = {} } -
P. Joulani, A. György, and C. Szepesvári, “Fast Cross-Validation for Incremental Learning.,” in IJCAI, 2015.
[Bibtex]@inproceedings{ijcaiJoulaniGS15, author = {Pooria Joulani and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {Fast Cross-Validation for Incremental Learning.}, booktitle = {IJCAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Abstract/15/506'}}, keywords = {} } -
Y. Abbasi-Yadkori and C. Szepesvári, “Bayesian Optimal Control of Smoothly Parameterized Systems.,” in UAI, 2015.
[Bibtex]@inproceedings{uaiAbbasi-YadkoriS15, author = {Yasin Abbasi-Yadkori and Csaba Szepesv\'ari}, title = {Bayesian Optimal Control of Smoothly Parameterized Systems.}, booktitle = {UAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://auai.org/uai2015/proceedings/papers/271.pdf'}}, keywords = {} } -
J. Fox, J. Pach, and A. Suk, “Density and regularity theorems for semi-algebraic hypergraphs.,” in SODA, 2015.
[Bibtex]@inproceedings{sodaFoxPS15, author = {Jacob Fox and J\'anos Pach and Andrew Suk}, title = {Density and regularity theorems for semi-algebraic hypergraphs.}, booktitle = {SODA}, year = 2015, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973730.100'}}, keywords = {} } -
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} } -
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} } -
D. Szabó, F. Németh, B. Sonkoly, A. Gulyás, and F. H. P. Fitzek, “Towards the 5G Revolution: A Software Defined Network Architecture Exploiting Network Coding as a Service.,” in SIGCOMM, 2015.
[Bibtex]@inproceedings{sigcommSzaboNSGF15, author = {D\'avid Szab\'o and Felician N\'emeth and Bal\'azs Sonkoly and Andr\'as Guly\'as and Frank H. P. Fitzek}, title = {Towards the 5G Revolution: A Software Defined Network Architecture Exploiting Network Coding as a Service.}, booktitle = {SIGCOMM}, year = 2015, doi = {['https://doi.org/10.1145/2785956.2790025', 'https://doi.org/10.1145/2829988.2790025']}, keywords = {BME and mostly_hungarian and applied} } -
T. Lévai, I. Pelle, F. Németh, and A. Gulyás, “EPOXIDE: A Modular Prototype for SDN Troubleshooting.,” in SIGCOMM, 2015.
[Bibtex]@inproceedings{sigcommLevaiPNG15, author = {Tam\'as L\'evai and Istv\'an Pelle and Felician N\'emeth and Andr\'as Guly\'as}, title = {EPOXIDE: A Modular Prototype for SDN Troubleshooting.}, booktitle = {SIGCOMM}, year = 2015, doi = {['https://doi.org/10.1145/2785956.2790027', 'https://doi.org/10.1145/2829988.2790027', 'https://www.wikidata.org/entity/Q131118802']}, keywords = {BME and all_hungarian 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} } -
B. Sonkoly, J. Czentye, R. Szabó, D. Jocha, J. Elek, S. Sahhaf, W. Tavernier, and F. Risso, “Multi-Domain Service Orchestration Over Networks and Clouds: A Unified Approach.,” in SIGCOMM, 2015.
[Bibtex]@inproceedings{sigcommSonkolyCSJESTR15, author = {Bal\'azs Sonkoly and J\'anos Czentye and R\'obert Szab\'o and D\'avid Jocha and J\'anos Elek and Sahel Sahhaf and Wouter Tavernier and Fulvio Risso}, title = {Multi-Domain Service Orchestration Over Networks and Clouds: A Unified Approach.}, booktitle = {SIGCOMM}, year = 2015, doi = {['https://doi.org/10.1145/2785956.2790041', 'https://doi.org/10.1145/2829988.2790041']}, keywords = {BME and Ericsson and international and applied} } -
S. J. Reddi, B. Póczos, and A. J. Smola, “Doubly Robust Covariate Shift Correction.,” in AAAI, 2015.
[Bibtex]@inproceedings{aaaiReddiPS15, author = {Sashank Jakkam Reddi and Barnab\'as P\'oczos and Alexander J. Smola}, title = {Doubly Robust Covariate Shift Correction.}, booktitle = {AAAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v29i1.9576'}}, keywords = {} } -
A. Ramdas, S. J. Reddi, B. Póczos, A. Singh, and L. A. Wasserman, “On the Decreasing Power of Kernel and Distance Based Nonparametric Hypothesis Tests in High Dimensions.,” in AAAI, 2015.
[Bibtex]@inproceedings{aaaiRamdasRPSW15, author = {Aaditya Ramdas and Sashank Jakkam Reddi and Barnab\'as P\'oczos and Aarti Singh and Larry A. Wasserman}, title = {On the Decreasing Power of Kernel and Distance Based Nonparametric Hypothesis Tests in High Dimensions.}, booktitle = {AAAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v29i1.9692'}}, keywords = {} } -
K. Kandasamy, J. G. Schneider, and B. Póczos, “High Dimensional Bayesian Optimisation and Bandits via Additive Models.,” in ICML, 2015.
[Bibtex]@inproceedings{icmlKandasamySP15, author = {Kirthevasan Kandasamy and Jeff G. Schneider and Barnab\'as P\'oczos}, title = {High Dimensional Bayesian Optimisation and Bandits via Additive Models.}, booktitle = {ICML}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v37/kandasamy15.html'}}, keywords = {} } -
K. Kandasamy, J. G. Schneider, and B. Póczos, “Bayesian Active Learning for Posterior Estimation – IJCAI-15 Distinguished Paper.,” in IJCAI, 2015.
[Bibtex]@inproceedings{ijcaiKandasamySP15, author = {Kirthevasan Kandasamy and Jeff G. Schneider and Barnab\'as P\'oczos}, title = {Bayesian Active Learning for Posterior Estimation - IJCAI-15 Distinguished Paper.}, booktitle = {IJCAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Abstract/15/507'}}, keywords = {} } -
S. J. Reddi, B. Póczos, and A. J. Smola, “Communication Efficient Coresets for Empirical Loss Minimization.,” in UAI, 2015.
[Bibtex]@inproceedings{uaiReddiPS15, author = {Sashank J. Reddi and Barnab\'as P\'oczos and Alexander J. Smola}, title = {Communication Efficient Coresets for Empirical Loss Minimization.}, booktitle = {UAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://auai.org/uai2015/proceedings/papers/141.pdf'}}, keywords = {} } -
G. Neu, “First-order regret bounds for combinatorial semi-bandits.,” in COLT, 2015.
[Bibtex]@inproceedings{coltNeu15, author = {Gergely Neu}, title = {First-order regret bounds for combinatorial semi-bandits.}, booktitle = {COLT}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v40/Neu15.html'}}, keywords = {} } -
C. Dehnert, S. Junges, N. Jansen, F. Corzilius, M. Volk, H. Bruintjes, J. Katoen, and E. Ábrahám, “PROPhESY: A PRObabilistic ParamEter SYnthesis Tool.,” in CAV (1), 2015.
[Bibtex]@inproceedings{cavDehnertJJCVBKA15, author = {Christian Dehnert and Sebastian Junges and Nils Jansen and Florian Corzilius and Matthias Volk and Harold Bruintjes and Joost-Pieter Katoen and Erika \'Abrah\'am}, title = {PROPhESY: A PRObabilistic ParamEter SYnthesis Tool.}, booktitle = {CAV (1)}, year = 2015, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-319-21690-4_13'}, 'https://www.wikidata.org/entity/Q57800735']}, keywords = {} } -
E. Ábrahám, “Building Bridges between Symbolic Computation and Satisfiability Checking.,” in ISSAC, 2015.
[Bibtex]@inproceedings{issacAbraham15, author = {Erika \'Abrah\'am}, title = {Building Bridges between Symbolic Computation and Satisfiability Checking.}, booktitle = {ISSAC}, year = 2015, doi = {['https://doi.org/10.1145/2755996.2756636', 'https://www.wikidata.org/entity/Q131115972']}, keywords = {} } -
V. Pacifici and G. Dán, “Distributed algorithms for content allocation in interconnected content distribution networks.,” in INFOCOM, 2015.
[Bibtex]@inproceedings{infocomPacificiD15, author = {Valentino Pacifici and Gy\"orgy D\'an}, title = {Distributed algorithms for content allocation in interconnected content distribution networks.}, booktitle = {INFOCOM}, year = 2015, doi = {https://doi.org/10.1109/INFOCOM.2015.7218624}, keywords = {} } -
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} } -
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 = {} } -
W. Jitkrittum, A. Gretton, N. Heess, A. S. M. Eslami, B. Lakshminarayanan, D. Sejdinovic, and Z. Szabó, “Kernel-Based Just-In-Time Learning for Passing Expectation Propagation Messages.,” in UAI, 2015.
[Bibtex]@inproceedings{uaiJitkrittumGHELS15, author = {Wittawat Jitkrittum and Arthur Gretton and Nicolas Heess and S. M. Ali Eslami and Balaji Lakshminarayanan and Dino Sejdinovic and Zolt\'an Szab\'o}, title = {Kernel-Based Just-In-Time Learning for Passing Expectation Propagation Messages.}, booktitle = {UAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'http://auai.org/uai2015/proceedings/papers/235.pdf'}}, keywords = {} } -
J. D. Hauenstein, B. Mourrain, and Á. Szántó, “Certifying Isolated Singular Points and their Multiplicity Structure.,” in ISSAC, 2015.
[Bibtex]@inproceedings{issacHauensteinMS15, author = {Jonathan D. Hauenstein and Bernard Mourrain and \'Agnes Sz\'ant\'o}, title = {Certifying Isolated Singular Points and their Multiplicity Structure.}, booktitle = {ISSAC}, year = 2015, doi = {https://doi.org/10.1145/2755996.2756645}, keywords = {} } -
P. Yadav, M. S. Steinbach, L. Pruinelli, B. L. Westra, C. Delaney, V. Kumar, and G. J. Simon, “Forensic Style Analysis with Survival Trajectories.,” in ICDM, 2015.
[Bibtex]@inproceedings{icdmYadavSPWDKS15, author = {Pranjul Yadav and Michael S. Steinbach and Lisiane Pruinelli and Bonnie L. Westra and Connie Delaney and Vipin Kumar and Gy\"orgy J. Simon}, title = {Forensic Style Analysis with Survival Trajectories.}, booktitle = {ICDM}, year = 2015, doi = {['https://doi.org/10.1109/ICDM.2015.152', 'https://doi.ieeecomputersociety.org/10.1109/ICDM.2015.152']}, keywords = {} } -
N. Q. V. Hung, T. T. Nguyen, V. T. Chau, T. K. Wijaya, Z. Miklós, K. Aberer, A. Gal, and M. Weidlich, “SMART: A tool for analyzing and reconciling schema matching networks.,” in ICDE, 2015.
[Bibtex]@inproceedings{icdeHungTCWMAGW15, author = {Nguyen Quoc Viet Hung and Thanh Tam Nguyen and Vinh Tuan Chau and Tri Kurniawan Wijaya and Zolt\'an Mikl\'os and Karl Aberer and Avigdor Gal and Matthias Weidlich}, title = {SMART: A tool for analyzing and reconciling schema matching networks.}, booktitle = {ICDE}, year = 2015, doi = {['https://doi.org/10.1109/ICDE.2015.7113408', 'https://doi.ieeecomputersociety.org/10.1109/ICDE.2015.7113408']}, keywords = {} } -
V. Dalmau, L. Egri, P. Hell, B. Larose, and A. Rafiey, “Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.,” in LICS, 2015.
[Bibtex]@inproceedings{licsDalmauEHLR15, author = {V\'ictor Dalmau and L\'aszl\'o Egri and Pavol Hell and Benoît Larose and Arash Rafiey}, title = {Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.}, booktitle = {LICS}, year = 2015, doi = {['https://doi.org/10.1109/LICS.2015.52', 'https://doi.ieeecomputersociety.org/10.1109/LICS.2015.52', 'http://dl.acm.org/citation.cfm?id=2876558']}, keywords = {} } -
T. Jager, J. Schwenk, and J. Somorovsky, “On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption.,” in CCS, 2015.
[Bibtex]@inproceedings{ccsJagerSS15, author = {Tibor Jager and J\"org Schwenk and Juraj Somorovsky}, title = {On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption.}, booktitle = {CCS}, year = 2015, doi = {['https://doi.org/10.1145/2810103.2813657', 'https://www.wikidata.org/entity/Q130851569']}, keywords = {} } -
T. Wiedemeyer, F. Balint-Benczedi, and M. Beetz, “Pervasive ‘Calm’ Perception for Autonomous Robotic Agents.,” in AAMAS, 2015.
[Bibtex]@inproceedings{atalWiedemeyerBB15, author = {Thiemo Wiedemeyer and Ferenc Balint-Benczedi and Michael Beetz}, title = {Pervasive 'Calm' Perception for Autonomous Robotic Agents.}, booktitle = {AAMAS}, year = 2015, doi = {http://dl.acm.org/citation.cfm?id=2773264}, keywords = {} } -
F. Balint-Benczedi, T. Wiedemeyer, M. Tenorth, D. Beßler, and M. Beetz, “A Knowledge-Based Approach to Robotic Perception using Unstructured Information Management.,” in AAMAS, 2015.
[Bibtex]@inproceedings{atalBalint-Benczedi15, author = {Ferenc Balint-Benczedi and Thiemo Wiedemeyer and Moritz Tenorth and Daniel Beßler and Michael Beetz}, title = {A Knowledge-Based Approach to Robotic Perception using Unstructured Information Management.}, booktitle = {AAMAS}, year = 2015, doi = {http://dl.acm.org/citation.cfm?id=2773515}, keywords = {} } -
A. Singla, M. Santoni, G. Bartók, P. Mukerji, M. Meenen, and A. Krause, “Incentivizing Users for Balancing Bike Sharing Systems.,” in AAAI, 2015.
[Bibtex]@inproceedings{aaaiSinglaSBMMK15, author = {Adish Singla and Marco Santoni and G\'abor Bart\'ok and Pratik Mukerji and Moritz Meenen and Andreas Krause}, title = {Incentivizing Users for Balancing Bike Sharing Systems.}, booktitle = {AAAI}, year = 2015, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v29i1.9251'}}, keywords = {} } -
G. Chrupala, Á. Kádár, and A. Alishahi, “Learning language through pictures.,” in ACL (2), 2015.
[Bibtex]@inproceedings{aclChrupalaKA15, author = {Grzegorz Chrupala and \'Akos K\'ad\'ar and Afra Alishahi}, title = {Learning language through pictures.}, booktitle = {ACL (2)}, year = 2015, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.3115/v1/p15-2019'}, {'@type': 'oa', '#text': 'https://aclanthology.org/P15-2019/'}, 'https://www.wikidata.org/entity/Q63171274']}, keywords = {} } -
M. Gjoka, B. Tillman, and A. Markopoulou, “Construction of simple graphs with a target joint degree matrix and beyond.,” in INFOCOM, 2015.
[Bibtex]@inproceedings{infocomGjokaTM15, author = {Minas Gjoka and B\'alint Tillman and Athina Markopoulou}, title = {Construction of simple graphs with a target joint degree matrix and beyond.}, booktitle = {INFOCOM}, year = 2015, doi = {https://doi.org/10.1109/INFOCOM.2015.7218534}, keywords = {} } -
G. Máttyus, S. Wang, S. Fidler, and R. Urtasun, “Enhancing Road Maps by Parsing Aerial Images Around the World.,” in ICCV, 2015.
[Bibtex]@inproceedings{iccvMattyusWFU15, author = {Gell\'ert M\'attyus and Shenlong Wang and Sanja Fidler and Raquel Urtasun}, title = {Enhancing Road Maps by Parsing Aerial Images Around the World.}, booktitle = {ICCV}, year = 2015, doi = {['https://doi.org/10.1109/ICCV.2015.197', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2015.197']}, keywords = {} }
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} } -
T. Dick, A. György, and C. Szepesvári, “Online Learning in Markov Decision Processes with Changing Cost Sequences.,” in ICML, 2014.
[Bibtex]@inproceedings{icmlDickGS14, author = {Travis Dick and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {Online Learning in Markov Decision Processes with Changing Cost Sequences.}, booktitle = {ICML}, year = 2014, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v32/dick14.html'}}, keywords = {} } -
J. Neufeld, A. György, C. Szepesvári, and D. Schuurmans, “Adaptive Monte Carlo via Bandit Allocation.,” in ICML, 2014.
[Bibtex]@inproceedings{icmlNeufeldGSS14, author = {James Neufeld and Andr\'as Gy\"orgy and Csaba Szepesv\'ari and Dale Schuurmans}, title = {Adaptive Monte Carlo via Bandit Allocation.}, booktitle = {ICML}, year = 2014, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v32/neufeld14.html'}}, keywords = {} } -
T. Lattimore, K. Crammer, and C. Szepesvári, “Optimal Resource Allocation with Semi-Bandit Feedback.,” in UAI, 2014.
[Bibtex]@inproceedings{uaiLattimoreCS14, author = {Tor Lattimore and Koby Crammer and Csaba Szepesv\'ari}, title = {Optimal Resource Allocation with Semi-Bandit Feedback.}, booktitle = {UAI}, year = 2014, doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2483&proceeding_id=30'}}, keywords = {} } -
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} } -
A. Csoma, B. Sonkoly, L. Csikor, F. Németh, A. Gulyás, W. Tavernier, and S. Sahhaf, “ESCAPE: extensible service chain prototyping environment using mininet, click, NETCONF and POX.,” in SIGCOMM, 2014.
[Bibtex]@inproceedings{sigcommCsomaSCNGTS14, author = {Attila Csoma and Bal\'azs Sonkoly and Levente Csikor and Felician N\'emeth and Andr\'as Guly\'as and Wouter Tavernier and Sahel Sahhaf}, title = {ESCAPE: extensible service chain prototyping environment using mininet, click, NETCONF and POX.}, booktitle = {SIGCOMM}, year = 2014, doi = {['https://doi.org/10.1145/2619239.2631448', 'https://doi.org/10.1145/2740070.2631448']}, keywords = {BME and mostly_hungarian and applied} } -
W. Hedgecock, M. Maróti, Á. Lédeczi, P. Völgyesi, and R. A. Banalagay, “Accurate real-time relative localization using single-frequency GPS.,” in SenSys, 2014.
[Bibtex]@inproceedings{sensysHedgecockMLVB14, author = {Will Hedgecock and Mikl\'os Mar\'oti and \'Akos L\'edeczi and P\'eter V\"olgyesi and Rueben A. Banalagay}, title = {Accurate real-time relative localization using single-frequency GPS.}, booktitle = {SenSys}, year = 2014, doi = {https://doi.org/10.1145/2668332.2668379}, keywords = {} } -
W. Hedgecock, M. Maróti, Á. Lédeczi, P. Völgyesi, and R. A. Banalagay, “PinPtr: a high-precision GPS cloud service.,” in SenSys, 2014.
[Bibtex]@inproceedings{sensysHedgecockMLVB14a, author = {Will Hedgecock and Mikl\'os Mar\'oti and \'Akos L\'edeczi and P\'eter V\"olgyesi and Rueben A. Banalagay}, title = {PinPtr: a high-precision GPS cloud service.}, booktitle = {SenSys}, year = 2014, doi = {https://doi.org/10.1145/2668332.2668342}, keywords = {} } -
A. Taddese, P. Völgyesi, Á. Lédeczi, M. Beccani, E. Susilo, and P. Valdastri, “A modular software architecture for miniature capsule robots based on TinyOS.,” in SenSys, 2014.
[Bibtex]@inproceedings{sensysTaddeseVLBSV14, author = {Addisu Taddese and P\'eter V\"olgyesi and \'Akos L\'edeczi and Marco Beccani and Ekawahyu Susilo and Pietro Valdastri}, title = {A modular software architecture for miniature capsule robots based on TinyOS.}, booktitle = {SenSys}, year = 2014, doi = {['https://doi.org/10.1145/2668332.2668363', 'https://www.wikidata.org/entity/Q56837155']}, keywords = {} } -
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} } -
S. Singh and B. Póczos, “Generalized Exponential Concentration Inequality for Renyi Divergence Estimation.,” in ICML, 2014.
[Bibtex]@inproceedings{icmlSinghP14, author = {Shashank Singh and Barnab\'as P\'oczos}, title = {Generalized Exponential Concentration Inequality for Renyi Divergence Estimation.}, booktitle = {ICML}, year = 2014, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v32/singh14.html'}}, keywords = {} } -
A. Krishnamurthy, K. Kandasamy, B. Póczos, and L. A. Wasserman, “Nonparametric Estimation of Renyi Divergence and Friends.,” in ICML, 2014.
[Bibtex]@inproceedings{icmlKrishnamurthyKPW14, author = {Akshay Krishnamurthy and Kirthevasan Kandasamy and Barnab\'as P\'oczos and Larry A. Wasserman}, title = {Nonparametric Estimation of Renyi Divergence and Friends.}, booktitle = {ICML}, year = 2014, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v32/krishnamurthy14.html'}}, keywords = {} } -
S. J. Reddi and B. Póczos, “k-NN Regression on Functional Data with Incomplete Observations.,” in UAI, 2014.
[Bibtex]@inproceedings{uaiReddiP14, author = {Sashank J. Reddi and Barnab\'as P\'oczos}, title = {k-NN Regression on Functional Data with Incomplete Observations.}, booktitle = {UAI}, year = 2014, doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2505&proceeding_id=30'}}, keywords = {} } -
B. Kégl, “Open Problem: A (missing) boosting-type convergence result for AdaBoost.MH with factorized multi-class classifiers.,” in COLT, 2014.
[Bibtex]@inproceedings{coltKegl14, author = {Bal\'azs K\'egl}, title = {Open Problem: A (missing) boosting-type convergence result for AdaBoost.MH with factorized multi-class classifiers.}, booktitle = {COLT}, year = 2014, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v35/kegl14.html'}}, keywords = {} } -
H. Mohammadmoradi, O. Gnawali, N. Rattner, A. Terzis, and S. A. Szalay, “Robust time synchronization in wireless sensor networks using real time clock.,” in SenSys, 2014.
[Bibtex]@inproceedings{sensysMohammadmoradiG14, author = {Hessam Mohammadmoradi and Omprakash Gnawali and Nir Rattner and Andreas Terzis and A. Sandor Szalay}, title = {Robust time synchronization in wireless sensor networks using real time clock.}, booktitle = {SenSys}, year = 2014, doi = {https://doi.org/10.1145/2668332.2668365}, keywords = {} } -
G. Dán and N. Carlsson, “Dynamic content allocation for cloud-assisted service of periodic workloads.,” in INFOCOM, 2014.
[Bibtex]@inproceedings{infocomDanC14, author = {Gy\"orgy D\'an and Niklas Carlsson}, title = {Dynamic content allocation for cloud-assisted service of periodic workloads.}, booktitle = {INFOCOM}, year = 2014, doi = {https://doi.org/10.1109/INFOCOM.2014.6848013}, keywords = {} } -
G. V. Záruba and K. Farkas, “General chairs welcome welcome message from the general chairs.,” in PerCom, 2014.
[Bibtex]@inproceedings{percomZarubaF14, author = {Gergely V. Z\'aruba and K\'aroly Farkas}, title = {General chairs welcome welcome message from the general chairs.}, booktitle = {PerCom}, year = 2014, doi = {['https://doi.org/10.1109/PerCom.2014.6813932', 'https://doi.ieeecomputersociety.org/10.1109/PerCom.2014.6813932']}, keywords = {BME and international and applied} } -
M. Alamgir, G. Lugosi, and U. von Luxburg, “Density-preserving quantization with application to graph downsampling.,” in COLT, 2014.
[Bibtex]@inproceedings{coltAlamgirLL14, author = {Morteza Alamgir and G\'abor Lugosi and Ulrike von Luxburg}, title = {Density-preserving quantization with application to graph downsampling.}, booktitle = {COLT}, year = 2014, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v35/alamgir14.html'}}, keywords = {} } -
A. Dasgupta, R. Kumar, and T. Sarlós, “On estimating the average degree.,” in WWW, 2014.
[Bibtex]@inproceedings{wwwDasguptaKS14, author = {Anirban Dasgupta and Ravi Kumar and Tam\'as Sarl\'os}, title = {On estimating the average degree.}, booktitle = {WWW}, year = 2014, doi = {https://doi.org/10.1145/2566486.2568019}, keywords = {} } -
D. Aharonov, A. W. Harrow, Z. Landau, D. Nagaj, M. Szegedy, and U. V. Vazirani, “Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law.,” in FOCS, 2014.
[Bibtex]@inproceedings{focsAharonovHLNSV14, author = {Dorit Aharonov and Aram W. Harrow and Zeph Landau and Daniel Nagaj and Mario Szegedy and Umesh V. Vazirani}, title = {Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law.}, booktitle = {FOCS}, year = 2014, doi = {['https://doi.org/10.1109/FOCS.2014.34', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2014.34', 'https://www.wikidata.org/entity/Q59482307']}, keywords = {} } -
M. Singh and L. A. Végh, “Approximating Minimum Cost Connectivity Orientation and Augmentation.,” in SODA, 2014.
[Bibtex]@inproceedings{sodaSinghV14, author = {Mohit Singh and L\'aszl\'o A. V\'egh}, title = {Approximating Minimum Cost Connectivity Orientation and Augmentation.}, booktitle = {SODA}, year = 2014, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973402.122'}}, keywords = {} } -
L. A. Végh, “A strongly polynomial algorithm for generalized flow maximization.,” in STOC, 2014.
[Bibtex]@inproceedings{stocVegh14, author = {L\'aszl\'o A. V\'egh}, title = {A strongly polynomial algorithm for generalized flow maximization.}, booktitle = {STOC}, year = 2014, doi = {https://doi.org/10.1145/2591796.2591806}, keywords = {} } -
A. Bernáth and Y. Kobayashi, “The Generalized Terminal Backup Problem.,” in SODA, 2014.
[Bibtex]@inproceedings{sodaBernathK14, author = {Attila Bern\'ath and Yusuke Kobayashi}, title = {The Generalized Terminal Backup Problem.}, booktitle = {SODA}, year = 2014, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973402.121'}}, keywords = {} } -
N. Q. V. Hung, T. T. Nguyen, Z. Miklós, K. Aberer, A. Gal, and M. Weidlich, “Pay-as-you-go reconciliation in schema matching networks.,” in ICDE, 2014.
[Bibtex]@inproceedings{icdeHungTMAGW14, author = {Nguyen Quoc Viet Hung and Thanh Tam Nguyen and Zolt\'an Mikl\'os and Karl Aberer and Avigdor Gal and Matthias Weidlich}, title = {Pay-as-you-go reconciliation in schema matching networks.}, booktitle = {ICDE}, year = 2014, doi = {['https://doi.org/10.1109/ICDE.2014.6816653', 'https://doi.ieeecomputersociety.org/10.1109/ICDE.2014.6816653']}, keywords = {} } -
L. Egri, P. Hell, B. Larose, and A. Rafiey, “‘i': ‘H’, ‘#text': ‘Space complexity of list -colouring: a dichotomy.’,” in SODA, 2014.
[Bibtex]@inproceedings{sodaEgriHLR14, author = {L\'aszl\'o Egri and Pavol Hell and Benoît Larose and Arash Rafiey}, title = {{'i': 'H', '#text': 'Space complexity of list -colouring: a dichotomy.'}}, booktitle = {SODA}, year = 2014, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973402.26'}}, keywords = {} } -
A. Singla, I. Bogunovic, G. Bartók, A. Karbasi, and A. Krause, “Near-Optimally Teaching the Crowd to Classify.,” in ICML, 2014.
[Bibtex]@inproceedings{icmlSinglaBBKK14, author = {Adish Singla and Ilija Bogunovic and G\'abor Bart\'ok and Amin Karbasi and Andreas Krause}, title = {Near-Optimally Teaching the Crowd to Classify.}, booktitle = {ICML}, year = 2014, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v32/singla14.html'}}, keywords = {} } -
T. Goldschwendt, C. Anthes, G. Schubert, D. Kranzlmüller, and F. Petzold, “The collaborative design platform – A protocol for a mixed reality installation for improved incorporation of laypeople in architecture.,” in ISMAR, 2014.
[Bibtex]@inproceedings{ismarGoldschwendtASKP14, author = {Tibor Goldschwendt and Christoph Anthes and Gerhard Schubert and Dieter Kranzlm\"uller and Frank Petzold}, title = {The collaborative design platform - A protocol for a mixed reality installation for improved incorporation of laypeople in architecture.}, booktitle = {ISMAR}, year = 2014, doi = {['https://doi.org/10.1109/ISMAR.2014.6948477', 'https://doi.ieeecomputersociety.org/10.1109/ISMAR.2014.6948477']}, keywords = {} } -
V. Kuznetsov, L. Szekeres, M. Payer, G. Candea, R. Sekar, and D. Song, “Code-Pointer Integrity.,” in OSDI, 2014.
[Bibtex]@inproceedings{osdiKuznetsovSPCSS14, author = {Volodymyr Kuznetsov and L\'aszl\'o Szekeres and Mathias Payer and George Candea and R. Sekar and Dawn Song}, title = {Code-Pointer Integrity.}, booktitle = {OSDI}, year = 2014, doi = {{'@type': 'oa', '#text': 'https://www.usenix.org/conference/osdi14/technical-sessions/presentation/kuznetsov'}}, keywords = {} }
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} } -
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} } -
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} } -
A. Afkanpour, A. György, C. Szepesvári, and M. Bowling, “A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning.,” in ICML (1), 2013.
[Bibtex]@inproceedings{icmlAfkanpourGSB13, author = {Arash Afkanpour and Andr\'as Gy\"orgy and Csaba Szepesv\'ari and Michael Bowling}, title = {A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning.}, booktitle = {ICML (1)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/afkanpour13.html'}}, keywords = {} } -
Y. Yu, H. Cheng, D. Schuurmans, and C. Szepesvári, “Characterizing the Representer Theorem.,” in ICML (1), 2013.
[Bibtex]@inproceedings{icmlYuCSS13, author = {Yaoliang Yu and Hao Cheng and Dale Schuurmans and Csaba Szepesv\'ari}, title = {Characterizing the Representer Theorem.}, booktitle = {ICML (1)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/yu13.html'}}, keywords = {} } -
B. Á. Pires, C. Szepesvári, and M. Ghavamzadeh, “Cost-sensitive Multiclass Classification Risk Bounds.,” in ICML (3), 2013.
[Bibtex]@inproceedings{icmlPiresSG13, author = {Bernardo \'Avila Pires and Csaba Szepesv\'ari and Mohammad Ghavamzadeh}, title = {Cost-sensitive Multiclass Classification Risk Bounds.}, booktitle = {ICML (3)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/avilapires13.html'}}, keywords = {} } -
P. Joulani, A. György, and C. Szepesvári, “Online Learning under Delayed Feedback.,” in ICML (3), 2013.
[Bibtex]@inproceedings{icmlJoulaniGS13, author = {Pooria Joulani and Andr\'as Gy\"orgy and Csaba Szepesv\'ari}, title = {Online Learning under Delayed Feedback.}, booktitle = {ICML (3)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/joulani13.html'}}, keywords = {} } -
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} } -
F. Németh, B. Sonkoly, L. Csikor, and A. Gulyás, “A large-scale multipath playground for experimenters and early adopters.,” in SIGCOMM, 2013.
[Bibtex]@inproceedings{sigcommNemethSCG13, author = {Felician N\'emeth and Bal\'azs Sonkoly and Levente Csikor and Andr\'as Guly\'as}, title = {A large-scale multipath playground for experimenters and early adopters.}, booktitle = {SIGCOMM}, year = 2013, doi = {['https://doi.org/10.1145/2486001.2491698', 'https://doi.org/10.1145/2534169.2491698', 'https://www.wikidata.org/entity/Q131125899']}, keywords = {BME and all_hungarian and applied} } -
L. Babai, X. Chen, X. Sun, S. Teng, and J. Wilmes, “Faster Canonical Forms for Strongly Regular Graphs.,” in FOCS, 2013.
[Bibtex]@inproceedings{focsBabaiCSTW13, author = {L\'aszl\'o Babai and Xi Chen and Xiaorui Sun and Shang-Hua Teng and John Wilmes}, title = {Faster Canonical Forms for Strongly Regular Graphs.}, booktitle = {FOCS}, year = 2013, doi = {['https://doi.org/10.1109/FOCS.2013.25', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.25']}, keywords = {} } -
L. Babai and J. Wilmes, “Quasipolynomial-time canonical form for steiner designs.,” in STOC, 2013.
[Bibtex]@inproceedings{stocBabaiW13, author = {L\'aszl\'o Babai and John Wilmes}, title = {Quasipolynomial-time canonical form for steiner designs.}, booktitle = {STOC}, year = 2013, doi = {https://doi.org/10.1145/2488608.2488642}, keywords = {} } -
J. Sallai, P. Völgyesi, Á. Lédeczi, K. Pence, T. Bapty, S. Neema, and J. R. Davis, “Acoustic shockwave-based bearing estimation.,” in IPSN, 2013.
[Bibtex]@inproceedings{ipsnSallaiVLPBND13, author = {J\'anos Sallai and P\'eter V\"olgyesi and \'Akos L\'edeczi and Ken Pence and Ted Bapty and Sandeep Neema and James R. Davis}, title = {Acoustic shockwave-based bearing estimation.}, booktitle = {IPSN}, year = 2013, doi = {['https://doi.org/10.1145/2461381.2461409', 'https://doi.org/10.1109/IPSN.2013.6917564']}, keywords = {} } -
A. Dumitrescu and C. D. Tóth, “The traveling salesman problem for lines, balls and planes.,” in SODA, 2013.
[Bibtex]@inproceedings{sodaDumitrescuT13, author = {Adrian Dumitrescu and Csaba D. T\'oth}, title = {The traveling salesman problem for lines, balls and planes.}, booktitle = {SODA}, year = 2013, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973105.59'}}, keywords = {} } -
M. Ajtai, “Lower bounds for RAMs and quantifier elimination.,” in STOC, 2013.
[Bibtex]@inproceedings{stocAjtai13, author = {Mikl\'os Ajtai}, title = {Lower bounds for RAMs and quantifier elimination.}, booktitle = {STOC}, year = 2013, doi = {https://doi.org/10.1145/2488608.2488710}, keywords = {} } -
L. Xiong, B. Póczos, and J. G. Schneider, “Efficient Learning on Point Sets.,” in ICDM, 2013.
[Bibtex]@inproceedings{icdmXiongPS13, author = {Liang Xiong and Barnab\'as P\'oczos and Jeff G. Schneider}, title = {Efficient Learning on Point Sets.}, booktitle = {ICDM}, year = 2013, doi = {['https://doi.org/10.1109/ICDM.2013.59', 'https://doi.ieeecomputersociety.org/10.1109/ICDM.2013.59']}, keywords = {} } -
J. B. Oliva, B. Póczos, and J. G. Schneider, “Distribution to Distribution Regression.,” in ICML (3), 2013.
[Bibtex]@inproceedings{icmlOlivaPS13, author = {Junier B. Oliva and Barnab\'as P\'oczos and Jeff G. Schneider}, title = {Distribution to Distribution Regression.}, booktitle = {ICML (3)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/oliva13.html'}}, keywords = {} } -
S. J. Reddi and B. Póczos, “Scale Invariant Conditional Dependence Measures.,” in ICML (3), 2013.
[Bibtex]@inproceedings{icmlReddiP13, author = {Sashank J. Reddi and Barnab\'as P\'oczos}, title = {Scale Invariant Conditional Dependence Measures.}, booktitle = {ICML (3)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/jreddi13.html'}}, keywords = {} } -
D. J. Sutherland, B. Póczos, and J. G. Schneider, “Active learning and search on low-rank matrices.,” in KDD, 2013.
[Bibtex]@inproceedings{kddSutherlandPS13, author = {Danica J. Sutherland and Barnab\'as P\'oczos and Jeff G. Schneider}, title = {Active learning and search on low-rank matrices.}, booktitle = {KDD}, year = 2013, doi = {https://doi.org/10.1145/2487575.2487627}, keywords = {} } -
L. Kovács and A. Voronkov, “First-Order Theorem Proving and Vampire.,” in CAV, 2013.
[Bibtex]@inproceedings{cavKovacsV13, author = {Laura Kov\'acs and Andrei Voronkov}, title = {First-Order Theorem Proving and Vampire.}, booktitle = {CAV}, year = 2013, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-642-39799-8_1'}}, keywords = {} } -
J. Veness, M. White, M. Bowling, and A. György, “Partition Tree Weighting.,” in DCC, 2013.
[Bibtex]@inproceedings{dccVenessWBG13, author = {Joel Veness and Martha White and Michael Bowling and Andr\'as Gy\"orgy}, title = {Partition Tree Weighting.}, booktitle = {DCC}, year = 2013, doi = {https://doi.org/10.1109/DCC.2013.40}, keywords = {} } -
T. Lee, F. Magniez, and M. Santha, “Improved quantum query algorithms for triangle finding and associativity testing.,” in SODA, 2013.
[Bibtex]@inproceedings{sodaLeeMS13, author = {Troy Lee and Fr\'ed\'eric Magniez and Miklos Santha}, title = {Improved quantum query algorithms for triangle finding and associativity testing.}, booktitle = {SODA}, year = 2013, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973105.107'}}, keywords = {} } -
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} } -
R. Bardenet, M. Brendel, B. Kégl, and M. Sebag, “Collaborative hyperparameter tuning.,” in ICML (2), 2013.
[Bibtex]@inproceedings{icmlBardenetBKS13, author = {R\'emi Bardenet and M\'aty\'as Brendel and Bal\'azs K\'egl and Michèle Sebag}, title = {Collaborative hyperparameter tuning.}, booktitle = {ICML (2)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/bardenet13.html'}}, keywords = {} } -
V. Syrgkanis and É. Tardos, “Composable and efficient mechanisms.,” in STOC, 2013.
[Bibtex]@inproceedings{stocSyrgkanisT13, author = {Vasilis Syrgkanis and \'Eva Tardos}, title = {Composable and efficient mechanisms.}, booktitle = {STOC}, year = 2013, doi = {https://doi.org/10.1145/2488608.2488635}, keywords = {} } -
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} } -
X. Chen, E. Ábrahám, and S. Sankaranarayanan, “Flow*: An Analyzer for Non-linear Hybrid Systems.,” in CAV, 2013.
[Bibtex]@inproceedings{cavChenAS13, author = {Xin Chen and Erika \'Abrah\'am and Sriram Sankaranarayanan}, title = {Flow*: An Analyzer for Non-linear Hybrid Systems.}, booktitle = {CAV}, year = 2013, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-642-39799-8_18'}}, keywords = {} } -
E. Bonnet, F. Jamain, and A. Saffidine, “On the Complexity of Trick-Taking Card Games.,” in IJCAI, 2013.
[Bibtex]@inproceedings{ijcaiBonnetJS13, author = {Edouard Bonnet and Florian Jamain and Abdallah Saffidine}, title = {On the Complexity of Trick-Taking Card Games.}, booktitle = {IJCAI}, year = 2013, doi = {[{'@type': 'archive', '#text': 'http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6920'}, {'@type': 'oa', '#text': 'http://ijcai.org/Abstract/13/079'}]}, keywords = {} } -
V. Pacifici and G. Dán, “Content-peering dynamics of autonomous caches in a content-centric network.,” in INFOCOM, 2013.
[Bibtex]@inproceedings{infocomPacificiD13, author = {Valentino Pacifici and Gy\"orgy D\'an}, title = {Content-peering dynamics of autonomous caches in a content-centric network.}, booktitle = {INFOCOM}, year = 2013, doi = {https://doi.org/10.1109/INFCOM.2013.6566898}, keywords = {} } -
A. Kovacs, “Task Sequencing for Remote Laser Welding in the Automotive Industry.,” in ICAPS, 2013.
[Bibtex]@inproceedings{aipsKovacs13, author = {Andras Kovacs}, title = {Task Sequencing for Remote Laser Welding in the Automotive Industry.}, booktitle = {ICAPS}, year = 2013, doi = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS13/paper/view/5956}, keywords = {ELTE and all_hungarian and applied} } -
Q. V. Le, T. Sarlós, and A. J. Smola, “Fastfood – Computing Hilbert Space Expansions in loglinear time.,” in ICML (3), 2013.
[Bibtex]@inproceedings{icmlLeSS13, author = {Quoc V. Le and Tam\'as Sarl\'os and Alexander J. Smola}, title = {Fastfood - Computing Hilbert Space Expansions in loglinear time.}, booktitle = {ICML (3)}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v28/le13.html'}}, keywords = {} } -
N. N. Dalvi, V. Rastogi, A. Dasgupta, A. D. Sarma, and T. Sarlós, “Optimal hashing schemes for entity matching.,” in WWW, 2013.
[Bibtex]@inproceedings{wwwDalviRDSS13, author = {Nilesh N. Dalvi and Vibhor Rastogi and Anirban Dasgupta and Anish Das Sarma and Tam\'as Sarl\'os}, title = {Optimal hashing schemes for entity matching.}, booktitle = {WWW}, year = 2013, doi = {https://doi.org/10.1145/2488388.2488415}, keywords = {} } -
E. Kiltz, K. Pietrzak, and M. Szegedy, “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.,” in CRYPTO (1), 2013.
[Bibtex]@inproceedings{cryptoKiltzPS13, author = {Eike Kiltz and Krzysztof Pietrzak and Mario Szegedy}, title = {Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.}, booktitle = {CRYPTO (1)}, year = 2013, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-642-40041-4_31'}, 'https://www.wikidata.org/entity/Q59163678']}, keywords = {} } -
F. van Walderveen, N. Zeh, and L. Arge, “Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs.,” in SODA, 2013.
[Bibtex]@inproceedings{sodaWalderveenZA13, author = {Freek van Walderveen and Norbert Zeh and Lars Arge}, title = {Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs.}, booktitle = {SODA}, year = 2013, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973105.65'}}, keywords = {} } -
W. Xia, C. Domokos, J. Dong, L. Cheong, and S. Yan, “Semantic Segmentation without Annotating Segments.,” in ICCV, 2013.
[Bibtex]@inproceedings{iccvXiaDDCY13, author = {Wei Xia and Csaba Domokos and Jian Dong and Loong-Fah Cheong and Shuicheng Yan}, title = {Semantic Segmentation without Annotating Segments.}, booktitle = {ICCV}, year = 2013, doi = {['https://doi.org/10.1109/ICCV.2013.271', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2013.271']}, keywords = {} } -
J. Cheriyan and L. A. Végh, “Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs.,” in FOCS, 2013.
[Bibtex]@inproceedings{focsCheriyanV13, author = {Joseph Cheriyan and L\'aszl\'o A. V\'egh}, title = {Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs.}, booktitle = {FOCS}, year = 2013, doi = {['https://doi.org/10.1109/FOCS.2013.12', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.12']}, keywords = {} } -
N. Q. V. Hung, X. H. Luong, Z. Miklós, T. T. Quan, and K. Aberer, “An MAS negotiation support tool for schema matching.,” in AAMAS, 2013.
[Bibtex]@inproceedings{atalHungLMTA13, author = {Nguyen Quoc Viet Hung and Xuan Hoai Luong and Zolt\'an Mikl\'os and Thanh Tho Quan and Karl Aberer}, title = {An MAS negotiation support tool for schema matching.}, booktitle = {AAMAS}, year = 2013, doi = {http://dl.acm.org/citation.cfm?id=2485240}, keywords = {} } -
A. Hannák, P. Sapiezynski, A. M. Kakhki, B. Krishnamurthy, D. Lazer, A. Mislove, and C. Wilson, “Measuring personalization of web search.,” in WWW, 2013.
[Bibtex]@inproceedings{wwwHannakSKKLMW13, author = {Anik\'o Hann\'ak and Piotr Sapiezynski and Arash Molavi Kakhki and Balachander Krishnamurthy and David Lazer and Alan Mislove and Christo Wilson}, title = {Measuring personalization of web search.}, booktitle = {WWW}, year = 2013, doi = {https://doi.org/10.1145/2488388.2488435}, keywords = {} } -
G. Bartók, “A near-optimal algorithm for finite partial-monitoring games against adversarial opponents.,” in COLT, 2013.
[Bibtex]@inproceedings{coltBartok13, author = {G\'abor Bart\'ok}, title = {A near-optimal algorithm for finite partial-monitoring games against adversarial opponents.}, booktitle = {COLT}, year = 2013, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v30/Bartok13.html'}}, keywords = {} }
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} } -
K. V. Adaricheva, R. H. Sloan, B. Szörényi, and G. Turán, “Horn Belief Contraction: Remainders, Envelopes and Complexity.,” in KR, 2012.
[Bibtex]@inproceedings{krAdarichevaSST12, author = {Kira V. Adaricheva and Robert H. Sloan and Bal\'azs Sz\"or\'enyi and Gy\"orgy Tur\'an}, title = {Horn Belief Contraction: Remainders, Envelopes and Complexity.}, booktitle = {KR}, year = 2012, doi = {{'@type': 'oa', '#text': 'http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4497'}}, keywords = {SZTE and Hungary and international and theory} } -
A. Gulyás, A. Korösi, G. Rétvári, J. Bíró, and D. Szabó, “Brief announcement: network formation games can give rise to realistic networks.,” in PODC, 2012.
[Bibtex]@inproceedings{podcGulyasKRBS12, author = {Andr\'as Guly\'as and Attila Kor\"osi and G\'abor R\'etv\'ari and J\'ozsef B\'ir\'o and D\'avid Szab\'o}, title = {Brief announcement: network formation games can give rise to realistic networks.}, booktitle = {PODC}, year = 2012, doi = {https://doi.org/10.1145/2332432.2332494}, keywords = {BME and all_hungarian and applied} } -
G. Németh and G. Rétvári, “Towards a statistical characterization of the competitiveness of oblivious routing.,” in SIGMETRICS, 2012.
[Bibtex]@inproceedings{sigmetricsNemethR12, author = {G\'abor N\'emeth and G\'abor R\'etv\'ari}, title = {Towards a statistical characterization of the competitiveness of oblivious routing.}, booktitle = {SIGMETRICS}, year = 2012, doi = {['https://doi.org/10.1145/2254756.2254806', 'https://doi.org/10.1145/2318857.2254806']}, keywords = {BME and all_hungarian and applied} } -
H. Yao and C. Szepesvári, “Approximate Policy Iteration with Linear Action Models.,” in AAAI, 2012.
[Bibtex]@inproceedings{aaaiYaoS12, author = {Hengshuai Yao and Csaba Szepesv\'ari}, title = {Approximate Policy Iteration with Linear Action Models.}, booktitle = {AAAI}, year = 2012, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1609/aaai.v26i1.8319'}, 'https://www.wikidata.org/entity/Q113424505']}, keywords = {} } -
G. Bartók, N. Zolghadr, and C. Szepesvári, “An adaptive algorithm for finite stochastic partial monitoring.,” in ICML, 2012.
[Bibtex]@inproceedings{icmlBartokZS12, author = {G\'abor Bart\'ok and Navid Zolghadr and Csaba Szepesv\'ari}, title = {An adaptive algorithm for finite stochastic partial monitoring.}, booktitle = {ICML}, year = 2012, doi = {{'@type': 'oa', '#text': 'http://icml.cc/2012/papers/846.pdf'}}, keywords = {} } -
B. Á. Pires and C. Szepesvári, “Statistical linear estimation with penalized estimators: an application to reinforcement learning.,” in ICML, 2012.
[Bibtex]@inproceedings{icmlPiresS12, author = {Bernardo \'Avila Pires and Csaba Szepesv\'ari}, title = {Statistical linear estimation with penalized estimators: an application to reinforcement learning.}, booktitle = {ICML}, year = 2012, doi = {{'@type': 'oa', '#text': 'http://icml.cc/2012/papers/759.pdf'}}, keywords = {} } -
Y. Yu and C. Szepesvári, “Analysis of Kernel Mean Matching under Covariate Shift.,” in ICML, 2012.
[Bibtex]@inproceedings{icmlYuS12, author = {Yaoliang Yu and Csaba Szepesv\'ari}, title = {Analysis of Kernel Mean Matching under Covariate Shift.}, booktitle = {ICML}, year = 2012, doi = {{'@type': 'oa', '#text': 'http://icml.cc/2012/papers/330.pdf'}}, keywords = {} } -
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} } -
F. Németh, Ádám. Stipkovits, B. Sonkoly, and A. Gulyás, “Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches.,” in SIGCOMM, 2012.
[Bibtex]@inproceedings{sigcommNemethSSG12, author = {Felician N\'emeth and \'Ad\'am Stipkovits and Bal\'azs Sonkoly and Andr\'as Guly\'as}, title = {Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches.}, booktitle = {SIGCOMM}, year = 2012, doi = {['https://doi.org/10.1145/2342356.2342372', 'https://doi.org/10.1145/2377677.2342372']}, keywords = {BME and mostly_hungarian and applied} } -
P. Reinecke, M. Telek, and K. Wolter, “Micro and macro views of discrete-state markov models and their application to efficient simulation with phase-type distributions.,” in SIGMETRICS, 2012.
[Bibtex]@inproceedings{sigmetricsReineckeTW12, author = {Philipp Reinecke and Mikl\'os Telek and Katinka Wolter}, title = {Micro and macro views of discrete-state markov models and their application to efficient simulation with phase-type distributions.}, booktitle = {SIGMETRICS}, year = 2012, doi = {['https://doi.org/10.1145/2254756.2254826', 'https://doi.org/10.1145/2318857.2254826']}, keywords = {BME and international and applied} } -
A. Dumitrescu and C. D. Tóth, “Packing anchored rectangles.,” in SODA, 2012.
[Bibtex]@inproceedings{sodaDumitrescuT12, author = {Adrian Dumitrescu and Csaba D. T\'oth}, title = {Packing anchored rectangles.}, booktitle = {SODA}, year = 2012, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973099.28'}, 'https://dl.acm.org/citation.cfm?id=2095144']}, keywords = {} } -
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} } -
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} } -
M. Ajtai, “Determinism versus nondeterminism with arithmetic tests and computation: extended abstract.,” in STOC, 2012.
[Bibtex]@inproceedings{stocAjtai12, author = {Mikl\'os Ajtai}, title = {Determinism versus nondeterminism with arithmetic tests and computation: extended abstract.}, booktitle = {STOC}, year = 2012, doi = {https://doi.org/10.1145/2213977.2214001}, keywords = {} } -
B. Póczos, Z. Ghahramani, and J. G. Schneider, “Copula-based Kernel Dependency Measures.,” in ICML, 2012.
[Bibtex]@inproceedings{icmlPoczosGS12, author = {Barnab\'as P\'oczos and Zoubin Ghahramani and Jeff G. Schneider}, title = {Copula-based Kernel Dependency Measures.}, booktitle = {ICML}, year = 2012, doi = {{'@type': 'oa', '#text': 'http://icml.cc/2012/papers/417.pdf'}}, keywords = {} } -
K. Hoder, L. Kovács, and A. Voronkov, “Playing in the grey area of proofs.,” in POPL, 2012.
[Bibtex]@inproceedings{poplHoderKV12, author = {Krystof Hoder and Laura Kov\'acs and Andrei Voronkov}, title = {Playing in the grey area of proofs.}, booktitle = {POPL}, year = 2012, doi = {['https://doi.org/10.1145/2103656.2103689', 'https://doi.org/10.1145/2103621.2103689']}, keywords = {} } -
R. P. Leme, V. Syrgkanis, and É. Tardos, “Sequential auctions and externalities.,” in SODA, 2012.
[Bibtex]@inproceedings{sodaLemeST12, author = {Renato Paes Leme and Vasilis Syrgkanis and \'Eva Tardos}, title = {Sequential auctions and externalities.}, booktitle = {SODA}, year = 2012, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973099.70'}, 'https://dl.acm.org/citation.cfm?id=2095186']}, keywords = {} } -
B. Lucier, R. P. Leme, and É. Tardos, “On revenue in the generalized second price auction.,” in WWW, 2012.
[Bibtex]@inproceedings{wwwLucierLT12, author = {Brendan Lucier and Renato Paes Leme and \'Eva Tardos}, title = {On revenue in the generalized second price auction.}, booktitle = {WWW}, year = 2012, doi = {https://doi.org/10.1145/2187836.2187886}, keywords = {} } -
M. Stonebraker, A. Ailamaki, J. Kepner, and S. A. Szalay, “The Future of Scientific Data Bases.,” in ICDE, 2012.
[Bibtex]@inproceedings{icdeStonebrakerAKS12, author = {Michael Stonebraker and Anastasia Ailamaki and Jeremy Kepner and A. Sandor Szalay}, title = {The Future of Scientific Data Bases.}, booktitle = {ICDE}, year = 2012, doi = {['https://doi.org/10.1109/ICDE.2012.151', 'https://doi.ieeecomputersociety.org/10.1109/ICDE.2012.151']}, keywords = {} } -
X. Chen, E. Ábrahám, and S. Sankaranarayanan, “Taylor Model Flowpipe Construction for Non-linear Hybrid Systems.,” in RTSS, 2012.
[Bibtex]@inproceedings{rtssChenAS12, author = {Xin Chen and Erika \'Abrah\'am and Sriram Sankaranarayanan}, title = {Taylor Model Flowpipe Construction for Non-linear Hybrid Systems.}, booktitle = {RTSS}, year = 2012, doi = {['https://doi.org/10.1109/RTSS.2012.70', 'https://doi.ieeecomputersociety.org/10.1109/RTSS.2012.70']}, keywords = {} } -
V. Pacifici, F. Lehrieder, and G. Dán, “Cache capacity allocation for BitTorrent-like systems to minimize inter-ISP traffic.,” in INFOCOM, 2012.
[Bibtex]@inproceedings{infocomPacificiLD12, author = {Valentino Pacifici and Frank Lehrieder and Gy\"orgy D\'an}, title = {Cache capacity allocation for BitTorrent-like systems to minimize inter-ISP traffic.}, booktitle = {INFOCOM}, year = 2012, doi = {https://doi.org/10.1109/INFCOM.2012.6195518}, keywords = {} } -
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} } -
F. Chierichetti, R. Kumar, P. Raghavan, and T. Sarlós, “Are web users really Markovian?,” in WWW, 2012.
[Bibtex]@inproceedings{wwwChierichettiKRS12, author = {Flavio Chierichetti and Ravi Kumar and Prabhakar Raghavan and Tam\'as Sarl\'os}, title = {Are web users really Markovian?}, booktitle = {WWW}, year = 2012, doi = {['https://doi.org/10.1145/2187836.2187919', 'https://www.wikidata.org/entity/Q57904472']}, keywords = {} } -
M. Poloczek and M. Szegedy, “Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis.,” in FOCS, 2012.
[Bibtex]@inproceedings{focsPoloczekS12, author = {Matthias Poloczek and Mario Szegedy}, title = {Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis.}, booktitle = {FOCS}, year = 2012, doi = {['https://doi.org/10.1109/FOCS.2012.20', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.20']}, keywords = {} } -
A. Gál, K. A. Hansen, M. Koucký, P. Pudlák, and E. Viola, “Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.,” in STOC, 2012.
[Bibtex]@inproceedings{stocGalHKPV12, author = {Anna G\'al and Kristoffer Arnsfelt Hansen and Michal Koucký and Pavel Pudl\'ak and Emanuele Viola}, title = {Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.}, booktitle = {STOC}, year = 2012, doi = {['https://doi.org/10.1145/2213977.2214023', 'https://www.wikidata.org/entity/Q130975564']}, keywords = {} } -
A. Faragó, “Brief announcement: an obstacle to scalability in wireless networks.,” in PODC, 2012.
[Bibtex]@inproceedings{podcFarago12, author = {Andr\'as Farag\'o}, title = {Brief announcement: an obstacle to scalability in wireless networks.}, booktitle = {PODC}, year = 2012, doi = {https://doi.org/10.1145/2332432.2332477}, keywords = {} } -
L. A. Végh, “Concave Generalized Flows with Applications to Market Equilibria.,” in FOCS, 2012.
[Bibtex]@inproceedings{focsVegh12, author = {L\'aszl\'o A. V\'egh}, title = {Concave Generalized Flows with Applications to Market Equilibria.}, booktitle = {FOCS}, year = 2012, doi = {['https://doi.org/10.1109/FOCS.2012.33', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.33']}, keywords = {} } -
K. Chandrasekaran, L. A. Végh, and S. S. Vempala, “The Cutting Plane Method Is Polynomial for Perfect Matchings.,” in FOCS, 2012.
[Bibtex]@inproceedings{focsChandrasekaranVV12, author = {Karthekeyan Chandrasekaran and L\'aszl\'o A. V\'egh and Santosh S. Vempala}, title = {The Cutting Plane Method Is Polynomial for Perfect Matchings.}, booktitle = {FOCS}, year = 2012, doi = {['https://doi.org/10.1109/FOCS.2012.35', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.35']}, keywords = {} } -
L. A. Végh, “Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives.,” in STOC, 2012.
[Bibtex]@inproceedings{stocVegh12, author = {L\'aszl\'o A. V\'egh}, title = {Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives.}, booktitle = {STOC}, year = 2012, doi = {https://doi.org/10.1145/2213977.2213981}, keywords = {} } -
S. R. Yerva, Z. Miklós, F. Grosan, A. Tandrau, and K. Aberer, “TweetSpector: entity-based retrieval of tweets.,” in SIGIR, 2012.
[Bibtex]@inproceedings{sigirYervaMGTA12, author = {Surender Reddy Yerva and Zolt\'an Mikl\'os and Flavia Grosan and Alexandru Tandrau and Karl Aberer}, title = {TweetSpector: entity-based retrieval of tweets.}, booktitle = {SIGIR}, year = 2012, doi = {https://doi.org/10.1145/2348283.2348441}, keywords = {} } -
T. Jager, F. Kohlar, S. Schäge, and J. Schwenk, “On the Security of TLS-DHE in the Standard Model.,” in CRYPTO, 2012.
[Bibtex]@inproceedings{cryptoJagerKSS12, author = {Tibor Jager and Florian Kohlar and Sven Schäge and J\"org Schwenk}, title = {On the Security of TLS-DHE in the Standard Model.}, booktitle = {CRYPTO}, year = 2012, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-642-32009-5_17'}}, keywords = {} } -
D. Hofheinz and T. Jager, “Tightly Secure Signatures and Public-Key Encryption.,” in CRYPTO, 2012.
[Bibtex]@inproceedings{cryptoHofheinzJ12, author = {Dennis Hofheinz and Tibor Jager}, title = {Tightly Secure Signatures and Public-Key Encryption.}, booktitle = {CRYPTO}, year = 2012, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1007/978-3-642-32009-5_35'}}, keywords = {} } -
E. Mossel and M. Z. Rácz, “A quantitative gibbard-satterthwaite theorem without neutrality.,” in STOC, 2012.
[Bibtex]@inproceedings{stocMosselR12, author = {Elchanan Mossel and Mikl\'os Z. R\'acz}, title = {A quantitative gibbard-satterthwaite theorem without neutrality.}, booktitle = {STOC}, year = 2012, doi = {https://doi.org/10.1145/2213977.2214071}, keywords = {} } -
F. Huszar and D. Duvenaud, “Optimally-Weighted Herding is Bayesian Quadrature.,” in UAI, 2012.
[Bibtex]@inproceedings{uaiHuszarD12, author = {Ferenc Huszar and David Duvenaud}, title = {Optimally-Weighted Herding is Bayesian Quadrature.}, booktitle = {UAI}, year = 2012, doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2300&proceeding_id=28'}}, keywords = {} } -
Á. Seress, “Construction of 2-closed M-representations.,” in ISSAC, 2012.
[Bibtex]@inproceedings{issacSeress12, author = {\'Akos Seress}, title = {Construction of 2-closed M-representations.}, booktitle = {ISSAC}, year = 2012, doi = {https://doi.org/10.1145/2442829.2442874}, keywords = {} }
2011
-
D. Lokshtanov, D. Marx, and S. Saurabh, “Slightly Superexponential Parameterized Problems.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaLokshtanovMS11, author = {Daniel Lokshtanov and D\'aniel Marx and Saket Saurabh}, title = {Slightly Superexponential Parameterized Problems.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.60'}, 'http://dl.acm.org/citation.cfm?id=2133096']}, keywords = {} } -
D. Lokshtanov, D. Marx, and S. Saurabh, “Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaLokshtanovMS11a, author = {Daniel Lokshtanov and D\'aniel Marx and Saket Saurabh}, title = {Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.61'}, 'http://dl.acm.org/citation.cfm?id=2133097']}, keywords = {} } -
M. Bateni, C. Chekuri, A. Ene, M. T. Hajiaghayi, N. Korula, and D. Marx, “Prize-collecting Steiner Problems on Planar Graphs.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaBateniCEHKM11, author = {MohammadHossein Bateni and Chandra Chekuri and Alina Ene and Mohammad Taghi Hajiaghayi and Nitish Korula and D\'aniel Marx}, title = {Prize-collecting Steiner Problems on Planar Graphs.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.79'}, 'http://dl.acm.org/citation.cfm?id=2133115']}, keywords = {} } -
D. Marx and I. Razgon, “Fixed-parameter tractability of multicut parameterized by the size of the cutset.,” in STOC, 2011.
[Bibtex]@inproceedings{stocMarxR11, author = {D\'aniel Marx and Igor Razgon}, title = {Fixed-parameter tractability of multicut parameterized by the size of the cutset.}, booktitle = {STOC}, year = 2011, doi = {https://doi.org/10.1145/1993636.1993699}, keywords = {} } -
M. Grohe, K. Kawarabayashi, D. Marx, and P. Wollan, “Finding topological subgraphs is fixed-parameter tractable.,” in STOC, 2011.
[Bibtex]@inproceedings{stocGroheKMW11, author = {Martin Grohe and Ken-ichi Kawarabayashi and D\'aniel Marx and Paul Wollan}, title = {Finding topological subgraphs is fixed-parameter tractable.}, booktitle = {STOC}, year = 2011, doi = {https://doi.org/10.1145/1993636.1993700}, keywords = {} } -
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} } -
H. Jowhari, M. Saglam, and G. Tardos, “Tight bounds for Lp samplers, finding duplicates in streams, and related problems.,” in PODS, 2011.
[Bibtex]@inproceedings{podsJowhariST11, author = {Hossein Jowhari and Mert Saglam and G\'abor Tardos}, title = {Tight bounds for Lp samplers, finding duplicates in streams, and related problems.}, booktitle = {PODS}, year = 2011, doi = {https://doi.org/10.1145/1989284.1989289}, keywords = {} } -
H. Gebauer, T. Szabó, and G. Tardos, “The Local Lemma is Tight for SAT.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaGebauerST11, author = {Heidi Gebauer and Tibor Szab\'o and G\'abor Tardos}, title = {The Local Lemma is Tight for SAT.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.52'}, 'http://dl.acm.org/citation.cfm?id=2133088']}, keywords = {} } -
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} } -
P. Arora, C. Szepesvári, and R. Zheng, “Sequential learning for optimal monitoring of multi-channel wireless networks.,” in INFOCOM, 2011.
[Bibtex]@inproceedings{infocomAroraSZ11, author = {Pallavi Arora and Csaba Szepesv\'ari and Rong Zheng}, title = {Sequential learning for optimal monitoring of multi-channel wireless networks.}, booktitle = {INFOCOM}, year = 2011, doi = {https://doi.org/10.1109/INFCOM.2011.5934892}, keywords = {} } -
M. M. Fard, J. Pineau, and C. Szepesvári, “PAC-Bayesian Policy Evaluation for Reinforcement Learning.,” in UAI, 2011.
[Bibtex]@inproceedings{uaiFardPS11, author = {Mahdi Milani Fard and Joelle Pineau and Csaba Szepesv\'ari}, title = {PAC-Bayesian Policy Evaluation for Reinforcement Learning.}, booktitle = {UAI}, year = 2011, doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2218&proceeding_id=27'}}, keywords = {} } -
Y. Abbasi-Yadkori and C. Szepesvári, “Regret Bounds for the Adaptive Control of Linear Quadratic Systems.,” in COLT, 2011.
[Bibtex]@inproceedings{journalsjmlrAbbasi-YadkoriS11, author = {Yasin Abbasi-Yadkori and Csaba Szepesv\'ari}, title = {Regret Bounds for the Adaptive Control of Linear Quadratic Systems.}, booktitle = {COLT}, year = 2011, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v19/abbasi-yadkori11a/abbasi-yadkori11a.pdf'}}, keywords = {} } -
G. Bartók, D. Pál, and C. Szepesvári, “Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments.,” in COLT, 2011.
[Bibtex]@inproceedings{journalsjmlrBartokPS11, author = {G\'abor Bart\'ok and D\'avid P\'al and Csaba Szepesv\'ari}, title = {Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments.}, booktitle = {COLT}, year = 2011, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v19/bartok11a/bartok11a.pdf'}}, keywords = {} } -
I. Szita and C. Szepesvári, “Agnostic KWIK learning and efficient approximate reinforcement learning.,” in COLT, 2011.
[Bibtex]@inproceedings{journalsjmlrSzitaS11, author = {Istvan Szita and Csaba Szepesv\'ari}, title = {Agnostic KWIK learning and efficient approximate reinforcement learning.}, booktitle = {COLT}, year = 2011, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v19/szita11a/szita11a.pdf'}}, keywords = {} } -
J. Fox and J. Pach, “Computing the Independence Number of Intersection Graphs.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaFoxP11, author = {Jacob Fox and J\'anos Pach}, title = {Computing the Independence Number of Intersection Graphs.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.87'}, 'http://dl.acm.org/citation.cfm?id=2133123']}, keywords = {} } -
J. Fox, M. Gromov, V. Lafforgue, A. Naor, and J. Pach, “Overlap properties of geometric expanders.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaFoxGLNP11, author = {Jacob Fox and Mikhail Gromov and Vincent Lafforgue and Assaf Naor and J\'anos Pach}, title = {Overlap properties of geometric expanders.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.90'}, 'http://dl.acm.org/citation.cfm?id=2133126']}, keywords = {} } -
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} } -
L. Babai, P. Codenotti, J. A. Grochow, and Y. Qiao, “Code Equivalence and Group Isomorphism.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaBabaiCGQ11, author = {L\'aszl\'o Babai and Paolo Codenotti and Joshua A. Grochow and Youming Qiao}, title = {Code Equivalence and Group Isomorphism.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.107'}, 'http://dl.acm.org/citation.cfm?id=2133143']}, keywords = {} } -
J. Sallai, Á. Lédeczi, and P. Völgyesi, “Acoustic shooter localization with a minimal number of single-channel wireless sensor nodes.,” in SenSys, 2011.
[Bibtex]@inproceedings{sensysSallaiLV11, author = {J\'anos Sallai and \'Akos L\'edeczi and P\'eter V\"olgyesi}, title = {Acoustic shooter localization with a minimal number of single-channel wireless sensor nodes.}, booktitle = {SenSys}, year = 2011, doi = {https://doi.org/10.1145/2070942.2070953}, keywords = {} } -
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} } -
M. Ajtai, “Secure computation with information leaking to an adversary.,” in STOC, 2011.
[Bibtex]@inproceedings{stocAjtai11, author = {Mikl\'os Ajtai}, title = {Secure computation with information leaking to an adversary.}, booktitle = {STOC}, year = 2011, doi = {https://doi.org/10.1145/1993636.1993731}, keywords = {} } -
B. Póczos, L. Xiong, and J. G. Schneider, “Nonparametric Divergence Estimation with Applications to Machine Learning on Distributions.,” in UAI, 2011.
[Bibtex]@inproceedings{uaiPoczosXS11, author = {Barnab\'as P\'oczos and Liang Xiong and Jeff G. Schneider}, title = {Nonparametric Divergence Estimation with Applications to Machine Learning on Distributions.}, booktitle = {UAI}, year = 2011, doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2205&proceeding_id=27'}}, keywords = {} } -
M. Z. Mao, R. M. Gray, and T. Linder, “On Asymptotically Optimal Stationary Source Codes for IID Sources.,” in DCC, 2011.
[Bibtex]@inproceedings{dccMaoGL11, author = {Mark Z. Mao and Robert M. Gray and Tam\'as Linder}, title = {On Asymptotically Optimal Stationary Source Codes for IID Sources.}, booktitle = {DCC}, year = 2011, doi = {['https://doi.org/10.1109/DCC.2011.8', 'https://doi.ieeecomputersociety.org/10.1109/DCC.2011.8']}, keywords = {} } -
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} } -
L. E. Blume, D. A. Easley, J. M. Kleinberg, R. Kleinberg, and É. Tardos, “Which Networks are Least Susceptible to Cascading Failures?,” in FOCS, 2011.
[Bibtex]@inproceedings{focsBlumeEKKT11, author = {Lawrence E. Blume and David A. Easley and Jon M. Kleinberg and Robert Kleinberg and \'Eva Tardos}, title = {Which Networks are Least Susceptible to Cascading Failures?}, booktitle = {FOCS}, year = 2011, doi = {['https://doi.org/10.1109/FOCS.2011.38', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.38']}, keywords = {} } -
K. Veress and M. Maróti, “LinkBench: Benchmark and metric framework for wireless sensor networks.,” in IPSN, 2011.
[Bibtex]@inproceedings{ipsnVeressM11, author = {Krisztian Veress and Mikl\'os Mar\'oti}, title = {LinkBench: Benchmark and metric framework for wireless sensor networks.}, booktitle = {IPSN}, year = 2011, doi = {https://ieeexplore.ieee.org/document/5779099/}, keywords = {} } -
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} } -
J. Audibert, S. Bubeck, and G. Lugosi, “Minimax Policies for Combinatorial Prediction Games.,” in COLT, 2011.
[Bibtex]@inproceedings{journalsjmlrAudibertBL11, author = {Jean-Yves Audibert and S\'ebastien Bubeck and G\'abor Lugosi}, title = {Minimax Policies for Combinatorial Prediction Games.}, booktitle = {COLT}, year = 2011, doi = {{'@type': 'oa', '#text': 'http://proceedings.mlr.press/v19/audibert11a/audibert11a.pdf'}}, keywords = {} } -
A. Dasgupta, R. Kumar, and T. Sarlós, “Fast locality-sensitive hashing.,” in KDD, 2011.
[Bibtex]@inproceedings{kddDasguptaKS11, author = {Anirban Dasgupta and Ravi Kumar and Tam\'as Sarl\'os}, title = {Fast locality-sensitive hashing.}, booktitle = {KDD}, year = 2011, doi = {https://doi.org/10.1145/2020408.2020578}, keywords = {} } -
T. Lappas, K. Punera, and T. Sarlós, “Mining tags using social endorsement networks.,” in SIGIR, 2011.
[Bibtex]@inproceedings{sigirLappasPS11, author = {Theodoros Lappas and Kunal Punera and Tam\'as Sarl\'os}, title = {Mining tags using social endorsement networks.}, booktitle = {SIGIR}, year = 2011, doi = {https://doi.org/10.1145/2009916.2009946}, keywords = {} } -
T. Lee, R. Mittal, B. W. Reichardt, R. Spalek, and M. Szegedy, “Quantum Query Complexity of State Conversion.,” in FOCS, 2011.
[Bibtex]@inproceedings{focsLeeMRSS11, author = {Troy Lee and Rajat Mittal and Ben W. Reichardt and Robert Spalek and Mario Szegedy}, title = {Quantum Query Complexity of State Conversion.}, booktitle = {FOCS}, year = 2011, doi = {['https://doi.org/10.1109/FOCS.2011.75', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.75']}, keywords = {} } -
K. B. R. Kolipaka and M. Szegedy, “Moser and tardos meet Lovász.,” in STOC, 2011.
[Bibtex]@inproceedings{stocKolipakaS11, author = {Kashyap Babu Rao Kolipaka and Mario Szegedy}, title = {Moser and tardos meet Lovász.}, booktitle = {STOC}, year = 2011, doi = {https://doi.org/10.1145/1993636.1993669}, keywords = {} } -
P. Afshani, G. S. Brodal, and N. Zeh, “Ordered and Unordered Top-K Range Reporting in Large Data Sets.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaAfshaniBZ11, author = {Peyman Afshani and Gerth Stølting Brodal and Norbert Zeh}, title = {Ordered and Unordered Top-K Range Reporting in Large Data Sets.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.31'}, 'http://dl.acm.org/citation.cfm?id=2133067']}, keywords = {} } -
P. Afshani and N. Zeh, “Improved Space Bounds for Cache-Oblivious Range Reporting.,” in SODA, 2011.
[Bibtex]@inproceedings{sodaAfshaniZ11, author = {Peyman Afshani and Norbert Zeh}, title = {Improved Space Bounds for Cache-Oblivious Range Reporting.}, booktitle = {SODA}, year = 2011, doi = {[{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973082.134'}, 'http://dl.acm.org/citation.cfm?id=2133170']}, keywords = {} } -
L. Marchesotti, F. Perronnin, D. Larlus, and G. Csurka, “Assessing the aesthetic quality of photographs using generic image descriptors.,” in ICCV, 2011.
[Bibtex]@inproceedings{iccvMarchesottiPLC11, author = {Luca Marchesotti and Florent Perronnin and Diane Larlus and Gabriela Csurka}, title = {Assessing the aesthetic quality of photographs using generic image descriptors.}, booktitle = {ICCV}, year = 2011, doi = {['https://doi.org/10.1109/ICCV.2011.6126444', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2011.6126444']}, keywords = {} } -
Á. Szántó, “Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview.,” in ISSAC, 2011.
[Bibtex]@inproceedings{issacSzanto11, author = {\'Agnes Sz\'ant\'o}, title = {Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview.}, booktitle = {ISSAC}, year = 2011, doi = {['https://doi.org/10.1145/1993886.1993893', 'https://www.wikidata.org/entity/Q130978001']}, keywords = {} } -
G. J. Simon, P. W. Li, C. J. R. Jr., and P. Vemuri, “Understanding atrophy trajectories in alzheimer’s disease using association rules on MRI images.,” in KDD, 2011.
[Bibtex]@inproceedings{kddSimonLJV11, author = {Gy\"orgy J. Simon and Peter W. Li and Clifford R. Jack Jr. and Prashanthi Vemuri}, title = {Understanding atrophy trajectories in alzheimer's disease using association rules on MRI images.}, booktitle = {KDD}, year = 2011, doi = {https://doi.org/10.1145/2020408.2020469}, keywords = {} } -
G. J. Simon, V. Kumar, and P. W. Li, “A simple statistical model and association rule filtering for classification.,” in KDD, 2011.
[Bibtex]@inproceedings{kddSimonKL11, author = {Gy\"orgy J. Simon and Vipin Kumar and Peter W. Li}, title = {A simple statistical model and association rule filtering for classification.}, booktitle = {KDD}, year = 2011, doi = {https://doi.org/10.1145/2020408.2020550}, keywords = {} } -
T. Jager and J. Somorovsky, “How to break XML encryption.,” in CCS, 2011.
[Bibtex]@inproceedings{ccsJagerJ11, author = {Tibor Jager and Juraj Somorovsky}, title = {How to break XML encryption.}, booktitle = {CCS}, year = 2011, doi = {['https://doi.org/10.1145/2046707.2046756', 'https://www.wikidata.org/entity/Q130851560']}, keywords = {} } -
R. Rahman, T. Vinkó, D. Hales, J. A. Pouwelse, and H. J. Sips, “Design space analysis for modeling incentives in distributed systems.,” in SIGCOMM, 2011.
[Bibtex]@inproceedings{sigcommRahmanVHPS11, author = {Rameez Rahman and Tam\'as Vink\'o and David Hales and Johan A. Pouwelse and Henk J. Sips}, title = {Design space analysis for modeling incentives in distributed systems.}, booktitle = {SIGCOMM}, year = 2011, doi = {['https://doi.org/10.1145/2018436.2018458', 'https://doi.org/10.1145/2043164.2018458']}, keywords = {} } -
J. Ezekiel, A. Lomuscio, L. Molnar, and S. M. Veres, “Verifying Fault Tolerance and Self-Diagnosability of an Autonomous Underwater Vehicle.,” in IJCAI, 2011.
[Bibtex]@inproceedings{ijcaiEzekielLMV11, author = {Jonathan Ezekiel and Alessio Lomuscio and Levente Molnar and Sandor M. Veres}, title = {Verifying Fault Tolerance and Self-Diagnosability of an Autonomous Underwater Vehicle.}, booktitle = {IJCAI}, year = 2011, doi = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-279}, keywords = {} }
2010
-
M. Bateni, M. Hajiaghayi, and D. Marx, “Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth.,” in STOC, 2010.
[Bibtex]@inproceedings{stocBateniHM10, author = {MohammadHossein Bateni and MohammadTaghi Hajiaghayi and D\'aniel Marx}, title = {Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth.}, booktitle = {STOC}, year = 2010, doi = {https://doi.org/10.1145/1806689.1806720}, keywords = {} } -
D. Marx, “Tractable hypergraph properties for constraint satisfaction and conjunctive queries.,” in STOC, 2010.
[Bibtex]@inproceedings{stocMarx10, author = {D\'aniel Marx}, title = {Tractable hypergraph properties for constraint satisfaction and conjunctive queries.}, booktitle = {STOC}, year = 2010, doi = {https://doi.org/10.1145/1806689.1806790}, keywords = {} } -
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} } -
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} } -
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} } -
H. R. Maei, C. Szepesvári, S. Bhatnagar, and R. S. Sutton, “Toward Off-Policy Learning Control with Function Approximation.,” in ICML, 2010.
[Bibtex]@inproceedings{icmlMaeiSBS10, author = {Hamid Reza Maei and Csaba Szepesv\'ari and Shalabh Bhatnagar and Richard S. Sutton}, title = {Toward Off-Policy Learning Control with Function Approximation.}, booktitle = {ICML}, year = 2010, doi = {{'@type': 'oa', '#text': 'https://icml.cc/Conferences/2010/papers/627.pdf'}}, keywords = {} } -
L. Li, B. Póczos, C. Szepesvári, and R. Greiner, “Budgeted Distribution Learning of Belief Net Parameters.,” in ICML, 2010.
[Bibtex]@inproceedings{icmlLiPSG10, author = {Liuyang Li and Barnab\'as P\'oczos and Csaba Szepesv\'ari and Russell Greiner}, title = {Budgeted Distribution Learning of Belief Net Parameters.}, booktitle = {ICML}, year = 2010, doi = {{'@type': 'oa', '#text': 'https://icml.cc/Conferences/2010/papers/406.pdf'}}, keywords = {} } -
I. Szita and C. Szepesvári, “Model-based reinforcement learning with nearly tight exploration complexity bounds.,” in ICML, 2010.
[Bibtex]@inproceedings{icmlSzitaS10, author = {Istvan Szita and Csaba Szepesv\'ari}, title = {Model-based reinforcement learning with nearly tight exploration complexity bounds.}, booktitle = {ICML}, year = 2010, doi = {{'@type': 'oa', '#text': 'https://icml.cc/Conferences/2010/papers/546.pdf'}}, keywords = {} } -
G. D. Battista, F. Frati, and J. Pach, “On the Queue Number of Planar Graphs.,” in FOCS, 2010.
[Bibtex]@inproceedings{focsBattistaFP10, author = {Giuseppe Di Battista and Fabrizio Frati and J\'anos Pach}, title = {On the Queue Number of Planar Graphs.}, booktitle = {FOCS}, year = 2010, doi = {['https://doi.org/10.1109/FOCS.2010.42', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2010.42']}, keywords = {} } -
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} } -
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} } -
M. Ajtai, “Oblivious RAMs without cryptogrpahic assumptions.,” in STOC, 2010.
[Bibtex]@inproceedings{stocAjtai10, author = {Mikl\'os Ajtai}, title = {Oblivious RAMs without cryptogrpahic assumptions.}, booktitle = {STOC}, year = 2010, doi = {https://doi.org/10.1145/1806689.1806716}, keywords = {} } -
K. Hoder, L. Kovács, and A. Voronkov, “Interpolation and Symbol Elimination in Vampire.,” in IJCAR, 2010.
[Bibtex]@inproceedings{cadeHoderKV10, author = {Krystof Hoder and Laura Kov\'acs and Andrei Voronkov}, title = {Interpolation and Symbol Elimination in Vampire.}, booktitle = {IJCAR}, year = 2010, doi = {https://doi.org/10.1007/978-3-642-14203-1_16}, keywords = {} } -
R. Bardenet and B. Kégl, “Surrogating the surrogate: accelerating Gaussian-process-based global optimization with a mixture cross-entropy algorithm.,” in ICML, 2010.
[Bibtex]@inproceedings{icmlBardenetK10, author = {R\'emi Bardenet and Bal\'azs K\'egl}, title = {Surrogating the surrogate: accelerating Gaussian-process-based global optimization with a mixture cross-entropy algorithm.}, booktitle = {ICML}, year = 2010, doi = {{'@type': 'oa', '#text': 'https://icml.cc/Conferences/2010/papers/297.pdf'}}, keywords = {} } -
R. P. Leme and É. Tardos, “Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction.,” in FOCS, 2010.
[Bibtex]@inproceedings{focsLemeT10, author = {Renato Paes Leme and \'Eva Tardos}, title = {Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction.}, booktitle = {FOCS}, year = 2010, doi = {['https://doi.org/10.1109/FOCS.2010.75', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2010.75']}, keywords = {} } -
Z. Kira, “Inter-robot transfer learning for perceptual classification.,” in AAMAS, 2010.
[Bibtex]@inproceedings{atalKira10, author = {Zsolt Kira}, title = {Inter-robot transfer learning for perceptual classification.}, booktitle = {AAMAS}, year = 2010, doi = {https://dl.acm.org/citation.cfm?id=1838209}, keywords = {} } -
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} } -
L. A. Végh, “Augmenting undirected node-connectivity by one.,” in STOC, 2010.
[Bibtex]@inproceedings{stocVegh10, author = {L\'aszl\'o A. V\'egh}, title = {Augmenting undirected node-connectivity by one.}, booktitle = {STOC}, year = 2010, doi = {https://doi.org/10.1145/1806689.1806767}, keywords = {} } -
A. Bernáth, R. Grappe, and Z. Szigeti, “Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.,” in SODA, 2010.
[Bibtex]@inproceedings{sodaBernathGS10, author = {Attila Bern\'ath and Roland Grappe and Zolt\'an Szigeti}, title = {Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.}, booktitle = {SODA}, year = 2010, doi = {{'@type': 'oa', '#text': 'https://doi.org/10.1137/1.9781611973075.123'}}, keywords = {} } -
V. Dyo, S. A. Ellwood, D. W. Macdonald, A. Markham, C. Mascolo, B. Pásztor, S. Scellato, N. Trigoni, R. Wohlers, and K. Yousef, “Evolution and sustainability of a wildlife monitoring sensor network.,” in SenSys, 2010.
[Bibtex]@inproceedings{sensysDyoEMMMPSTWY10, author = {Vladimir Dyo and Stephen A. Ellwood and David W. Macdonald and Andrew Markham and Cecilia Mascolo and Bence P\'asztor and Salvatore Scellato and Niki Trigoni and Ricklef Wohlers and Kharsim Yousef}, title = {Evolution and sustainability of a wildlife monitoring sensor network.}, booktitle = {SenSys}, year = 2010, doi = {https://doi.org/10.1145/1869983.1869997}, keywords = {} } -
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 = {} }
2009
-
A. A. Bulatov and D. Marx, “The Complexity of Global Cardinality Constraints.,” in LICS, 2009.
[Bibtex]@inproceedings{licsBulatovM09, author = {Andrei A. Bulatov and D\'aniel Marx}, title = {The Complexity of Global Cardinality Constraints.}, booktitle = {LICS}, year = 2009, doi = {['https://doi.org/10.1109/LICS.2009.38', 'https://doi.ieeecomputersociety.org/10.1109/LICS.2009.38']}, keywords = {} } -
D. Marx, “Approximating fractional hypertree width.,” in SODA, 2009.
[Bibtex]@inproceedings{sodaMarx09, author = {D\'aniel Marx}, title = {Approximating fractional hypertree width.}, booktitle = {SODA}, year = 2009, doi = {['https://doi.org/10.1137/1.9781611973068.98', {'@type': 'oa', '#text': 'http://dl.acm.org/citation.cfm?id=1496770.1496868'}]}, keywords = {} } -
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} } -
E. Amiri and G. Tardos, “High rate fingerprinting codes and the fingerprinting capacity.,” in SODA, 2009.
[Bibtex]@inproceedings{sodaAmiriT09, author = {Ehsan Amiri and G\'abor Tardos}, title = {High rate fingerprinting codes and the fingerprinting capacity.}, booktitle = {SODA}, year = 2009, doi = {['https://doi.org/10.1137/1.9781611973068.38', {'@type': 'oa', '#text': 'http://dl.acm.org/citation.cfm?id=1496770.1496808'}]}, keywords = {} } -
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} } -
J. Audibert, P. Auer, A. Lazaric, R. Munos, D. Ryabko, and C. Szepesvári, “Workshop summary: On-line learning with limited feedback.,” in ICML, 2009.
[Bibtex]@inproceedings{icmlAudibertALMRS09, author = {Jean-Yves Audibert and Peter Auer and Alessandro Lazaric and R\'emi Munos and Daniil Ryabko and Csaba Szepesv\'ari}, title = {Workshop summary: On-line learning with limited feedback.}, booktitle = {ICML}, year = 2009, doi = {https://doi.org/10.1145/1553374.1553547}, keywords = {} } -
A. Farhangfar, R. Greiner, and C. Szepesvári, “Learning to segment from a few well-selected training images.,” in ICML, 2009.
[Bibtex]@inproceedings{icmlFarhangfarGS09, author = {Alireza Farhangfar and Russell Greiner and Csaba Szepesv\'ari}, title = {Learning to segment from a few well-selected training images.}, booktitle = {ICML}, year = 2009, doi = {https://doi.org/10.1145/1553374.1553413}, keywords = {} } -
B. Póczos, Y. Abbasi-Yadkori, C. Szepesvári, R. Greiner, and N. R. Sturtevant, “Learning when to stop thinking and do something!,” in ICML, 2009.
[Bibtex]@inproceedings{icmlPoczosASGS09, author = {Barnab\'as P\'oczos and Yasin Abbasi-Yadkori and Csaba Szepesv\'ari and Russell Greiner and Nathan R. Sturtevant}, title = {Learning when to stop thinking and do something!}, booktitle = {ICML}, year = 2009, doi = {https://doi.org/10.1145/1553374.1553480}, keywords = {} } -
R. S. Sutton, H. R. Maei, D. Precup, S. Bhatnagar, D. Silver, C. Szepesvári, and E. Wiewiora, “Fast gradient-descent methods for temporal-difference learning with linear function approximation.,” in ICML, 2009.
[Bibtex]@inproceedings{icmlSuttonMPBSSW09, author = {Richard S. Sutton and Hamid Reza Maei and Doina Precup and Shalabh Bhatnagar and David Silver and Csaba Szepesv\'ari and Eric Wiewiora}, title = {Fast gradient-descent methods for temporal-difference learning with linear function approximation.}, booktitle = {ICML}, year = 2009, doi = {https://doi.org/10.1145/1553374.1553501}, keywords = {} } -
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} } -
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} } -
L. Babai, R. Beals, and Á. Seress, “Polynomial-time theory of matrix groups.,” in STOC, 2009.
[Bibtex]@inproceedings{stocBabaiBS09, author = {L\'aszl\'o Babai and Robert Beals and \'Akos Seress}, title = {Polynomial-time theory of matrix groups.}, booktitle = {STOC}, year = 2009, doi = {['https://doi.org/10.1145/1536414.1536425', 'https://www.wikidata.org/entity/Q60587912']}, keywords = {} } -
J. Sallai, P. Völgyesi, and Á. Lédeczi, “Radio interferometric Quasi Doppler bearing estimation.,” in IPSN, 2009.
[Bibtex]@inproceedings{ipsnSallaiVL09, author = {J\'anos Sallai and P\'eter V\"olgyesi and \'Akos L\'edeczi}, title = {Radio interferometric Quasi Doppler bearing estimation.}, booktitle = {IPSN}, year = 2009, doi = {['https://ieeexplore.ieee.org/document/5211920/', 'https://dl.acm.org/citation.cfm?id=1602195']}, keywords = {} } -
A. Dumitrescu, C. D. Tóth, and G. Xu, “On stars and Steiner stars: II.,” in SODA, 2009.
[Bibtex]@inproceedings{sodaDumitrescuTX09, author = {Adrian Dumitrescu and Csaba D. T\'oth and Guangwu Xu}, title = {On stars and Steiner stars: II.}, booktitle = {SODA}, year = 2009, doi = {['https://doi.org/10.1137/1.9781611973068.35', {'@type': 'oa', '#text': 'http://dl.acm.org/citation.cfm?id=1496770.1496805'}]}, keywords = {} } -
F. Magniez, A. Nayak, P. C. Richter, and M. Santha, “On the hitting times of quantum versus random walks.,” in SODA, 2009.
[Bibtex]@inproceedings{sodaMagniezNRS09, author = {Fr\'ed\'eric Magniez and Ashwin Nayak and Peter C. Richter and Miklos Santha}, title = {On the hitting times of quantum versus random walks.}, booktitle = {SODA}, year = 2009, doi = {['https://doi.org/10.1137/1.9781611973068.10', {'@type': 'oa', '#text': 'http://dl.acm.org/citation.cfm?id=1496770.1496780'}]}, keywords = {} } -
R. M. Gray and T. Linder, “Bits in Asymptotically Optimal Lossy Source Codes Are Asymptotically Bernoulli.,” in DCC, 2009.
[Bibtex]@inproceedings{dccGrayL09, author = {Robert M. Gray and Tam\'as Linder}, title = {Bits in Asymptotically Optimal Lossy Source Codes Are Asymptotically Bernoulli.}, booktitle = {DCC}, year = 2009, doi = {['https://doi.org/10.1109/DCC.2009.21', 'https://doi.ieeecomputersociety.org/10.1109/DCC.2009.21']}, keywords = {} } -
H. Madeira and I. Majzik, “From assessment to standardised benchmarking: Will it happen? What could we do about it?,” in DSN, 2009.
[Bibtex]@inproceedings{dsnMadeiraM09, author = {Henrique Madeira and Istv\'an Majzik}, title = {From assessment to standardised benchmarking: Will it happen? What could we do about it?}, booktitle = {DSN}, year = 2009, doi = {['https://doi.org/10.1109/DSN.2009.5270325', 'https://doi.ieeecomputersociety.org/10.1109/DSN.2009.5270325']}, keywords = {BME and international and applied} } -
R. D. Kleinberg, G. Piliouras, and É. Tardos, “Load balancing without regret in the bulletin board model.,” in PODC, 2009.
[Bibtex]@inproceedings{podcKleinbergPT09, author = {Robert D. Kleinberg and Georgios Piliouras and \'Eva Tardos}, title = {Load balancing without regret in the bulletin board model.}, booktitle = {PODC}, year = 2009, doi = {https://doi.org/10.1145/1582716.1582731}, keywords = {} } -
R. Kleinberg, G. Piliouras, and É. Tardos, “Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract.,” in STOC, 2009.
[Bibtex]@inproceedings{stocKleinbergPT09, author = {Robert Kleinberg and Georgios Piliouras and \'Eva Tardos}, title = {Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract.}, booktitle = {STOC}, year = 2009, doi = {https://doi.org/10.1145/1536414.1536487}, keywords = {} } -
K. Nahrstedt and G. V. Záruba, “Message from the General and Vice-General Chairs.,” in PerCom, 2009.
[Bibtex]@inproceedings{percomNahrstedtZ09, author = {Klara Nahrstedt and Gergely V. Z\'aruba}, title = {Message from the General and Vice-General Chairs.}, booktitle = {PerCom}, year = 2009, doi = {['https://doi.org/10.1109/PERCOM.2009.4912740', 'https://doi.ieeecomputersociety.org/10.1109/PERCOM.2009.4912740']}, keywords = {} } -
N. Cesa-Bianchi and G. Lugosi, “Combinatorial Bandits.,” in COLT, 2009.
[Bibtex]@inproceedings{coltCesa-BianchiL09, author = {Nicolò Cesa-Bianchi and G\'abor Lugosi}, title = {Combinatorial Bandits.}, booktitle = {COLT}, year = 2009, doi = {{'@type': 'oa', '#text': 'http://www.cs.mcgill.ca/~colt2009/papers/024.pdf#page=1'}}, keywords = {} } -
G. Lugosi, O. Papaspiliopoulos, and G. Stoltz, “Online Multi-task Learning with Hard Constraints.,” in COLT, 2009.
[Bibtex]@inproceedings{coltLugosiPS09, author = {G\'abor Lugosi and Omiros Papaspiliopoulos and Gilles Stoltz}, title = {Online Multi-task Learning with Hard Constraints.}, booktitle = {COLT}, year = 2009, doi = {{'@type': 'oa', '#text': 'http://www.cs.mcgill.ca/~colt2009/papers/007.pdf#page=1'}}, keywords = {} } -
T. J. Walsh, I. Szita, C. Diuk, and M. L. Littman, “Exploring compact reinforcement-learning representations with linear regression.,” in UAI, 2009.
[Bibtex]@inproceedings{uaiWalshSDL09, author = {Thomas J. Walsh and Istvan Szita and Carlos Diuk and Michael L. Littman}, title = {Exploring compact reinforcement-learning representations with linear regression.}, booktitle = {UAI}, year = 2009, doi = {{'@type': 'oa', '#text': 'https://www.auai.org/uai2009/papers/UAI2009_0137_63d573cf0e7d454d9e3e3eb713845209.pdf'}}, keywords = {} } -
G. Kun and M. Szegedy, “A new line of attack on the dichotomy conjecture.,” in STOC, 2009.
[Bibtex]@inproceedings{stocKunS09, author = {G\'abor Kun and Mario Szegedy}, title = {A new line of attack on the dichotomy conjecture.}, booktitle = {STOC}, year = 2009, doi = {https://doi.org/10.1145/1536414.1536512}, keywords = {} } -
L. Marchesotti, C. Cifarelli, and G. Csurka, “A framework for visual saliency detection with applications to image thumbnailing.,” in ICCV, 2009.
[Bibtex]@inproceedings{iccvMarchesottiCC09, author = {Luca Marchesotti and Claudio Cifarelli and Gabriela Csurka}, title = {A framework for visual saliency detection with applications to image thumbnailing.}, booktitle = {ICCV}, year = 2009, doi = {['https://doi.org/10.1109/ICCV.2009.5459467', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.2009.5459467']}, keywords = {} } -
S. Ben-David, D. Pál, and S. Shalev-Shwartz, “Agnostic Online Learning.,” in COLT, 2009.
[Bibtex]@inproceedings{coltBen-DavidPS09, author = {Shai Ben-David and D\'avid P\'al and Shai Shalev-Shwartz}, title = {Agnostic Online Learning.}, booktitle = {COLT}, year = 2009, doi = {{'@type': 'oa', '#text': 'http://www.cs.mcgill.ca/~colt2009/papers/032.pdf#page=1'}}, keywords = {} } -
G. Aggarwal, S. Muthukrishnan, D. Pál, and M. Pál, “General auction mechanism for search advertising.,” in WWW, 2009.
[Bibtex]@inproceedings{wwwAggarwalMPP09, author = {Gagan Aggarwal and S. Muthukrishnan and D\'avid P\'al and Martin P\'al}, title = {General auction mechanism for search advertising.}, booktitle = {WWW}, year = 2009, doi = {https://doi.org/10.1145/1526709.1526742}, keywords = {} } -
V. Dyo, S. A. Ellwood, D. W. Macdonald, A. Markham, C. Mascolo, B. Pásztor, N. Trigoni, and R. Wohlers, “Wildlife and environmental monitoring using RFID and WSN technology.,” in SenSys, 2009.
[Bibtex]@inproceedings{sensysDyoEMMMPTW09, author = {Vladimir Dyo and Stephen A. Ellwood and David W. Macdonald and Andrew Markham and Cecilia Mascolo and Bence P\'asztor and Niki Trigoni and Ricklef Wohlers}, title = {Wildlife and environmental monitoring using RFID and WSN technology.}, booktitle = {SenSys}, year = 2009, doi = {https://doi.org/10.1145/1644038.1644107}, keywords = {} }
2008
-
A. Atserias, M. Grohe, and D. Marx, “Size Bounds and Query Plans for Relational Joins.,” in FOCS, 2008.
[Bibtex]@inproceedings{focsAtseriasGM08, author = {Albert Atserias and Martin Grohe and D\'aniel Marx}, title = {Size Bounds and Query Plans for Relational Joins.}, booktitle = {FOCS}, year = 2008, doi = {['https://doi.org/10.1109/FOCS.2008.43', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2008.43']}, keywords = {} } -
X. Chen, J. Pach, M. Szegedy, and G. Tardos, “Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.,” in SODA, 2008.
[Bibtex]@inproceedings{sodaChenPST08, author = {Xiaomin Chen and J\'anos Pach and Mario Szegedy and G\'abor Tardos}, title = {Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.}, booktitle = {SODA}, year = 2008, doi = {http://dl.acm.org/citation.cfm?id=1347082.1347093}, keywords = {} } -
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. Mnih, C. Szepesvári, and J. Audibert, “Empirical Bernstein stopping.,” in ICML, 2008.
[Bibtex]@inproceedings{icmlMnihSA08, author = {Volodymyr Mnih and Csaba Szepesv\'ari and Jean-Yves Audibert}, title = {Empirical Bernstein stopping.}, booktitle = {ICML}, year = 2008, doi = {https://doi.org/10.1145/1390156.1390241}, keywords = {} } -
A. Isaza, C. Szepesvári, V. Bulitko, and R. Greiner, “Speeding Up Planning in Markov Decision Processes via Automatically Constructed Abstraction.,” in UAI, 2008.
[Bibtex]@inproceedings{uaiIsazaSBG08, author = {Alejandro Isaza and Csaba Szepesv\'ari and Vadim Bulitko and Russell Greiner}, title = {Speeding Up Planning in Markov Decision Processes via Automatically Constructed Abstraction.}, booktitle = {UAI}, year = 2008, doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1955&proceeding_id=24'}}, keywords = {} } -
R. S. Sutton, C. Szepesvári, A. Geramifard, and M. H. Bowling, “Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping.,” in UAI, 2008.
[Bibtex]@inproceedings{uaiSuttonSGB08, author = {Richard S. Sutton and Csaba Szepesv\'ari and Alborz Geramifard and Michael H. Bowling}, title = {Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping.}, booktitle = {UAI}, year = 2008, doi = {{'@type': 'archive', '#text': 'https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1971&proceeding_id=24'}}, keywords = {} } -
L. Babai and P. Codenotti, “Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time.,” in FOCS, 2008.
[Bibtex]@inproceedings{focsBabaiC08, author = {L\'aszl\'o Babai and Paolo Codenotti}, title = {Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time.}, booktitle = {FOCS}, year = 2008, doi = {['https://doi.org/10.1109/FOCS.2008.80', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2008.80']}, keywords = {} } -
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} } -
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} } -
P. Völgyesi, A. Nádas, X. D. Koutsoukos, and Á. Lédeczi, “Air Quality Monitoring with SensorMap.,” in IPSN, 2008.
[Bibtex]@inproceedings{ipsnVolgyesiNKL08, author = {P\'eter V\"olgyesi and Andr\'as N\'adas and Xenofon D. Koutsoukos and \'Akos L\'edeczi}, title = {Air Quality Monitoring with SensorMap.}, booktitle = {IPSN}, year = 2008, doi = {['https://doi.org/10.1109/IPSN.2008.50', 'https://doi.ieeecomputersociety.org/10.1109/IPSN.2008.50']}, keywords = {} } -
A. Dumitrescu and C. D. Tóth, “Minimum weight convex Steiner partitions.,” in SODA, 2008.
[Bibtex]@inproceedings{sodaDumitrescuT08, author = {Adrian Dumitrescu and Csaba D. T\'oth}, title = {Minimum weight convex Steiner partitions.}, booktitle = {SODA}, year = 2008, doi = {http://dl.acm.org/citation.cfm?id=1347082.1347147}, keywords = {} } -
A. Dumitrescu and C. D. Tóth, “On stars and Steiner stars.,” in SODA, 2008.
[Bibtex]@inproceedings{sodaDumitrescuT08a, author = {Adrian Dumitrescu and Csaba D. T\'oth}, title = {On stars and Steiner stars.}, booktitle = {SODA}, year = 2008, doi = {http://dl.acm.org/citation.cfm?id=1347082.1347216}, keywords = {} } -
L. Toka and P. Michiardi, “A dynamic exchange game.,” in PODC, 2008.
[Bibtex]@inproceedings{podcTokaM08, author = {L\'aszl\'o Toka and Pietro Michiardi}, title = {A dynamic exchange game.}, booktitle = {PODC}, year = 2008, doi = {https://doi.org/10.1145/1400751.1400821}, keywords = {BME and international and applied} } -
S. Kirshner and B. Póczos, “ICA and ISA using Schweizer-Wolff measure of dependence.,” in ICML, 2008.
[Bibtex]@inproceedings{icmlKirshnerP08, author = {Sergey Kirshner and Barnab\'as P\'oczos}, title = {ICA and ISA using Schweizer-Wolff measure of dependence.}, booktitle = {ICML}, year = 2008, doi = {https://doi.org/10.1145/1390156.1390215}, keywords = {} } -
L. Kovács, “Aligator: A Mathematica Package for Invariant Generation (System Description).,” in IJCAR, 2008.
[Bibtex]@inproceedings{cadeKovacs08, author = {Laura Kov\'acs}, title = {Aligator: A Mathematica Package for Invariant Generation (System Description).}, booktitle = {IJCAR}, year = 2008, doi = {https://doi.org/10.1007/978-3-540-71070-7_22}, keywords = {} } -
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} } -
A. Bondavalli, I. Majzik, and A. P. A. van Moorsel, “International Workshop on Resilience Assessment and Dependability Benchmarking (RADB 2008).,” in DSN, 2008.
[Bibtex]@inproceedings{dsnBondavalliMM08, author = {Andrea Bondavalli and Istv\'an Majzik and Aad P. A. van Moorsel}, title = {International Workshop on Resilience Assessment and Dependability Benchmarking (RADB 2008).}, booktitle = {DSN}, year = 2008, doi = {['https://doi.org/10.1109/DSN.2008.4630125', 'https://doi.ieeecomputersociety.org/10.1109/DSN.2008.4630125']}, keywords = {BME and international and applied} } -
N. Kottenstette, X. D. Koutsoukos, J. F. Hall, J. Sztipanovits, and P. J. Antsaklis, “Passivity-Based Design of Wireless Networked Control Systems for Robustness to Time-Varying Delays.,” in RTSS, 2008.
[Bibtex]@inproceedings{rtssKottenstetteKHSA08, author = {Nicholas Kottenstette and Xenofon D. Koutsoukos and Joseph F. Hall and Janos Sztipanovits and Panos J. Antsaklis}, title = {Passivity-Based Design of Wireless Networked Control Systems for Robustness to Time-Varying Delays.}, booktitle = {RTSS}, year = 2008, doi = {['https://doi.org/10.1109/RTSS.2008.14', 'https://doi.ieeecomputersociety.org/10.1109/RTSS.2008.14']}, keywords = {} } -
J. M. Kleinberg and É. Tardos, “Balanced outcomes in social exchange networks.,” in STOC, 2008.
[Bibtex]@inproceedings{stocKleinbergT08, author = {Jon M. Kleinberg and \'Eva Tardos}, title = {Balanced outcomes in social exchange networks.}, booktitle = {STOC}, year = 2008, doi = {https://doi.org/10.1145/1374376.1376994}, keywords = {} } -
S. A. Szalay, “Scientific publishing in the era of petabye data.,” in JCDL, 2008.
[Bibtex]@inproceedings{jcdlSzalay08, author = {A. Sandor Szalay}, title = {Scientific publishing in the era of petabye data.}, booktitle = {JCDL}, year = 2008, doi = {https://doi.org/10.1145/1378889.1378932}, keywords = {} } -
G. Lugosi, “Concentration Inequalities.,” in COLT, 2008.
[Bibtex]@inproceedings{coltLugosi08, author = {G\'abor Lugosi}, title = {Concentration Inequalities.}, booktitle = {COLT}, year = 2008, doi = {{'@type': 'oa', '#text': 'http://colt2008.cs.helsinki.fi/papers/lugosi.pdf'}}, keywords = {} } -
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} } -
G. Szarvas, “Hedge Classification in Biomedical Texts with a Weakly Supervised Selection of Keywords.,” in ACL, 2008.
[Bibtex]@inproceedings{aclSzarvas08, author = {Gy\"orgy Szarvas}, title = {Hedge Classification in Biomedical Texts with a Weakly Supervised Selection of Keywords.}, booktitle = {ACL}, year = 2008, doi = {{'@type': 'oa', '#text': 'https://aclanthology.org/P08-1033/'}}, keywords = {} } -
G. J. Simon, V. Kumar, and Z. Zhang, “Semi-supervised approach to rapid and reliable labeling of large data sets.,” in KDD, 2008.
[Bibtex]@inproceedings{kddSimonKZ08, author = {Gy\"orgy J. Simon and Vipin Kumar and Zhi-Li Zhang}, title = {Semi-supervised approach to rapid and reliable labeling of large data sets.}, booktitle = {KDD}, year = 2008, doi = {https://doi.org/10.1145/1401890.1401968}, keywords = {} } -
S. Ben-David, T. Lu, and D. Pál, “Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning.,” in COLT, 2008.
[Bibtex]@inproceedings{coltBen-DavidLP08, author = {Shai Ben-David and Tyler Lu and D\'avid P\'al}, title = {Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning.}, booktitle = {COLT}, year = 2008, doi = {{'@type': 'oa', '#text': 'http://colt2008.cs.helsinki.fi/papers/92-Ben-David.pdf'}}, keywords = {} } -
M. Raya, M. H. Manshaei, M. Félegyházi, and J. Hubaux, “Revocation games in ephemeral networks.,” in CCS, 2008.
[Bibtex]@inproceedings{ccsRayaMFH08, author = {Maxim Raya and Mohammad Hossein Manshaei and M\'ark F\'elegyh\'azi and Jean-Pierre Hubaux}, title = {Revocation games in ephemeral networks.}, booktitle = {CCS}, year = 2008, doi = {https://doi.org/10.1145/1455770.1455797}, keywords = {} } -
M. H. Manshaei, J. Freudiger, M. Félegyházi, P. Marbach, and J. Hubaux, “On Wireless Social Community Networks.,” in INFOCOM, 2008.
[Bibtex]@inproceedings{infocomManshaeiFFMH08, author = {Mohammad Hossein Manshaei and Julien Freudiger and M\'ark F\'elegyh\'azi and Peter Marbach and Jean-Pierre Hubaux}, title = {On Wireless Social Community Networks.}, booktitle = {INFOCOM}, year = 2008, doi = {https://doi.org/10.1109/INFOCOM.2008.215}, keywords = {} }
2007
-
D. Marx, “Can you beat treewidth?,” in FOCS, 2007.
[Bibtex]@inproceedings{focsMarx07, author = {D\'aniel Marx}, title = {Can you beat treewidth?}, booktitle = {FOCS}, year = 2007, doi = {['https://doi.org/10.1109/FOCS.2007.27', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2007.27']}, keywords = {} } -
D. Marx, “On the Optimality of Planar and Geometric Approximation Schemes.,” in FOCS, 2007.
[Bibtex]@inproceedings{focsMarx07a, author = {D\'aniel Marx}, title = {On the Optimality of Planar and Geometric Approximation Schemes.}, booktitle = {FOCS}, year = 2007, doi = {['https://doi.org/10.1109/FOCS.2007.26', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2007.26']}, keywords = {} } -
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} } -
P. Auer, R. Ortner, and C. Szepesvári, “Improved Rates for the Stochastic Continuum-Armed Bandit Problem.,” in COLT, 2007.
[Bibtex]@inproceedings{coltAuerOS07, author = {Peter Auer and Ronald Ortner and Csaba Szepesv\'ari}, title = {Improved Rates for the Stochastic Continuum-Armed Bandit Problem.}, booktitle = {COLT}, year = 2007, doi = {https://doi.org/10.1007/978-3-540-72927-3_33}, keywords = {} } -
A. M. Farahmand, C. Szepesvári, and J. Audibert, “Manifold-adaptive dimension estimation.,” in ICML, 2007.
[Bibtex]@inproceedings{icmlFarahmandSA07, author = {Amir Massoud Farahmand and Csaba Szepesv\'ari and Jean-Yves Audibert}, title = {Manifold-adaptive dimension estimation.}, booktitle = {ICML}, year = 2007, doi = {https://doi.org/10.1145/1273496.1273530}, keywords = {} } -
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} } -
I. Bíró, Z. Szamonek, and C. Szepesvári, “Sequence Prediction Exploiting Similary Information.,” in IJCAI, 2007.
[Bibtex]@inproceedings{ijcaiBiroSS07, author = {Istv\'an B\'ir\'o and Zolt\'an Szamonek and Csaba Szepesv\'ari}, title = {Sequence Prediction Exploiting Similary Information.}, booktitle = {IJCAI}, year = 2007, doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/07/Papers/254.pdf'}}, keywords = {} } -
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} } -
L. Babai and I. Gorodezky, “Sandpile transience on the grid is polynomially bounded.,” in SODA, 2007.
[Bibtex]@inproceedings{sodaBabaiG07, author = {L\'aszl\'o Babai and Igor Gorodezky}, title = {Sandpile transience on the grid is polynomially bounded.}, booktitle = {SODA}, year = 2007, doi = {http://dl.acm.org/citation.cfm?id=1283383.1283451}, keywords = {} } -
B. Kusy, Á. Lédeczi, and X. D. Koutsoukos, “Tracking mobile nodes using RF Doppler shifts.,” in SenSys, 2007.
[Bibtex]@inproceedings{sensysKusyLK07, author = {Branislav Kusy and \'Akos L\'edeczi and Xenofon D. Koutsoukos}, title = {Tracking mobile nodes using RF Doppler shifts.}, booktitle = {SenSys}, year = 2007, doi = {https://doi.org/10.1145/1322263.1322267}, keywords = {} } -
A. Dumitrescu and C. D. Tóth, “On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.,” in SODA, 2007.
[Bibtex]@inproceedings{sodaDumitrescuT07, author = {Adrian Dumitrescu and Csaba D. T\'oth}, title = {On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.}, booktitle = {SODA}, year = 2007, doi = {http://dl.acm.org/citation.cfm?id=1283383.1283503}, keywords = {} } -
F. Magniez, A. Nayak, J. Roland, and M. Santha, “Search via quantum walk.,” in STOC, 2007.
[Bibtex]@inproceedings{stocMagniezNRS07, author = {Fr\'ed\'eric Magniez and Ashwin Nayak and J\'er\'emie Roland and Miklos Santha}, title = {Search via quantum walk.}, booktitle = {STOC}, year = 2007, doi = {['https://doi.org/10.1145/1250790.1250874', 'https://www.wikidata.org/entity/Q56386237']}, keywords = {} } -
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} } -
G. Dán, V. Elek, and I. Chatzidrossos, “On the Performance of Multiple-Tree-Based Peer-to-Peer Live Streaming.,” in INFOCOM, 2007.
[Bibtex]@inproceedings{infocomDanFC07, author = {Gy\"orgy D\'an and Vikt\'oria Elek and Ilias Chatzidrossos}, title = {On the Performance of Multiple-Tree-Based Peer-to-Peer Live Streaming.}, booktitle = {INFOCOM}, year = 2007, doi = {https://doi.org/10.1109/INFCOM.2007.320}, keywords = {} } -
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} } -
G. Lugosi, S. Mannor, and G. Stoltz, “Strategies for Prediction Under Imperfect Monitoring.,” in COLT, 2007.
[Bibtex]@inproceedings{coltLugosiMS07, author = {G\'abor Lugosi and Shie Mannor and Gilles Stoltz}, title = {Strategies for Prediction Under Imperfect Monitoring.}, booktitle = {COLT}, year = 2007, doi = {https://doi.org/10.1007/978-3-540-72927-3_19}, keywords = {} } -
L. Devroye, G. Lugosi, G. Park, and W. Szpankowski, “Multiple choice tries and distributed hash tables.,” in SODA, 2007.
[Bibtex]@inproceedings{sodaDevroyeLPS07, author = {Luc Devroye and G\'abor Lugosi and GaHyun Park and Wojciech Szpankowski}, title = {Multiple choice tries and distributed hash tables.}, booktitle = {SODA}, year = 2007, doi = {http://dl.acm.org/citation.cfm?id=1283383.1283479}, keywords = {} } -
L. Allulli, P. Lichodzijewski, and N. Zeh, “A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.,” in SODA, 2007.
[Bibtex]@inproceedings{sodaAllulliLZ07, author = {Luca Allulli and Peter Lichodzijewski and Norbert Zeh}, title = {A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.}, booktitle = {SODA}, year = 2007, doi = {http://dl.acm.org/citation.cfm?id=1283383.1283481}, keywords = {} } -
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} } -
A. Gál and P. Gopalan, “Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.,” in FOCS, 2007.
[Bibtex]@inproceedings{focsGalG07, author = {Anna G\'al and Parikshit Gopalan}, title = {Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.}, booktitle = {FOCS}, year = 2007, doi = {['https://doi.org/10.1109/FOCS.2007.54', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2007.54']}, keywords = {} } -
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. Gottlob, Z. Miklós, and T. Schwentick, “Generalized hypertree decompositions: np-hardness and tractable variants.,” in PODS, 2007.
[Bibtex]@inproceedings{podsGottlobMS07, author = {Georg Gottlob and Zolt\'an Mikl\'os and Thomas Schwentick}, title = {Generalized hypertree decompositions: np-hardness and tractable variants.}, booktitle = {PODS}, year = 2007, doi = {['https://doi.org/10.1145/1265530.1265533', 'https://www.wikidata.org/entity/Q59259642']}, keywords = {} } -
L. Egri, B. Larose, and P. Tesson, “Symmetric Datalog and Constraint Satisfaction Problems in Logspace.,” in LICS, 2007.
[Bibtex]@inproceedings{licsEgriLT07, author = {L\'aszl\'o Egri and Benoît Larose and Pascal Tesson}, title = {Symmetric Datalog and Constraint Satisfaction Problems in Logspace.}, booktitle = {LICS}, year = 2007, doi = {['https://doi.org/10.1109/LICS.2007.47', 'https://doi.ieeecomputersociety.org/10.1109/LICS.2007.47']}, keywords = {} } -
S. Ben-David, D. Pál, and H. U. Simon, “‘i': ‘k’, ‘#text': ‘Stability of -Means Clustering.’,” in COLT, 2007.
[Bibtex]@inproceedings{coltBen-DavidPS07, author = {Shai Ben-David and D\'avid P\'al and Hans Ulrich Simon}, title = {{'i': 'k', '#text': 'Stability of -Means Clustering.'}}, booktitle = {COLT}, year = 2007, doi = {https://doi.org/10.1007/978-3-540-72927-3_4}, keywords = {} } -
M. Félegyházi, M. Cagalj, D. Dufour, and J. Hubaux, “Border Games in Cellular Networks.,” in INFOCOM, 2007.
[Bibtex]@inproceedings{infocomFelegyhaziCDH07, author = {M\'ark F\'elegyh\'azi and Mario Cagalj and Diego Dufour and Jean-Pierre Hubaux}, title = {Border Games in Cellular Networks.}, booktitle = {INFOCOM}, year = 2007, doi = {https://doi.org/10.1109/INFCOM.2007.100}, keywords = {} } -
M. Félegyházi, M. Cagalj, S. S. Bidokhti, and J. Hubaux, “Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks.,” in INFOCOM, 2007.
[Bibtex]@inproceedings{infocomFelegyhaziCBH07, author = {M\'ark F\'elegyh\'azi and Mario Cagalj and Shirin Saeedi Bidokhti and Jean-Pierre Hubaux}, title = {Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks.}, booktitle = {INFOCOM}, year = 2007, doi = {https://doi.org/10.1109/INFCOM.2007.170}, keywords = {} }
2006
-
M. Grohe and D. Marx, “Constraint solving via fractional edge covers.,” in SODA, 2006.
[Bibtex]@inproceedings{sodaGroheM06, author = {Martin Grohe and D\'aniel Marx}, title = {Constraint solving via fractional edge covers.}, booktitle = {SODA}, year = 2006, doi = {http://dl.acm.org/citation.cfm?id=1109557.1109590}, keywords = {} } -
G. Turán, “On Learning and Logic.,” in COLT, 2006.
[Bibtex]@inproceedings{coltTuran06, author = {Gy\"orgy Tur\'an}, title = {On Learning and Logic.}, booktitle = {COLT}, year = 2006, doi = {https://doi.org/10.1007/11776420_2}, keywords = {Hungary and all_hungarian and theory} } -
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} } -
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 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} } -
A. A. Benczúr, I. Bíró, K. Csalogány, and Máté. Uher, “Detecting nepotistic links by language model disagreement.,” in WWW, 2006.
[Bibtex]@inproceedings{wwwBenczurBCU06, author = {Andr\'as A. Bencz\'ur and Istv\'an B\'ir\'o and K\'aroly Csalog\'any and M\'at\'e Uher}, title = {Detecting nepotistic links by language model disagreement.}, booktitle = {WWW}, year = 2006, doi = {['https://doi.org/10.1145/1135777.1135954', 'https://www.wikidata.org/entity/Q130801712']}, keywords = {SZTAKI and international and applied} } -
P. A. Szekely, M. Becker, S. Fitzpatrick, G. Gati, D. Hanák, J. Jin, G. Karsai, R. T. Maheswaran, R. Neches, C. M. Rogers, R. Sanchez, and C. P. van Buskirk, “CSC: Criticality-Sensitive Coordination.,” in AAMAS, 2006.
[Bibtex]@inproceedings{atalSzekelyBFGHJKMNRSB06, author = {Pedro A. Szekely and Marcel Becker and Stephen Fitzpatrick and Gergely Gati and D\'avid Han\'ak and Jing Jin and Gabor Karsai and Rajiv T. Maheswaran and Robert Neches and Craig Milo Rogers and Romeo Sanchez and Christopher P. van Buskirk}, title = {CSC: Criticality-Sensitive Coordination.}, booktitle = {AAMAS}, year = 2006, doi = {https://doi.org/10.1145/1160633.1160905}, keywords = {} } -
L. Babai, “On the diameter of Eulerian orientations of graphs.,” in SODA, 2006.
[Bibtex]@inproceedings{sodaBabai06, author = {L\'aszl\'o Babai}, title = {On the diameter of Eulerian orientations of graphs.}, booktitle = {SODA}, year = 2006, doi = {http://dl.acm.org/citation.cfm?id=1109557.1109648}, keywords = {} } -
B. Kusy, Á. Lédeczi, M. Maróti, and L. G. L. T. Meertens, “Node density independent localization.,” in IPSN, 2006.
[Bibtex]@inproceedings{ipsnKusyLMM06, author = {Branislav Kusy and \'Akos L\'edeczi and Mikl\'os Mar\'oti 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. 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} } -
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} } -
I. Csabai, P. Hága, P. Mátray, G. Simon, J. Stéger, and G. Vattay, “Results of Large-Scale Queueing Delay Tomography Performed in the ETOMIC Infrastructure.,” in INFOCOM, 2006.
[Bibtex]@inproceedings{infocomCsabaiHMSSV06, author = {Istv\'an Csabai and P\'eter H\'aga and P\'eter M\'atray and G\'abor Simon and J\'ozsef St\'eger and G\'abor Vattay}, title = {Results of Large-Scale Queueing Delay Tomography Performed in the ETOMIC Infrastructure.}, booktitle = {INFOCOM}, year = 2006, doi = {https://doi.org/10.1109/INFOCOM.2006.55}, keywords = {ELTE and Ericsson and all_hungarian and applied} } -
P. Hága, K. Diriczi, G. Vattay, and I. Csabai, “Understanding Packet Pair Separation Beyond the Fluid Model: The Key Role of Traffic Granularity.,” in INFOCOM, 2006.
[Bibtex]@inproceedings{infocomHagaDVC06, author = {P\'eter H\'aga and Kriszti\'an Diriczi and G\'abor Vattay and Istv\'an Csabai}, title = {Understanding Packet Pair Separation Beyond the Fluid Model: The Key Role of Traffic Granularity.}, booktitle = {INFOCOM}, year = 2006, doi = {https://doi.org/10.1109/INFOCOM.2006.285}, keywords = {Ericsson and ELTE and all_hungarian and applied} } -
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} } -
Z. Svitkina and É. Tardos, “Facility location with hierarchical facility costs.,” in SODA, 2006.
[Bibtex]@inproceedings{sodaSvitkinaT06, author = {Zoya Svitkina and \'Eva Tardos}, title = {Facility location with hierarchical facility costs.}, booktitle = {SODA}, year = 2006, doi = {http://dl.acm.org/citation.cfm?id=1109557.1109576}, keywords = {} } -
A. Hayrapetyan, É. Tardos, and T. Wexler, “The effect of collusion in congestion games.,” in STOC, 2006.
[Bibtex]@inproceedings{stocHayrapetyanTW06, author = {Ara Hayrapetyan and \'Eva Tardos and Tom Wexler}, title = {The effect of collusion in congestion games.}, booktitle = {STOC}, year = 2006, doi = {https://doi.org/10.1145/1132516.1132529}, keywords = {} } -
S. Ozer, J. Gray, S. A. Szalay, A. Terzis, R. Musaloiu-Elefteri, K. Szlavecz, R. C. Burns, and J. Cogan, “Data analysis tools for sensor-based science.,” in SenSys, 2006.
[Bibtex]@inproceedings{sensysOzerGSTMSBC06, author = {Stuart Ozer and Jim Gray and A. Sandor Szalay and Andreas Terzis and Razvan Musaloiu-Elefteri and Katalin Szlavecz and Randal C. Burns and Joshua Cogan}, title = {Data analysis tools for sensor-based science.}, booktitle = {SenSys}, year = 2006, doi = {['https://doi.org/10.1145/1182807.1182844', 'https://www.wikidata.org/entity/Q60558999']}, keywords = {} } -
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} } -
C. Klas, N. Fuhr, S. Kriewel, H. Albrechtsen, G. Tsakonas, S. Kapidakis, C. Papatheodorou, P. Hansen, L. Kovács, A. Micsik, and E. K. Jacob, “An experimental framework for comparative digital library evaluation: the logging scheme.,” in JCDL, 2006.
[Bibtex]@inproceedings{jcdlKlasFKATKPHKMJ06, author = {Claus-Peter Klas and Norbert Fuhr and Sascha Kriewel and Hanne Albrechtsen and Giannis Tsakonas and Sarantos Kapidakis and Christos Papatheodorou and Preben Hansen and L\'aszl\'o Kov\'acs and Andr\'as Micsik and Elin K. Jacob}, title = {An experimental framework for comparative digital library evaluation: the logging scheme.}, booktitle = {JCDL}, year = 2006, doi = {https://doi.org/10.1145/1141753.1141822}, keywords = {SZTAKI and international and applied} } -
V. V. Govindaswamy, G. V. Záruba, and G. Balasekaran, “Analyzing the Receiver Window Modification Scheme of TCP Queues.,” in INFOCOM, 2006.
[Bibtex]@inproceedings{infocomGovindaswamyZB06, author = {Visvasuresh Victor Govindaswamy and Gergely V. Z\'aruba and G. Balasekaran}, title = {Analyzing the Receiver Window Modification Scheme of TCP Queues.}, booktitle = {INFOCOM}, year = 2006, doi = {https://doi.org/10.1109/INFOCOM.2006.57}, keywords = {} } -
T. Horváth, J. Ramon, and S. Wrobel, “Frequent subgraph mining in outerplanar graphs.,” in KDD, 2006.
[Bibtex]@inproceedings{kddHorvathRW06, author = {Tam\'as Horv\'ath and Jan Ramon and Stefan Wrobel}, title = {Frequent subgraph mining in outerplanar graphs.}, booktitle = {KDD}, year = 2006, doi = {https://doi.org/10.1145/1150402.1150427}, keywords = {} } -
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} } -
M. Szegedy, “The DLT priority sampling is essentially optimal.,” in STOC, 2006.
[Bibtex]@inproceedings{stocSzegedy06, author = {Mario Szegedy}, title = {The DLT priority sampling is essentially optimal.}, booktitle = {STOC}, year = 2006, doi = {https://doi.org/10.1145/1132516.1132539}, keywords = {} } -
J. Renders, É. Gaussier, C. Goutte, F. Pacull, and G. Csurka, “Categorization in multiple category systems.,” in ICML, 2006.
[Bibtex]@inproceedings{icmlRendersGGPC06, author = {Jean-Michel Renders and \'Eric Gaussier and Cyril Goutte and François Pacull and Gabriela Csurka}, title = {Categorization in multiple category systems.}, booktitle = {ICML}, year = 2006, doi = {['https://doi.org/10.1145/1143844.1143938', 'https://www.wikidata.org/entity/Q57830270']}, keywords = {} } -
Y. Cheng, J. Bellardo, P. Benkö, A. C. Snoeren, G. M. Voelker, and S. Savage, “Jigsaw: solving the puzzle of enterprise 802.11 analysis.,” in SIGCOMM, 2006.
[Bibtex]@inproceedings{sigcommChengBBSVS06, author = {Yuchung Cheng and John Bellardo and P\'eter Benk\"o and Alex C. Snoeren and Geoffrey M. Voelker and Stefan Savage}, title = {Jigsaw: solving the puzzle of enterprise 802.11 analysis.}, booktitle = {SIGCOMM}, year = 2006, doi = {['https://doi.org/10.1145/1159913.1159920', 'https://doi.org/10.1145/1151659.1159920']}, keywords = {} } -
T. Borsos, I. Szabó, J. Wieland, and Pál. Zarándy, “A Measurement Based Solution for Service Quality Assurance in Operational GPRS Networks.,” in INFOCOM, 2006.
[Bibtex]@inproceedings{infocomBorsosSWZ06, author = {Tam\'as Borsos and Istv\'an Szab\'o and Jeroen Wieland and P\'al Zar\'andy}, title = {A Measurement Based Solution for Service Quality Assurance in Operational GPRS Networks.}, booktitle = {INFOCOM}, year = 2006, doi = {https://doi.org/10.1109/INFOCOM.2006.283}, keywords = {} } -
S. Ben-David, U. von Luxburg, and D. Pál, “A Sober Look at Clustering Stability.,” in COLT, 2006.
[Bibtex]@inproceedings{coltBen-DavidLP06, author = {Shai Ben-David and Ulrike von Luxburg and D\'avid P\'al}, title = {A Sober Look at Clustering Stability.}, booktitle = {COLT}, year = 2006, doi = {https://doi.org/10.1007/11776420_4}, keywords = {} } -
M. Félegyházi and J. Hubaux, “Wireless Operators in a Shared Spectrum.,” in INFOCOM, 2006.
[Bibtex]@inproceedings{infocomFelegyhaziH06, author = {M\'ark F\'elegyh\'azi and Jean-Pierre Hubaux}, title = {Wireless Operators in a Shared Spectrum.}, booktitle = {INFOCOM}, year = 2006, doi = {https://doi.org/10.1109/INFOCOM.2006.150}, keywords = {} } -
C. Mascolo, M. Musolesi, and B. Pásztor, “Data collection in delay tolerant mobile sensor networks using SCAR.,” in SenSys, 2006.
[Bibtex]@inproceedings{sensysMascoloMP06, author = {Cecilia Mascolo and Mirco Musolesi and Bence P\'asztor}, title = {Data collection in delay tolerant mobile sensor networks using SCAR.}, booktitle = {SenSys}, year = 2006, doi = {https://doi.org/10.1145/1182807.1182845}, keywords = {} } -
M. Neunhöffer and Á. Seress, “A data structure for a uniform approach to computations with finite groups.,” in ISSAC, 2006.
[Bibtex]@inproceedings{issacNeunhofferS06, author = {Max Neunh\"offer and \'Akos Seress}, title = {A data structure for a uniform approach to computations with finite groups.}, booktitle = {ISSAC}, year = 2006, doi = {https://doi.org/10.1145/1145768.1145811}, keywords = {} }
2005
-
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} } -
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} } -
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} } -
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 applied} } -
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 applied} } -
A. Fiat, M. Levy, J. Matousek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner, and E. Welzl, “Online conflict-free coloring for intervals.,” in SODA, 2005.
[Bibtex]@inproceedings{sodaFiatLMMPSSWW05, author = {Amos Fiat and Meital Levy and Jir\'i Matousek and Elchanan Mossel and J\'anos Pach and Micha Sharir and Shakhar Smorodinsky and Uli Wagner and Emo Welzl}, title = {Online conflict-free coloring for intervals.}, booktitle = {SODA}, year = 2005, doi = {http://dl.acm.org/citation.cfm?id=1070432.1070506}, keywords = {} } -
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} } -
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} } -
L. Babai and T. P. Hayes, “Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group.,” in SODA, 2005.
[Bibtex]@inproceedings{sodaBabaiH05, author = {L\'aszl\'o Babai and Thomas P. Hayes}, title = {Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group.}, booktitle = {SODA}, year = 2005, doi = {http://dl.acm.org/citation.cfm?id=1070432.1070584}, keywords = {} } -
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} } -
Á. Lédeczi, P. Völgyesi, M. Maróti, 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 Mikl\'os Mar\'oti 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} } -
K. Jain, L. Lovász, and P. A. Chou, “Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding.,” in PODC, 2005.
[Bibtex]@inproceedings{podcJainLC05, author = {Kamal Jain and L\'aszl\'o Lov\'asz and Philip A. Chou}, title = {Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding.}, booktitle = {PODC}, year = 2005, doi = {https://doi.org/10.1145/1073814.1073824}, keywords = {} } -
N. Shrivastava, S. Suri, and C. D. Tóth, “Detecting cuts in sensor networks.,” in IPSN, 2005.
[Bibtex]@inproceedings{ipsnShrivastavaST05, author = {Nisheeth Shrivastava and Subhash Suri and Csaba D. T\'oth}, title = {Detecting cuts in sensor networks.}, booktitle = {IPSN}, year = 2005, doi = {['https://doi.org/10.1109/IPSN.2005.1440927', 'http://dl.acm.org/citation.cfm?id=1147723']}, keywords = {} } -
J. Hershberger, N. Shrivastava, S. Suri, and C. D. Tóth, “Space complexity of hierarchical heavy hitters in multi-dimensional data streams.,” in PODS, 2005.
[Bibtex]@inproceedings{podsHershbergerSST05, author = {John Hershberger and Nisheeth Shrivastava and Subhash Suri and Csaba D. T\'oth}, title = {Space complexity of hierarchical heavy hitters in multi-dimensional data streams.}, booktitle = {PODS}, year = 2005, doi = {https://doi.org/10.1145/1065167.1065211}, keywords = {} } -
M. Ajtai, “Representing hard lattices with O(n log n) bits.,” in STOC, 2005.
[Bibtex]@inproceedings{stocAjtai05, author = {Mikl\'os Ajtai}, title = {Representing hard lattices with O(n log n) bits.}, booktitle = {STOC}, year = 2005, doi = {['https://doi.org/10.1145/1060590.1060604', 'https://www.wikidata.org/entity/Q130970629']}, keywords = {} } -
A. György, T. Linder, and G. Lugosi, “Tracking the Best of Many Experts.,” in COLT, 2005.
[Bibtex]@inproceedings{coltGyorgyLL05, author = {Andr\'as Gy\"orgy and Tam\'as Linder and G\'abor Lugosi}, title = {Tracking the Best of Many Experts.}, booktitle = {COLT}, year = 2005, doi = {https://doi.org/10.1007/11503415_14}, keywords = {} } -
F. Magniez, M. Santha, and M. Szegedy, “Quantum algorithms for the triangle problem.,” in SODA, 2005.
[Bibtex]@inproceedings{sodaMagniezSS05, author = {Fr\'ed\'eric Magniez and Miklos Santha and Mario Szegedy}, title = {Quantum algorithms for the triangle problem.}, booktitle = {SODA}, year = 2005, doi = {http://dl.acm.org/citation.cfm?id=1070432.1070591}, keywords = {} } -
Y. Wang, F. Alajaji, and T. Linder, “Design of VQ-Based Hybrid Digital-Analog Joint Source-Channel Codes for Image Communication.,” in DCC, 2005.
[Bibtex]@inproceedings{dccWangAL05, author = {Yadong Wang and Fady Alajaji and Tam\'as Linder}, title = {Design of VQ-Based Hybrid Digital-Analog Joint Source-Channel Codes for Image Communication.}, booktitle = {DCC}, year = 2005, doi = {['https://doi.org/10.1109/DCC.2005.30', 'https://doi.ieeecomputersociety.org/10.1109/DCC.2005.30']}, keywords = {} } -
A. Hayrapetyan, É. Tardos, and T. Wexler, “A network pricing game for selfish traffic.,” in PODC, 2005.
[Bibtex]@inproceedings{podcHayrapetyanTW05, author = {Ara Hayrapetyan and \'Eva Tardos and Tom Wexler}, title = {A network pricing game for selfish traffic.}, booktitle = {PODC}, year = 2005, doi = {https://doi.org/10.1145/1073814.1073869}, keywords = {} } -
H. N. Gabow, M. X. Goemans, É. Tardos, and D. P. Williamson, “‘i': ‘k’, ‘#text': ‘Approximating the smallest -edge connected spanning subgraph by LP-rounding.’,” in SODA, 2005.
[Bibtex]@inproceedings{sodaGabowGTW05, author = {Harold N. Gabow and Michel X. Goemans and \'Eva Tardos and David P. Williamson}, title = {{'i': 'k', '#text': 'Approximating the smallest -edge connected spanning subgraph by LP-rounding.'}}, booktitle = {SODA}, year = 2005, doi = {http://dl.acm.org/citation.cfm?id=1070432.1070511}, keywords = {} } -
A. Hayrapetyan, C. Swamy, and É. Tardos, “Network design for information networks.,” in SODA, 2005.
[Bibtex]@inproceedings{sodaHayrapetyanST05, author = {Ara Hayrapetyan and Chaitanya Swamy and \'Eva Tardos}, title = {Network design for information networks.}, booktitle = {SODA}, year = 2005, doi = {http://dl.acm.org/citation.cfm?id=1070432.1070567}, keywords = {} } -
V. Seshadri, G. V. Záruba, and M. Huber, “A Bayesian Sampling Approach to In-Door Localization of Wireless Devices Using Received Signal Strength Indication.,” in PerCom, 2005.
[Bibtex]@inproceedings{percomSeshadriZH05, author = {Vinay Seshadri and Gergely V. Z\'aruba and Manfred Huber}, title = {A Bayesian Sampling Approach to In-Door Localization of Wireless Devices Using Received Signal Strength Indication.}, booktitle = {PerCom}, year = 2005, doi = {['https://doi.org/10.1109/PERCOM.2005.1', 'https://doi.ieeecomputersociety.org/10.1109/PERCOM.2005.1']}, keywords = {} } -
S. Clémençon, G. Lugosi, and N. Vayatis, “Ranking and Scoring Using Empirical Risk Minimization.,” in COLT, 2005.
[Bibtex]@inproceedings{coltClemenconLV05, author = {St\'ephan Cl\'emençon and G\'abor Lugosi and Nicolas Vayatis}, title = {Ranking and Scoring Using Empirical Risk Minimization.}, booktitle = {COLT}, year = 2005, doi = {https://doi.org/10.1007/11503415_1}, keywords = {} } -
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} } -
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} } -
H. Cohn, R. D. Kleinberg, B. Szegedy, and C. Umans, “Group-theoretic Algorithms for Matrix Multiplication.,” in FOCS, 2005.
[Bibtex]@inproceedings{focsCohnKSU05, author = {Henry Cohn and Robert D. Kleinberg and Bal\'azs Szegedy and Christopher Umans}, title = {Group-theoretic Algorithms for Matrix Multiplication.}, booktitle = {FOCS}, year = 2005, doi = {['https://doi.org/10.1109/SFCS.2005.39', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.39', 'https://www.wikidata.org/entity/Q56784302']}, keywords = {} } -
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} }
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 applied} } -
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} } -
G. Madl, S. Abdelwahed, and G. Karsai, “Automatic Verification of Component-Based Real-Time CORBA Applications.,” in RTSS, 2004.
[Bibtex]@inproceedings{rtssMadlAK04, author = {Gabor Madl and Sherif Abdelwahed and Gabor Karsai}, title = {Automatic Verification of Component-Based Real-Time CORBA Applications.}, booktitle = {RTSS}, year = 2004, doi = {['https://doi.org/10.1109/REAL.2004.13', 'https://doi.ieeecomputersociety.org/10.1109/REAL.2004.13']}, keywords = {} } -
L. Babai, R. Beals, and Á. Seress, “On the diameter of the symmetric group: polynomial bounds.,” in SODA, 2004.
[Bibtex]@inproceedings{sodaBabaiBS04, author = {L\'aszl\'o Babai and Robert Beals and \'Akos Seress}, title = {On the diameter of the symmetric group: polynomial bounds.}, booktitle = {SODA}, year = 2004, doi = {http://dl.acm.org/citation.cfm?id=982792.982956}, keywords = {} } -
L. Babai and D. Stefankovic, “Simultaneous diophantine approximation with excluded primes.,” in SODA, 2004.
[Bibtex]@inproceedings{sodaBabaiS04, author = {L\'aszl\'o Babai and Daniel Stefankovic}, title = {Simultaneous diophantine approximation with excluded primes.}, booktitle = {SODA}, year = 2004, doi = {http://dl.acm.org/citation.cfm?id=982792.982958}, keywords = {} } -
G. Horváth, S. Rácz, and M. Telek, “Analysis of Second-Order Markov Reward Models.,” in DSN, 2004.
[Bibtex]@inproceedings{dsnHorvathRT04, author = {G\'abor Horv\'ath and S\'andor R\'acz and Mikl\'os Telek}, title = {Analysis of Second-Order Markov Reward Models.}, booktitle = {DSN}, year = 2004, doi = {['https://doi.org/10.1109/DSN.2004.1311955', 'https://doi.ieeecomputersociety.org/10.1109/DSN.2004.1311955']}, keywords = {Ericsson and BME and mostly_hungarian and applied} } -
S. Kogekar, S. Neema, B. Eames, X. D. Koutsoukos, Á. Lédeczi, and M. Maróti, “Constraint-guided dynamic reconfiguration in sensor networks.,” in IPSN, 2004.
[Bibtex]@inproceedings{ipsnKogekarNEKLM04, author = {Sachin Kogekar and Sandeep Neema and Brandon Eames and Xenofon D. Koutsoukos and \'Akos L\'edeczi and Mikl\'os Mar\'oti}, title = {Constraint-guided dynamic reconfiguration in sensor networks.}, booktitle = {IPSN}, year = 2004, doi = {['https://doi.org/10.1145/984622.984677', 'https://doi.org/10.1109/IPSN.2004.1307359']}, keywords = {} } -
G. Simon, M. Maróti, Á. Lédeczi, G. Balogh, B. Kusy, A. Nádas, G. Pap, J. Sallai, and K. Frampton, “Sensor network-based countersniper system.,” in SenSys, 2004.
[Bibtex]@inproceedings{sensysSimonMLBKNPSF04, author = {Gyula Simon and Mikl\'os Mar\'oti and \'Akos L\'edeczi and Gy\"orgy Balogh and Branislav Kusy and Andr\'as N\'adas and G\'abor Pap and J\'anos Sallai and Ken Frampton}, title = {Sensor network-based countersniper system.}, booktitle = {SenSys}, year = 2004, doi = {https://doi.org/10.1145/1031495.1031497}, keywords = {} } -
M. Maróti, B. Kusy, G. Simon, and Á. Lédeczi, “The flooding time synchronization protocol.,” in SenSys, 2004.
[Bibtex]@inproceedings{sensysMarotiKSL04, author = {Mikl\'os Mar\'oti and Branislav Kusy and Gyula Simon and \'Akos L\'edeczi}, title = {The flooding time synchronization protocol.}, booktitle = {SenSys}, year = 2004, doi = {['https://doi.org/10.1145/1031495.1031501', 'https://www.wikidata.org/entity/Q56475251']}, keywords = {} } -
L. Lovász and S. S. Vempala, “Hit-and-run from a corner.,” in STOC, 2004.
[Bibtex]@inproceedings{stocLovaszV04, author = {L\'aszl\'o Lov\'asz and Santosh S. Vempala}, title = {Hit-and-run from a corner.}, booktitle = {STOC}, year = 2004, doi = {https://doi.org/10.1145/1007352.1007403}, keywords = {} } -
J. Chen, R. D. Kleinberg, L. Lovász, R. Rajaraman, R. Sundaram, and A. Vetta, “(Almost) tight bounds and existence theorems for confluent flows.,” in STOC, 2004.
[Bibtex]@inproceedings{stocChenKLRSV04, author = {Jiangzhuo Chen and Robert D. Kleinberg and L\'aszl\'o Lov\'asz and Rajmohan Rajaraman and Ravi Sundaram and Adrian Vetta}, title = {(Almost) tight bounds and existence theorems for confluent flows.}, booktitle = {STOC}, year = 2004, doi = {https://doi.org/10.1145/1007352.1007432}, keywords = {} } -
M. Ajtai, “A conjecture about polynomial time computable lattice-lattice functions.,” in STOC, 2004.
[Bibtex]@inproceedings{stocAjtai04, author = {Mikl\'os Ajtai}, title = {A conjecture about polynomial time computable lattice-lattice functions.}, booktitle = {STOC}, year = 2004, doi = {https://doi.org/10.1145/1007352.1007426}, keywords = {} } -
M. Santha and M. Szegedy, “Quantum and classical query complexities of local search are polynomially related.,” in STOC, 2004.
[Bibtex]@inproceedings{stocSanthaS04, author = {Miklos Santha and Mario Szegedy}, title = {Quantum and classical query complexities of local search are polynomially related.}, booktitle = {STOC}, year = 2004, doi = {['https://doi.org/10.1145/1007352.1007427', 'https://www.wikidata.org/entity/Q130927173']}, keywords = {} } -
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} } -
E. Anshelevich, A. Dasgupta, J. M. Kleinberg, É. Tardos, T. Wexler, and T. Roughgarden, “The Price of Stability for Network Design with Fair Cost Allocation.,” in FOCS, 2004.
[Bibtex]@inproceedings{focsAnshelevichDKTWR04, author = {Elliot Anshelevich and Anirban Dasgupta and Jon M. Kleinberg and \'Eva Tardos and Tom Wexler and Tim Roughgarden}, title = {The Price of Stability for Network Design with Fair Cost Allocation.}, booktitle = {FOCS}, year = 2004, doi = {['https://doi.org/10.1109/FOCS.2004.68', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.68']}, keywords = {} } -
H. C. Lin, T. Roughgarden, and É. Tardos, “A stronger bound on Braess’s Paradox.,” in SODA, 2004.
[Bibtex]@inproceedings{sodaLinRT04, author = {Henry C. Lin and Tim Roughgarden and \'Eva Tardos}, title = {A stronger bound on Braess's Paradox.}, booktitle = {SODA}, year = 2004, doi = {http://dl.acm.org/citation.cfm?id=982792.982840}, keywords = {} } -
A. Archer, J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, K. Talwar, and É. Tardos, “Approximate classification via earthmover metrics.,” in SODA, 2004.
[Bibtex]@inproceedings{sodaArcherFHKTT04, author = {Aaron Archer and Jittat Fakcharoenphol and Chris Harrelson and Robert Krauthgamer and Kunal Talwar and \'Eva Tardos}, title = {Approximate classification via earthmover metrics.}, booktitle = {SODA}, year = 2004, doi = {http://dl.acm.org/citation.cfm?id=982792.982952}, keywords = {} } -
É. Tardos, “Network games.,” in STOC, 2004.
[Bibtex]@inproceedings{stocTardos04, author = {\'Eva Tardos}, title = {Network games.}, booktitle = {STOC}, year = 2004, doi = {https://doi.org/10.1145/1007352.1007356}, keywords = {} } -
N. Cesa-Bianchi, G. Lugosi, and G. Stoltz, “Minimizing Regret with Label Efficient Prediction.,” in COLT, 2004.
[Bibtex]@inproceedings{coltCesa-BianchiLS04, author = {Nicolò Cesa-Bianchi and G\'abor Lugosi and Gilles Stoltz}, title = {Minimizing Regret with Label Efficient Prediction.}, booktitle = {COLT}, year = 2004, doi = {['https://doi.org/10.1007/978-3-540-27819-1_6', 'https://www.wikidata.org/entity/Q59538598']}, keywords = {} } -
T. Horváth, T. Gärtner, and S. Wrobel, “Cyclic pattern kernels for predictive graph mining.,” in KDD, 2004.
[Bibtex]@inproceedings{kddHorvathGW04, author = {Tam\'as Horv\'ath and Thomas Gärtner and Stefan Wrobel}, title = {Cyclic pattern kernels for predictive graph mining.}, booktitle = {KDD}, year = 2004, doi = {['https://doi.org/10.1145/1014052.1014072', 'https://www.wikidata.org/entity/Q58503901']}, keywords = {} } -
M. Szegedy, “Quantum Speed-Up of Markov Chain Based Algorithms.,” in FOCS, 2004.
[Bibtex]@inproceedings{focsSzegedy04, author = {Mario Szegedy}, title = {Quantum Speed-Up of Markov Chain Based Algorithms.}, booktitle = {FOCS}, year = 2004, doi = {['https://doi.org/10.1109/FOCS.2004.53', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.53']}, keywords = {} } -
J. Matousek and T. Szabó, “Random Edge Can Be Exponential on Abstract Cubes.,” in FOCS, 2004.
[Bibtex]@inproceedings{focsMatousekS04, author = {Jir\'i Matousek and Tibor Szab\'o}, title = {Random Edge Can Be Exponential on Abstract Cubes.}, booktitle = {FOCS}, year = 2004, doi = {['https://doi.org/10.1109/FOCS.2004.56', 'https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.56']}, keywords = {} } -
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 = {} }
2003
-
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} } -
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} } -
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} } -
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} } -
L. Babai, A. Shpilka, and D. Stefankovic, “Locally Testable Cyclic Codes.,” in FOCS, 2003.
[Bibtex]@inproceedings{focsBabaiSS03, author = {L\'aszl\'o Babai and Amir Shpilka and Daniel Stefankovic}, title = {Locally Testable Cyclic Codes.}, booktitle = {FOCS}, year = 2003, doi = {['https://doi.org/10.1109/SFCS.2003.1238186', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238186']}, keywords = {} } -
L. Lovász and S. S. Vempala, “Logconcave Functions: Geometry and Efficient Sampling Algorithms,” in FOCS, 2003.
[Bibtex]@inproceedings{focsLovaszV03a, author = {L\'aszl\'o Lov\'asz and Santosh S. Vempala}, title = {Logconcave Functions: Geometry and Efficient Sampling Algorithms}, booktitle = {FOCS}, year = 2003, doi = {['https://doi.org/10.1109/SFCS.2003.1238236', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238236']}, keywords = {} } -
L. Lovász and S. S. Vempala, “Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm.,” in FOCS, 2003.
[Bibtex]@inproceedings{focsLovaszV03, author = {L\'aszl\'o Lov\'asz and Santosh S. Vempala}, title = {Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm.}, booktitle = {FOCS}, year = 2003, doi = {['https://doi.org/10.1109/SFCS.2003.1238237', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238237']}, keywords = {} } -
B. Speckmann and C. D. Tóth, “Allocating vertex pi-guards in simple polygons via pseudo-triangulations.,” in SODA, 2003.
[Bibtex]@inproceedings{sodaSpeckmannT03, author = {Bettina Speckmann and Csaba D. T\'oth}, title = {Allocating vertex pi-guards in simple polygons via pseudo-triangulations.}, booktitle = {SODA}, year = 2003, doi = {http://dl.acm.org/citation.cfm?id=644108.644128}, keywords = {} } -
F. C. Gärtner, K. Kursawe, and L. Buttyán, “PoDSy 2003: Principles of Dependable Systems.,” in DSN, 2003.
[Bibtex]@inproceedings{dsnGartnerKB03, author = {Felix C. Gärtner and Klaus Kursawe and Levente Butty\'an}, title = {PoDSy 2003: Principles of Dependable Systems.}, booktitle = {DSN}, year = 2003, doi = {https://doi.ieeecomputersociety.org/10.1109/DSN.2003.10002}, keywords = {BME and international and applied} } -
M. Ajtai, “The worst-case behavior of schnorr’s algorithm approximating the shortest nonzero vector in a lattice.,” in STOC, 2003.
[Bibtex]@inproceedings{stocAjtai03, author = {Mikl\'os Ajtai}, title = {The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice.}, booktitle = {STOC}, year = 2003, doi = {https://doi.org/10.1145/780542.780602}, keywords = {} } -
R. M. Gray and T. Linder, “High Rate Mismatch in Entropy Constrained Quantization.,” in DCC, 2003.
[Bibtex]@inproceedings{dccGrayL03, author = {Robert M. Gray and Tam\'as Linder}, title = {High Rate Mismatch in Entropy Constrained Quantization.}, booktitle = {DCC}, year = 2003, doi = {['https://doi.org/10.1109/DCC.2003.1194008', 'https://doi.ieeecomputersociety.org/10.1109/DCC.2003.1194008']}, keywords = {} } -
D. A. Nagy and T. Linder, “Experimental Study of a Binary Block Sorting Compression Scheme.,” in DCC, 2003.
[Bibtex]@inproceedings{dccNagyL03, author = {Daniel A. Nagy and Tam\'as Linder}, title = {Experimental Study of a Binary Block Sorting Compression Scheme.}, booktitle = {DCC}, year = 2003, doi = {['https://doi.org/10.1109/DCC.2003.1194058', 'https://doi.ieeecomputersociety.org/10.1109/DCC.2003.1194058']}, keywords = {} } -
B. Kégl, “Robust Regression by Boosting the Median.,” in COLT, 2003.
[Bibtex]@inproceedings{coltKegl03, author = {Bal\'azs K\'egl}, title = {Robust Regression by Boosting the Median.}, booktitle = {COLT}, year = 2003, doi = {https://doi.org/10.1007/978-3-540-45167-9_20}, keywords = {} } -
M. Pál and É. Tardos, “Group Strategyproof Mechanisms via Primal-Dual Algorithms.,” in FOCS, 2003.
[Bibtex]@inproceedings{focsPalT03, author = {Martin P\'al and \'Eva Tardos}, title = {Group Strategyproof Mechanisms via Primal-Dual Algorithms.}, booktitle = {FOCS}, year = 2003, doi = {['https://doi.org/10.1109/SFCS.2003.1238231', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238231']}, keywords = {} } -
D. Kempe, J. M. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network.,” in KDD, 2003.
[Bibtex]@inproceedings{kddKempeKT03, author = {David Kempe and Jon M. Kleinberg and \'Eva Tardos}, title = {Maximizing the spread of influence through a social network.}, booktitle = {KDD}, year = 2003, doi = {['https://doi.org/10.1145/956750.956769', 'https://www.wikidata.org/entity/Q54186154']}, keywords = {} } -
A. Archer, C. H. Papadimitriou, K. Talwar, and É. Tardos, “An approximate truthful mechanism for combinatorial auctions with single parameter agents.,” in SODA, 2003.
[Bibtex]@inproceedings{sodaArcherPTT03, author = {Aaron Archer and Christos H. Papadimitriou and Kunal Talwar and \'Eva Tardos}, title = {An approximate truthful mechanism for combinatorial auctions with single parameter agents.}, booktitle = {SODA}, year = 2003, doi = {http://dl.acm.org/citation.cfm?id=644108.644144}, keywords = {} } -
E. Anshelevich, A. Dasgupta, É. Tardos, and T. Wexler, “Near-optimal network design with selfish agents.,” in STOC, 2003.
[Bibtex]@inproceedings{stocAnshelevichDTW03, author = {Elliot Anshelevich and Anirban Dasgupta and \'Eva Tardos and Tom Wexler}, title = {Near-optimal network design with selfish agents.}, booktitle = {STOC}, year = 2003, doi = {['https://doi.org/10.1145/780542.780617', 'https://www.wikidata.org/entity/Q130977769']}, keywords = {} } -
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} } -
P. Schojer, L. Böszörményi, H. Hellwagner, B. Penz, and S. Podlipnig, “Architecture of a quality based intelligent proxy (QBIX) for MPEG-4 videos.,” in WWW, 2003.
[Bibtex]@inproceedings{wwwSchojerBHPP03, author = {Peter Schojer and L\'aszl\'o B\"osz\"orm\'enyi and Hermann Hellwagner and Bernhard Penz and Stefan Podlipnig}, title = {Architecture of a quality based intelligent proxy (QBIX) for MPEG-4 videos.}, booktitle = {WWW}, year = 2003, doi = {https://doi.org/10.1145/775152.775208}, keywords = {} } -
G. V. Záruba, V. Chaluvadi, and A. M. Suleman, “LABAR: Location Area Based Ad Hoc Routing for GPS-Scarce Wide-Area Ad Hoc Networks.,” in PerCom, 2003.
[Bibtex]@inproceedings{percomZarubaCS03, author = {Gergely V. Z\'aruba and Vamsi Chaluvadi and Azeem M. Suleman}, title = {LABAR: Location Area Based Ad Hoc Routing for GPS-Scarce Wide-Area Ad Hoc Networks.}, booktitle = {PerCom}, year = 2003, doi = {['https://doi.org/10.1109/PERCOM.2003.1192781', 'https://doi.ieeecomputersociety.org/10.1109/PERCOM.2003.1192781']}, keywords = {} } -
G. Stoltz and G. Lugosi, “Internal Regret in On-Line Portfolio Selection.,” in COLT, 2003.
[Bibtex]@inproceedings{coltStoltzL03, author = {Gilles Stoltz and G\'abor Lugosi}, title = {Internal Regret in On-Line Portfolio Selection.}, booktitle = {COLT}, year = 2003, doi = {https://doi.org/10.1007/978-3-540-45167-9_30}, keywords = {} } -
L. Arge and N. Zeh, “I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.,” in FOCS, 2003.
[Bibtex]@inproceedings{focsArgeZ03, author = {Lars Arge and Norbert Zeh}, title = {I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.}, booktitle = {FOCS}, year = 2003, doi = {['https://doi.org/10.1109/SFCS.2003.1238200', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238200']}, keywords = {} } -
E. L. Mansfield and Á. Szántó, “Elimination theory for differential difference polynomials.,” in ISSAC, 2003.
[Bibtex]@inproceedings{issacMansfieldS03, author = {Elizabeth L. Mansfield and \'Agnes Sz\'ant\'o}, title = {Elimination theory for differential difference polynomials.}, booktitle = {ISSAC}, year = 2003, doi = {https://doi.org/10.1145/860854.860897}, keywords = {} } -
A. Gál and A. Rosén, “Lower bounds on the amount of randomness in private computation.,” in STOC, 2003.
[Bibtex]@inproceedings{stocGalR03, author = {Anna G\'al and Adi Ros\'en}, title = {Lower bounds on the amount of randomness in private computation.}, booktitle = {STOC}, year = 2003, doi = {https://doi.org/10.1145/780542.780638}, keywords = {} } -
Z. Miklós, G. Neumann, U. Zdun, and M. Sintek, “Querying Semantic Web Resources Using TRIPLE Views.,” in ISWC, 2003.
[Bibtex]@inproceedings{semwebMiklosNZS03, author = {Zolt\'an Mikl\'os and Gustaf Neumann and Uwe Zdun and Michael Sintek}, title = {Querying Semantic Web Resources Using TRIPLE Views.}, booktitle = {ISWC}, year = 2003, doi = {['https://doi.org/10.1007/978-3-540-39718-2_33', 'https://www.wikidata.org/entity/Q125462914']}, keywords = {} }
2002
-
A. Bobbio, A. Horváth, and M. Telek, “PhFit: A General Phase-type Fitting Tool.,” in DSN, 2002.
[Bibtex]@inproceedings{dsnBobbioHT02, author = {Andrea Bobbio and Andr\'as Horv\'ath and Mikl\'os Telek}, title = {PhFit: A General Phase-type Fitting Tool.}, booktitle = {DSN}, year = 2002, doi = {['https://doi.org/10.1109/DSN.2002.1028966', 'https://doi.ieeecomputersociety.org/10.1109/DSN.2002.1028966', 'https://www.wikidata.org/entity/Q62048506']}, keywords = {BME and international and applied} } -
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} } -
S. Arora, B. Bollobás, and L. Lovász, “Proving Integrality Gaps without Knowing the Linear Program.,” in FOCS, 2002.
[Bibtex]@inproceedings{focsAroraBL02, author = {Sanjeev Arora and B\'ela Bollob\'as and L\'aszl\'o Lov\'asz}, title = {Proving Integrality Gaps without Knowing the Linear Program.}, booktitle = {FOCS}, year = 2002, doi = {['https://doi.org/10.1109/SFCS.2002.1181954', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181954']}, keywords = {} } -
I. Benjamini and L. Lovász, “Global Information from Local Observation.,” in FOCS, 2002.
[Bibtex]@inproceedings{focsBenjaminiL02, author = {Itai Benjamini and L\'aszl\'o Lov\'asz}, title = {Global Information from Local Observation.}, booktitle = {FOCS}, year = 2002, doi = {['https://doi.org/10.1109/SFCS.2002.1181995', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181995']}, keywords = {} } -
C. D. Tóth, “Binary space partitions for line segments with a limited number of directions.,” in SODA, 2002.
[Bibtex]@inproceedings{sodaToth02, author = {Csaba D. T\'oth}, title = {Binary space partitions for line segments with a limited number of directions.}, booktitle = {SODA}, year = 2002, doi = {http://dl.acm.org/citation.cfm?id=545381.545443}, keywords = {} } -
M. Ajtai, “Random Lattices and a Conjectured 0 – 1 Law about Their Polynomial Time Computable Properties.,” in FOCS, 2002.
[Bibtex]@inproceedings{focsAjtai02, author = {Mikl\'os Ajtai}, title = {Random Lattices and a Conjectured 0 - 1 Law about Their Polynomial Time Computable Properties.}, booktitle = {FOCS}, year = 2002, doi = {['https://doi.org/10.1109/SFCS.2002.1181998', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181998']}, keywords = {} } -
M. Ajtai, T. S. Jayram, R. Kumar, and D. Sivakumar, “Approximate counting of inversions in a data stream.,” in STOC, 2002.
[Bibtex]@inproceedings{stocAjtaiJKS02, author = {Mikl\'os Ajtai and T. S. Jayram and Ravi Kumar and D. Sivakumar}, title = {Approximate counting of inversions in a data stream.}, booktitle = {STOC}, year = 2002, doi = {https://doi.org/10.1145/509907.509964}, keywords = {} } -
M. Ajtai, “The invasiveness of off-line memory checking.,” in STOC, 2002.
[Bibtex]@inproceedings{stocAjtai02, author = {Mikl\'os Ajtai}, title = {The invasiveness of off-line memory checking.}, booktitle = {STOC}, year = 2002, doi = {https://doi.org/10.1145/509907.509981}, keywords = {} } -
F. Behnamfar, F. Alajaji, and T. Linder, “Progressive Image Communication over Binary Channels with Additive Bursty Noise.,” in DCC, 2002.
[Bibtex]@inproceedings{dccBehnamfarAL02, author = {Firouz Behnamfar and Fady Alajaji and Tam\'as Linder}, title = {Progressive Image Communication over Binary Channels with Additive Bursty Noise.}, booktitle = {DCC}, year = 2002, doi = {['https://doi.org/10.1109/DCC.2002.999965', 'https://doi.ieeecomputersociety.org/10.1109/DCC.2002.999965']}, keywords = {} } -
G. Ahn, L. Sun, A. Veres, and A. T. Campbell, “SWAN: Service Differentiation in Stateless Wireless Ad Hoc Networks.,” in INFOCOM, 2002.
[Bibtex]@inproceedings{infocomAhnSVC02, author = {Gahng-Seop Ahn and Li-Hsiang Sun and Andras Veres and Andrew T. Campbell}, title = {SWAN: Service Differentiation in Stateless Wireless Ad Hoc Networks.}, booktitle = {INFOCOM}, year = 2002, doi = {['https://doi.org/10.1109/INFCOM.2002.1019290', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2002.1019290']}, keywords = {} } -
A. Archer and É. Tardos, “Frugal path mechanisms.,” in SODA, 2002.
[Bibtex]@inproceedings{sodaArcherT02, author = {Aaron Archer and \'Eva Tardos}, title = {Frugal path mechanisms.}, booktitle = {SODA}, year = 2002, doi = {http://dl.acm.org/citation.cfm?id=545381.545509}, keywords = {} } -
G. Lugosi and N. Vayatis, “A Consistent Strategy for Boosting Algorithms.,” in COLT, 2002.
[Bibtex]@inproceedings{coltLugosiV02, author = {G\'abor Lugosi and Nicolas Vayatis}, title = {A Consistent Strategy for Boosting Algorithms.}, booktitle = {COLT}, year = 2002, doi = {https://doi.org/10.1007/3-540-45435-7_21}, keywords = {} } -
P. Antal, P. Glenisson, and G. Fannes, “On the potential of domain literature for clustering and Bayesian network learning.,” in KDD, 2002.
[Bibtex]@inproceedings{kddAntalGF02, author = {Peter Antal and Patrick Glenisson and Geert Fannes}, title = {On the potential of domain literature for clustering and Bayesian network learning.}, booktitle = {KDD}, year = 2002, doi = {https://doi.org/10.1145/775047.775105}, keywords = {} } -
A. Maheshwari and N. Zeh, “I/O-optimal algorithms for planar graphs using separators.,” in SODA, 2002.
[Bibtex]@inproceedings{sodaMaheshwariZ02, author = {Anil Maheshwari and Norbert Zeh}, title = {I/O-optimal algorithms for planar graphs using separators.}, booktitle = {SODA}, year = 2002, doi = {http://dl.acm.org/citation.cfm?id=545381.545430}, keywords = {} }
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. Ajtai, R. Kumar, and D. Sivakumar, “A sieve algorithm for the shortest lattice vector problem.,” in STOC, 2001.
[Bibtex]@inproceedings{stocAjtaiKS01, author = {Mikl\'os Ajtai and Ravi Kumar and D. Sivakumar}, title = {A sieve algorithm for the shortest lattice vector problem.}, booktitle = {STOC}, year = 2001, doi = {https://doi.org/10.1145/380752.380857}, keywords = {} } -
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} } -
M. Pál, É. Tardos, and T. Wexler, “Facility Location with Nonuniform Hard Capacities.,” in FOCS, 2001.
[Bibtex]@inproceedings{focsPalTW01, author = {Martin P\'al and \'Eva Tardos and Tom Wexler}, title = {Facility Location with Nonuniform Hard Capacities.}, booktitle = {FOCS}, year = 2001, doi = {['https://doi.org/10.1109/SFCS.2001.959907', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2001.959907']}, keywords = {} } -
A. Archer and É. Tardos, “Truthful Mechanisms for One-Parameter Agents.,” in FOCS, 2001.
[Bibtex]@inproceedings{focsArcherT01, author = {Aaron Archer and \'Eva Tardos}, title = {Truthful Mechanisms for One-Parameter Agents.}, booktitle = {FOCS}, year = 2001, doi = {['https://doi.org/10.1109/SFCS.2001.959924', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2001.959924']}, keywords = {} } -
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} } -
H. Kosch, L. Böszörményi, A. Bachlechner, C. Hanin, C. Hofbauer, M. Lang, C. Riedler, and R. Tusch, “SMOOTH – A Distributed Multimedia Database System.,” in VLDB, 2001.
[Bibtex]@inproceedings{vldbKoschBBHHLRT01, author = {Harald Kosch and L\'aszl\'o B\"osz\"orm\'enyi and Alexander Bachlechner and Christian Hanin and Christian Hofbauer and Margit Lang and Carmen Riedler and Roland Tusch}, title = {SMOOTH - A Distributed Multimedia Database System.}, booktitle = {VLDB}, year = 2001, doi = {{'@type': 'oa', '#text': 'http://www.vldb.org/conf/2001/P713.pdf'}}, keywords = {} } -
A. Maheshwari and N. Zeh, “I/O-efficient algorithms for graphs of bounded treewidth.,” in SODA, 2001.
[Bibtex]@inproceedings{sodaMaheshwariZ01, author = {Anil Maheshwari and Norbert Zeh}, title = {I/O-efficient algorithms for graphs of bounded treewidth.}, booktitle = {SODA}, year = 2001, doi = {http://dl.acm.org/citation.cfm?id=365411.365423}, keywords = {} } -
A. Faragó and V. R. Syrotiuk, “Merit: A unified framework for routing protocol assessment in mobile Ad Hoc networks.,” in MobiCom, 2001.
[Bibtex]@inproceedings{mobicomFaragoS01, author = {Andr\'as Farag\'o and Violet R. Syrotiuk}, title = {Merit: A unified framework for routing protocol assessment in mobile Ad Hoc networks.}, booktitle = {MobiCom}, year = 2001, doi = {https://doi.org/10.1145/381677.381683}, keywords = {} } -
T. Szabó and E. Welzl, “Unique Sink Orientations of Cubes.,” in FOCS, 2001.
[Bibtex]@inproceedings{focsSzaboW01, author = {Tibor Szab\'o and Emo Welzl}, title = {Unique Sink Orientations of Cubes.}, booktitle = {FOCS}, year = 2001, doi = {['https://doi.org/10.1109/SFCS.2001.959931', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2001.959931']}, keywords = {} } -
B. Gärtner, J. Solymosi, F. Tschirschnitz, E. Welzl, and P. Valtr, “One line and n points.,” in STOC, 2001.
[Bibtex]@inproceedings{stocGartnerSTWV01, author = {Bernd Gärtner and Jozsef Solymosi and Falk Tschirschnitz and Emo Welzl and Pavel Valtr}, title = {One line and n points.}, booktitle = {STOC}, year = 2001, doi = {https://doi.org/10.1145/380752.380814}, keywords = {} }
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. 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} } -
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} } -
N. Alon, M. R. Capalbo, Y. Kohayakawa, V. Rödl, A. Rucinski, and E. Szemerédi, “Universality and Tolerance.,” in FOCS, 2000.
[Bibtex]@inproceedings{focsAlonCKRRS00, author = {Noga Alon and Michael R. Capalbo and Yoshiharu Kohayakawa and Vojtech R\"odl and Andrzej Rucinski and Endre Szemer\'edi}, title = {Universality and Tolerance.}, booktitle = {FOCS}, year = 2000, doi = {['https://doi.org/10.1109/SFCS.2000.892007', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892007', 'https://www.wikidata.org/entity/Q105584774']}, keywords = {} } -
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} } -
L. Babai and I. Pak, “Strong bias of group generators: an obstacle to the "product replacement algorithm".,” in SODA, 2000.
[Bibtex]@inproceedings{sodaBabaiP00, author = {L\'aszl\'o Babai and Igor Pak}, title = {Strong bias of group generators: an obstacle to the "product replacement algorithm".}, booktitle = {SODA}, year = 2000, doi = {http://dl.acm.org/citation.cfm?id=338219.338616}, keywords = {} } -
J. Kahn, J. H. Kim, L. Lovász, and V. H. Vu, “The Cover Time, the Blanket Time, and the Matthews Bound.,” in FOCS, 2000.
[Bibtex]@inproceedings{focsKahnKLV00, author = {Jeff Kahn and Jeong Han Kim and L\'aszl\'o Lov\'asz and Van H. Vu}, title = {The Cover Time, the Blanket Time, and the Matthews Bound.}, booktitle = {FOCS}, year = 2000, doi = {['https://doi.org/10.1109/SFCS.2000.892134', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892134']}, keywords = {} } -
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} } -
W. van Dam, F. Magniez, M. Mosca, and M. Santha, “Self-testing of universal and fault-tolerant sets of quantum gates.,” in STOC, 2000.
[Bibtex]@inproceedings{stocDamMMS00, author = {Wim van Dam and Fr\'ed\'eric Magniez and Michele Mosca and Miklos Santha}, title = {Self-testing of universal and fault-tolerant sets of quantum gates.}, booktitle = {STOC}, year = 2000, doi = {['https://doi.org/10.1145/335305.335402', 'https://www.wikidata.org/entity/Q130926896']}, keywords = {} } -
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. 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} } -
V. Elek, G. Karlsson, and R. Rönngren, “Admission Control Based on End-to-End Measurements.,” in INFOCOM, 2000.
[Bibtex]@inproceedings{infocomElekKR00, author = {Vikt\'oria Elek and Gunnar Karlsson and Robert R\"onngren}, title = {Admission Control Based on End-to-End Measurements.}, booktitle = {INFOCOM}, year = 2000, doi = {['https://doi.org/10.1109/INFCOM.2000.832236', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.2000.832236']}, keywords = {} } -
T. Roughgarden and É. Tardos, “How Bad is Selfish Routing?,” in FOCS, 2000.
[Bibtex]@inproceedings{focsRoughgardenT00, author = {Tim Roughgarden and \'Eva Tardos}, title = {How Bad is Selfish Routing?}, booktitle = {FOCS}, year = 2000, doi = {['https://doi.org/10.1109/SFCS.2000.892069', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892069']}, keywords = {} } -
A. Gupta and É. Tardos, “A constant factor approximation algorithm for a class of classification problems.,” in STOC, 2000.
[Bibtex]@inproceedings{stocGuptaT00, author = {Anupam Gupta and \'Eva Tardos}, title = {A constant factor approximation algorithm for a class of classification problems.}, booktitle = {STOC}, year = 2000, doi = {https://doi.org/10.1145/335305.335397}, keywords = {} } - P. L. Bartlett, S. Boucheron, and G. Lugosi, “Model Selection and Error Estimation.,” in COLT, 2000.
[Bibtex]@inproceedings{coltBartlettBL00, author = {Peter L. Bartlett and St\'ephane Boucheron and G\'abor Lugosi}, title = {Model Selection and Error Estimation.}, booktitle = {COLT}, year = 2000, doi = {}, keywords = {} } -
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} } -
F. Chen, L. Lovász, and I. Pak, “Lifting Markov Chains to Speed up Mixing.,” in STOC, 1999.
[Bibtex]@inproceedings{stocChenLP99, author = {Fang Chen and L\'aszl\'o Lov\'asz and Igor Pak}, title = {Lifting Markov Chains to Speed up Mixing.}, booktitle = {STOC}, year = 1999, doi = {https://doi.org/10.1145/301250.301315}, keywords = {} } -
L. Lovász and R. Kannan, “Faster Mixing via Average Conductance.,” in STOC, 1999.
[Bibtex]@inproceedings{stocLovaszK99, author = {L\'aszl\'o Lov\'asz and Ravi Kannan}, title = {Faster Mixing via Average Conductance.}, booktitle = {STOC}, year = 1999, doi = {https://doi.org/10.1145/301250.301317}, keywords = {} } -
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} } -
M. Ajtai, “A Non-linear Time Lower Bound for Boolean Branching Programs.,” in FOCS, 1999.
[Bibtex]@inproceedings{focsAjtai99, author = {Mikl\'os Ajtai}, title = {A Non-linear Time Lower Bound for Boolean Branching Programs.}, booktitle = {FOCS}, year = 1999, doi = {['https://doi.org/10.1109/SFFCS.1999.814578', 'https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814578']}, keywords = {} } -
M. Ajtai, “Determinism versus Non-Determinism for Linear Time RAMs (Extended Abstract).,” in STOC, 1999.
[Bibtex]@inproceedings{stocAjtai99, author = {Mikl\'os Ajtai}, title = {Determinism versus Non-Determinism for Linear Time RAMs (Extended Abstract).}, booktitle = {STOC}, year = 1999, doi = {https://doi.org/10.1145/301250.301424}, keywords = {} } -
M. A. Kiwi, F. Magniez, and M. Santha, “Approximate Testing with Relative Error.,” in STOC, 1999.
[Bibtex]@inproceedings{stocKiwiMS99, author = {Marcos A. Kiwi and Fr\'ed\'eric Magniez and Miklos Santha}, title = {Approximate Testing with Relative Error.}, booktitle = {STOC}, year = 1999, doi = {https://doi.org/10.1145/301250.301269}, keywords = {} } -
J. M. Kleinberg and É. Tardos, “Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields.,” in FOCS, 1999.
[Bibtex]@inproceedings{focsKleinbergT99, author = {Jon M. Kleinberg and \'Eva Tardos}, title = {Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields.}, booktitle = {FOCS}, year = 1999, doi = {['https://doi.org/10.1109/SFFCS.1999.814572', 'https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814572']}, keywords = {} } -
J. M. Kleinberg, Y. Rabani, and É. Tardos, “Fairness in Routing and Load Balancing.,” in FOCS, 1999.
[Bibtex]@inproceedings{focsKleinbergRT99, author = {Jon M. Kleinberg and Yuval Rabani and \'Eva Tardos}, title = {Fairness in Routing and Load Balancing.}, booktitle = {FOCS}, year = 1999, doi = {['https://doi.org/10.1109/SFFCS.1999.814631', 'https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814631']}, keywords = {} } -
M. Charikar, S. Guha, É. Tardos, and D. B. Shmoys, “‘i': ‘k’, ‘#text': ‘A Constant-Factor Approximation Algorithm for the -Median Problem (Extended Abstract).’,” in STOC, 1999.
[Bibtex]@inproceedings{stocCharikarGTS99, author = {Moses Charikar and Sudipto Guha and \'Eva Tardos and David B. Shmoys}, title = {{'i': 'k', '#text': 'A Constant-Factor Approximation Algorithm for the -Median Problem (Extended Abstract).'}}, booktitle = {STOC}, year = 1999, doi = {https://doi.org/10.1145/301250.301257}, keywords = {} } -
A. Goel, M. R. Henzinger, S. A. Plotkin, and É. Tardos, “Scheduling Data Transfers in a Network and the Set Scheduling Problem.,” in STOC, 1999.
[Bibtex]@inproceedings{stocGoelHPT99, author = {Ashish Goel and Monika Rauch Henzinger and Serge A. Plotkin and \'Eva Tardos}, title = {Scheduling Data Transfers in a Network and the Set Scheduling Problem.}, booktitle = {STOC}, year = 1999, doi = {https://doi.org/10.1145/301250.301300}, keywords = {} } -
N. Cesa-Bianchi and G. Lugosi, “Minimax Regret Under log Loss for General Classes of Experts.,” in COLT, 1999.
[Bibtex]@inproceedings{coltCesa-BianchiL99, author = {Nicolò Cesa-Bianchi and G\'abor Lugosi}, title = {Minimax Regret Under log Loss for General Classes of Experts.}, booktitle = {COLT}, year = 1999, doi = {['https://doi.org/10.1145/307400.307407', 'https://www.wikidata.org/entity/Q59538611']}, keywords = {} } -
N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, “Regular Languages Are Testable with a Constant Number of Queries.,” in FOCS, 1999.
[Bibtex]@inproceedings{focsAlonKNS99, author = {Noga Alon and Michael Krivelevich and Ilan Newman and Mario Szegedy}, title = {Regular Languages Are Testable with a Constant Number of Queries.}, booktitle = {FOCS}, year = 1999, doi = {['https://doi.org/10.1109/SFFCS.1999.814641', 'https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814641']}, keywords = {} } -
N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, “Efficient Testing of Large Graphs.,” in FOCS, 1999.
[Bibtex]@inproceedings{focsAlonFKS99, author = {Noga Alon and Eldar Fischer and Michael Krivelevich and Mario Szegedy}, title = {Efficient Testing of Large Graphs.}, booktitle = {FOCS}, year = 1999, doi = {['https://doi.org/10.1109/SFFCS.1999.814642', 'https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814642']}, keywords = {} } -
N. Alon, P. B. Gibbons, Y. Matias, and M. Szegedy, “Tracking Join and Self-Join Sizes in Limited Storage.,” in PODS, 1999.
[Bibtex]@inproceedings{podsAlonGMS99, author = {Noga Alon and Phillip B. Gibbons and Yossi Matias and Mario Szegedy}, title = {Tracking Join and Self-Join Sizes in Limited Storage.}, booktitle = {PODS}, year = 1999, doi = {https://doi.org/10.1145/303976.303978}, keywords = {} } -
H. Kaplan and M. Szegedy, “On-line Complexity of Monotone Set Systems.,” in SODA, 1999.
[Bibtex]@inproceedings{sodaKaplanS99, author = {Haim Kaplan and Mario Szegedy}, title = {On-line Complexity of Monotone Set Systems.}, booktitle = {SODA}, year = 1999, doi = {http://dl.acm.org/citation.cfm?id=314500.314872}, keywords = {} } -
D. S. Johnson and M. Szegedy, “What are the Least Tractable Instances of max Independent Set?,” in SODA, 1999.
[Bibtex]@inproceedings{sodaJohnsonS99, author = {David S. Johnson and Mario Szegedy}, title = {What are the Least Tractable Instances of max Independent Set?}, booktitle = {SODA}, year = 1999, doi = {http://dl.acm.org/citation.cfm?id=314500.315093}, keywords = {} } -
H. Kaplan, M. Strauss, and M. Szegedy, “Just the Fax – Differentiating Voice and Fax Phone Lines Using Call Billing Data.,” in SODA, 1999.
[Bibtex]@inproceedings{sodaKaplanSS99, author = {Haim Kaplan and Martin Strauss and Mario Szegedy}, title = {Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data.}, booktitle = {SODA}, year = 1999, doi = {http://dl.acm.org/citation.cfm?id=314500.314929}, keywords = {} } -
M. Szegedy, “A Slique Size Bounding Technique with Application to Non-Linear Codes.,” in SODA, 1999.
[Bibtex]@inproceedings{sodaSzegedy99, author = {Mario Szegedy}, title = {A Slique Size Bounding Technique with Application to Non-Linear Codes.}, booktitle = {SODA}, year = 1999, doi = {http://dl.acm.org/citation.cfm?id=314500.314952}, keywords = {} } -
G. Csurka and P. Bouthemy, “Direct Identification of Moving Objects and Background from 2D Motion Models.,” in ICCV, 1999.
[Bibtex]@inproceedings{iccvCsurkaB99, author = {Gabriela Csurka and Patrick Bouthemy}, title = {Direct Identification of Moving Objects and Background from 2D Motion Models.}, booktitle = {ICCV}, year = 1999, doi = {['https://doi.org/10.1109/ICCV.1999.791274', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.1999.791274']}, keywords = {} } -
A. Gál and A. Rosén, “A Theorem on Sensitivity and Applications in Private Computation.,” in STOC, 1999.
[Bibtex]@inproceedings{stocGalR99, author = {Anna G\'al and Adi Ros\'en}, title = {A Theorem on Sensitivity and Applications in Private Computation.}, booktitle = {STOC}, year = 1999, doi = {https://doi.org/10.1145/301250.301340}, keywords = {} } -
A. Faragó, I. Chlamtac, and S. Basagni, “Virtual Path Network Topology Optimization Using Random Graphs.,” in INFOCOM, 1999.
[Bibtex]@inproceedings{infocomFaragoCB99, author = {Andr\'as Farag\'o and Imrich Chlamtac and Stefano Basagni}, title = {Virtual Path Network Topology Optimization Using Random Graphs.}, booktitle = {INFOCOM}, year = 1999, doi = {['https://doi.org/10.1109/INFCOM.1999.751382', 'https://doi.ieeecomputersociety.org/10.1109/INFCOM.1999.751382']}, keywords = {} }
1998
-
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} } -
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} } - 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 applied} } -
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. 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} } -
L. Babai, T. P. Hayes, and P. G. Kimmel, “The Cost of the Missing Bit: Communication Complexity with Help.,” in STOC, 1998.
[Bibtex]@inproceedings{stocBabaiHK98, author = {L\'aszl\'o Babai and Thomas P. Hayes and Peter G. Kimmel}, title = {The Cost of the Missing Bit: Communication Complexity with Help.}, booktitle = {STOC}, year = 1998, doi = {https://doi.org/10.1145/276698.276883}, keywords = {} } -
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} } -
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} } -
M. Ajtai, “‘i': [‘sub': ‘2’, ‘#text': ‘L’, ‘NP’], ‘#text': ‘The Shortest Vector Problem in is -hard for Randomized Reductions (Extended Abstract).’,” in STOC, 1998.
[Bibtex]@inproceedings{stocAjtai98, author = {Mikl\'os Ajtai}, title = {{'i': [{'sub': '2', '#text': 'L'}, 'NP'], '#text': 'The Shortest Vector Problem in is -hard for Randomized Reductions (Extended Abstract).'}}, booktitle = {STOC}, year = 1998, doi = {https://doi.org/10.1145/276698.276705}, keywords = {} } -
M. Ajtai, R. Fagin, and L. J. Stockmeyer, “The Closure of Monadic NP (Extended Abstract).,” in STOC, 1998.
[Bibtex]@inproceedings{stocAjtaiFS98, author = {Mikl\'os Ajtai and Ronald Fagin and Larry J. Stockmeyer}, title = {The Closure of Monadic NP (Extended Abstract).}, booktitle = {STOC}, year = 1998, doi = {https://doi.org/10.1145/276698.276771}, keywords = {} } -
N. Cesa-Bianchi and G. Lugosi, “On Sequential Prediction of Individual Sequences Relative to a Set of Experts.,” in COLT, 1998.
[Bibtex]@inproceedings{coltCesa-BianchiL98, author = {Nicolò Cesa-Bianchi and G\'abor Lugosi}, title = {On Sequential Prediction of Individual Sequences Relative to a Set of Experts.}, booktitle = {COLT}, year = 1998, doi = {['https://doi.org/10.1145/279943.279946', 'https://www.wikidata.org/entity/Q59538616']}, keywords = {} } -
M. Szegedy, “Algorithms to Tile the Infinite Grid with Finite Clusters.,” in FOCS, 1998.
[Bibtex]@inproceedings{focsSzegedy98, author = {Mario Szegedy}, title = {Algorithms to Tile the Infinite Grid with Finite Clusters.}, booktitle = {FOCS}, year = 1998, doi = {['https://doi.org/10.1109/SFCS.1998.743437', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743437']}, keywords = {} } -
R. Horaud and G. Csurka, “Self-Calibration and Euclidean Reconstruction Using Motions of a Stereo Rig.,” in ICCV, 1998.
[Bibtex]@inproceedings{iccvHoraudC98, author = {Radu Horaud and Gabriela Csurka}, title = {Self-Calibration and Euclidean Reconstruction Using Motions of a Stereo Rig.}, booktitle = {ICCV}, year = 1998, doi = {['https://doi.org/10.1109/ICCV.1998.710706', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.1998.710706']}, keywords = {} } -
A. Gál, “A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs.,” in STOC, 1998.
[Bibtex]@inproceedings{stocGal98, author = {Anna G\'al}, title = {A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs.}, booktitle = {STOC}, year = 1998, doi = {https://doi.org/10.1145/276698.276855}, keywords = {} }
1997
-
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} } -
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} } -
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} } -
L. Babai, “The Growth Rate of Vertex-Transitive Planar Graphs.,” in SODA, 1997.
[Bibtex]@inproceedings{sodaBabai97, author = {L\'aszl\'o Babai}, title = {The Growth Rate of Vertex-Transitive Planar Graphs.}, booktitle = {SODA}, year = 1997, doi = {http://dl.acm.org/citation.cfm?id=314161.314390}, keywords = {} } -
L. Babai, “Paul Erdös (1913-1996): His Influence on the Theory of Computing.,” in STOC, 1997.
[Bibtex]@inproceedings{stocBabai97, author = {L\'aszl\'o Babai}, title = {Paul Erdös (1913-1996): His Influence on the Theory of Computing.}, booktitle = {STOC}, year = 1997, doi = {https://doi.org/10.1145/258533.258624}, keywords = {} } -
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} } -
M. Ajtai and C. Dwork, “A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence.,” in STOC, 1997.
[Bibtex]@inproceedings{stocAjtaiD97, author = {Mikl\'os Ajtai and Cynthia Dwork}, title = {A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence.}, booktitle = {STOC}, year = 1997, doi = {['https://doi.org/10.1145/258533.258604', 'https://www.wikidata.org/entity/Q57568017']}, keywords = {} } -
I. Chlamtac, V. Elek, A. Fumagalli, and C. A. Szabo, “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 Szabo}, 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} } -
D. B. Shmoys, É. Tardos, and K. I. Aardal, “Approximation Algorithms for Facility Location Problems (Extended Abstract).,” in STOC, 1997.
[Bibtex]@inproceedings{stocShmoysTA97, author = {David B. Shmoys and \'Eva Tardos and Karen I. Aardal}, title = {Approximation Algorithms for Facility Location Problems (Extended Abstract).}, booktitle = {STOC}, year = 1997, doi = {https://doi.org/10.1145/258533.258600}, keywords = {} } -
J. M. Kleinberg, Y. Rabani, and É. Tardos, “Allocating Bandwidth for Bursty Connections.,” in STOC, 1997.
[Bibtex]@inproceedings{stocKleinbergRT97, author = {Jon M. Kleinberg and Yuval Rabani and \'Eva Tardos}, title = {Allocating Bandwidth for Bursty Connections.}, booktitle = {STOC}, year = 1997, doi = {https://doi.org/10.1145/258533.258661}, keywords = {} }
1996
-
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} } -
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} } -
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} } - 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 applied} } -
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} } -
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} } -
M. Ajtai, “Generating Hard Instances of Lattice Problems (Extended Abstract).,” in STOC, 1996.
[Bibtex]@inproceedings{stocAjtai96, author = {Mikl\'os Ajtai}, title = {Generating Hard Instances of Lattice Problems (Extended Abstract).}, booktitle = {STOC}, year = 1996, doi = {['https://doi.org/10.1145/237814.237838', 'https://www.wikidata.org/entity/Q57484376']}, keywords = {} } -
C. Dürr and M. Santha, “A Decision Procedure for Unitary Linear Quantum Cellular Automata.,” in FOCS, 1996.
[Bibtex]@inproceedings{focsDurrS96, author = {Christoph D\"urr and Miklos Santha}, title = {A Decision Procedure for Unitary Linear Quantum Cellular Automata.}, booktitle = {FOCS}, year = 1996, doi = {['https://doi.org/10.1109/SFCS.1996.548462', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548462']}, keywords = {} } -
Y. Rabani and É. Tardos, “Distributed Packet Switching in Arbitrary Networks.,” in STOC, 1996.
[Bibtex]@inproceedings{stocRabaniT96, author = {Yuval Rabani and \'Eva Tardos}, title = {Distributed Packet Switching in Arbitrary Networks.}, booktitle = {STOC}, year = 1996, doi = {https://doi.org/10.1145/237814.237983}, keywords = {} } -
G. Lugosi and M. Pintér, “A Data-Dependent Skeleton Estimate for Learning.,” in COLT, 1996.
[Bibtex]@inproceedings{coltLugosiP96, author = {G\'abor Lugosi and M\'arta Pint\'er}, title = {A Data-Dependent Skeleton Estimate for Learning.}, booktitle = {COLT}, year = 1996, doi = {https://doi.org/10.1145/238061.238068}, keywords = {} } -
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} } -
N. Alon, Y. Matias, and M. Szegedy, “The Space Complexity of Approximating the Frequency Moments.,” in STOC, 1996.
[Bibtex]@inproceedings{stocAlonMS96, author = {Noga Alon and Yossi Matias and Mario Szegedy}, title = {The Space Complexity of Approximating the Frequency Moments.}, booktitle = {STOC}, year = 1996, doi = {['https://doi.org/10.1145/237814.237823', 'https://www.wikidata.org/entity/Q57482549']}, keywords = {} } -
I. Newman and M. Szegedy, “Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract).,” in STOC, 1996.
[Bibtex]@inproceedings{stocNewmanS96, author = {Ilan Newman and Mario Szegedy}, title = {Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract).}, booktitle = {STOC}, year = 1996, doi = {https://doi.org/10.1145/237814.238004}, keywords = {} }
1995
-
N. Kahalé, F. T. Leighton, Y. Ma, G. C. Plaxton, T. Suel, and E. Szemerédi, “Lower bounds for sorting networks.,” in STOC, 1995.
[Bibtex]@inproceedings{stocKahaleLMPSS95, author = {Nabil Kahal\'e and Frank Thomson Leighton and Yuan Ma and C. Greg Plaxton and Torsten Suel and Endre Szemer\'edi}, title = {Lower bounds for sorting networks.}, booktitle = {STOC}, year = 1995, doi = {https://doi.org/10.1145/225058.225178}, keywords = {} } -
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} } -
K. S. Trivedi, A. Bobbio, M. Telek, R. German, G. Ciardo, and A. Puliafito, “Non-Markovian Petri Nets (Panel).,” in SIGMETRICS, 1995.
[Bibtex]@inproceedings{sigmetricsTrivediBTGCP95, author = {Kishor S. Trivedi and Andrea Bobbio and Mikl\'os Telek and Reinhard German and Gianfranco Ciardo and Antonio Puliafito}, title = {Non-Markovian Petri Nets (Panel).}, booktitle = {SIGMETRICS}, year = 1995, doi = {['https://doi.org/10.1145/223587.223616', 'https://doi.org/10.1145/223586.223616']}, keywords = {BME and international and applied} } -
L. Lovász and P. Winkler, “Efficient stopping rules for Markov chains.,” in STOC, 1995.
[Bibtex]@inproceedings{stocLovaszW95, author = {L\'aszl\'o Lov\'asz and Peter Winkler}, title = {Efficient stopping rules for Markov chains.}, booktitle = {STOC}, year = 1995, doi = {https://doi.org/10.1145/225058.225086}, keywords = {} } -
M. Ajtai, N. Megiddo, and O. Waarts, “Improved Algorithms and Analysis for Secretary Problems and Generalizations.,” in FOCS, 1995.
[Bibtex]@inproceedings{focsAjtaiMW95, author = {Mikl\'os Ajtai and Nimrod Megiddo and Orli Waarts}, title = {Improved Algorithms and Analysis for Secretary Problems and Generalizations.}, booktitle = {FOCS}, year = 1995, doi = {['https://doi.org/10.1109/SFCS.1995.492578', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492578']}, keywords = {} } -
M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L. J. Schulman, and O. Waarts, “Fairness in Scheduling.,” in SODA, 1995.
[Bibtex]@inproceedings{sodaAjtaiANRSW95, author = {Mikl\'os Ajtai and James Aspnes and Moni Naor and Yuval Rabani and Leonard J. Schulman and Orli Waarts}, title = {Fairness in Scheduling.}, booktitle = {SODA}, year = 1995, doi = {http://dl.acm.org/citation.cfm?id=313651.313796}, keywords = {} } -
J. M. Kleinberg and É. Tardos, “Disjoint Paths in Densely Embedded Graphs.,” in FOCS, 1995.
[Bibtex]@inproceedings{focsKleinbergT95, author = {Jon M. Kleinberg and \'Eva Tardos}, title = {Disjoint Paths in Densely Embedded Graphs.}, booktitle = {FOCS}, year = 1995, doi = {['https://doi.org/10.1109/SFCS.1995.492462', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492462']}, keywords = {} } -
B. Hoppe and É. Tardos, “The Quickest Transshipment Problem.,” in SODA, 1995.
[Bibtex]@inproceedings{sodaHoppeT95, author = {Bruce Hoppe and \'Eva Tardos}, title = {The Quickest Transshipment Problem.}, booktitle = {SODA}, year = 1995, doi = {http://dl.acm.org/citation.cfm?id=313651.313810}, keywords = {} } -
J. M. Kleinberg and É. Tardos, “Approximations for the disjoint paths problem in high-diameter planar networks.,” in STOC, 1995.
[Bibtex]@inproceedings{stocKleinbergT95, author = {Jon M. Kleinberg and \'Eva Tardos}, title = {Approximations for the disjoint paths problem in high-diameter planar networks.}, booktitle = {STOC}, year = 1995, doi = {https://doi.org/10.1145/225058.225075}, keywords = {} } -
C. Rothwell, G. Csurka, and O. D. Faugeras, “A Comparison of Projective Reconstruction Methods for Pairs of Views.,” in ICCV, 1995.
[Bibtex]@inproceedings{iccvRothwellCF95, author = {Charlie Rothwell and Gabriela Csurka and Olivier D. Faugeras}, title = {A Comparison of Projective Reconstruction Methods for Pairs of Views.}, booktitle = {ICCV}, year = 1995, doi = {['https://doi.org/10.1109/ICCV.1995.466835', 'https://doi.ieeecomputersociety.org/10.1109/ICCV.1995.466835']}, keywords = {} } -
A. Beimel, A. Gál, and M. Paterson, “Lower Bounds for Monotone Span Programs.,” in FOCS, 1995.
[Bibtex]@inproceedings{focsBeimelGP95, author = {Amos Beimel and Anna G\'al and Mike Paterson}, title = {Lower Bounds for Monotone Span Programs.}, booktitle = {FOCS}, year = 1995, doi = {['https://doi.org/10.1109/SFCS.1995.492669', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492669']}, keywords = {} }
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} } -
M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts, “A Theory of Competitive Analysis for Distributed Algorithms,” in FOCS, 1994.
[Bibtex]@inproceedings{focsAjtaiADW94, author = {Mikl\'os Ajtai and James Aspnes and Cynthia Dwork and Orli Waarts}, title = {A Theory of Competitive Analysis for Distributed Algorithms}, booktitle = {FOCS}, year = 1994, doi = {['https://doi.org/10.1109/SFCS.1994.365676', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365676']}, keywords = {} } -
M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts, “Competitiveness in Distributed Algorithms.,” in PODC, 1994.
[Bibtex]@inproceedings{podcAjtaiADW94, author = {Mikl\'os Ajtai and James Aspnes and Cynthia Dwork and Orli Waarts}, title = {Competitiveness in Distributed Algorithms.}, booktitle = {PODC}, year = 1994, doi = {https://doi.org/10.1145/197917.198178}, keywords = {} } -
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} } -
M. X. Goemans, A. V. Goldberg, S. A. Plotkin, D. B. Shmoys, É. Tardos, and D. P. Williamson, “Improved Approximation Algorithms for Network Design Problems.,” in SODA, 1994.
[Bibtex]@inproceedings{sodaGoemansGPSTW94, author = {Michel X. Goemans and Andrew V. Goldberg and Serge A. Plotkin and David B. Shmoys and \'Eva Tardos and David P. Williamson}, title = {Improved Approximation Algorithms for Network Design Problems.}, booktitle = {SODA}, year = 1994, doi = {http://dl.acm.org/citation.cfm?id=314464.314497}, keywords = {} } -
B. Hoppe and É. Tardos, “Polynomial Time Algorithms for Some Evacuation Problems.,” in SODA, 1994.
[Bibtex]@inproceedings{sodaHoppeT94, author = {Bruce Hoppe and \'Eva Tardos}, title = {Polynomial Time Algorithms for Some Evacuation Problems.}, booktitle = {SODA}, year = 1994, doi = {http://dl.acm.org/citation.cfm?id=314464.314583}, keywords = {} } -
M. Szegedy, “A note on the Theta number of Lovász and the generalized Delsarte bound,” in FOCS, 1994.
[Bibtex]@inproceedings{focsSzegedy94, author = {Mario Szegedy}, title = {A note on the Theta number of Lovász and the generalized Delsarte bound}, booktitle = {FOCS}, year = 1994, doi = {['https://doi.org/10.1109/SFCS.1994.365707', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365707']}, keywords = {} } -
M. Schönert and Á. Seress, “Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time.,” in ISSAC, 1994.
[Bibtex]@inproceedings{issacSchonertS94, author = {Martin Sch\"onert and \'Akos Seress}, title = {Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time.}, booktitle = {ISSAC}, year = 1994, doi = {https://doi.org/10.1145/190347.190400}, keywords = {} }
1993
-
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} } -
R. Beals and L. Babai, “Las Vegas algorithms for matrix groups,” in FOCS, 1993.
[Bibtex]@inproceedings{focsBealsB93, author = {Robert Beals and L\'aszl\'o Babai}, title = {Las Vegas algorithms for matrix groups}, booktitle = {FOCS}, year = 1993, doi = {['https://doi.org/10.1109/SFCS.1993.366844', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1993.366844']}, keywords = {} } -
S. Arora, L. Babai, J. Stern, and Z. Sweedyk, “The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations,” in FOCS, 1993.
[Bibtex]@inproceedings{focsAroraBSS93, author = {Sanjeev Arora and L\'aszl\'o Babai and Jacques Stern and Z. Sweedyk}, title = {The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations}, booktitle = {FOCS}, year = 1993, doi = {['https://doi.org/10.1109/SFCS.1993.366815', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1993.366815', 'https://www.wikidata.org/entity/Q57567991']}, keywords = {} } -
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} } -
L. Babai, R. Beals, and D. N. Rockmore, “Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time.,” in ISSAC, 1993.
[Bibtex]@inproceedings{issacBabaiBR93, author = {L\'aszl\'o Babai and Robert Beals and Daniel N. Rockmore}, title = {Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time.}, booktitle = {ISSAC}, year = 1993, doi = {https://doi.org/10.1145/164081.164104}, keywords = {} } -
D. B. Shmoys and É. Tardos, “Scheduling Unrelated Machines with Costs.,” in SODA, 1993.
[Bibtex]@inproceedings{sodaShmoysT93, author = {David B. Shmoys and \'Eva Tardos}, title = {Scheduling Unrelated Machines with Costs.}, booktitle = {SODA}, year = 1993, doi = {http://dl.acm.org/citation.cfm?id=313559.313851}, keywords = {} } -
S. A. Plotkin and É. Tardos, “Improved bounds on the max-flow min-cut ratio for multicommodity flows.,” in STOC, 1993.
[Bibtex]@inproceedings{stocPlotkinT93, author = {Serge A. Plotkin and \'Eva Tardos}, title = {Improved bounds on the max-flow min-cut ratio for multicommodity flows.}, booktitle = {STOC}, year = 1993, doi = {https://doi.org/10.1145/167088.167263}, keywords = {} } -
M. Szegedy and S. Vishwanathan, “Locality based graph coloring.,” in STOC, 1993.
[Bibtex]@inproceedings{stocSzegedyV93, author = {Mario Szegedy and Sundar Vishwanathan}, title = {Locality based graph coloring.}, booktitle = {STOC}, year = 1993, doi = {https://doi.org/10.1145/167088.167156}, keywords = {} }
1992
-
N. Nisan, E. Szemerédi, and A. Wigderson, “Undirected Connectivity in O(log ^1.5 n) Space,” in FOCS, 1992.
[Bibtex]@inproceedings{focsNisanSW92, author = {Noam Nisan and Endre Szemer\'edi and Avi Wigderson}, title = {Undirected Connectivity in O(log ^1.5 n) Space}, booktitle = {FOCS}, year = 1992, doi = {['https://doi.org/10.1109/SFCS.1992.267822', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267822', 'https://www.wikidata.org/entity/Q56474978']}, keywords = {} } -
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} } -
M. Ajtai, N. Alon, J. Bruck, R. Cypher, C. Ho, M. Naor, and E. Szemerédi, “Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths,” in FOCS, 1992.
[Bibtex]@inproceedings{focsAjtaiABCHNS92, author = {Mikl\'os Ajtai and Noga Alon and Jehoshua Bruck and Robert Cypher and Ching-Tien Ho and Moni Naor and Endre Szemer\'edi}, title = {Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths}, booktitle = {FOCS}, year = 1992, doi = {['https://doi.org/10.1109/SFCS.1992.267781', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267781']}, keywords = {} } -
L. Babai, “Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time.,” in SODA, 1992.
[Bibtex]@inproceedings{sodaBabai92, author = {L\'aszl\'o Babai}, title = {Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time.}, booktitle = {SODA}, year = 1992, doi = {http://dl.acm.org/citation.cfm?id=139404.139411}, keywords = {} } -
L. Babai, R. Beals, and Pál. Takácsi-Nagy, “Symmetry and Complexity,” in STOC, 1992.
[Bibtex]@inproceedings{stocBabaiBT92, author = {L\'aszl\'o Babai and Robert Beals and P\'al Tak\'acsi-Nagy}, title = {Symmetry and Complexity}, booktitle = {STOC}, year = 1992, doi = {https://doi.org/10.1145/129712.129754}, keywords = {} } -
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} } -
A. Björner, L. Lovász, and A. C. Yao, “Linear Decision Trees: Volume Estimates and Topological Bounds,” in STOC, 1992.
[Bibtex]@inproceedings{stocBjornerLY92, author = {Anders Bj\"orner and L\'aszl\'o Lov\'asz and Andrew Chi-Chih Yao}, title = {Linear Decision Trees: Volume Estimates and Topological Bounds}, booktitle = {STOC}, year = 1992, doi = {https://doi.org/10.1145/129712.129730}, keywords = {} } -
U. Feige and L. Lovász, “Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract),” in STOC, 1992.
[Bibtex]@inproceedings{stocFeigeL92a, author = {Uriel Feige and L\'aszl\'o Lov\'asz}, title = {Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract)}, booktitle = {STOC}, year = 1992, doi = {https://doi.org/10.1145/129712.129783}, keywords = {} } -
M. Ajtai and N. Megiddo, “A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension,” in STOC, 1992.
[Bibtex]@inproceedings{stocAjtaiM92, author = {Mikl\'os Ajtai and Nimrod Megiddo}, title = {A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension}, booktitle = {STOC}, year = 1992, doi = {https://doi.org/10.1145/129712.129744}, keywords = {} } -
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} } -
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, “Proof Verification and Hardness of Approximation Problems,” in FOCS, 1992.
[Bibtex]@inproceedings{focsAroraLMSS92, author = {Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy}, title = {Proof Verification and Hardness of Approximation Problems}, booktitle = {FOCS}, year = 1992, doi = {['https://doi.org/10.1109/SFCS.1992.267823', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267823', 'https://www.wikidata.org/entity/Q55919308']}, keywords = {} } -
M. M. Halldórsson and M. Szegedy, “Lower Bounds for On-Line Graph Coloring.,” in SODA, 1992.
[Bibtex]@inproceedings{sodaHalldorssonS92, author = {Magn\'us M. Halld\'orsson and Mario Szegedy}, title = {Lower Bounds for On-Line Graph Coloring.}, booktitle = {SODA}, year = 1992, doi = {http://dl.acm.org/citation.cfm?id=139404.139452}, keywords = {} } -
N. Nisan and M. Szegedy, “On the Degree of Boolean Functions as Real Polynomials,” in STOC, 1992.
[Bibtex]@inproceedings{stocNisanS92, author = {Noam Nisan and Mario Szegedy}, title = {On the Degree of Boolean Functions as Real Polynomials}, booktitle = {STOC}, year = 1992, doi = {https://doi.org/10.1145/129712.129757}, keywords = {} } -
J. Simon and M. Szegedy, “On the Complexity of RAM with Various Operation Sets,” in STOC, 1992.
[Bibtex]@inproceedings{stocSimonS92, author = {Janos Simon and Mario Szegedy}, title = {On the Complexity of RAM with Various Operation Sets}, booktitle = {STOC}, year = 1992, doi = {https://doi.org/10.1145/129712.129773}, keywords = {} } -
R. Beals and Á. Seress, “Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time,” in STOC, 1992.
[Bibtex]@inproceedings{stocBealsS92, author = {Robert Beals and \'Akos Seress}, title = {Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time}, booktitle = {STOC}, year = 1992, doi = {https://doi.org/10.1145/129712.129724}, keywords = {} }
1991
-
J. Matousek, N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, “Fat Triangles Determine Linearly Many Holes,” in FOCS, 1991.
[Bibtex]@inproceedings{focsMatousekMPSSW91, author = {Jir\'i Matousek and Nathaly Miller and J\'anos Pach and Micha Sharir and Shmuel Sifrony and Emo Welzl}, title = {Fat Triangles Determine Linearly Many Holes}, booktitle = {FOCS}, year = 1991, doi = {['https://doi.org/10.1109/SFCS.1991.185347', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185347']}, keywords = {} } -
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} } -
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} } -
L. Babai, G. Cooperman, L. Finkelstein, and Á. Seress, “Nearly Linear Time Algorithms for Permutation Groups with a Small Base.,” in ISSAC, 1991.
[Bibtex]@inproceedings{issacBabaiCFS91, author = {L\'aszl\'o Babai and Gene Cooperman and Larry Finkelstein and \'Akos Seress}, title = {Nearly Linear Time Algorithms for Permutation Groups with a Small Base.}, booktitle = {ISSAC}, year = 1991, doi = {https://doi.org/10.1145/120694.120724}, keywords = {} } -
L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy, “Checking Computations in Polylogarithmic Time,” in STOC, 1991.
[Bibtex]@inproceedings{stocBabaiFLS91, author = {L\'aszl\'o Babai and Lance Fortnow and Leonid A. Levin and Mario Szegedy}, title = {Checking Computations in Polylogarithmic Time}, booktitle = {STOC}, year = 1991, doi = {https://doi.org/10.1145/103418.103428}, keywords = {} } -
L. Babai, G. Cooperman, L. Finkelstein, E. M. Luks, and Á. Seress, “Fast Monte Carlo Algorithms for Permutation Groups,” in STOC, 1991.
[Bibtex]@inproceedings{stocBabaiCFLS91, author = {L\'aszl\'o Babai and Gene Cooperman and Larry Finkelstein and Eugene M. Luks and \'Akos Seress}, title = {Fast Monte Carlo Algorithms for Permutation Groups}, booktitle = {STOC}, year = 1991, doi = {https://doi.org/10.1145/103418.103435}, keywords = {} } -
L. Babai, “Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups,” in STOC, 1991.
[Bibtex]@inproceedings{stocBabai91, author = {L\'aszl\'o Babai}, title = {Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups}, booktitle = {STOC}, year = 1991, doi = {https://doi.org/10.1145/103418.103440}, keywords = {} } -
U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, “Approximating Clique is Almost NP-Complete (Preliminary Version),” in FOCS, 1991.
[Bibtex]@inproceedings{focsFeigeGLSS91, author = {Uriel Feige and Shafi Goldwasser and L\'aszl\'o Lov\'asz and Shmuel Safra and Mario Szegedy}, title = {Approximating Clique is Almost NP-Complete (Preliminary Version)}, booktitle = {FOCS}, year = 1991, doi = {['https://doi.org/10.1109/SFCS.1991.185341', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185341', 'https://www.wikidata.org/entity/Q56210407']}, keywords = {} } -
L. Lovász, M. Naor, I. Newman, and A. Wigderson, “Search Problems in the Decision Tree Model (Preliminary Version),” in FOCS, 1991.
[Bibtex]@inproceedings{focsLovaszNNW91, author = {L\'aszl\'o Lov\'asz and Moni Naor and Ilan Newman and Avi Wigderson}, title = {Search Problems in the Decision Tree Model (Preliminary Version)}, booktitle = {FOCS}, year = 1991, doi = {['https://doi.org/10.1109/SFCS.1991.185422', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185422']}, keywords = {} } -
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} } -
S. A. Plotkin, D. B. Shmoys, and É. Tardos, “Fast Approximation Algorithms for Fractional Packing and Covering Problems,” in FOCS, 1991.
[Bibtex]@inproceedings{focsPlotkinST91, author = {Serge A. Plotkin and David B. Shmoys and \'Eva Tardos}, title = {Fast Approximation Algorithms for Fractional Packing and Covering Problems}, booktitle = {FOCS}, year = 1991, doi = {['https://doi.org/10.1109/SFCS.1991.185411', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185411']}, keywords = {} } -
F. T. Leighton, F. Makedon, S. A. Plotkin, C. Stein, É. Tardos, and S. Tragoudas, “Fast Approximation Algorithms for Multicommodity Flow Problems,” in STOC, 1991.
[Bibtex]@inproceedings{stocLeightonMPSTT91, author = {Frank Thomson Leighton and Fillia Makedon and Serge A. Plotkin and Clifford Stein and \'Eva Tardos and Spyros Tragoudas}, title = {Fast Approximation Algorithms for Multicommodity Flow Problems}, booktitle = {STOC}, year = 1991, doi = {https://doi.org/10.1145/103418.103425}, keywords = {} } -
A. Gál, “Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates,” in FOCS, 1991.
[Bibtex]@inproceedings{focsGal91, author = {Anna G\'al}, title = {Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates}, booktitle = {FOCS}, year = 1991, doi = {['https://doi.org/10.1109/SFCS.1991.185424', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185424']}, keywords = {} }
1990
-
W. Maass and G. Turán, “On the Complexity of Learning from Counterexamples and Membership Queries (abstract).,” in COLT, 1990.
[Bibtex]@inproceedings{coltMaassT90, author = {Wolfgang Maass and Gy\"orgy Tur\'an}, title = {On the Complexity of Learning from Counterexamples and Membership Queries (abstract).}, booktitle = {COLT}, year = 1990, doi = {http://dl.acm.org/citation.cfm?id=102684}, keywords = {Hungary 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} } -
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} } -
L. Babai, L. Fortnow, and C. Lund, “Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols,” in FOCS, 1990.
[Bibtex]@inproceedings{focsBabaiFL90, author = {L\'aszl\'o Babai and Lance Fortnow and Carsten Lund}, title = {Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols}, booktitle = {FOCS}, year = 1990, doi = {['https://doi.org/10.1109/FSCS.1990.89520', 'https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89520', 'https://www.wikidata.org/entity/Q55952611']}, keywords = {} } -
L. Babai and L. Fortnow, “A Characterization of \sharp P Arithmetic Straight Line Programs,” in FOCS, 1990.
[Bibtex]@inproceedings{focsBabaiF90, author = {L\'aszl\'o Babai and Lance Fortnow}, title = {A Characterization of \sharp P Arithmetic Straight Line Programs}, booktitle = {FOCS}, year = 1990, doi = {['https://doi.org/10.1109/FSCS.1990.89521', 'https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89521']}, keywords = {} } -
L. Babai, G. Hetyei, W. M. Kantor, A. Lubotzky, and Á. Seress, “On the Diameter of Finite Groups,” in FOCS, 1990.
[Bibtex]@inproceedings{focsBabaiHKLS90, author = {L\'aszl\'o Babai and G\'abor Hetyei and William M. Kantor and Alexander Lubotzky and \'Akos Seress}, title = {On the Diameter of Finite Groups}, booktitle = {FOCS}, year = 1990, doi = {['https://doi.org/10.1109/FSCS.1990.89608', 'https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89608']}, keywords = {} } -
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} } -
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} } -
S. A. Plotkin and É. Tardos, “Improved Dual Network Simplex.,” in SODA, 1990.
[Bibtex]@inproceedings{sodaPlotkinT90, author = {Serge A. Plotkin and \'Eva Tardos}, title = {Improved Dual Network Simplex.}, booktitle = {SODA}, year = 1990, doi = {http://dl.acm.org/citation.cfm?id=320176.320222}, keywords = {} } -
C. H. Norton, S. A. Plotkin, and É. Tardos, “Using Separation Algorithms in Fixed Dimension.,” in SODA, 1990.
[Bibtex]@inproceedings{sodaNortonPT90, author = {Carolyn Haibt Norton and Serge A. Plotkin and \'Eva Tardos}, title = {Using Separation Algorithms in Fixed Dimension.}, booktitle = {SODA}, year = 1990, doi = {http://dl.acm.org/citation.cfm?id=320176.320223}, keywords = {} } -
P. N. Klein, C. Stein, and É. Tardos, “Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities,” in STOC, 1990.
[Bibtex]@inproceedings{stocKleinST90, author = {Philip N. Klein and Clifford Stein and \'Eva Tardos}, title = {Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities}, booktitle = {STOC}, year = 1990, doi = {https://doi.org/10.1145/100216.100257}, keywords = {} } -
M. Szegedy, “Functions with Bounded Symmetric Communication Complexity and Circuits with \mathop mod m Gates,” in STOC, 1990.
[Bibtex]@inproceedings{stocSzegedy90, author = {Mario Szegedy}, title = {Functions with Bounded Symmetric Communication Complexity and Circuits with \mathop mod m Gates}, booktitle = {STOC}, year = 1990, doi = {https://doi.org/10.1145/100216.100252}, keywords = {} } -
B. Chor, M. Geréb-Graus, and E. Kushilevitz, “Private Computations Over the Integers (Extended Abstract),” in FOCS, 1990.
[Bibtex]@inproceedings{focsChorGK90, author = {Benny Chor and Mih\'aly Ger\'eb-Graus and Eyal Kushilevitz}, title = {Private Computations Over the Integers (Extended Abstract)}, booktitle = {FOCS}, year = 1990, doi = {['https://doi.org/10.1109/FSCS.1990.89552', 'https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89552']}, keywords = {} }
1989
-
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} } -
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} } -
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} } -
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. 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} } -
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. Babai, N. Nisan, and M. Szegedy, “Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract),” in STOC, 1989.
[Bibtex]@inproceedings{stocBabaiNS89, author = {L\'aszl\'o Babai and Noam Nisan and Mario Szegedy}, title = {Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract)}, booktitle = {STOC}, year = 1989, doi = {https://doi.org/10.1145/73007.73008}, keywords = {} } -
M. Ajtai and Y. Gurevich, “Datalog vs. First-Order Logic,” in FOCS, 1989.
[Bibtex]@inproceedings{focsAjtaiG89, author = {Mikl\'os Ajtai and Yuri Gurevich}, title = {Datalog vs. First-Order Logic}, booktitle = {FOCS}, year = 1989, doi = {['https://doi.org/10.1109/SFCS.1989.63469', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63469', 'https://www.wikidata.org/entity/Q51221166']}, keywords = {} } -
A. V. Goldberg, S. A. Plotkin, D. B. Shmoys, and É. Tardos, “Interior-Point Methods in Parallel Computation,” in FOCS, 1989.
[Bibtex]@inproceedings{focsGoldbergPST89, author = {Andrew V. Goldberg and Serge A. Plotkin and David B. Shmoys and \'Eva Tardos}, title = {Interior-Point Methods in Parallel Computation}, booktitle = {FOCS}, year = 1989, doi = {['https://doi.org/10.1109/SFCS.1989.63502', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63502']}, keywords = {} }
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} } -
H. de Fraysseix, J. Pach, and R. Pollack, “Small Sets Supporting Fáry Embeddings of Planar Graphs,” in STOC, 1988.
[Bibtex]@inproceedings{stocFraysseixPP88, author = {Hubert de Fraysseix and J\'anos Pach and Richard Pollack}, title = {Small Sets Supporting Fáry Embeddings of Planar Graphs}, booktitle = {STOC}, year = 1988, doi = {['https://doi.org/10.1145/62212.62254', 'https://www.wikidata.org/entity/Q29396057']}, keywords = {} } -
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} } -
L. Babai, E. M. Luks, and Á. Seress, “Fast Management of Permutation Groups,” in FOCS, 1988.
[Bibtex]@inproceedings{focsBabaiLS88, author = {L\'aszl\'o Babai and Eugene M. Luks and \'Akos Seress}, title = {Fast Management of Permutation Groups}, booktitle = {FOCS}, year = 1988, doi = {['https://doi.org/10.1109/SFCS.1988.21943', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21943']}, keywords = {} } -
L. Lovász and M. E. Saks, “Lattices, Möbius Functions and Communication Complexity,” in FOCS, 1988.
[Bibtex]@inproceedings{focsLovaszS88, author = {L\'aszl\'o Lov\'asz and Michael E. Saks}, title = {Lattices, Möbius Functions and Communication Complexity}, booktitle = {FOCS}, year = 1988, doi = {['https://doi.org/10.1109/SFCS.1988.21924', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21924']}, keywords = {} } -
M. Ajtai, “The Complexity of the Pigeonhole Principle,” in FOCS, 1988.
[Bibtex]@inproceedings{focsAjtai88, author = {Mikl\'os Ajtai}, title = {The Complexity of the Pigeonhole Principle}, booktitle = {FOCS}, year = 1988, doi = {['https://doi.org/10.1109/SFCS.1988.21951', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21951']}, keywords = {} } -
M. Ajtai and R. Fagin, “Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version),” in FOCS, 1988.
[Bibtex]@inproceedings{focsAjtaiF88, author = {Mikl\'os Ajtai and Ronald Fagin}, title = {Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version)}, booktitle = {FOCS}, year = 1988, doi = {['https://doi.org/10.1109/SFCS.1988.21952', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21952']}, keywords = {} } -
A. V. Goldberg, S. A. Plotkin, and É. Tardos, “Combinatorial Algorithms for the Generalized Circulation Problem,” in FOCS, 1988.
[Bibtex]@inproceedings{focsGoldbergPT88, author = {Andrew V. Goldberg and Serge A. Plotkin and \'Eva Tardos}, title = {Combinatorial Algorithms for the Generalized Circulation Problem}, booktitle = {FOCS}, year = 1988, doi = {['https://doi.org/10.1109/SFCS.1988.21959', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21959']}, keywords = {} } -
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} } -
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} } -
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} } -
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} } -
H. Edelsbrunner, J. Pach, J. T. Schwartz, and M. Sharir, “On the Lower Envelope of Bivariate Functions and its Applications,” in FOCS, 1987.
[Bibtex]@inproceedings{focsEdelsbrunnerPSS87, author = {Herbert Edelsbrunner and J\'anos Pach and Jacob T. Schwartz and Micha Sharir}, title = {On the Lower Envelope of Bivariate Functions and its Applications}, booktitle = {FOCS}, year = 1987, doi = {['https://doi.org/10.1109/SFCS.1987.44', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.44']}, keywords = {} } -
L. Babai, E. M. Luks, and Á. Seress, “Permutation Groups in NC,” in STOC, 1987.
[Bibtex]@inproceedings{stocBabaiLS87, author = {L\'aszl\'o Babai and Eugene M. Luks and \'Akos Seress}, title = {Permutation Groups in NC}, booktitle = {STOC}, year = 1987, doi = {https://doi.org/10.1145/28395.28439}, keywords = {} } -
M. Ajtai, “Recursive Construction for 3-Regular Expanders,” in FOCS, 1987.
[Bibtex]@inproceedings{focsAjtai87, author = {Mikl\'os Ajtai}, title = {Recursive Construction for 3-Regular Expanders}, booktitle = {FOCS}, year = 1987, doi = {['https://doi.org/10.1109/SFCS.1987.50', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.50']}, keywords = {} } -
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} } -
J. K. Lenstra, D. B. Shmoys, and É. Tardos, “Approximation Algorithms for Scheduling Unrelated Parallel Machines,” in FOCS, 1987.
[Bibtex]@inproceedings{focsLenstraST87, author = {Jan Karel Lenstra and David B. Shmoys and \'Eva Tardos}, title = {Approximation Algorithms for Scheduling Unrelated Parallel Machines}, booktitle = {FOCS}, year = 1987, doi = {['https://doi.org/10.1109/SFCS.1987.8', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.8']}, keywords = {} } -
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} } -
M. Geréb-Graus and D. Krizanc, “The Complexity of Parallel Comparison Merging,” in FOCS, 1987.
[Bibtex]@inproceedings{focsGereb-GrausK87, author = {Mih\'aly Ger\'eb-Graus and Danny Krizanc}, title = {The Complexity of Parallel Comparison Merging}, booktitle = {FOCS}, year = 1987, doi = {['https://doi.org/10.1109/SFCS.1987.55', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.55']}, keywords = {} }
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} } -
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} } -
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} } -
L. Babai, “A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues,” in FOCS, 1986.
[Bibtex]@inproceedings{focsBabai86, author = {L\'aszl\'o Babai}, title = {A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues}, booktitle = {FOCS}, year = 1986, doi = {https://doi.org/10.1109/SFCS.1986.1}, keywords = {} } -
L. Babai, P. Frankl, and J. Simon, “Complexity classes in communication complexity theory (preliminary version),” in FOCS, 1986.
[Bibtex]@inproceedings{focsBabaiFS86, author = {L\'aszl\'o Babai and Peter Frankl and Janos Simon}, title = {Complexity classes in communication complexity theory (preliminary version)}, booktitle = {FOCS}, year = 1986, doi = {['https://doi.org/10.1109/SFCS.1986.15', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1986.15']}, keywords = {} } -
N. Linial, L. Lovász, and A. Wigderson, “A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications,” in FOCS, 1986.
[Bibtex]@inproceedings{focsLinialLW86, author = {Nathan Linial and L\'aszl\'o Lov\'asz and Avi Wigderson}, title = {A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications}, booktitle = {FOCS}, year = 1986, doi = {https://doi.org/10.1109/SFCS.1986.3}, keywords = {} } -
Z. Galil and É. Tardos, “An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm,” in FOCS, 1986.
[Bibtex]@inproceedings{focsGalilT86, author = {Zvi Galil and \'Eva Tardos}, title = {An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm}, booktitle = {FOCS}, year = 1986, doi = {https://doi.org/10.1109/SFCS.1986.7}, keywords = {} } -
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
-
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} } -
L. Babai, “Trading Group Theory for Randomness,” in STOC, 1985.
[Bibtex]@inproceedings{stocBabai85, author = {L\'aszl\'o Babai}, title = {Trading Group Theory for Randomness}, booktitle = {STOC}, year = 1985, doi = {['https://doi.org/10.1145/22145.22192', 'https://www.wikidata.org/entity/Q59487146']}, keywords = {} } -
L. Lovász, “Computing ears and branchings in parallel,” in FOCS, 1985.
[Bibtex]@inproceedings{focsLovasz85, author = {L\'aszl\'o Lov\'asz}, title = {Computing ears and branchings in parallel}, booktitle = {FOCS}, year = 1985, doi = {['https://doi.org/10.1109/SFCS.1985.16', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.16']}, keywords = {} } -
M. Ajtai and A. Wigderson, “Deterministic Simulation of Probabilistic Constant Depth Circuits (Preliminary Version),” in FOCS, 1985.
[Bibtex]@inproceedings{focsAjtaiW85, author = {Mikl\'os Ajtai and Avi Wigderson}, title = {Deterministic Simulation of Probabilistic Constant Depth Circuits (Preliminary Version)}, booktitle = {FOCS}, year = 1985, doi = {['https://doi.org/10.1109/SFCS.1985.19', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.19']}, keywords = {} } -
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} }
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} } -
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} } -
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} } -
M. Ajtai and M. Ben-Or, “A Theorem on Probabilistic Constant Depth Computations,” in STOC, 1984.
[Bibtex]@inproceedings{stocAjtaiB84, author = {Mikl\'os Ajtai and Michael Ben-Or}, title = {A Theorem on Probabilistic Constant Depth Computations}, booktitle = {STOC}, year = 1984, doi = {https://doi.org/10.1145/800057.808715}, keywords = {} } -
M. Santha and U. V. Vazirani, “Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract),” in FOCS, 1984.
[Bibtex]@inproceedings{focsSanthaV84, author = {Miklos Santha and Umesh V. Vazirani}, title = {Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract)}, booktitle = {FOCS}, year = 1984, doi = {['https://doi.org/10.1109/SFCS.1984.715945', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715945']}, keywords = {} }
1983
-
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} } -
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} } -
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} } -
L. Babai, W. M. Kantor, and E. M. Luks, “Computational Complexity and the Classification of Finite Simple Groups,” in FOCS, 1983.
[Bibtex]@inproceedings{focsBabaiKL83, author = {L\'aszl\'o Babai and William M. Kantor and Eugene M. Luks}, title = {Computational Complexity and the Classification of Finite Simple Groups}, booktitle = {FOCS}, year = 1983, doi = {['https://doi.org/10.1109/SFCS.1983.10', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.10']}, keywords = {} } -
L. Babai and E. M. Luks, “Canonical Labeling of Graphs,” in STOC, 1983.
[Bibtex]@inproceedings{stocBabaiL83, author = {L\'aszl\'o Babai and Eugene M. Luks}, title = {Canonical Labeling of Graphs}, booktitle = {STOC}, year = 1983, doi = {https://doi.org/10.1145/800061.808746}, keywords = {} } -
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} } -
A. Márkus, “Shifting the Focus of Attention: The Way Agatha Christie Leads You On.,” in IJCAI, 1983.
[Bibtex]@inproceedings{ijcaiMarkus83, author = {Andr\'as M\'arkus}, title = {Shifting the Focus of Attention: The Way Agatha Christie Leads You On.}, booktitle = {IJCAI}, year = 1983, doi = {{'@type': 'oa', '#text': 'http://ijcai.org/Proceedings/83-1/Papers/013.pdf'}}, keywords = {SZTE and all_hungarian and applied} }
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. Babai, Y. D. Grigoryev, and D. M. Mount, “Isomorphism of Graphs with Bounded Eigenvalue Multiplicity,” in STOC, 1982.
[Bibtex]@inproceedings{stocBabaiGM82, author = {L\'aszl\'o Babai and D. Yu. Grigoryev and David M. Mount}, title = {Isomorphism of Graphs with Bounded Eigenvalue Multiplicity}, booktitle = {STOC}, year = 1982, doi = {https://doi.org/10.1145/800070.802206}, keywords = {} }
1979
-
L. Babai and L. Kucera, “Canonical Labelling of Graphs in Linear Average Time,” in FOCS, 1979.
[Bibtex]@inproceedings{focsBabaiK79, author = {L\'aszl\'o Babai and Ludek Kucera}, title = {Canonical Labelling of Graphs in Linear Average Time}, booktitle = {FOCS}, year = 1979, doi = {['https://doi.org/10.1109/SFCS.1979.8', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1979.8']}, keywords = {} } -
R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff, “Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems,” in FOCS, 1979.
[Bibtex]@inproceedings{focsAleliunasKLLR79, author = {Romas Aleliunas and Richard M. Karp and Richard J. Lipton and L\'aszl\'o Lov\'asz and Charles Rackoff}, title = {Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems}, booktitle = {FOCS}, year = 1979, doi = {['https://doi.org/10.1109/SFCS.1979.34', 'https://doi.ieeecomputersociety.org/10.1109/SFCS.1979.34', 'https://www.wikidata.org/entity/Q56474977']}, keywords = {} }
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 institutionsmostly_hungarian– at least half of the authors are Hungarian-affiliatedinternational– 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.