Остановите войну!
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
- 2003
- Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson:
A proportionate fair scheduling rule with good worst-case performance. SPAA 2003: 101-108 - Micah Adler, Ying Gong, Arnold L. Rosenberg:
Optimal sharing of bags of tasks in heterogeneous clusters. SPAA 2003: 1-10 - Gagan Aggarwal, Rajeev Motwani, An Zhu:
The load rebalancing problem. SPAA 2003: 258-265 - Susanne Albers, Markus Büttner:
Integrated prefetching and caching in single and parallel disk systems. SPAA 2003: 109-117 - Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman:
Designing overlay multicast networks for streaming. SPAA 2003: 149-158 - Lars Arge, Laura Toma, Norbert Zeh:
I/O-efficient topological sorting of planar DAGs. SPAA 2003: 85-93 - Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka:
Compact routing with name independence. SPAA 2003: 184-192 - Esther M. Arkin, Michael A. Bender, Dongdong Ge:
Improved approximation algorithms for the freeze-tag problem. SPAA 2003: 295-303 - Nir Avrahami, Yossi Azar:
Minimizing total flow time and total completion time with immediate dispatching. SPAA 2003: 11-18 - Yossi Azar, Avrim Blum, Yishay Mansour:
Combining online algorithms for rejection and acceptance. SPAA 2003: 159-163 - Adnan Aziz, Amit Prakash, Vijaya Ramachandran:
A near optimal scheduler for switch-memory-switch routers. SPAA 2003: 343-352 - Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length menger's theorem and reliable optical routing. SPAA 2003: 246-247 - Evripidis Bampis, Alexander V. Kononov:
Bicriteria approximation algorithms for scheduling problems with communications. SPAA 2003: 252-253 - Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson:
Online oblivious routing. SPAA 2003: 44-49 - Amotz Bar-Noy, Justin Goshi, Richard E. Ladner:
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. SPAA 2003: 164-173 - Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Can we elect if we cannot compare? SPAA 2003: 324-332 - Raghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra:
Efficient galois field arithmetic on SIMD architectures. SPAA 2003: 256-257 - Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke:
A practical algorithm for constructing oblivious routing schemes. SPAA 2003: 24-33 - Jesse D. Bingham, Anne Condon, Alan J. Hu:
Toward a decidable notion of sequential consistency. SPAA 2003: 304-313 - Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura:
Analysis of link reversal routing algorithms for mobile ad hoc networks. SPAA 2003: 210-219 - Christopher Caltagirone, Kasi Anantha:
High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA. SPAA 2003: 240-241 - Jason F. Cantin, Mikko H. Lipasti, James E. Smith:
The complexity of verifying memory coherence. SPAA 2003: 254-255 - Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen:
Relaxing the problem-size bound for out-of-core columnsort. SPAA 2003: 250-251 - Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Frederic T. Chong, Isaac L. Chuang, John Kubiatowicz:
The effect of communication costs in solid-state quantum computing architectures. SPAA 2003: 65-74 - Roman Dementiev, Peter Sanders:
Asynchronous parallel disk sorting. SPAA 2003: 138-148 - Jeff Edmonds, Suprakash Datta, Patrick W. Dymond:
TCP is competitive against a limited adversary. SPAA 2003: 174-183 - Robert Elsässer, Burkhard Monien:
Load balancing of unit size tokens and expansion properties of graphs. SPAA 2003: 266-273 - Anupam Gupta, Amit Kumar, Mikkel Thorup:
Tree based MPLS routing. SPAA 2003: 193-199 - Jens Gustedt:
Randomized permutations in a coarse grained parallel environment. SPAA 2003: 248-249 - Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante:
Cycle stealing under immediate dispatch task assignment. SPAA 2003: 274-285
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-05-10 16:11 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