Остановите войну!
for scientists:
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 48 matches
- 2017
- Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann:
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. SPAA 2017: 321-323 - Richard Cole, Vijaya Ramachandran:
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. SPAA 2017: 351-362 - He Sun, Luca Zanetti:
Distributed Graph Clustering by Load Balancing. SPAA 2017: 163-171 - Umut A. Acar, Vitaly Aksenov, Sam Westrick:
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. SPAA 2017: 275-277 - Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput. SPAA 2017: 87-89 - Susanne Albers:
On Energy Conservation in Data Centers. SPAA 2017: 35-44 - William C. Anderton, Maxwell Young:
Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions. SPAA 2017: 183-194 - Sepehr Assadi, Sanjeev Khanna:
Randomized Composable Coresets for Matching and Vertex Cover. SPAA 2017: 3-12 - Rohit Atre, Ali Jannesari, Felix Wolf:
Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs. SPAA 2017: 363-365 - Yossi Azar, Danny Vainstein:
Tight Bounds for Clairvoyant Dynamic Bin Packing. SPAA 2017: 77-86 - MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. SPAA 2017: 13-23 - Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami:
Brief Announcement: Graph Matching in Massive Datasets. SPAA 2017: 133-136 - Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra:
Online Tree Caching. SPAA 2017: 329-338 - Antje Bjelde, Max Klimm, Daniel Schmand:
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. SPAA 2017: 227-229 - Guy E. Blelloch:
Some Sequential Algorithms are Almost Always Parallel. SPAA 2017: 141 - Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. SPAA 2017: 173-182 - Vincent Chau, Minming Li, Samuel McCauley, Kai Wang:
Minimizing Total Weighted Flow Time with Calibrations. SPAA 2017: 67-76 - Rezaul Chowdhury, Pramod Ganapathi, Yuan Tang, Jesmin Jahan Tithi:
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms. SPAA 2017: 339-350 - Colin Cooper, Tomasz Radzik, Nicolas Rivera:
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA 2017: 305-312 - Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. SPAA 2017: 293-304 - Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. SPAA 2017: 207-215 - Stefan Dobrev, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. SPAA 2017: 265-274 - Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Distributed Submodular Maximization in a Few Rounds. SPAA 2017: 25-33 - David Eppstein, Michael T. Goodrich:
Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. SPAA 2017: 137-139 - Björn Feldkord, Friedhelm Meyer auf der Heide:
The Mobile Server Problem. SPAA 2017: 313-319 - Pierre Fraigniaud, Dennis Olivetti:
Distributed Detection of Cycles. SPAA 2017: 153-162 - Ellis Giles, Kshitij A. Doshi, Peter J. Varman:
Brief Announcement: Hardware Transactional Storage Class Memory. SPAA 2017: 375-378 - Sudipto Guha, Yi Li, Qin Zhang:
Distributed Partial Clustering. SPAA 2017: 143-152 - Piotr Indyk:
Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems. SPAA 2017: 1 - Riko Jacob, Nodari Sitchinava:
Lower Bounds in the Asymmetric External Memory Model. SPAA 2017: 247-254
skipping 18 more matches
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-06-06 06:26 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