Alejandro Lopez-ortiz
Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, Caan 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers - Lecture Notes in Computer Science / Computer Communi Alejandro Lopez-ortiz

Name: Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, Caan 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers - Lecture Notes in Computer Science / Computer Communi
Price: 55.99 USD
Availability: OutOfStock
Author: Alejandro Lopez-ortiz

Precio

$ 55,99

sin IVA

Pedido desde almacén remoto

Entrega prevista 26 de jun. - 9 de jul.

Nuestros clientes opinan:

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

Política de devolución de 14 días conforme a la legislación europea de protección de los consumidores

Mejor valorado en Trustpilot

Añadir a tu lista de deseos de iMusic

Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, Caan 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers - Lecture Notes in Computer Science / Computer Communi

Alejandro Lopez-ortiz

Constitutes the refereed proceedings of the first workshop on Combinatorial and Algorithmic Aspects of Networking, held in Banff, Alberta, Canada in August 2004. The papers in this book cover topics ranging from the web graph to game theory to string matching, all in the context of large-scale networks.

Marc Notes: Includes bibliographical references and index.; EBSCO complete collection. Table of Contents: 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. Publisher Marketing: Constitutes the refereed proceedings of the first workshop on Combinatorial and Algorithmic Aspects of Networking, held in Banff, Alberta, Canada in August 2004. The papers in this book cover topics ranging from the web graph to game theory to string matching, all in the context of large-scale networks.

Medios de comunicación	Libros Paperback Book (Libro con tapa blanda y lomo encolado)
Publicado	14 de julio de 2005
ISBN13	9783540278733
Editores	Springer-Verlag Berlin and Heidelberg Gm
Páginas	205
Dimensiones	156 × 234 × 11 mm · 312 g
Lengua	Alemán
Editor	Hamel, Angele
Editor	Lopez-ortiz, Alejandro (University of Waterloo)