Publications

Export 1858 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is C  [Clear All Filters]
1975
Mylopoulos J, Borgida A, Cohen P, Roussopoulos N, Tsotsos J, Wong H.  1975.  TORUS-a natural language understanding system for data management. Proceedings of the Fourth International Conference on Artificial Intelligence. :414-421.
1976
Concus P, Golub GH, O'Leary DP.  1976.  A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations. Sparse Matrix ComputationsSparse Matrix Computations. :309-332.
Mylopoulos J, Borgida A, Cohen P, Roussopoulos N, Tsotsos J, Wong H.  1976.  TORUS: A step towards bridging the gap between data bases and the casual user. Information Systems. 2(2):49-64.
1978
Concus P, Golub GH, O'Leary DP.  1978.  Numerical Solution of Nonlinear Elliptic Partial Differential Equations by a Generalized Conjugate Gradient Method. Computing. 19:321-339.
1980
Yeh RY, Roussopoulos N, Chang P.  1980.  Systematic Derivation of Software Requirements. Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design. :403-404.
1981
Chen E, Zelkowitz MV.  1981.  Use of cluster analysis to evaluate software engineering methodologies. Proceedings of the 5th international conference on Software engineering. :117-123.
1982
Chandra AK, Stockmeyer LJ, Vishkin U.  1982.  A complexity theory for unbounded fan-in parallelism. 23rd Annual Symposium on Foundations of Computer Science. :1-13.
1983
Coolahan JE, Roussopoulos N.  1983.  Timing Requirements for Time-Driven Systems Using Augmented Petri Nets. IEEE Transactions on Software Engineering. SE-9(5):603-616.
1984
Basili VR, Chang S, Gannon J, Katz E, Panlilio-Yap MN, Ramsey C L, Zelkowitz MV, Bailey J, Kruesi E, Sheppard S.  1984.  Monitoring an Ada software development. ACM SIG Ada Letters. IV(1):32-39.
1985
Aloimonos Y, Chou PB, of of Science U R. D. C.  1985.  Detection of Surface Orientation and Motion from Texture: The Case of Planes.
Coppersmith D, Vishkin U.  1985.  Solving NP-hard problems in [] almost trees': Vertex cover. Discrete applied mathematics. 10(1):27-45.
Coolahan Jr JE, Roussopoulos N.  1985.  A timed petri net methodolgoy for specifying real-time system timing requirements. International Workshop on Timed Petri Nets. :24-31.
1986
Cole R, Vishkin U.  1986.  The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Ultracomputer Note-108.
Cole R, Vishkin U.  1986.  Approximate and exact parallel scheduling with applications to list, tree and graph problems. 27th Annual Symposium on Foundations of Computer Science. :478-491.
Cole R, Vishkin U.  1986.  Approximate scheduling, exact scheduling, and applications to parallel algorithms. Proceedings Symposium on Foundations of Computer Science. :478-491.
Cole R, Vishkin U.  1986.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. Proceedings of the eighteenth annual ACM symposium on Theory of computing. :206-219.
Cole R, Vishkin U.  1986.  Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control. 70(1):32-53.
1987
Kozen D, Teitelbaum T, Chen WZ, Field JH, Pugh W, Vander Zanden BT.  1987.  ALEX-an Alexical Programming Language. TR87-835
Greif I, Curtis B, Krasner H, Malone TW, Shneiderman B.  1987.  Computer-supported cooperative work (panel): is this REALLY a new field of research? Proceedings of the SIGCHI/GI conference on Human factors in computing systems and graphics interface. :227-228.
Chandran S, Mount D.  1987.  Shared memory algorithms and the medial axis transform. IEEE Workshop on Computer Architecture for PAMI. :44-50.
Chin JP, Norman KL, Shneiderman B.  1987.  Subjective user evaluation of CF PASCAL programming tools. Department of Computer Science and Human-Computer Interaction Laboratory Working Paper.
1988
Cole R, Vishkin U.  1988.  The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica. 3(1):329-346.
Cole R, Vishkin U.  1988.  Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal on Computing. 17:128-128.
Shneiderman B, Carroll JM.  1988.  Ecological studies of professional programmers. Commun. ACM. 31(11):1256-1258.
Callahan J, Hopkins D, Weiser M, Shneiderman B.  1988.  An empirical comparison of pie vs. linear menus. Proceedings of the SIGCHI conference on Human factors in computing systems. :95-100.

Pages