remove paper titles

BU-DiSC · Sep 5, 2023 · 3d199af · 3d199af
1 parent 1c99331
commit 3d199af
Showing 1 changed file with 6 additions and 6 deletions.
diff --git a/index.html b/index.html
@@ -175,7 +175,7 @@ <h1 class="text-center">Class at a Glance</h1>
 			<div class="col-lg-6 col-md-6 text-center">
 				<p> Labs: Fri 12:20-1:10pm / 1:25-2:15pm / 4:40-5:30pm, <a href="https://www.bu.edu/classrooms/classroom/har-211/" target="_blank">HAR 211</a> / <a href="https://www.bu.edu/classrooms/classroom/psy-b35/" target="_blank">PSY B35</a>/ <a href="https://www.bu.edu/classrooms/classroom/brb-122/" target="_blank">BRB 122</a><br>
                 TFs:
-                <a href="https://cs-people.bu.edu/karatse/" target="_blank">Konstantinos Karatsenidis</a>   <a href="mailto:[email protected]?subject=[CS660]"><i class="fa fa-envelope"></i></a>, &nbsp;
+                <a href="https://cs-people.bu.edu/karatse/" target="_blank">Kostas Karatsenidis</a>   <a href="mailto:[email protected]?subject=[CS660]"><i class="fa fa-envelope"></i></a>, &nbsp;
                 <a href="https://cs-people.bu.edu/aneeshr/" target="_blank">Aneesh Raman</a>   <a href="mailto:[email protected]?subject=[CS660]"><i class="fa fa-envelope"></i></a>, &nbsp;
                 <a href="https://cs-people.bu.edu/zczhu/" target="_blank">Zichen Zhu</a>   <a href="mailto:[email protected]?subject=[CS660]"><i class="fa fa-envelope"></i></a> &nbsp;
                 <br>
@@ -390,7 +390,7 @@ <h4 class="post-subtitle">Class <script type="text/javascript">document.write(cd
                         <ul>
                             <li><a tabindex="-1" href="./slides/CS660-Fall2023-Class10.pdf">Slides</a></li>
                             <li><a href="http://pages.cs.wisc.edu/~dbbook/" target="_blank"><i class="fa fa-book fa-6" aria-hidden="true"></i></a> Chapter 8 &amp; 9.1, 9.5-9.7</li>
-                            <li><a href="https://link.springer.com/article/10.1007%2Fs00778-002-0074-9"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> "Data page layouts for relational databases on deep memory hierarchies", The VLDB Journal, 2002 (Sections 1, 2, 3, 4)</li>
+                            <li><a href="https://link.springer.com/article/10.1007%2Fs00778-002-0074-9"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> Sections 1, 2, 3, 4</li>
                         </ul>
                     </div>
                 </div>
@@ -408,8 +408,8 @@ <h4 class="post-subtitle">Class <script type="text/javascript">document.write(cd
                         <ul>
                             <li><a tabindex="-1" href="./slides/CS660-Fall2023-Class11.pdf">Slides</a></li>
                             <li><a href="http://pages.cs.wisc.edu/~dbbook/" target="_blank"><i class="fa fa-book fa-6" aria-hidden="true"></i></a> Chapter 9.1-9.4</li>
-                            <li><a href="https://www.usenix.org/legacy/events/fast05/tech/schlosser/schlosser.pdf"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> "On Multidimensional Data and Modern Disks", FAST 2005 (Sections 1, 2, 3, 4)</li>
-                            <li><a href="https://www.usenix.org/legacy/events/usenix08/tech/full_papers/agrawal/agrawal_html/index.html"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> "Design Tradeoffs for SSD Performance", USENIX ATC 2008 (Sections 1, 2, 3)</li>
+                            <li><a href="https://www.usenix.org/legacy/events/fast05/tech/schlosser/schlosser.pdf"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> Sections 1, 2, 3, 4)</li>
+                            <li><a href="https://www.usenix.org/legacy/events/usenix08/tech/full_papers/agrawal/agrawal_html/index.html"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> Sections 1, 2, 3</li>
                         </ul>
                     </div>
                 </div>
@@ -478,7 +478,7 @@ <h4 class="post-subtitle">Class <script type="text/javascript">document.write(cd
                     <div class="col-lg-3 post-preview">
                         <ul>
                             <li><a tabindex="-1" href="./slides/CS660-Fall2023-Class16.pdf">Slides</a></li>
-                            <li><a href="https://dl.acm.org/citation.cfm?id=3276980"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> "Optimal Bloom Filters and Adaptive Merging for LSM-Trees", ACM TODS 2018 (Sections 1, 2, 3)</li>
+                            <li><a href="https://dl.acm.org/citation.cfm?id=3276980"><i class="fa fa-file-text-o" aria-hidden="true"></i></a> Sections 1, 2, 3</li>
                         </ul>
                     </div>
                 </div>
@@ -522,7 +522,7 @@ <h4 class="post-subtitle">Midterm</h4>
                         <p class="post-meta"><script type="text/javascript"> document.write(classDay(cday));cday++;</script></p>
                     </div>
                     <div class="col-lg-7 post-preview">
-                        <p class="post-content">You can bring with you <strong>one pages (one sheet one side) of any notes</strong> you want. No more material will be available. No laptops, tablets or phones are allowed. 
+                        <p class="post-content">You can bring with you <strong>one page (one sheet one side) of any notes</strong> you want. No more material will be available. No laptops, tablets or phones are allowed. 
                         Please come 2-3 minutes prior to the top of the hour to start sharp at 2pm.</p>
                         <!-- <p class="post-content">Details to follow. </p> -->
                     </div>