Publications
Export 344 results:
Author [ Title] Type Year Filters: First Letter Of Title is R [Clear All Filters]
1996. Runtime coupling of data-parallel programs. Proceedings of the 10th international conference on Supercomputing. :229-236.
1997. Run-time and compiler support for programming in adaptive parallel environments. Scientific Programming. 6(2):215-227.
2004. Running on the bare metal with GeekOS. Proceedings of the 35th SIGCSE technical symposium on Computer science education. :315-319.
2009. Running memory span: A comparison of behavioral capacity limits with those of an attractor neural network. Cognitive Systems Research. 10(2):161-171.
1999. Running EveryWare on the computational grid. Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM). :6–es-6–es.
2008. Rule-based static analysis of network protocol implementations. Information and Computation. 206(2):130-157.
1994. A rule-based approach to prepositional phrase attachment disambiguation. Proceedings of the 15th conference on Computational linguistics-Volume 2. :1198-1204.
1993. RTSL: a language for real-time schedulability analysis. Real-Time Systems Symposium, 1993., Proceedings.. :274-283.
2004. RT-S: Surface rich transcription scoring, methodology, and initial results. Proc. DARPA Rich Transcription Workshop.
2012. Rpn1 and Rpn2 coordinate ubiquitin processing factors at the proteasome. Journal of Biological ChemistryJ. Biol. Chem..
1989. On routing two-terminal nets in the presence of obstacles. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on. 8(5):563-570.
2006. Routing in intermittent network topologies. Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems. :385-389.
1996. Rounding errors in solving block Hessenberg systems. Mathematics of Computation. 65(213):115-135.
2007. Round-efficient secure computation in point-to-point networks. Advances in Cryptology-EUROCRYPT 2007. :311-328.
2003. Round efficiency of multi-party computation with a dishonest majority. Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques. :578-595.
2007. Round Complexity of Authenticated Broadcast with a Dishonest Majority. Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on. :658-668.