Publications

Export 447 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is M  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
M
Mount D.  1990.  The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.
Mount D.  1997.  Geometric intersection. Handbook of Discrete and Computational Geometry, chapter 33. :615-632.
Mount SM.  1983.  RNA processing: Sequences that signal where to splice. Nature. 304(5924):309-310.
Mount SM, Steitz J.  1983.  RNA processing: Lessons from mutant globins. Nature. 303(5916):380-381.
Mount D, Silverman R.  1990.  Packing and covering the plane with translates of a convex polygon. Journal of Algorithms. 11(4):564-580.
Mount D, Netanyahu NS.  1993.  Efficient algorithms for robust circular arc estimators. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada.
Mount D, Netanyahu NS.  1994.  Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP: Graphical Models and Image Processing. 56(4):289-303.
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
Mount D, Netanyahu NS, Le Moigne J.  1997.  Efficient algorithms for robust feature matching. Image Registration Workshop Proceedings.
Mount SM.  1996.  AT-AC Introns—An ATtACk on Dogma. ScienceScience. 271(5256):1690-1692.
Mount SM, Steitz JA.  1984.  RNA splicing and the involvement of small ribonucleoproteins. Modern cell biology. 3:249-297.
Mount D, Park E.  2010.  A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
Mount D, Stein C.  2002.  Algorithm Engineering and Experiments: 4th International Workshop, Alenex 2002, San Francisco, Ca, Usa, January 4-5. 2002 : Revised Papers.
Mount D, Netanyahu NS, Silverman R, Wu AY.  2000.  Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry. 17(3–4):97-119.
Mount D, Netanyahu NS, Piatko CD, Silverman R, Wu AY.  2004.  A computational framework for incremental motion. Proceedings of the twentieth annual symposium on Computational geometry. :200-209.
Motiwala M, bin Tariq M, Anwer B, Andersen D, Feamster N.  2009.  A Narrow Waist for Multipath Routing.
Motiwala M, Dhamdhere A, Feamster N, Lakhina A.  2012.  Towards a cost model for network traffic. SIGCOMM Comput. Commun. Rev.. 42(1):54-60.
Motiwala M, Feamster N, Vempala S.  2007.  Path splicing: Reliable connectivity with rapid recovery. ACM SIGCOMM HotNets VI.
Motiwala M, Elmore M, Feamster N, Vempala S.  2008.  Path splicing. SIGCOMM Comput. Commun. Rev.. 38(4):27-38.
Motesharrei S, Rivas J, Kalnay E, Asrar GR, Busalacchi AJ, Cahalan RF, Cane MA, Colwell RR, Feng K, Franklin RS et al..  2016.  Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems. National Science Review. :nww081.
Mosse D, Noh SH, Trinh B, Agrawala AK.  1993.  Multiple Resource Allocation for Multiprocessor Distributed Real-Time Systems. In Workshop on Parallel and Distributed Real-Time Systems (PDRTS), IEEE IPPS'93.
Morselli R, Katz J, Bhattacharjee B.  2004.  A game-theoretic framework for analyzing trust-inference protocols. Workshop on Economics of Peer-to-Peer Systems.
Morselli R, Bhattacharjee B, Katz J, Marsh M.  2007.  Exploiting approximate transitivity of trust. Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on. :515-524.
Morselli R, Bhattacharjee B, Katz J, Keleher P.  2004.  Trust-preserving set operations. INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies. 4:2231-2241vol.4-2231-2241vol.4.
Morselli R, Bhattacharjee B, Srinivasan A, Marsh MA.  2005.  Efficient lookup on unstructured topologies. Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing. :77-86.

Pages