default search action
Alexander Hall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j14]Andreas Kipf, Damian Chromejko, Alexander Hall, Peter A. Boncz, David G. Andersen:
Cuckoo Index: A Lightweight Secondary Index Structure. Proc. VLDB Endow. 13(13): 3559-3572 (2020)
2010 – 2019
- 2013
- [c21]Stefan Heule, Marc Nunkesser, Alexander Hall:
HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm. EDBT 2013: 683-692 - 2012
- [j13]Alexander Hall, Olaf Bachmann, Robert Büssow, Silviu Ganceanu, Marc Nunkesser:
Processing a Trillion Cells per Mouse Click. Proc. VLDB Endow. 5(11): 1436-1446 (2012) - [i2]Alexander Hall, Olaf Bachmann, Robert Büssow, Silviu Ganceanu, Marc Nunkesser:
Processing a Trillion Cells per Mouse Click. CoRR abs/1208.0225 (2012) - 2011
- [j12]Fedor V. Fomin
, Petr A. Golovach
How to Guard a Graph? Algorithmica 61(4): 839-856 (2011) - 2010
- [j11]Georg Baier, Thomas Erlebach
Length-bounded cuts and flows. ACM Trans. Algorithms 7(1): 4:1-4:27 (2010)
2000 – 2009
- 2009
- [c20]Pavel Ghosh, Arunabha Sen, Alexander Hall:
Energy efficient application mapping to NoC processing elements operating at multiple voltage levels. NOCS 2009: 80-85 - 2008
- [j10]Alexander Hall, Evdokia Nikolova
Incentive-Compatible Interdomain Routing with Linear Utilities. Internet Math. 5(4): 395-410 (2008) - [j9]Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser:
Sequential vector packing. Theor. Comput. Sci. 409(3): 351-363 (2008) - [j8]Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall:
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Theory Comput. 4(1): 1-20 (2008) - [c19]Fedor V. Fomin
How to Guard a Graph?. ISAAC 2008: 318-329 - [c18]Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller:
The Maximum Energy-Constrained Dynamic Flow Problem. SWAT 2008: 114-126 - 2007
- [b1]Alexander Hall:
Scheduling and flow-related problems in networks: algorithms and complexity. ETH Zurich, 2007, ISBN 978-3-8364-1701-3, pp. 1-143 - [j7]Alexander Hall, Katharina Langkau, Martin Skutella:
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica 47(3): 299-321 (2007) - [j6]Thomas Erlebach
Cuts and Disjoint Paths in the Valley-Free Model. Internet Math. 3(3): 333-359 (2007) - [j5]Alexander Hall, Steffen Hippler, Martin Skutella:
Multicommodity flows over time: Efficient algorithms and complexity. Theor. Comput. Sci. 379(3): 387-404 (2007) - [j4]Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank:
Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2): 267-280 (2007) - [c17]Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser:
Sequential Vector Packing. ESCAPE 2007: 12-23 - [c16]Thomas Erlebach, Alexander Hall, Matús Mihalák:
Approximate Discovery of Random Graphs. SAGA 2007: 82-92 - [c15]Alexander Hall, C. Pomm, Peter Widmayer:
A Combinatorial Approach to Multi-Domain Sketch Recognition. SBIM 2007: 7-14 - [c14]Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman:
Single source multiroute flows and cuts on uniform capacity networks. SODA 2007: 855-863 - [c13]Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou:
Incentive-Compatible Interdomain Routing with Linear Utilities. WINE 2007: 232-244 - 2006
- [j3]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach
Network Discovery and Verification. IEEE J. Sel. Areas Commun. 24(12): 2168-2181 (2006) - [c12]Thomas Erlebach
Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80 - [c11]Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic:
Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program 2006: 260-274 - [c10]Georg Baier, Thomas Erlebach
Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690 - 2005
- [c9]Alexander Hall, Heiko Schilling:
Flows over Time: Towards a More Realistic and Computationally Tractable Model. ALENEX/ANALCO 2005: 55-67 - [c8]Alexander Hall, Christos H. Papadimitriou:
Approximating the Distortion. APPROX-RANDOM 2005: 111-122 - [c7]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach
Network Discovery and Verification. WG 2005: 127-138 - [i1]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j2]Thomas Erlebach
NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. J. Sched. 7(3): 223-241 (2004) - [c6]Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. CAAN 2004: 49-62 - 2003
- [j1]R. Sai Anand, Thomas Erlebach
Call control with k rejections. J. Comput. Syst. Sci. 67(4): 707-722 (2003) - [c5]Alexander Hall, Steffen Hippler, Martin Skutella:
Multicommodity Flows over Time: Efficient Algorithms and Complexity. ICALP 2003: 397-409 - [c4]Alexander Hall, Katharina Langkau, Martin Skutella:
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. RANDOM-APPROX 2003: 71-82 - [c3]Alexander Hall, Hanjo Täubig:
Comparing Push- and Pull-Based Broadcasting. WEA 2003: 148-164 - 2002
- [c2]Thomas Erlebach, Alexander Hall:
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. SODA 2002: 194-202 - [c1]R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos:
Call Control with k Rejections. SWAT 2002: 308-317
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: