Остановите войну!
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 39 matches
- 2006
- François Baccelli, Sridhar Machiraju, Darryl Veitch, Jean Bolot:
The role of PASTA in network measurement. SIGCOMM 2006: 231-242 - Andy C. Bavier, Nick Feamster, Mark Huang, Larry L. Peterson, Jennifer Rexford:
In VINI veritas: realistic and controlled network experimentation. SIGCOMM 2006: 3-14 - Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese:
Beyond bloom filters: from approximate membership checks to approximate state machines. SIGCOMM 2006: 315-326 - Matthew Caesar, Tyson Condie, Jayanthkumar Kannan, Karthik Lakshminarayanan, Ion Stoica:
ROFL: routing on flat labels. SIGCOMM 2006: 363-374 - Matthew Caesar, Miguel Castro, Edmund B. Nightingale, Greg O'Shea, Antony I. T. Rowstron:
Virtual ring routing: network routing inspired by DHTs. SIGCOMM 2006: 351-362 - Haowen Chan, Debabrata Dash, Adrian Perrig, Hui Zhang:
Modeling adoptability of secure BGP protocol. SIGCOMM 2006: 279-290 - Chi-Kin Chau:
Policy-based routing with non-strict preferences. SIGCOMM 2006: 387-398 - Kuan-Ta Chen, Chun-Ying Huang, Polly Huang, Chin-Laung Lei:
Quantifying Skype user satisfaction. SIGCOMM 2006: 399-410 - Yuchung Cheng, John Bellardo, Péter Benkö, Alex C. Snoeren, Geoffrey M. Voelker, Stefan Savage:
Jigsaw: solving the puzzle of enterprise 802.11 analysis. SIGCOMM 2006: 39-50 - Kenjiro Cho, Kensuke Fukuda, Hiroshi Esaki, Akira Kato:
The impact and implications of the growth in residential user-to-user traffic. SIGCOMM 2006: 207-218 - Domenico Ferrari:
Humble beginnings, uncertain end: getting the internet to provide performance guarantees. SIGCOMM 2006: 1-2 - Christos Gkantsidis, Thomas Karagiannis, Pablo Rodriguez, Milan Vojnovic:
Planet scale software updates. SIGCOMM 2006: 423-434 - Brighten Godfrey, Scott Shenker, Ion Stoica:
Minimizing churn in distributed systems. SIGCOMM 2006: 147-158 - Yuming Jiang:
A basic stochastic network calculus. SIGCOMM 2006: 123-134 - Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein:
Growth codes: maximizing sensor network data persistence. SIGCOMM 2006: 255-266 - Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft:
XORs in the air: practical wireless network coding. SIGCOMM 2006: 243-254 - Eddie Kohler, Mark Handley, Sally Floyd:
Designing DCCP: congestion control without reliability. SIGCOMM 2006: 27-38 - Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, Jonathan S. Turner:
Algorithms to accelerate multiple regular expressions matching for deep packet inspection. SIGCOMM 2006: 339-350 - Paul Laskowski, John Chuang:
Network monitors and contracting systems: competition and innovation. SIGCOMM 2006: 183-194 - Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall, Amin Vahdat:
Systematic topology analysis and generation using degree correlations. SIGCOMM 2006: 135-146 - Ratul Mahajan, Maya Rodrig, David Wetherall, John Zahorjan:
Analyzing the MAC-level behavior of wireless networks in the wild. SIGCOMM 2006: 75-86 - Michael Menth, Rüdiger Martin, Joachim Charzinski:
Capacity overprovisioning for networks with resilience requirements. SIGCOMM 2006: 87-98 - Wolfgang Mühlbauer, Anja Feldmann, Olaf Maennel, Matthew Roughan, Steve Uhlig:
Building an AS-topology model that captures route diversity. SIGCOMM 2006: 195-206 - Anirudh Ramachandran, Nick Feamster:
Understanding the network-level behavior of spammers. SIGCOMM 2006: 291-302 - Sumit Rangwala, Ramakrishna Gummadi, Ramesh Govindan, Konstantinos Psounis:
Interference-aware fair rate control in wireless sensor networks. SIGCOMM 2006: 63-74 - Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenker:
Revisiting IP multicast. SIGCOMM 2006: 15-26 - Charles Reis, Ratul Mahajan, Maya Rodrig, David Wetherall, John Zahorjan:
Measurement-based models of delivery and interference in static wireless networks. SIGCOMM 2006: 51-62 - Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, Fabián E. Bustamante:
Drafting behind Akamai (travelocity-based detouring). SIGCOMM 2006: 435-446 - Yu-Wei Eric Sung, Michael A. Bishop, Sanjay G. Rao:
Enabling contribution awareness in an overlay broadcasting system. SIGCOMM 2006: 411-422 - George Varghese, J. Andrew Fingerhut, Flavio Bonomi:
Detecting evasion attacks at high speeds without reassembly. SIGCOMM 2006: 327-338
skipping 9 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-29 00:21 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