Simulating an agile, synchronized manufacturing system von Carlson, John G.H., Yao, Andrew C.

Volltext

The impact of real-time data communication on inventory management von Yao, Andrew C, Carlson, John G

Volltext

Graph properties and circular functions: how low can quantum query complexity go? von Xiaoming Sun, Yao, A.C., Shengyu Zhang

Volltext

Deniable Internet Key Exchange von Yao, Andrew C., Zhao, Yunlei

Volltext

A visually interactive expert system for a distribution center environment von Carlson, John G, Yao, Andrew C

Volltext

Concurrent Knowledge Extraction in the Public-Key Model von Yao, Andrew C., Yung, Moti, Zhao, Yunlei

Volltext

On the complexity of maintaining partial sums von YAO, A. C

Volltext

Computationally-Fair Group and Identity-Based Key-Exchange von Yao, Andrew C., Zhao, Yunlei

Volltext

The role of master kits in assembly operations von Carlson, John G., Yao, Andrew C., Girouard, Wm.F.

Volltext

Optimal Expected-Time Algorithms for Closest Point Problems von Bentley, Jon Louis, Weide, Bruce W., Yao, Andrew C.

Volltext

On fault-tolerant networks for sorting von YAO, A. C, YAO, F. F

Volltext

Uniform hashing is optimal von YAO, A. C

Volltext

On the Communication Complexity of Co-linearity Problems von Yao, Andrew C.

Volltext

An Analysis of a Memory Allocation Scheme for Implementing Stacks von Yao, Andrew C.

Volltext

On the expected performance of path compression algorithms von YAO, A. C

Volltext

On the Average-Case Complexity of Selecting the k th Best von Yao, Andrew C., Yao, F. Frances

Volltext

NQP subscript C equals co-C subequals P von Yamakami, Tomoyuki, Yao, Andrew C

Volltext

Groups and algebraic complexity von Yao, Andrew C.

Volltext

On optimal arrangements of keys with double hashing von Yao, Andrew C

Volltext

NQP sub(C) identical with co-C sub( identical with )P von Yamakami, Tomoyuki, Yao, Andrew C

Volltext