The following pages link to Andras Farago (Q924145):
Displayed 25 items.
- On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity (Q924146) (← links)
- Efficient blocking probability computation of complex traffic flows for network dimensioning (Q925826) (← links)
- (Q943000) (redirect page) (← links)
- A general tractable density concept for graphs (Q943001) (← links)
- On dual power assignment optimization for biconnectivity (Q965816) (← links)
- Inverse optimization in high-speed networks (Q1399112) (← links)
- Utilizing network structure to accelerate Markov chain Monte Carlo algorithms (Q1736821) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- A new algorithm design technique for hard problems (Q2173301) (← links)
- On the fundamental limits of topology control in ad hoc networks (Q2471707) (← links)
- On the typical case complexity of graph optimization (Q2581548) (← links)
- Low Distortion Metric Embedding into Constant Dimension (Q3010393) (← links)
- (Q3137184) (← links)
- (Q3468423) (← links)
- On the Convergence Rate of Quasi Lumpable Markov Chains (Q3613675) (← links)
- (Q4016319) (← links)
- Strong universal consistency of neural network classifiers (Q4307316) (← links)
- (Q4735211) (← links)
- The Impact of Edge Correlations in Random Networks (Q5068857) (← links)
- (Q5414579) (← links)
- Brief announcement (Q5891984) (← links)
- A new algorithm design technique for hard problems, building on methods of complexity theory (Q6073051) (← links)
- The Amazing Power of Randomness: NP=RP (Q6346343) (← links)
- On Non-Markovian Performance Models (Q6355961) (← links)
- de Finetti Style Theorems With Applications to Network Analysis (Q6375122) (← links)