|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-31860-6 |
| 003 |
DE-He213 |
| 005 |
20220311205316.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100715s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540318606
|9 978-3-540-31860-6
|
| 024 |
7 |
|
|a 10.1007/11527954
|2 doi
|
| 050 |
|
4 |
|a QA76.76.A65
|
| 072 |
|
7 |
|a UB
|2 bicssc
|
| 072 |
|
7 |
|a COM032000
|2 bisacsh
|
| 072 |
|
7 |
|a UX
|2 thema
|
| 082 |
0 |
4 |
|a 005.3
|2 23
|
| 245 |
1 |
0 |
|a Combinatorial and Algorithmic Aspects of Networking
|h [electronic resource] :
|b First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers /
|c edited by Alejandro López-Ortiz, Angèle Hamel.
|
| 250 |
|
|
|a 1st ed. 2005.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2005.
|
| 300 |
|
|
|a VIII, 205 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Computer Communication Networks and Telecommunications,
|x 2945-9184 ;
|v 3405
|
| 505 |
0 |
|
|a Workshop 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 |
|a Application software.
|
| 650 |
|
0 |
|a Computer engineering.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Game theory.
|
| 650 |
1 |
4 |
|a Computer and Information Systems Applications.
|
| 650 |
2 |
4 |
|a Computer Engineering and Networks.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Game Theory.
|
| 700 |
1 |
|
|a López-Ortiz, Alejandro.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Hamel, Angèle.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540813293
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540278733
|
| 830 |
|
0 |
|a Computer Communication Networks and Telecommunications,
|x 2945-9184 ;
|v 3405
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11527954
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
