


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.
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 14 matches
- 2020
- Makis Arsenis, Robert Kleinberg:
Online Flow Computation on Unit-Vertex-Capacitated Networks. APOCS 2020: 120-132 - Leonid Barenboim, Gal Oren:
Fast Distributed Backup Placement in Sparse and Dense Networks. APOCS 2020: 90-104 - Ran Ben Basat, Maayan Goldstein, Itai Segall:
Learning Software Constraints via Installation Attempts. APOCS 2020: 60-74 - Nathan Beckmann, Phillip B. Gibbons, Bernhard Haeupler
, Charles McGuffey:
Writeback-Aware Caching. APOCS 2020: 1-15 - Guy E. Blelloch, Yan Gu:
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. APOCS 2020: 105-119 - Tim Kaler, William Kuszmaul, Tao B. Schardl, Daniele Vettorel:
Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. APOCS 2020: 162-176 - Robert Kelly, Barak A. Pearlmutter, Phil Maguire:
Lock-Free Hopscotch Hashing. APOCS 2020: 45-59 - Zaoxing Liu, Samson Zhou, Ori Rottenstreich, Vladimir Braverman, Jennifer Rexford:
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms. APOCS 2020: 31-44 - Gahyun Park, Minseok Kwon, Ramprasad Tamilselvan, Seungjoon Lee:
Two-Way Trees: A Distributed Algorithm for Efficient Replica Search and Placement. APOCS 2020: 133-146 - Jessica Shi
, Julian Shun:
Parallel Algorithms for Butterfly Computations. APOCS 2020: 16-30 - Kyle Singer
, Kunal Agrawal, I-Ting Angelina Lee:
Scheduling I/O Latency-Hiding Futures in Task-Parallel Platforms. APOCS 2020: 147-161 - Tal Wagner:
Eccentricity Heuristics through Sublinear Analysis Lenses. APOCS 2020: 75-89 - Front Matter. APOCS 2020: 1-2
- Bruce M. Maggs:
1st Symposium on Algorithmic Principles of Computer Systems, APOCS 2020, Salt Lake City, UT, USA, January 8, 2020. SIAM 2020, ISBN 978-1-61197-602-1 [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.
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.
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.
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 2025-07-23 01:06 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
