Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: György Ottucsák
@article{DBLP:journals/jmlr/GyorgyLO10, author = {Andr{\'{a}}s Gy{\"{o}}rgy and G{\'{a}}bor Lugosi and Gy{\"{o}}rgy Ottucs{\'{a}}k}, title = {On-Line Sequential Bin Packing}, journal = {J. Mach. Learn. Res.}, volume = {11}, pages = {89--109}, year = {2010}, url = {https://dl.acm.org/doi/10.5555/1756006.1756010}, doi = {10.5555/1756006.1756010}, timestamp = {Thu, 02 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/GyorgyLO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/hu/Gyorgy08, author = {Gy{\"{o}}rgy Ottucs{\'{a}}k}, title = {G{\'{e}}pi tanul{\'{a}}si algoritmusok alkalmaz{\'{a}}sa infokommunik{\'{a}}ci{\'{o}}s h{\'{a}}l{\'{o}}zatokban}, school = {Budapest University of Technology and Economics, Hungary}, year = {2008}, url = {https://doktori.hu/index.php?menuid=193\&\#38;lang=HU\&\#38;vid=161}, timestamp = {Thu, 08 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/hu/Gyorgy08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/GyorgyLO08, author = {Andr{\'{a}}s Gy{\"{o}}rgy and G{\'{a}}bor Lugosi and Gy{\"{o}}rgy Ottucs{\'{a}}k}, editor = {Rocco A. Servedio and Tong Zhang}, title = {On-line Sequential Bin Packing}, booktitle = {21st Annual Conference on Learning Theory - {COLT} 2008, Helsinki, Finland, July 9-12, 2008}, pages = {447--454}, publisher = {Omnipress}, year = {2008}, url = {http://colt2008.cs.helsinki.fi/papers/53-Gyorgy.pdf}, timestamp = {Wed, 20 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/GyorgyLO08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/GyorgyLLO07, author = {Andr{\'{a}}s Gy{\"{o}}rgy and Tam{\'{a}}s Linder and G{\'{a}}bor Lugosi and Gy{\"{o}}rgy Ottucs{\'{a}}k}, title = {The On-Line Shortest Path Problem Under Partial Monitoring}, journal = {J. Mach. Learn. Res.}, volume = {8}, pages = {2369--2403}, year = {2007}, url = {https://dl.acm.org/doi/10.5555/1314498.1314575}, doi = {10.5555/1314498.1314575}, timestamp = {Thu, 02 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/GyorgyLLO07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/OttucsakG07, author = {Gy{\"{o}}rgy Ottucs{\'{a}}k and L{\'{a}}szl{\'{o}} Gy{\"{o}}rfi}, title = {Sequential prediction of binary sequence with side information only}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007, Nice, France, June 24-29, 2007}, pages = {2351--2355}, publisher = {{IEEE}}, year = {2007}, url = {https://doi.org/10.1109/ISIT.2007.4557170}, doi = {10.1109/ISIT.2007.4557170}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/OttucsakG07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0704-1020, author = {Andr{\'{a}}s Gy{\"{o}}rgy and Tam{\'{a}}s Linder and G{\'{a}}bor Lugosi and Gy{\"{o}}rgy Ottucs{\'{a}}k}, title = {The on-line shortest path problem under partial monitoring}, journal = {CoRR}, volume = {abs/0704.1020}, year = {2007}, url = {http://arxiv.org/abs/0704.1020}, eprinttype = {arXiv}, eprint = {0704.1020}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0704-1020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cj/GyorgyO06, author = {Andr{\'{a}}s Gy{\"{o}}rgy and Gy{\"{o}}rgy Ottucs{\'{a}}k}, title = {Adaptive Routing Using Expert Advice}, journal = {Comput. J.}, volume = {49}, number = {2}, pages = {180--189}, year = {2006}, url = {https://doi.org/10.1093/comjnl/bxh168}, doi = {10.1093/COMJNL/BXH168}, timestamp = {Wed, 20 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cj/GyorgyO06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alt/AllenbergAGO06, author = {Chamy Allenberg and Peter Auer and L{\'{a}}szl{\'{o}} Gy{\"{o}}rfi and Gy{\"{o}}rgy Ottucs{\'{a}}k}, editor = {Jos{\'{e}} L. Balc{\'{a}}zar and Philip M. Long and Frank Stephan}, title = {Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring}, booktitle = {Algorithmic Learning Theory, 17th International Conference, {ALT} 2006, Barcelona, Spain, October 7-10, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4264}, pages = {229--243}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11894841\_20}, doi = {10.1007/11894841\_20}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/alt/AllenbergAGO06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/GyorgyLO06, author = {Andr{\'{a}}s Gy{\"{o}}rgy and Tam{\'{a}}s Linder and Gy{\"{o}}rgy Ottucs{\'{a}}k}, editor = {G{\'{a}}bor Lugosi and Hans Ulrich Simon}, title = {The Shortest Path Problem Under Partial Monitoring}, booktitle = {Learning Theory, 19th Annual Conference on Learning Theory, {COLT} 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4005}, pages = {468--482}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11776420\_35}, doi = {10.1007/11776420\_35}, timestamp = {Fri, 08 Sep 2023 21:18:17 +0200}, biburl = {https://dblp.org/rec/conf/colt/GyorgyLO06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.