| 2008 |
|---|
| 31 | EE | András Faragó:
Algorithmic Challenges in Learning Path Metrics from Observed Choices.
Applied Artificial Intelligence 22(7&8): 749-760 (2008) |
| 30 | EE | András Faragó:
Efficient blocking probability computation of complex traffic flows for network dimensioning.
Computers & OR 35(12): 3834-3847 (2008) |
| 29 | EE | András Faragó:
A General Tractable Density Concept for Graphs.
Mathematics in Computer Science 1(4): 689-699 (2008) |
| 2007 |
|---|
| 28 | EE | András Faragó:
On the Fundamental Limits of Topology Control in Ad Hoc Networks.
Algorithmica 49(4): 337-356 (2007) |
| 2006 |
|---|
| 27 | EE | András Faragó:
On the Convergence Rate of Quasi Lumpable Markov Chains.
EPEW 2006: 138-147 |
| 2005 |
|---|
| 26 | | András Faragó:
New analytical results on ad hoc network connectivity.
Communications and Computer Networks 2005: 126-131 |
| 25 | EE | András Faragó:
On the typical case complexity of graph optimization.
Discrete Applied Mathematics 153(1-3): 73-88 (2005) |
| 2004 |
|---|
| 24 | EE | András Faragó:
On the fundamental limits of topology control.
DIALM-POMC 2004: 1-7 |
| 2003 |
|---|
| 23 | | András Faragó:
A Mathematical Method for Analyzing the Effect of Different Protocol Layers on Routing in Ad Hoc Networks.
International Conference on Wireless Networks 2003: 626-631 |
| 22 | EE | András Faragó,
Áron Szentesi,
Balázs Szviatovszki:
Inverse Optimization in High-speed Networks.
Discrete Applied Mathematics 129(1): 83-98 (2003) |
| 21 | EE | András Faragó,
Violet R. Syrotiuk:
MERIT: A Scalable Approach for Protocol Assessment.
MONET 8(5): 567-577 (2003) |
| 2002 |
|---|
| 20 | EE | András Faragó:
Scalable analysis and design of ad hoc networks via random graph theory.
DIAL-M 2002: 43-50 |
| 19 | EE | András Faragó:
Network Level Capacity Planning with Efficiently Computable Global Optimum.
MASCOTS 2002: 229-236 |
| 2001 |
|---|
| 18 | | András Faragó,
Violet R. Syrotiuk:
Algorithmic Problems in Power-Controlled Ad Hoc Networks.
ISCA PDCS 2001: 177-182 |
| 17 | EE | András Faragó,
Violet R. Syrotiuk:
Merit: A unified framework for routing protocol assessment in mobile Ad Hoc networks.
MOBICOM 2001: 53-60 |
| 2000 |
|---|
| 16 | | András Faragó:
Blocking Probability Estimation for General Under Incomplete Information.
ICC (3) 2000: 1547-1551 |
| 1999 |
|---|
| 15 | | András Faragó,
Imrich Chlamtac,
Stefano Basagni:
Virtual Path Network Topology Optimization Using Random Graphs.
INFOCOM 1999: 491-496 |
| 14 | EE | Imrich Chlamtac,
András Faragó:
A new approach to the design and analysis of peer-to-peer mobile networks.
Wireless Networks 5(3): 149-156 (1999) |
| 1998 |
|---|
| 13 | EE | Imrich Chlamtac,
Hongbiao Zhang,
András Faragó,
Andrea Fumagalli:
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks.
IEEE/ACM Trans. Netw. 6(4): 422-431 (1998) |
| 1997 |
|---|
| 12 | | Paramvir Bahl,
Imrich Chlamtac,
András Faragó:
Optimizing Resource Utilization in Wireless Multimedia Networks.
ICC (3) 1997: 1432-1437 |
| 11 | | András Faragó,
József Bíró,
Tamás Henk,
Miklós Boda:
Analog Neural Optimization for ATM Resource Management.
IEEE Journal on Selected Areas in Communications 15(2): 156-164 (1997) |
| 10 | EE | Imrich Chlamtac,
András Faragó,
Hongbiao Zhang:
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks.
IEEE/ACM Trans. Netw. 5(6): 804-812 (1997) |
| 1996 |
|---|
| 9 | | Imrich Chlamtac,
András Faragó,
Tao Zhang:
Lightpath (Wavelength) Routing in Large WDM Networks.
IEEE Journal on Selected Areas in Communications 14(5): 909-913 (1996) |
| 1995 |
|---|
| 8 | | András Faragó,
Søren Blaabjerg,
W. Holender,
B. Stavenow,
Tamás Henk,
László Ast,
Sándor Székely:
Enhancing ATM Network Performance by Optimizing the Virtual Network Configuration.
Data Communications and their Performance 1995: 401-414 |
| 7 | | András Faragó,
Søren Blaabjerg,
László Ast,
Géza Gordos,
Tamás Henk:
A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration.
IEEE Journal on Selected Areas in Communications 13(7): 1199-1206 (1995) |
| 6 | | András Faragó:
On the complexity of finding sparsest and densest parts in wireless networks.
Wireless Networks 1(2): 221-226 (1995) |
| 1994 |
|---|
| 5 | | Imrich Chlamtac,
András Faragó:
An Optimal Channel Access Protocol with Multiple Reception Capacity.
IEEE Trans. Computers 43(4): 480-484 (1994) |
| 4 | EE | Imrich Chlamtac,
András Faragó:
Making transmission schedules immune to topology changes in multi-hop packet radio networks.
IEEE/ACM Trans. Netw. 2(1): 23-29 (1994) |
| 3 | EE | Imrich Chlamtac,
András Faragó,
Tao Zhang:
Optimizing the system of virtual paths.
IEEE/ACM Trans. Netw. 2(6): 581-587 (1994) |
| 1993 |
|---|
| 2 | EE | András Faragó,
Tamás Linder,
Gábor Lugosi:
Fast Nearest-Neighbor Search in Dissimilarity Spaces.
IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 957-962 (1993) |
| 1 | | András Faragó,
Gábor Lugosi:
Strong universal consistency of neural network classifiers.
IEEE Transactions on Information Theory 39(4): 1146-1151 (1993) |
