Publications
Export 566 results:
Author [ Title] Type Year Filters: First Letter Of Last Name is V [Clear All Filters]
2002. Structural Properties of Polyubiquitin Chains in Solution. Journal of Molecular Biology. 324(4):637-647.
1990. The structure, distribution and evolution of the ıt Ta1 retrotransposable element family of ıt Arabidopsis thaliana. Genetics. 126(3):713-721.
1994. Symmetry breaking for suffix tree construction. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. :300-309.
2010. Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience Proceedings of the 41st ACM technical symposium on Computer science education. :290-294.
1995. On a Technique for Parsing a String (Invited Lecture). Lecture Notes in Computer Science. 937:386-386.
2000. Telicity as a cue to temporal and discourse structure in Chinese-English machine translation. :34-41.
2001. Therapeutic play with a storytelling robot. CHI '01 extended abstracts on Human factors in computing systems. :27-28.
2007. Thinking in parallel: Some basic data-parallel algorithms and techniques. UMIACS, University of Maryland, College Park. 1993
1987. Tight comparison bounds on the complexity of parallel sorting. SIAM J. Comput.. 16(3):458-464.
1986. Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.
2011. Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture. Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on. :1282-1291.
1994. Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima. SIAM Journal on Computing. 23(3):449-465.
1998. Topology simplification for polygonal virtual environments. Visualization and Computer Graphics, IEEE Transactions on. 4(2):133-144.
2003. Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. Theory of Computing Systems. 36(5):521-552.
1991. Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.