Publications

Found 95 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is O  [Clear All Filters]
1974
Karp, R. M., & Glassey C.. R. (1974).  On the Optimality of Huffman Trees.
1976
Karp, R. M., & Glassey C.. R. (1976).  On the Optimality of Huffman Trees. SIAM Journal on Applied Mathematics. 31(2), 368-378.
Feldman, J., Ballard D. Harry, & Brown C. M. (1976).  Outline of a Query-Driven Vision System.
1977
Feldman, J. (1977).  Overview of the Rochester Image Understanding Program.
1989
Impagliazzo, R., & Luby M. (1989).  One-Way Functions Are Essential for Complexity Based Cryptography (Extended.
Shenker, S., & Weinrib A. (1989).  The Optimal Control of Heterogeneous Queuing Systems: A Paradigm for Load-Sharing and Routing. IEEE Transactions of Computers. 38(12), 1724-1735.
Dahlhaus, E., Hajnal P., & Karpinski M. (1989).  Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
1990
Herrtwich, R. Guido, & Delgrossi L. (1990).  ODA-Based Data Modeling in Multimedia Systems.
Karp, R. M., Vazirani U. V., & Vazirani V. V. (1990).  An optimal algorithm for on-line bipartite matching. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
1991
Zhang, L., Shenker S., & Clark D. D. (1991).  Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic. Proceedings of the ACM SIGCOMM '91 Conference on Communications Architecture & Protocols. 133-147.
Maass, W. (1991).  On-Line Learning with an Oblivious Environment and the Power of Randomization.
Chinrungrueng, C., & Séquin C. H. (1991).  Optimal Adaptive K-means Algorithm with Dynamic Adjustment of Learning Rate.
Codenotti, B., Leoncini M., & Resta G. (1991).  Oracle Computations in Parallel Numerical Linear Algebra.
1992
Paterno, F. (1992).  An Object-Oriented Approach to the Design of Graphical User Interface Systems.
Karp, R. M. (1992).  On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future?.
Karp, R. M. (1992).  On-line algorithms versus off-line algorithms: how much is it worth to know the future?. Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92. 416-429.
Marchetti-Spaccamela, A., Nanni U., & Rohnert H. (1992).  On-Line Graph Algorithms for Incremental Compilation.
Ausiello, G., Italiano G. F., & Nanni U. (1992).  Optimal Traversal of Directed Hypergraphs.
1993
Ostrovsky, R., & Wigderson A. (1993).  One-Way Functions Are Essential for Non-Trivial Zero-Knowledge.
Luby, M., & Ertel W. (1993).  Optimal Parallelization of Las Vegas Algorithms.
Novak, E. (1993).  Optimal Recovery and n-Widths For Convex Classes of Functions.
Luby, M., Sinclair A., & Zuckerman D. (1993).  Optimal Speedup of Las Vegas Algorithms.
Novak, E., & Petras K. (1993).  Optimal Stochastic Quadrature Formulas For Convex Functions.
Behrendt, T., Compton K., & Grdel E. (1993).  Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.
Pan, V. (1993).  Optimum Parallel Computations with Band Matrices.

Pages