Остановите войну!
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 271 matches
- 2005
- Micah Adler, Rakesh Kumar, Keith W. Ross, Dan Rubenstein, Torsten Suel, David D. Yao:
Optimal peer selection for P2P downloading and streaming. INFOCOM 2005: 1538-1549 - Basheer Al-Duwairi, G. Manimaran:
Intentional dropping: a novel scheme for SYN flooding mitigation. INFOCOM 2005: 2820-2824 - Sara Alouf, Eitan Altman, Jérôme Galtier, Jean-François Lalande, Corinne Touati:
Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites. INFOCOM 2005: 560-571 - Eitan Altman:
On stochastic recursive equations and infinite server queues. INFOCOM 2005: 1295-1302 - Eitan Altman, Konstantin Avrachenkov, Arzad Alam Kherani, B. J. Prabhu:
Performance analysis and stochastic stability of congestion control protocols. INFOCOM 2005: 1316-1327 - Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu:
Fairness in MIMD congestion control algorithms. INFOCOM 2005: 1350-1361 - Matthew Andrews:
Maximizing profit in overloaded networks. INFOCOM 2005: 217-224 - Matthew Andrews, Lijun Qian, Alexander L. Stolyar:
Optimal utility based multi-user throughput allocation subject to throughput constraints. INFOCOM 2005: 2415-2424 - Matthew Andrews, Lisa Zhang:
Bounds on fiber minimization in optical networks with fixed fiber capacity. INFOCOM 2005: 409-419 - Konstantin Avrachenkov, Urtzi Ayesta, Patrick Brown, R. Núñez Queija:
Discriminatory processor sharing revisited. INFOCOM 2005: 784-795 - Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg:
Provably competitive adaptive routing. INFOCOM 2005: 631-641 - Sami Ayyorgun, Sarut Vanichpun, Wu-chun Feng:
Q-Composer and CpR: a probabilistic synthesizer and regulator of traffic (a probabilistic control of buffer occupancy). INFOCOM 2005: 1303-1315 - François Baccelli, Bartlomiej Blaszczyszyn, Mohamed Kadhem Karray:
Blocking rates in large CDMA networks via a spatial Erlang formula. INFOCOM 2005: 58-67 - François Baccelli, Augustin Chaintreau, Zhen Liu, Anton Riabov:
The one-to-many TCP overlay: a scalable and reliable multicast architecture. INFOCOM 2005: 1629-1640 - François Baccelli, Ki Baek Kim, Danny De Vleeschauwer:
Analysis of the competition between wired, DSL and wireless users in an access network. INFOCOM 2005: 362-373 - Seung Jun Baek, Gustavo de Veciana:
Spatial energy balancing in large-scale wireless multihop networks. INFOCOM 2005: 126-137 - Neil Barakat, Edward H. Sargent:
Dual-header optical burst switching: a new architecture for WDM burst-switched networks. INFOCOM 2005: 685-693 - Arash Behzad, Izhak Rubin:
Impact of power control on the performance of ad hoc wireless networks. INFOCOM 2005: 102-113 - Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta:
Capacity allocation and routing of locally restorable bandwidth guaranteed connections. INFOCOM 2005: 2691-2701 - Alberto Blanc, Yi-Kai Liu, Amin Vahdat:
Designing incentives for peer-to-peer routing. INFOCOM 2005: 374-385 - Jean-Yves Le Boudec, Milan Vojnovic:
Perfect simulation and stationarity of a class of mobility models. INFOCOM 2005: 2743-2754 - Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
Gossip algorithms: design, analysis and applications. INFOCOM 2005: 1653-1664 - Anat Bremler-Barr, Hanoch Levy:
Spoofing prevention method. INFOCOM 2005: 536-547 - Eli Brosh, Galit Lubetzky-Sharon, Yuval Shavitt:
Spatial-temporal analysis of passive TCP measurements. INFOCOM 2005: 949-959 - Andrew Brzezinski, Eytan H. Modiano:
Dynamic reconfiguration and routing algorithms for IP-over-WDM networks with stochastic traffic. INFOCOM 2005: 432-443 - Tian Bu, Mun Choon Chan, Ramachandran Ramjee:
Designing wireless radio access networks for third generation cellular networks. INFOCOM 2005: 68-78 - Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Power aware routing for sensor databases. INFOCOM 2005: 1747-1757 - Brendan Burns, Oliver Brock, Brian Neil Levine:
MV routing and capacity building in disruption tolerant networks. INFOCOM 2005: 398-408 - Mario Cagalj, Saurabh Ganeriwal, Imad Aad, Jean-Pierre Hubaux:
On selfish behavior in CSMA/CA networks. INFOCOM 2005: 2513-2524 - Lin Cai, Xuemin Shen, Jon W. Mark, Jianping Pan:
A QoS-aware AIMD protocol for time-sensitive applications in wired/wireless networks. INFOCOM 2005: 2008-2019
skipping 241 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-03 14:37 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