Остановите войну!
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
- 1999
- Matthew Andrews, Lisa Zhang:
Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule. INFOCOM 1999: 380-388 - Ilia Baldine, George N. Rouskas:
Dynamic Reconfiguration Policies for WDM Networks. INFOCOM 1999: 313-320 - Amotz Bar-Noy, Yaron Shilo:
Optimal Broadcasting of Two Files over an Asymmetric Channel. INFOCOM 1999: 267-274 - Bhargav R. Bellur, Richard G. Ogier:
A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks. INFOCOM 1999: 178-186 - Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker:
Web Caching and Zipf-like Distributions: Evidence and Implications. INFOCOM 1999: 126-134 - Timothy X. Brown:
Classifying Loss Rates in Broadband Networks. INFOCOM 1999: 361-370 - John W. Byers, Michael Luby, Michael Mitzenmacher:
Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. INFOCOM 1999: 275-283 - Ramón Cáceres, Nick G. Duffield, Joseph Horowitz, Donald F. Towsley, Tian Bu:
Multicast-Based Inference of Network-Internal Characteristics: Accuracy of Packet Loss Estimation. INFOCOM 1999: 371-379 - Jim Challenger, Arun Iyengar, Paul Dantzig:
A Scalable System for Consistently Caching Dynamic Web Data. INFOCOM 1999: 294-303 - Mun Choon Chan, Thomas Y. C. Woo:
Cache-Based Compaction: A New Technique for Optimizing Web Transfer. INFOCOM 1999: 117-125 - Cheng-Shang Chang:
Deterministic Traffic Specification via Projections under the Min-Plus Algebra. INFOCOM 1999: 43-50 - Cheng-Shang Chang, Rene L. Cruz:
A Time Varying Filtering Theory for Constrained Traffic Regulation and Dynamic Service Guarantees. INFOCOM 1999: 63-70 - Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford:
Efficient Algorithms for Predicting Requests to Web Servers. INFOCOM 1999: 284-293 - Richard Draves, Christopher King, Venkatachary Srinivasan, Brian Zill:
Constructing Optimal IP Routing Tables. INFOCOM 1999: 88-97 - Yuguang Fang, Imrich Chlamtac:
A New Mobility Model and Its Application in the Channel Holding Time Characterization in PCS Network. INFOCOM 1999: 20-27 - V. Fayet, Denis A. Khotimsky, Tony Przygienda:
Hop-by-Hop Routing with Node-Dependent Topology Information. INFOCOM 1999: 79-87 - Anja Feldmann, Ramón Cáceres, Fred Douglis, Gideon Glass, Michael Rabinovich:
Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments. INFOCOM 1999: 107-116 - Paul Francis, Sugih Jamin, Vern Paxson, Lixia Zhang, Daniel F. Gryniewicz, Yixin Jin:
An Architecture for a Global Internet Host Distance Estimation Service. INFOCOM 1999: 210-217 - David A. Hayes, Michael P. Rumsewicz, Lachlan L. H. Andrew:
Quality of Service Driven Packet Scheduling Disciplines for Real-Time Applications: Looking Beyond Fairness. INFOCOM 1999: 405-412 - Ravi Jain, Thomas Raleigh, Danny Yang, Li-Fung Chang, Charles Graff, Michael Bereschinsky, Mitesh P. Patel:
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers. INFOCOM 1999: 3-11 - Chuanyi Ji, Sheng Ma, Xusheng Tian:
Approximation Capability of Independent Wavelet Models to Heterogeneous Network Traffic. INFOCOM 1999: 170-177 - Ji-Her Ju, Victor O. K. Li:
TDMA Scheduling Design of Multihop Packet Radio Networks Based on Latin Squares. INFOCOM 1999: 187-193 - Murali S. Kodialam, Steven H. Low:
Resource Allocation in a Multicast Tree. INFOCOM 1999: 262-266 - Santosh Krishnan, Abhijit K. Choudhury, Fabio M. Chiussi:
Dynamic Partitioning: A Mechanism for Shared-Memory Management. INFOCOM 1999: 144-152 - Rajesh Krishnan, Ram Ramanathan, Martha Steenstrup:
Optimization Algorithms for Large Self-Structuring Networks. INFOCOM 1999: 71-78 - Craig Labovitz, G. Robert Malan, Farnam Jahanian:
Origins of Internet Routing Instability. INFOCOM 1999: 218-226 - Kevin Lai, Mary Baker:
Measuring Bandwidth. INFOCOM 1999: 235-245 - Anthony Lauck, Charles R. Kalmanek, K. K. Ramakrishnan:
SUBMARINE: An Architecture for IP Routing over Large NBMA Networks. INFOCOM 1999: 98-106 - Arnaud Legout, Jörg Nonnenmacher, Ernst W. Biersack:
Bandwidth Allocation Policies for Unicast and Multicast Flows. INFOCOM 1999: 254-261 - Eric Levy-Abegnoli, Arun Iyengar, Junehwa Song, Daniel M. Dias:
Design and Performance of a Web Server Accelerator. INFOCOM 1999: 135-143
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-04 13:16 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