World Library  


Add to Book Shelf
Flag as Inappropriate
Email this Book

Buffered Versus Unbuffered Tree Networks for Accessing a Critical Resource

By Spirakis, Paul G

Click here to view

Book Id: WPLBN0000032817
Format Type: PDF eBook
File Size: 0.50 MB
Reproduction Date: 9/15/2008
Full Text

Title: Buffered Versus Unbuffered Tree Networks for Accessing a Critical Resource  
Author: Spirakis, Paul G
Volume:
Language: English
Subject: Math, Fine Arts, Sociology
Collections: American Libraries Collection
Historic
Publication Date:
1983
Publisher: New York; Courant Institute of Mathematical Sciences, New York; University

Citation

APA MLA Chicago

G, S. P. (1983). Buffered Versus Unbuffered Tree Networks for Accessing a Critical Resource. Retrieved from http://netlibrary.net/


Summary
Sloan Foundation; New York University, Institute of Fine Arts Library

 

Click To View

Additional Books


  • A Globally Convergent Algorithm for Mini... (by )
  • An Efficient Algorithm for Finding Conne... (by )
  • An Algorithm for Constructing Feasible S... (by )
  • Comparing Three Approaches to Transforma... (by )
  • Iterative Substructuring Methods : Algor... (by )
  • Additive Schwarz Methods for Elliptic Fi... (by )
  • Characterization of Signals from Multisc... (by )
  • The Force of Impact on a Sphere Striking... (by )
  • Some Domain Decomposition and Iterative ... (by )
  • A Note on the Local Structure of Shot No... (by )
  • Randomized Parallel Algorithms for Trape... (by )
  • Certain Transmission and Reflection Theo... (by )
Scroll Left
Scroll Right

 



Copyright © World Library Foundation. All rights reserved. eBooks from World Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.