cutternumberG216c

Calculadora Explorar ¿Qué es el Cutter?

Buscar en el catálogo

Cargando…

cutternumber.com.ar

Número de Cutter-Sanborn y catálogo bibliográfico en español, con millones de obras, ediciones y autores.

Calculadora Cutter Guía de catalogación Explorar el catálogo

Datos bibliográficos de Open Library (Internet Archive). Tabla Cutter-Sanborn de tres cifras.

Inicio
Explorar
Lower bounds on communication complexity in VLSI

Tapa de Lower bounds on communication complexity in VLSI

Número de Cutter-SanbornC689lEntrada «Cole» → 689 · marca de obra “l”

Lower bounds on communication complexity in VLSI

de Richard Cole

Ediciones (1)

Lower bounds on communication complexity in VLSI (1985)
Courant Institute of Mathematical Sciences, New York University · inglés

Más obras de Richard Cole

[[Extract from the will of Richard Cole, 1650]

[Extract from the will of Richard Cole, 1650]

Tapa de The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

Tapa de An asynchronous parallel algorithm for undirected graph connectivity

An asynchronous parallel algorithm for undirected graph connectivity

Lower bounds on communication complexity in VLSI — Richard Cole | Cutter Number

Tapa de An optimal selection algorithm

An optimal selection algorithm

Tapa de Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time

Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time

Tapa de Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time

Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time

Ver todas las obras de Richard Cole →