András Faragó

Publication Activity (10 Years)

Years Active: 1993-2021
Publications (10 Years): 16

Top Topics

Markov Chain Monte Carlo

Convergence Rate

Complexity Theory

Top Venues

Publications

András Faragó
A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results - A Survey. Algorithms 14 (12) (2021)
András Faragó
The Impact of Edge Correlations in Random Networks. Complex Syst. 30 (4) (2021)
Zohre R. Mojaveri, András Faragó
Routing for Global Congestion Avoidance. CoRR (2021)
András Faragó, Zohre R. Mojaveri
Safe Approximation - An Efficient Solution for a Hard Routing Problem. Algorithms 14 (2) (2021)
András Faragó
Decomposition of Random Sequences into Mixtures of Simpler Ones and Its Application in Network Analysis. Algorithms 14 (11) (2021)
András Faragó
Optimization of Virtual Networks. CoRR (2020)
András Faragó, Rupei Xu
A new algorithm design technique for hard problems. Theor. Comput. Sci. 821 (2020)
András Faragó
The Amazing Power of Randomness: NP=RP. CoRR (2020)
András Faragó, Zohre R. Mojaveri
In Search of the Densest Subgraph. Algorithms 12 (8) (2019)
Rupei Xu, András Faragó, Jason P. Jue
Job Edge-Fog Interconnection Network Creation Game in Internet of Things. CoRR (2019)
Rupei Xu, András Faragó
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem. CoRR (2019)
András Faragó, Rupei Xu
Connectivity and Structure in Large Networks. CoRR (2018)
Rupei Xu, András Faragó
A Simple Approximation for a Hard Routing Problem. CoRR (2018)
Ahmad Askarian, Rupei Xu, András Faragó
Utilizing Network Structure to Bound the Convergence Rate in Markov Chain Monte Carlo Algorithms. CoRR (2018)
András Faragó
A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory. AAIM (2018)
Ahmad Askarian, Rupei Xu, András Faragó
Utilizing Network Structure to Accelerate Markov Chain Monte Carlo Algorithms. Algorithms 9 (3) (2016)
András Faragó
Brief announcement: an obstacle to scalability in wireless networks. PODC (2012)
András Faragó
Network analysis under perturbations. FOMC (2012)
Zhiming Chen, András Faragó, Kang Zhang
Exploring Structural Properties of Web Graphs through 3D Visualization. ICEIS (2) (2012)
András Faragó
Asymptotically optimal trade-off between local and global connectivity in wireless networks. Perform. Evaluation 68 (2) (2011)
András Faragó, Stefano Basagni
Connecting Two Worlds: Physical Models and Graph Models of Wireless Network Topologies. HPCC (2011)
András Faragó
Low Distortion Metric Embedding into Constant Dimension. TAMC (2011)
András Faragó, Dung T. Tran
A Self-Tuning Protocol for Optimal Bandwidth Allocation in Wireless Networks. SASO (2010)
András Faragó
On the Structure of Classes of Random Graphs. Chic. J. Theor. Comput. Sci. 2010 (2010)
András Faragó
Local vs. Global Scalability in Ad Hoc and Sensor Networks. Infoscale (2009)
András Faragó
Efficient blocking probability computation of complex traffic flows for network dimensioning. Comput. Oper. Res. 35 (12) (2008)
András Faragó
Algorithmic Challenges in Learning Path Metrics from Observed Choices. Appl. Artif. Intell. 22 (7&8) (2008)
András Faragó
A General Tractable Density Concept for Graphs. Math. Comput. Sci. 1 (4) (2008)
András Faragó
On the Descriptional Complexity of Path Optimization in Graphs. DCFS (2008)
András Faragó
On the Fundamental Limits of Topology Control in Ad Hoc Networks. Algorithmica 49 (4) (2007)
András Faragó
On the Convergence Rate of Quasi Lumpable Markov Chains. EPEW (2006)
Natarajan Meghanathan, András Faragó
On the route refresh frequency for on-demand battery life routing in ad hoc networks. WiMob (3) (2005)
Natarajan Meghanathan, András Faragó
An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks. WiMob (3) (2005)
András Faragó
New analytical results on ad hoc network connectivity. Communications and Computer Networks (2005)
András Faragó
On the typical case complexity of graph optimization. Discret. Appl. Math. 153 (1-3) (2005)
András Faragó
On the fundamental limits of topology control. DIALM-POMC (2004)
András Faragó
Availability estimation of routes, trees and subnetworks for end-to-end QoS. GLOBECOM (2004)
András Faragó, Áron Szentesi, Balázs Szviatovszki
Inverse Optimization in High-speed Networks. Discret. Appl. Math. 129 (1) (2003)
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)
András Faragó, Violet R. Syrotiuk
MERIT: A Scalable Approach for Protocol Assessment. Mob. Networks Appl. 8 (5) (2003)
András Faragó, Ferenc Unghváry, Andrea Fumagalli
On incorporating dependent link failures in a traffic engineering model. ICC (2003)
Andrea Fumagalli, Marco Tacca, Ferenc Unghváry, András Faragó
Shared path protection with differentiated reliability. ICC (2002)
András Faragó
Network Level Capacity Planning with Efficiently Computable Global Optimum. MASCOTS (2002)
András Faragó
Scalable analysis and design of ad hoc networks via random graph theory. DIAL-M (2002)
András Faragó, Violet R. Syrotiuk
Merit: A unified framework for routing protocol assessment in mobile Ad Hoc networks. MobiCom (2001)
András Faragó, Violet R. Syrotiuk
Algorithmic Problems in Power-Controlled Ad Hoc Networks. PDCS (2001)
András Faragó, Andrew D. Myers, Violet R. Syrotiuk, Gergely V. Záruba
A new approach to MAC protocol optimization. GLOBECOM (2000)
András Faragó
Blocking Probability Estimation for General Under Incomplete Information. ICC (3) (2000)
Imrich Chlamtac, András Faragó
A new approach to the design and analysis of peer-to-peer mobile networks. Wirel. Networks 5 (3) (1999)
Hongbiao Zhang, Imrich Chlamtac, András Faragó
Efficient load balancing for UBR traffic in ATM networks. ICC (1999)
András Faragó, Imrich Chlamtac, Stefano Basagni
Virtual Path Network Topology Optimization Using Random Graphs. INFOCOM (1999)
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) (1998)
Paramvir Bahl, Imrich Chlamtac, András Faragó
Resource assignment for integrated services in wireless ATM networks. Int. J. Commun. Syst. 11 (1) (1998)
Krzysztof Szarkowicz, Gábor Fodor, András Faragó, Tamás Henk
Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks. Simul. 68 (1) (1997)
András Faragó, József Bíró, Tamás Henk, Miklós Boda
Analog Neural Optimization for ATM Resource Management. IEEE J. Sel. Areas Commun. 15 (2) (1997)
Paramvir Bahl, Imrich Chlamtac, András Faragó
Optimizing Resource Utilization in Wireless Multimedia Networks. ICC (3) (1997)
Imrich Chlamtac, András Faragó, Hongbiao Zhang
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks. IEEE/ACM Trans. Netw. 5 (6) (1997)
Imrich Chlamtac, András Faragó, Tao Zhang
Lightpath (Wavelength) Routing in Large WDM Networks. IEEE J. Sel. Areas Commun. 14 (5) (1996)
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)
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 J. Sel. Areas Commun. 13 (7) (1995)
András Faragó
On the complexity of finding sparsest and densest parts in wireless networks. Wirel. Networks 1 (2) (1995)
Imrich Chlamtac, András Faragó
Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE/ACM Trans. Netw. 2 (1) (1994)
Imrich Chlamtac, András Faragó, Tao Zhang
Optimizing the system of virtual paths. IEEE/ACM Trans. Netw. 2 (6) (1994)
Imrich Chlamtac, András Faragó
An Optimal Channel Access Protocol with Multiple Reception Capacity. IEEE Trans. Computers 43 (4) (1994)
Imrich Chlamtac, András Faragó, Hye Yeon Ahn
A topology transparent link activation protocol for mobile CDMA radio networks. IEEE J. Sel. Areas Commun. 12 (8) (1994)
András Faragó, Tamás Linder, Gábor Lugosi
Fast Nearest-Neighbor Search in Dissimilarity Spaces. IEEE Trans. Pattern Anal. Mach. Intell. 15 (9) (1993)
András Faragó, Gábor Lugosi
Strong universal consistency of neural network classifiers. IEEE Trans. Inf. Theory 39 (4) (1993)