000 | 03447nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-31860-6 | ||
003 | DE-He213 | ||
005 | 20160624101918.0 | ||
007 | cr nn 008mamaa | ||
008 | 100715s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540318606 _9978-3-540-31860-6 |
||
024 | 7 |
_a10.1007/11527954 _2doi |
|
050 | 4 | _aQA76.76.A65 | |
072 | 7 |
_aUNH _2bicssc |
|
072 | 7 |
_aUDBD _2bicssc |
|
072 | 7 |
_aCOM032000 _2bisacsh |
|
082 | 0 | 4 |
_a005.7 _223 |
245 | 1 | 0 |
_aCombinatorial and Algorithmic Aspects of Networking _h[electronic resource] : _bFirst Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers / _cedited by Alejandro López-Ortiz, Angèle M. Hamel. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005. |
|
300 |
_aVIII, 205 p. Also available online. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3405 |
|
505 | 0 | _aWorkshop Proceedings -- Aggregating Correlated Data in Sensor Networks -- The Efficiency of Optimal Taxes -- Congestion Games, Load Balancing, and Price of Anarchy -- Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives -- Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces -- Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing -- A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs -- String Matching on the Internet -- k-Robust Single-Message Transmission -- Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches -- The External Network Problem with Edge- or Arc-Connectivity Requirements -- Bipartite Graphs as Models of Complex Networks -- Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis -- Invited Talk: The Many Wonders of the Web Graph -- Survey Articles -- Algorithmic Foundations of the Internet:Foreword -- A Survey of Models of the Web Graph -- You Can Get There from Here: Routing in the Internet -- Search Engines and Web Information Retrieval -- Algorithmic Foundations of the Internet: Roundup. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer network architectures. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aInformation systems. | |
650 | 0 | _aMathematics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aInformation Systems Applications (incl.Internet). |
650 | 2 | 4 | _aComputer Systems Organization and Communication Networks. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aGame Theory, Economics, Social and Behav. Sciences. |
700 | 1 |
_aLópez-Ortiz, Alejandro. _eeditor. |
|
700 | 1 |
_aHamel, Angèle M. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540278733 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3405 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/11527954 |
942 |
_2EBK3661 _cEBK |
||
999 |
_c32955 _d32955 |