Program manual : NOR network transduction based on error-compensation : (Reference manual of NOR network transduction programs NETTRA-EL, NETTRA-E2, and NETTRA-E3) /

"Work supported in part by the National Science Foundation under Grant no. GJ-40221."

Multiprocessor network system design by process concept /

"UIUCDCS-R-75-717"

ILLINET--a 32 Mbits/sec. local-area network /

"October, 1980."

NOR network transduction by generalized gate merging and substitution procedures : (principles of NOR network transduction programs NETTRA-G3 and NETTRA-G4) /

Includes bibliographical references.

NOR network transduction procedures based on connectable and disconnectable conditions : principles of NOR network transduction programs NETTRA-G1 and NETTRA-G2 /

Bibliography: p. 63.

Cost effective analysis of network computers /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program /

Bibliography: p. 39 (2d group)

Optimum network design using NOR-OR gates by integer programming.

"Supported in part by ... Grant no. NSF GJ-503."

Level-restricted NOR network transduction procedures /

"UILU-ENG 77 1703."

Cost effective priority assignment in network computers,

"Supported in part by the National Science Foundation under grant no. NSF GJ 28289."

Impact of local library systems on the national networking environment : proceedings of the Library of Congress Network Advisory Committee Meeting, April 1-3, 1991.

Includes bibliographical references.

DARPA neural network study final report /

Mode of access: Internet.

Common command language for file manipulation and network job execution : an example /

Includes bibliographical references (p. 27).

Classical simulation of quantum many-body systems with a tree tensor network

We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement (Schmidt number) is small for any bipartite split along an edge of the tree. As an application, we show that any one-way quantum computation on a tree graph can be efficiently simulated with a classical computer.

PROST: A programmable structured peer-to-peer overlay network

We present the idea of a programmable structured P2P architecture. Our proposed system allows the key-based routing infrastructure, which is common to all structured P2P overlays, to be shared by multiple applications. Furthermore, our architecture allows the dynamic and on-demand deployment of new applications and services on top of the shared routing layer.