diff --git a/gtsam/linear/GaussianFactorGraph.cpp b/gtsam/linear/GaussianFactorGraph.cpp
index f10309d76..438a06783 100644
--- a/gtsam/linear/GaussianFactorGraph.cpp
+++ b/gtsam/linear/GaussianFactorGraph.cpp
@@ -61,7 +61,7 @@ namespace gtsam {
       for ( GaussianFactor::const_iterator it = gf->begin() ; it != gf->end() ; it++ ) {
         map<Key,size_t>::iterator it2 = spec.find(*it);
         if ( it2 == spec.end() ) {
-          spec.insert(make_pair<Key,size_t>(*it, gf->getDim(it)));
+          spec.insert(make_pair(*it, gf->getDim(it)));
         }
       }
     }
diff --git a/gtsam/linear/IterativeSolver.cpp b/gtsam/linear/IterativeSolver.cpp
index 36178b191..ab3ccde13 100644
--- a/gtsam/linear/IterativeSolver.cpp
+++ b/gtsam/linear/IterativeSolver.cpp
@@ -99,7 +99,7 @@ void KeyInfo::initialize(const GaussianFactorGraph &fg){
   for ( size_t i = 0 ; i < n ; ++i ) {
     const size_t key = ordering_[i];
     const size_t dim = colspec.find(key)->second;
-    insert(make_pair<Key, KeyInfoEntry>(key, KeyInfoEntry(i, dim, start)));
+    insert(make_pair(key, KeyInfoEntry(i, dim, start)));
     start += dim ;
   }
   numCols_ = start;
diff --git a/gtsam/linear/SubgraphPreconditioner.cpp b/gtsam/linear/SubgraphPreconditioner.cpp
index 20b434b9f..f5ee4ddfc 100644
--- a/gtsam/linear/SubgraphPreconditioner.cpp
+++ b/gtsam/linear/SubgraphPreconditioner.cpp
@@ -617,7 +617,7 @@ Vector getSubvector(const Vector &src, const KeyInfo &keyInfo, const FastVector<
   size_t d = 0;
   BOOST_FOREACH ( const Key &key, keys ) {
     const KeyInfoEntry &entry = keyInfo.find(key)->second;
-    cache.push_back(make_pair<size_t,size_t>(entry.colstart(), entry.dim()));
+    cache.push_back(make_pair(entry.colstart(), entry.dim()));
     d += entry.dim();
   }
 
diff --git a/gtsam/linear/SubgraphPreconditioner.h b/gtsam/linear/SubgraphPreconditioner.h
index 261e435dc..4c65d14ca 100644
--- a/gtsam/linear/SubgraphPreconditioner.h
+++ b/gtsam/linear/SubgraphPreconditioner.h
@@ -302,7 +302,7 @@ namespace gtsam {
      std::vector<std::pair<size_t,T> > tmp;
      tmp.reserve(n);
      for ( size_t i = 0 ; i < n ; i++ )
-       tmp.push_back(std::make_pair<size_t,T>(i, src[i]));
+       tmp.push_back(std::make_pair(i, src[i]));
 
      /* sort */
      std::stable_sort(tmp.begin(), tmp.end()) ;