Остановите войну!
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 41 matches
- 2004
- Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. SPAA 2004: 20-24 - Susanne Albers:
New results on web caching with request reordering. SPAA 2004: 84-92 - Konstantin Andreev, Harald Räcke:
Balanced graph partitioning. SPAA 2004: 120-124 - Hagit Attiya, David Hay:
The inherent queuing delay of parallel packet switches. SPAA 2004: 269-270 - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano:
How to route and tax selfish unsplittable traffic. SPAA 2004: 196-205 - Baruch Awerbuch, Christian Scheideler:
Consistent and compact data management in distributed storage systems. SPAA 2004: 44-53 - Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The effect of faults on network expansion. SPAA 2004: 286-293 - Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson:
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. SPAA 2004: 133-144 - Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober:
Pagoda: a dynamic overlay network for routing, data management, and multicasting. SPAA 2004: 170-179 - Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Fighting against two adversaries: page migration in dynamic networks. SPAA 2004: 64-73 - Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo:
Sharing the cost of multicast transmissions in wireless networks. SPAA 2004: 180-187 - Guy E. Blelloch, Phillip B. Gibbons:
Effectively sharing a cache among threads. SPAA 2004: 235-244 - David P. Bunde, Yishay Mansour:
Improved combination of online algorithms for acceptance and rejection. SPAA 2004: 265-266 - John W. Byers, Jeffrey Considine, Michael Mitzenmacher:
Geometric generalizations of the power of two choices. SPAA 2004: 54-63 - Vicent Cholvi, Pascal Felber, Ernst W. Biersack:
Efficient search in unstructured peer-to-peer networks. SPAA 2004: 271-272 - Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-oblivious shortest paths in graphs using buffer heap. SPAA 2004: 245-254 - Fan R. K. Chung, Ronald L. Graham, George Varghese:
Parallelism versus memory allocation in pipelined router forwarding engines. SPAA 2004: 103-111 - Yi Cui, Baochun Li, Klara Nahrstedt:
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions. SPAA 2004: 160-169 - Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.:
DCAS is not a silver bullet for nonblocking algorithm design. SPAA 2004: 216-224 - Pierre-François Dutot, Lionel Eyraud, Grégory Mounié, Denis Trystram:
Bi-criteria algorithm for scheduling jobs on cluster platforms. SPAA 2004: 125-132 - Dan Guez, Alexander Kesselman, Adi Rosén:
Packet-mode policies for input-queued switches. SPAA 2004: 93-102 - Danny Hendler, Nir Shavit, Lena Yerushalmi:
A scalable lock-free stack algorithm. SPAA 2004: 206-215 - Kirsten Hildrum, Robert Krauthgamer, John Kubiatowicz:
Object location in realistic networks. SPAA 2004: 25-35 - David R. Karger, Matthias Ruhl:
Simple efficient load balancing algorithms for peer-to-peer systems. SPAA 2004: 36-43 - Dariusz R. Kowalski, Alexander A. Shvartsman:
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. SPAA 2004: 311-320 - Fabian Kuhn, Roger Wattenhofer:
Dynamic analysis of the arrow distributed protocol. SPAA 2004: 294-301 - Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide:
Scheduling against an adversarial network. SPAA 2004: 151-159 - Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani:
Online hierarchical cooperative caching. SPAA 2004: 74-83 - Adam Meyerson:
Online algorithms for network design. SPAA 2004: 275-280 - Gary L. Miller, Peter C. Richter:
Lower bounds for graph embeddings and combinatorial preconditioners. SPAA 2004: 112-119
skipping 11 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-27 19:50 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