Остановите войну!
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 50 matches
- 2018
- Marco Bressan, Enoch Peserico, Luca Pretto:
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. SPAA 2018: 87-89 - Kunal Agrawal, Seth Gilbert, Wei Quan Lim:
Parallel Working-Set Search Structures. SPAA 2018: 321-332 - Susanne Albers, Jens Quedenfeld:
Optimal Algorithms for Right-Sizing Data Centers. SPAA 2018: 363-372 - Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. SPAA 2018: 133-142 - Dan Alistarh, Syed Kamran Haider, Raphael Kübler, Giorgi Nadiradze:
The Transactional Conflict Problem. SPAA 2018: 383-392 - Noga Alon, Yossi Azar, Mark Berlin:
The Price of Bounded Preemption. SPAA 2018: 301-310 - Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Distributed Domination on Graph Classes of Bounded Expansion. SPAA 2018: 143-151 - Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. SPAA 2018: 13-22 - David A. Bader:
Massive-scale Streaming Analytics: Models, Parallelism, & Real-world Applications. SPAA 2018: 193 - Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight:
A 3D Parallel Algorithm for QR Decomposition. SPAA 2018: 55-65 - Leonid Barenboim, Yaniv Tzur:
Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. SPAA 2018: 223-226 - Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. SPAA 2018: 235-246 - Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Parallel Persistent Memory Model. SPAA 2018: 247-258 - Ink Chinavinijkul, Jacob Newcomb, Lingzhi Xi, David P. Bunde:
Brief Announcement: Coloring-based Task Mapping for Dragonfly Systems. SPAA 2018: 91-93 - Nachshon Cohen, Rachid Guerraoui, Igor Zablotchi:
The Inherent Cost of Remembering Consistently. SPAA 2018: 259-269 - Simon Collet, Amos Korman:
Intense Competition can Drive Selfish Explorers to Optimize Coverage. SPAA 2018: 183-192 - Andreia Correia, Pascal Felber, Pedro Ramalhete:
Romulus: Efficient Algorithms for Persistent Transactional Memory. SPAA 2018: 271-282 - Erik D. Demaine, Quanquan C. Liu:
Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers. SPAA 2018: 195-204 - Nikhil R. Devanur, Janardhan Kulkarni:
A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems. SPAA 2018: 283-290 - Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. SPAA 2018: 393-404 - Guy Even, Moti Medina, Dror Rawitz:
Online Generalized Caching with Varying Weights and Costs. SPAA 2018: 205-212 - Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars:
An Efficient Wait-free Resizable Hash Table. SPAA 2018: 111-120 - Björn Feldkord, Friedhelm Meyer auf der Heide:
Online Facility Location with Mobile Facilities. SPAA 2018: 373-381 - Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman:
Possibilities and Impossibilities for Distributed Subgraph Detection. SPAA 2018: 153-162 - Barbara Geissmann, Lukas Gianinazzi:
Parallel Minimum Cuts in Near-linear Work and Low Depth. SPAA 2018: 1-11 - Amir Gholami, Ariful Azad, Peter H. Jin, Kurt Keutzer, Aydin Buluç:
Integrated Model, Batch, and Domain Parallelism in Training Neural Networks. SPAA 2018: 77-86 - Ellis Giles, Kshitij A. Doshi, Peter J. Varman:
Brief Announcement: Hardware Transactional Persistent Memory. SPAA 2018: 227-230 - Predrag Gruevski, William Hasenplaugh, David Lugato, James Thomas:
Laika: Efficient In-Place Scheduling for 3D Mesh Graph Computations. SPAA 2018: 415-426 - Nicholas J. A. Harvey, Christopher Liaw, Paul Liu:
Greedy and Local Ratio Algorithms in the MapReduce Model. SPAA 2018: 43-52 - Friedhelm Meyer auf der Heide, Johannes Schaefer:
Brief Announcement: Communication in Systems of Home Based Mobile Agents. SPAA 2018: 359-361
skipping 20 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-04-19 15:20 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