András György

	2012
28		Gergely Neu, András György, Csaba Szepesvári: The adversarial stochastic shortest path problem with unknown transition probabilities. Journal of Machine Learning Research - Proceedings Track 22: 805-813 (2012)
	2011
27		Béla Hullár, Sándor Laki, András György: Early Identification of Peer-to-Peer Traffic. ICC 2011: 1-6
26		András György, Gergely Neu: Near-optimal rates for limited-delay universal lossy source coding. ISIT 2011: 2218-2222
25		András György, Tamás Linder, Gábor Lugosi: Efficient Tracking of Large Classes of Experts CoRR abs/1110.2755: (2011)
24		András György, Levente Kocsis: Efficient Multi-Start Strategies for Local Search Algorithms. J. Artif. Intell. Res. (JAIR) 41: 407-444 (2011)
23		András György, Levente Kovács, Péter Szalay, Dániel A. Drexler, Balázs Benyó, Zoltán Benyó: Quasi-Model-Based Control of Type 1 Diabetes Mellitus. J. Electrical and Computer Engineering 2011: (2011)
	2010
22		Gergely Neu, András György, Csaba Szepesvári: The Online Loop-free Stochastic Shortest-Path Problem. COLT 2010: 231-243
21		Gergely Neu, András György, Csaba Szepesvári, András Antos: Online Markov Decision Processes under Bandit Feedback. NIPS 2010: 1804-1812
20		András György, Gábor Lugosi, György Ottucsák: On-Line Sequential Bin Packing. Journal of Machine Learning Research 11: 89-109 (2010)
19		Péter Torma, András György, Csaba Szepesvári: A Markov-Chain Monte Carlo Approach to Simultaneous Localization and Mapping. Journal of Machine Learning Research - Proceedings Track 9: 852-859 (2010)
	2009
18		Levente Kocsis, András György: Efficient Multi-start Strategies for Local Search Algorithms. ECML/PKDD (1) 2009: 705-720
17		Levente Kovács, András György, Balázs Benyó, Zoltán Benyó, Adalbert Kovacs: Soft computing control of Type 1 diabetes described at molecular levels. SACI 2009: 99-104
	2008
16		András György, Gábor Lugosi, György Ottucsák: On-line Sequential Bin Packing. COLT 2008: 447-454
15		András György, Tamás Linder, Gábor Lugosi: Tracking the Best Quantizer. IEEE Transactions on Information Theory 54(4): 1604-1625 (2008)
	2007
14		András György, Levente Kocsis, Ivett Szabó, Csaba Szepesvári: Continuous Time Associative Bandit Problems. IJCAI 2007: 830-835
13		András György, Tamás Linder, Gábor Lugosi, György Ottucsák: The on-line shortest path problem under partial monitoring CoRR abs/0704.1020: (2007)
12		András György, Tamás Linder, Gábor Lugosi, György Ottucsák: The On-Line Shortest Path Problem Under Partial Monitoring. Journal of Machine Learning Research 8: 2369-2403 (2007)
	2006
11		András György, Tamás Linder, György Ottucsák: The Shortest Path Problem Under Partial Monitoring. COLT 2006: 468-482
10		András György, György Ottucsák: Adaptive Routing Using Expert Advice. Comput. J. 49(2): 180-189 (2006)
	2005
9		András György, Tamás Linder, Gábor Lugosi: Tracking the Best of Many Experts. COLT 2005: 204-216
8		András Antos, László Györfi, András György: Individual convergence rates in empirical vector quantizer design. IEEE Transactions on Information Theory 51(11): 4013-4022 (2005)
	2004
7		András György, Tamás Linder, Gábor Lugosi: A "Follow the Perturbed Leader"-type Algorithm for Zero-Delay Quantization of Individual Sequence. Data Compression Conference 2004: 342-351
6		András György, Tamás Linder, Gábor Lugosi: Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding. IEEE Transactions on Signal Processing 52(8): 2337-2347 (2004)
	2003
5		András György, Tamás Linder, Philip A. Chou, Bradley J. Betts: Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? IEEE Transactions on Information Theory 49(11): 3031-3037 (2003)
4		András György, Tamás Linder: Codecell convexity in optimal entropy-constrained vector quantization. IEEE Transactions on Information Theory 49(7): 1821-1828 (2003)
	2002
3		András György, Tamás Linder: On the structure of optimal entropy-constrained scalar quantizers. IEEE Transactions on Information Theory 48(2): 416-427 (2002)
	2000
2		András György, Tamás Linder: Optimal entropy-constrained scalar quantization of a uniform source. IEEE Transactions on Information Theory 46(7): 2704-2711 (2000)
	1999
1		András György, Tamás Linder, Kenneth Zeger: On the rate-distortion function of random vectors and stationary sources with mixed distributions. IEEE Transactions on Information Theory 45(6): 2110-2115 (1999)

Coauthor Index

1	András Antos	[8] [21]
2	Balázs Benyó	[17] [23]
3	Zoltán Benyó	[17] [23]
4	Bradley J. Betts	[5]
5	Philip A. Chou	[5]
6	Dániel A. Drexler	[23]
7	László Györfi	[8]
8	Béla Hullár	[27]
9	Levente Kocsis	[14] [18] [24]
10	Adalbert Kovacs	[17]
11	Levente Kovács	[17] [23]
12	Sándor Laki	[27]
13	Tamás Linder	[1] [2] [3] [4] [5] [6] [7] [9] [11] [12] [13] [15] [25]
14	Gábor Lugosi	[6] [7] [9] [12] [13] [15] [16] [20] [25]
15	Gergely Neu	[21] [22] [26] [28]
16	György Ottucsák	[10] [11] [12] [13] [16] [20]
17	Ivett Szabó	[14]
18	Péter Szalay	[23]
19	Csaba Szepesvári	[14] [19] [21] [22] [28]
20	Péter Torma	[19]
21	Kenneth Zeger	[1]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page