Publications

Export 166 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is O  [Clear All Filters]
1973
Shneiderman B.  1973.  Optimum data base reorganization points. Communications of the ACM. 16(6):362-365.
1974
Shneiderman B.  1974.  Opportunities for data base reorganization. ACM SIGMOD Record. 6(4):1-8.
1978
Basili VR, Zelkowitz MV.  1978.  Operation of the Software Engineering Laboratory. Proceedings of the Second US Army/IEEE Software Life Cycle Management Workshop. New York: Computer Societies Press.
1982
Shiloach Y, Vishkin U.  1982.  An O (logn) parallel connectivity algorithm. Journal of Algorithms. 3(1):57-67.
Shiloach Y, Vishkin U.  1982.  An O (n2log n) parallel max-flow algorithm. Journal of Algorithms. 3(2):128-146.
Narayanan KA, O'Leary DP, Rosenfeld A.  1982.  An Optimization Approach to Edge Reinforcement. IEEE Transactions on Systems, Man, and Cybernetics. SMC-12:551-553.
1984
Vishkin U.  1984.  An optimal parallel connectivity algorithm* 1. Discrete applied mathematics. 9(2):197-207.
O'Leary DP.  1984.  Ordering Schemes for Parallel Processing of Certain Mesh Problems. SIAM Journal on Scientific and Statistical Computing. 5:620-632.
1985
Bar-On I, Vishkin U.  1985.  Optimal parallel generation of a computation tree form. ACM Transactions on Programming Languages and Systems (TOPLAS). 7(2):348-357.
Vishkin U.  1985.  Optimal parallel pattern matching in strings. Information and Control. 67(1-3):91-113.
1987
Vishkin U.  1987.  An optimal parallel algorithm for selection. Parallel and Distributed Computing. 4:79-86.
Ghosh S K, Mount D.  1987.  An output sensitive algorithm for computing visibility graphs. Foundations of Computer Science, 1987., 28th Annual Symposium on. :11-19.
1988
Chakrabarti C, JaJa JF.  1988.  Optimal Architectures for Multidimensional Transforms. ISR-TR-1988-39
Spetsakis ME, Aloimonos Y.  1988.  Optimal Computing Of Structure From Motion Using Point Correspondences In Two Frames. Proceedings of Second International Conference on Computer Vision. :449-453.
Cole R, Vishkin U.  1988.  Optimal parallel algorithms for expression tree evaluation and list ranking. VLSI Algorithms and Architectures. :91-100.
Chakrabarti C, JaJa JF.  1988.  Optimal Systolic Designs for the Computation of the Discrete Hartley and the Discrete Cosine Transforms.
1989
Spetsakis ME, Aloimonos Y.  1989.  Optimal motion estimation. Workshop on Visual Motion, 1989.,Proceedings. :229-237.
Chang SC, JaJa JF, Ryu KW.  1989.  Optimal parallel algorithms for one-layer routing.
Elman H, Agrón E.  1989.  Ordering techniques for the preconditioned conjugate gradient method on parallel computers. Computer Physics Communications. 53(1-3):253-269.
1990
Khuller S, Mitchell SG, Vazirani VV.  1990.  On-line algorithms for weighted matching and stable marriages. TR90-1143
Amir A, Roussopoulos N.  1990.  Optimal view caching. Information Systems. 15(2):169-171.
1991
Wu SA, JaJa JF.  1991.  Optimal algorithms for adjacent side routing. Algorithmica. 6(1):565-578.
Jacobs DW.  1991.  Optimal matching of planar models in 3D scenes. Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on. :269-274.
Plaisant C.  1991.  An overview of Hyperties, its user interface and data model. Hypermedia/Hypertext And Object-Oriented Databases. Chapman & Hall. :17-31.
1992
Pugh W.  1992.  The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM. 8(102-114):2-6.

Pages