Остановите войну!
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 40 matches
- 2013
- Yehuda Afek, Anat Bremler-Barr, Liron Schiff:
Recursive design of hardware priority queues. SPAA 2013: 23-32 - Hoda Akbari, Petra Berenbrink:
Parallel rotor walks on finite graphs and applications in discrete load balancing. SPAA 2013: 186-195 - John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and search in dynamic peer-to-peer networks. SPAA 2013: 53-62 - Yossi Azar, Naama Ben-Aroya, Nikhil R. Devanur, Navendu Jain:
Cloud scheduling with setup cost. SPAA 2013: 298-304 - Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication optimal parallel multiplication of sparse random matrices. SPAA 2013: 222-231 - Grey Ballard, James Demmel, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout. SPAA 2013: 232-240 - Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Brief announcement: set it and forget it - approximating the set once strip cover problem. SPAA 2013: 105-107 - Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A constant factor approximation algorithm for the storage allocation problem: extended abstract. SPAA 2013: 204-213 - Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, Cynthia A. Phillips:
Efficient scheduling to minimize calibrations. SPAA 2013: 280-287 - Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. SPAA 2013: 271-279 - Petra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre Stauffer:
Balls-into-bins with nearly optimal load distribution. SPAA 2013: 326-335 - Anastasia Braginsky, Alex Kogan, Erez Petrank:
Drop the anchor: lightweight memory management for non-blocking data structures. SPAA 2013: 33-42 - Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu:
Nonclairvoyant sleep management and flow-time scheduling on multiple processors. SPAA 2013: 261-270 - Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee:
Brief announcement: a game-theoretic model motivated by the darpa network challenge. SPAA 2013: 115-118 - Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Russell Martin, Oscar Morales-Ponce:
Optimal patrolling of fragmented boundaries. SPAA 2013: 241-250 - Dave Dice, Yossi Lev, Mark Moir:
Scalable statistics counters. SPAA 2013: 43-52 - Stephan Diestelhorst, Martin Nowack, Michael F. Spear, Christof Fetzer:
Brief announcement: between all and nothing - versatile aborts in hardware transactional memory. SPAA 2013: 108-110 - Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid:
HEX: scaling honeycombs is easier than scaling clock trees. SPAA 2013: 164-175 - Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-branching random walks on graphs. SPAA 2013: 176-185 - James Alexander Edwards, Uzi Vishkin:
Brief announcement: truly parallel burrows-wheeler compression and decompression. SPAA 2013: 93-96 - Martina Eikel, Christian Scheideler:
IRIS: a robust information system against insider dos-attacks. SPAA 2013: 119-129 - Seth Lewis Gilbert, Chaodong Zheng:
SybilCast: broadcast on the open airwaves (extended abstract). SPAA 2013: 130-139 - Magnús M. Halldórsson:
Brief announcement: locality in wireless scheduling. SPAA 2013: 97-98 - Martin Hoefer, Thomas Kesselheim:
Brief announcement: universally truthful secondary spectrum auctions. SPAA 2013: 99-101 - Sungjin Im, Benjamin Moseley:
Brief announcement: online batch scheduling for flow objectives. SPAA 2013: 102-104 - Thomas Janson, Christian Schindelhauer:
Broadcasting in logarithmic time for ad hoc network nodes on a line using mimo. SPAA 2013: 63-72 - Bernd Kawald, Pascal Lenzner:
On dynamics in selfish network creation. SPAA 2013: 83-92 - Peter Kling, Peter Pietrzyk:
Profitable scheduling on multiple speed-scalable processors. SPAA 2013: 251-260 - Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract. SPAA 2013: 73-82 - Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast greedy algorithms in mapreduce and streaming. SPAA 2013: 1-10
skipping 10 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-25 08:45 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