Network discovery and verification Z Beerliova, F Eberhard, T Erlebach, A Hall, M Hoffmann, M Mihal'ak, ... IEEE Journal on selected areas in communications 24 (12), 2168-2181, 2006 | 203 | 2006 |

HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm S Heule, M Nunkesser, A Hall Proceedings of the 16th International Conference on Extending Database …, 2013 | 189 | 2013 |

Computing the types of the relationships between autonomous systems G Di Battista, T Erlebach, A Hall, M Patrignani, M Pizzonia, T Schank IEEE/ACM Transactions on networking 15 (2), 267-280, 2007 | 100 | 2007 |

Processing a trillion cells per mouse click A Hall, O Bachmann, R Büssow, S Gănceanu, M Nunkesser arXiv preprint arXiv:1208.0225, 2012 | 91 | 2012 |

NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow T Erlebach, A Hall Journal of Scheduling 7 (3), 223-241, 2004 | 73 | 2004 |

Energy efficient application mapping to NoC processing elements operating at multiple voltage levels P Ghosh, A Sen, A Hall 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip, 80-85, 2009 | 67 | 2009 |

Classifying customer-provider relationships in the Internet T Erlebach, A Hall, T Schank TIK-Report 145, 2002 | 58 | 2002 |

Length-bounded cuts and flows G Baier, T Erlebach, A Hall, E Köhler, P Kolman, O Pangrác, H Schilling, ... ACM Transactions on Algorithms (TALG) 7 (1), 1-27, 2010 | 45 | 2010 |

Cuts and disjoint paths in the valley-free path model of Internet BGP routing T Erlebach, A Hall, A Panconesi, D Vukadinović Workshop on Combinatorial and Algorithmic Aspects of Networking, 49-62, 2004 | 40 | 2004 |

Length-bounded cuts and flows G Baier, T Erlebach, A Hall, E Köhler, H Schilling, M Skutella International Colloquium on Automata, Languages, and Programming, 679-690, 2006 | 36 | 2006 |

Network discovery and verification Z Beerliova, F Eberhard, T Erlebach, A Hall, M Hoffmann, M Mihaľák, ... International Workshop on Graph-Theoretic Concepts in Computer Science, 127-138, 2005 | 36 | 2005 |

Approximating the distortion A Hall, C Papadimitriou Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2005 | 26 | 2005 |

Comparing push-and pull-based broadcasting A Hall, H Täubig International Workshop on Experimental and Efficient Algorithms, 148-164, 2003 | 23 | 2003 |

How to guard a graph? FV Fomin, PA Golovach, A Hall, M Mihalák, E Vicari, P Widmayer International Symposium on Algorithms and Computation, 318-329, 2008 | 19 | 2008 |

A combinatorial approach to multi-domain sketch recognition A Hall, C Pomm, P Widmayer Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and …, 2007 | 15 | 2007 |

Call control with k rejections RS Anand, T Erlebach, A Hall, S Stefanakos Journal of Computer and System Sciences 67 (4), 707-722, 2003 | 13 | 2003 |

Network discovery and verification with distance queries T Erlebach, A Hall, M Hoffmann, M Mihaľák Italian Conference on Algorithms and Complexity, 69-80, 2006 | 12 | 2006 |

Single source multiroute flows and cuts on uniform capacity networks H Bruhn, J Černý, A Hall, P Kolman, J Sgall Theory of Computing 4 (1), 1-20, 2008 | 10 | 2008 |

Robustness of the Internet at the Topology and Routing Level T Erlebach, A Hall, L Moonen, A Panconesi, F Spieksma, D Vukadinović Dependable Systems: Software, Computing, Networks, 260-274, 2006 | 10 | 2006 |

Cuts and disjoint paths in the valley-free path model T Erlebach, A Hall, A Panconesi, D Vukadinović Internet Mathematics 3 (3), 333-359, 2006 | 10 | 2006 |