Остановите войну!
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 51 matches
- 2011
- Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu:
Parallelism in dynamic well-spaced point sets. SPAA 2011: 33-42 - Hrishikesh B. Acharya, Mohamed G. Gouda:
Brief announcement: RedRem: a parallel redundancy remover. SPAA 2011: 267-268 - Susanne Albers, Antonios Antoniadis, Gero Greiner:
On multi-processor speed scaling with migration: extended abstract. SPAA 2011: 279-288 - James Aspnes, Faith Ellen:
Tight bounds for anonymous adopt-commit objects. SPAA 2011: 317-324 - Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to equilibrium of logit dynamics for strategic games. SPAA 2011: 197-206 - Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert:
Brief announcement: reclaiming the energy of a schedule, models and algorithms. SPAA 2011: 135-136 - Yossi Azar, Aviv Nisgav, Boaz Patt-Shamir:
Recommender systems with non-binary grades. SPAA 2011: 245-252 - Grey Ballard, James Demmel, Andrew Gearhart:
Brief announcement: communication bounds for heterogeneous architectures. SPAA 2011: 257-258 - Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication: regular submission. SPAA 2011: 1-12 - Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Scheduling irregular parallel computations on hierarchical caches. SPAA 2011: 355-366 - Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA 2011: 13-22 - Guy E. Blelloch, Richard Peng, Kanat Tangwongsan:
Linear-work greedy parallel approximate set cover and variants. SPAA 2011: 23-32 - Patrick Briest, Christoph Raupach:
The car sharing problem. SPAA 2011: 167-176 - Victoria Caparrós Cabezas, Phillip Stanley-Marbell:
Parallelism and data movement characterization of contemporary application classes. SPAA 2011: 95-104 - George Constantin Caragea, Uzi Vishkin:
Brief announcement: better speedups for parallel max-flow. SPAA 2011: 131-134 - Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Brief announcement: full reversal routing as a linear dynamical system. SPAA 2011: 129-130 - Tyler Crain, Damien Imbs, Michel Raynal:
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. SPAA 2011: 315-316 - Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer:
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. SPAA 2011: 139-148 - David Dice:
Brief announcement: a partitioned ticket lock. SPAA 2011: 309-310 - David Dice, Virendra J. Marathe, Nir Shavit:
Flat-combining NUMA locks. SPAA 2011: 65-74 - David Dice, Oleksandr Otenko:
Brief announcement: multilane - a concurrent blocking multiset. SPAA 2011: 313-314 - Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 - Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee:
On a bounded budget network creation game. SPAA 2011: 207-214 - Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA 2011: 187-196 - Guy Even, Moti Medina:
Online packet-routing in grids with bounded buffers. SPAA 2011: 215-224 - Panagiota Fatourou, Nikolaos D. Kallimanis:
A highly-efficient wait-free universal construction. SPAA 2011: 325-334 - Cyril Gavoille, Christian Sommer:
Sparse spanners vs. compact routing. SPAA 2011: 225-234 - Michael T. Goodrich:
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. SPAA 2011: 379-388 - Michael T. Goodrich, Michael Mitzenmacher:
Brief announcement: large-scale multimaps. SPAA 2011: 259-260 - Vincent Gramoli, Rachid Guerraoui:
Brief announcement: transaction polymorphism. SPAA 2011: 311-312
skipping 21 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-05-21 04:01 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