Остановите войну!
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 89 matches
- 2001
- Miki Abu, Israel Ben-Shaul:
A Multi-threading Model for Distributed Mobile Objects and Its Realization in FarGo. ICDCS 2001: 313-321 - Yair Amir, Cristina Nita-Rotaru, John L. Schultz, Jonathan Robert Stanton, Yongdae Kim, Gene Tsudik:
Exploring Robustness in Group Key Agreement. ICDCS 2001: 399-408 - Anish Arora, Mikhail Nesterenko:
Unifying Stabilization and Termination in Message-Passing Systems. ICDCS 2001: 99-106 - Jin-Wook Baek, Jae-Heung Yeo, Gyu-Tae Kim, Heon Young Yeom:
Cost Effective Mobile Agent Planning for Distributed Information Retrieval. ICDCS 2001: 65-72 - Earl T. Barr, Raju Pandey, Michael Haungs:
MAGE: A Distributed Programming Model. ICDCS 2001: 303-312 - Nirupama Bulusu, Deborah Estrin, John S. Heidemann:
Adaptive Beacon Placement. ICDCS 2001: 489-498 - Randal C. Burns, Robert M. Rees, Darrell D. E. Long:
An Analytical Study of Opportunistic Lease Renewal. ICDCS 2001: 146-153 - Steven E. Butner, Moji Ghodoussi:
A Real-Time System for Tele-Surgery. ICDCS 2001: 236-243 - David Buttler, Ling Liu, Calton Pu:
A Fully Automated Object Extraction System for the World Wide Web. ICDCS 2001: 361-370 - Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Token Based Group Mutual Exclusion for Asynchronous Rings. ICDCS 2001: 691-694 - Ugur Çetintemel, Peter J. Keleher, Michael J. Franklin:
Support for Speculative Update Propagation and Mobility in Deno. ICDCS 2001: 509-516 - Ugur Çetintemel, Banu Özden, Abraham Silberschatz, Michael J. Franklin:
Design and Evaluation of Redistribution Strategies for Wide-Area Commodity Distribution. ICDCS 2001: 154-161 - Kasidit Chanchio, Xian-He Sun:
A Protocol Design of Communication State Transfer for Distributed Computing. ICDCS 2001: 715-718 - Ranveer Chandra, Venugopalan Ramasubramanian, Kenneth P. Birman:
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks. ICDCS 2001: 275-283 - Wen-Ke Chen, Matti A. Hiltunen, Richard D. Schlichting:
Constructing Adaptive Software in Distributed Systems. ICDCS 2001: 635-643 - Songqing Chen, Li Xiao, Xiaodong Zhang:
Dynamic Load Sharing with Unknown Memory Demands in Clusters. ICDCS 2001: 109-118 - Tzi-cker Chiueh, Fu-Hau Hsu:
RAD: A Compile-Time Solution to Buffer Overflow Attacks. ICDCS 2001: 409-417 - Gregory V. Chockler, Dahlia Malkhi, Michael K. Reiter:
Backoff Protocols for Distributed Mutual Exclusion and Ordering. ICDCS 2001: 11-20 - Byung-Kyu Choi, Riccardo Bettati:
Endpoint Admission Control: Network Based Approach. ICDCS 2001: 227-235 - Alain Cournier, Franck Petit, Vincent Villain, Ajoy Kumar Datta:
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks. ICDCS 2001: 91-98 - Landon P. Cox, Brian D. Noble:
Fast Reconciliations in Fluid Replication. ICDCS 2001: 449-458 - John Cruz, Kihong Park:
Towards Communication-Sensitive Load Balancing. ICDCS 2001: 731-734 - Pranav Dharwadkar, Howard Jay Siegel, Edwin K. P. Chong:
A Heuristic for Dynamic Bandwidth Allocation with Preemption and Degradation for Prioritized Requests. ICDCS 2001: 547-556 - Jeremy Elson, Deborah Estrin:
Random, Ephemeral Transaction Identifiers in Dynamic Sensor Networks. ICDCS 2001: 459-468 - Burkhard Englert, Larry Rudolph, Alexander A. Shvartsman:
Developing and Refining an Adaptive Token-Passing Strategy. ICDCS 2001: 597-605 - Pascal Felber, André Schiper:
Optimistic Active Replication. ICDCS 2001: 333-341 - Christof Fetzer:
Enforcing Perfect Failure Detection. ICDCS 2001: 350-357 - Udo Fritzke Jr., Philippe Ingels:
Transactions on Partially Replicated Data Based on Reliable and Atomic Multicasts. ICDCS 2001: 284-291 - Zhenghua Fu, Nalini Venkatasubramanian:
Adaptive Parameter Collection in Dynamic Distributed Environments. ICDCS 2001: 469-478 - Islene C. Garcia, Luiz Eduardo Buzato:
On the Minimal Characterization of the Rollback-Dependency Trackability Property. ICDCS 2001: 342-349
skipping 59 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-06-08 10:28 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