Alexander Hall

According to our database, Alexander Hall authored at least 29 papers between 2002 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Cuckoo Index: A Lightweight Secondary Index Structure.

Andreas Kipf, Damian Chromejko, Alexander Hall, Peter Boncz, David G. Andersen

Proc. VLDB Endow., 2020

2013

HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm.

Stefan Heule, Marc Nunkesser, Alexander Hall

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Processing a Trillion Cells per Mouse Click.

Alexander Hall, Olaf Bachmann, Robert Büssow, Silviu Ganceanu, Marc Nunkesser

Proc. VLDB Endow., 2012

2010

Length-bounded cuts and flows.

Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella

ACM Trans. Algorithms, 2010

2009

Energy efficient application mapping to NoC processing elements operating at multiple voltage levels.

Pavel Ghosh, Arunabha Sen, Alexander Hall

Proceedings of the Third International Symposium on Networks-on-Chips, 2009

2008

Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.

Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall

Theory Comput., 2008

The Maximum Energy-Constrained Dynamic Flow Problem.

Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller

Proceedings of the Algorithm Theory, 2008

How to Guard a Graph?.

Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Scheduling and flow-related problems in networks: algorithms and complexity.

Alexander Hall

PhD thesis, 2007

Computing the types of the relationships between autonomous systems.

Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank

IEEE/ACM Trans. Netw., 2007

Cuts and Disjoint Paths in the Valley-Free Model.

Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic

Internet Math., 2007

Incentive-Compatible Interdomain Routing with Linear Utilities.

Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Single source multiroute flows and cuts on uniform capacity networks.

Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A Combinatorial Approach to Multi-Domain Sketch Recognition.

Alexander Hall, C. Pomm, Peter Widmayer

Proceedings of the 4th Eurographics Workshop on Sketch-Based Interfaces and Modeling, 2007

Approximate Discovery of Random Graphs.

Thomas Erlebach, Alexander Hall, Matús Mihalák

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Sequential Vector Packing.

Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser

Proceedings of the Combinatorics, 2007

2006

Length-Bounded Cuts and Flows.

Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Robustness of the Internet at the Topology and Routing Level.

Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic

Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

Network Discovery and Verification with Distance Queries.

Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Network Discovery and Verification.

Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Approximating the Distortion.

Alexander Hall, Christos H. Papadimitriou

Proceedings of the Approximation, 2005

Flows over Time: Towards a More Realistic and Computationally Tractable Model.

Alexander Hall, Heiko Schilling

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing.

Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Call control with <i>k</i> rejections.

R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos

J. Comput. Syst. Sci., 2003

Comparing Push- and Pull-Based Broadcasting.

Alexander Hall, Hanjo Täubig

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.

Alexander Hall, Katharina Langkau, Martin Skutella

Proceedings of the Approximation, 2003

Multicommodity Flows over Time: Efficient Algorithms and Complexity.

Alexander Hall, Steffen Hippler, Martin Skutella

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Call Control with k Rejections.

R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos

Proceedings of the Algorithm Theory, 2002

NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow.

Thomas Erlebach, Alexander Hall

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002