Остановите войну!
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 53 matches
- 2007
- Mostafa H. Ammar:
10 networking papers: a blast from the past. Comput. Commun. Rev. 37(1): 57-59 (2007) - Bob Briscoe:
Flow rate fairness: dismantling a religion. Comput. Commun. Rev. 37(2): 63-74 (2007) - Helmut Bürklin, Ralf Schäfer, Dietrich Westerkamp:
DVB: from broadcasting to ip delivery. Comput. Commun. Rev. 37(1): 65-67 (2007) - Lyman Chapin:
IFIP TC6 activity report. Comput. Commun. Rev. 37(2): 99-100 (2007) - Manuel Crotti, Maurizio Dusi, Francesco Gringoli, Luca Salgarelli:
Traffic classification through simple statistical fingerprinting. Comput. Commun. Rev. 37(1): 5-16 (2007) - Jon Crowcroft:
Net neutrality: the technical side of the debate: a white paper. Comput. Commun. Rev. 37(1): 49-56 (2007) - Jon Crowcroft, Peter B. Key:
Report from the clean slate network research post-sigcomm 2006 workshop. Comput. Commun. Rev. 37(1): 75-78 (2007) - Jon Crowcroft, Craig Partridge, Geoffrey M. Voelker, Ellen W. Zegura:
Report from the 2006 SIGCOMM nomination committee. Comput. Commun. Rev. 37(1): 87 (2007) - Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, Marina Fomenkov, Bradley Huffaker, Young Hyun, Kimberly C. Claffy, George F. Riley:
AS relationships: inference and validation. Comput. Commun. Rev. 37(1): 29-40 (2007) - Michalis Faloutsos:
You must be joking... warns you: don't drink and type. Comput. Commun. Rev. 37(2): 93-94 (2007) - Michalis Faloutsos:
You must be joking...: why Alice killed Bob. Comput. Commun. Rev. 37(5): 75-76 (2007) - Michalis Faloutsos, Anirban Banerjee, Reza Rejaie:
You must be joking: a historic open reviewing at global internet '07. Comput. Commun. Rev. 37(3): 79-82 (2007) - Nick Feamster, Lixin Gao, Jennifer Rexford:
How to lease the internet in your spare time. Comput. Commun. Rev. 37(1): 61-64 (2007) - Anja Feldmann:
Internet clean-slate design: what and why? Comput. Commun. Rev. 37(3): 59-64 (2007) - Darleen Fisher:
US National Science Foundation and the Future Internet Design. Comput. Commun. Rev. 37(3): 85-87 (2007) - Anastasius Gavras, Arto Karila, Serge Fdida, Martin May, Martin Potts:
Future internet research and experimentation: the FIRE initiative. Comput. Commun. Rev. 37(3): 89-92 (2007) - Shimin Guo, Mohammad Hossein Falaki, Earl A. Oliver, Sumair Ur Rahman, Aaditeshwar Seth, Matei A. Zaharia, Srinivasan Keshav:
Very low-cost internet access using KioskNet. Comput. Commun. Rev. 37(5): 95-100 (2007) - Jiayue He, Jennifer Rexford, Mung Chiang:
Don't optimize existing protocols, design optimizable protocols. Comput. Commun. Rev. 37(3): 53-58 (2007) - Felipe Huici, Mark Handley:
An edge-to-edge filtering architecture against DoS. Comput. Commun. Rev. 37(2): 39-50 (2007) - Shengming Jiang:
An addressing independent networking structure favorable for all-optical packet switching. Comput. Commun. Rev. 37(1): 17-28 (2007) - Srikanth Kandula, Dina Katabi, Shantanu Sinha, Arthur W. Berger:
Dynamic load balancing without packet reordering. Comput. Commun. Rev. 37(2): 51-62 (2007) - Srinivasan Keshav:
How to read a paper. Comput. Commun. Rev. 37(3): 83-84 (2007) - Dmitri V. Krioukov, Kimberly C. Claffy, Marina Fomenkov, Fan R. K. Chung, Alessandro Vespignani, Walter Willinger:
The workshop on internet topology (wit) report. Comput. Commun. Rev. 37(1): 69-73 (2007) - Nate Kushman, Srikanth Kandula, Dina Katabi:
Can you hear me now?!: it must be BGP. Comput. Commun. Rev. 37(2): 75-84 (2007) - Kun-Chan Lan, Zhe Wang, Mahbub Hassan, Tim Moors, Rodney Berriman, Lavy Libman, Maximilian Ott, Björn Landfeldt, Zainab R. Zaidi:
Experiences in deploying a wireless mesh network testbed for traffic control. Comput. Commun. Rev. 37(5): 17-28 (2007) - Sara Landström, Lars-Åke Larzon:
Reducing the TCP acknowledgment frequency. Comput. Commun. Rev. 37(3): 5-16 (2007) - Jun Li, Michael Guidero, Zhen Wu, Eric Purpus, Toby Ehrenkranz:
BGP routing dynamics revisited. Comput. Commun. Rev. 37(2): 5-16 (2007) - Sridhar Machiraju, Darryl Veitch, François Baccelli, Jean Bolot:
Adding definition to active probing. Comput. Commun. Rev. 37(2): 17-28 (2007) - David Malone, Ken Duffy, Christopher King:
Some remarks on ld plots for heavy-tailed traffic. Comput. Commun. Rev. 37(1): 41-42 (2007) - Vivek Mhatre:
Enhanced wireless mesh networking for ns-2 simulator. Comput. Commun. Rev. 37(3): 69-72 (2007)
skipping 23 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-25 08:41 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