Publications
Export 1858 results:
Author Title Type [ Year] Filters: First Letter Of Last Name is C [Clear All Filters]
1989. A semantics based verification tool for finite state systems. Proceedings of the IFIP WG6. 1:287-302.
1988. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica. 3(1):329-346.
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.
1988. An empirical comparison of pie vs. linear menus. Proceedings of the SIGCHI conference on Human factors in computing systems. :95-100.
1988. Optimal parallel algorithms for expression tree evaluation and list ranking. VLSI Algorithms and Architectures. :91-100.
1988. A united approach to finding enclosing and enclosed triangles. Proceedings of 26th Allerton Conference on Communication, Control and Computing.
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.
1987. Shared memory algorithms and the medial axis transform. IEEE Workshop on Computer Architecture for PAMI. :44-50.
1987. Subjective user evaluation of CF PASCAL programming tools. Department of Computer Science and Human-Computer Interaction Laboratory Working Paper.
1986. Approximate and exact parallel scheduling with applications to list, tree and graph problems. 27th Annual Symposium on Foundations of Computer Science. :478-491.
1986. Approximate scheduling, exact scheduling, and applications to parallel algorithms. Proceedings Symposium on Foundations of Computer Science. :478-491.
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.
1986. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control. 70(1):32-53.
1985. Solving NP-hard problems in [] almost trees': Vertex cover. Discrete applied mathematics. 10(1):27-45.
1985. A timed petri net methodolgoy for specifying real-time system timing requirements. International Workshop on Timed Petri Nets. :24-31.