2008 |
13 | EE | András György,
Gábor Lugosi,
György Ottucsák:
On-line Sequential Bin Packing.
COLT 2008: 447-454 |
12 | EE | 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 |
11 | EE | András György,
Levente Kocsis,
Ivett Szabó,
Csaba Szepesvári:
Continuous Time Associative Bandit Problems.
IJCAI 2007: 830-835 |
10 | EE | 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) |
2006 |
9 | EE | András György,
Tamás Linder,
György Ottucsák:
The Shortest Path Problem Under Partial Monitoring.
COLT 2006: 468-482 |
8 | EE | András György,
György Ottucsák:
Adaptive Routing Using Expert Advice.
Comput. J. 49(2): 180-189 (2006) |
2005 |
7 | EE | András György,
Tamás Linder,
Gábor Lugosi:
Tracking the Best of Many Experts.
COLT 2005: 204-216 |
2004 |
6 | EE | 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 |
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) |