John S. Lew

According to our database, John S. Lew authored at least 10 papers between 1971 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1996

The generalized<i>D</i>^<i>[X]</i>/<i>D</i>/1 queue: A flexible computer communications model.

Chatschik Bisdikian, John S. Lew, Asser N. Tantawi

Telecommun. Syst., 1996

An Enlarged Family of Packing Polynomials on Multidemensional Lattices.

Luis B. Morales, John S. Lew

Math. Syst. Theory, 1996

Diagonal Polynomials for Small Dimensions.

John S. Lew, Luis B. Morales, A. Sánchez-Flores

Math. Syst. Theory, 1996

1989

Exact Solutions of a Differential Equation (Z. Ikonić and V. Milanović).

John S. Lew, Carl C. Grosjean

SIAM Rev., 1989

An Inverse Laplace Transform (O. G. Ruehr and W. R. Young).

Carl C. Grosjean, Otto G. Ruehr, W. R. Young, John S. Lew

SIAM Rev., 1989

1987

Analysis of Trade-offs in Distributed Locking for Transaction Processing Systems.

Balakrishna R. Iyer, C. M. Krishna, John S. Lew

Proceedings of the Computer Performance and Reliability, 1987

1983

Communication: An Improved Regional Correlation Algorithm for Signature Verification Which Permits Small Speed Changes Between Handwriting Segments.

John S. Lew

IBM J. Res. Dev., 1983

1980

Optimal Accelerometer Layouts for Data Recovery in Signature Verification.

John S. Lew

IBM J. Res. Dev., 1980

1979

Polynomial Enumeration of Multidimensional Lattices.

John S. Lew

Math. Syst. Theory, 1979

1971

The Range of a Vector Measure with Values in a Montel Space.

John S. Lew

Math. Syst. Theory, 1971