default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 18 matches
- 2019
- Yihan Sun, Guy E. Blelloch:
Parallel Range, Segment and Rectangle Queries with Augmented Maps. ALENEX 2019: 159-173 - Martin Aumüller, Nikolaj Hass:
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. ALENEX 2019: 15-26 - Johannes Fischer, Florian Kurpicz:
Lightweight Distributed Suffix Array Construction. ALENEX 2019: 27-38 - Romain Azaïs, Jean-Baptiste Durand, Christophe Godin:
Approximation of trees by self-nested trees. ALENEX 2019: 39-53 - Florian Barth, Stefan Funke, Sabine Storandt:
Alternative Multicriteria Routes. ALENEX 2019: 66-80 - Moritz Beck, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu:
Concatenated k-Path Covers. ALENEX 2019: 81-91 - Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck:
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX 2019: 130-143 - Thom Castermans, Bettina Speckmann, Kevin Verbeek:
A Practical Algorithm for Spatial Agglomerative Clustering. ALENEX 2019: 174-185 - Daniel Delling, Julian Dibbelt, Thomas Pajor:
Fast and Exact Public Transit Routing with Restricted Pareto Sets. ALENEX 2019: 54-65 - Stefan Edelkamp, Armin Weiß:
Worst-Case Efficient Sorting with QuickMergesort. ALENEX 2019: 1-14 - Sándor P. Fekete, Dominik Krupke:
Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. ALENEX 2019: 186-198 - Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. ALENEX 2019: 117-129 - Adalat Jabrayilov, Petra Mutzel:
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. ALENEX 2019: 107-116 - Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. ALENEX 2019: 144-158 - Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash:
Scalable Edge Partitioning. ALENEX 2019: 211-225 - Sebastian Schlag, Matthias Schmitt, Christian Schulz:
Faster Support Vector Machines. ALENEX 2019: 199-210 - Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. ALENEX 2019: 92-106 - Stephen G. Kobourov, Henning Meyerhenke:
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. SIAM 2019 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-06 01:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint