<?xml version="1.0" ?>
<!-- This file was exported from BibSonomy, http://www.bibsonomy.org -->

<bibliography>

<biblioentry xreflabel="AgrawalEtAl:96" id="AgrawalEtAl:96">
   <authorgroup>
       <author><firstname>R.</firstname><surname>Agrawal</surname></author>
       <author><firstname>H.</firstname><surname>Mannila</surname></author>
       <author><firstname>R.</firstname><surname>Srikant</surname></author>
       <author><firstname>H.</firstname><surname>Toivonen</surname></author>
       <author><firstname>A.</firstname><surname>Verkamo</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Fast discovery of association rules</citetitle>





   <pubdate>1996</pubdate>  

</biblioentry>
<biblioentry xreflabel="agrawal95mining" id="agrawal95mining">
   <authorgroup>
       <author><firstname>Rakesh</firstname><surname>Agrawal</surname></author>
       <author><firstname>Ramakrishnan</firstname><surname>Srikant</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Mining sequential patterns</citetitle>

   <publisher>
      <publishername>IEEE Computer Society Press</publishername>
   </publisher>


   <artpagenums>3&#x2013;14</artpagenums> 
   <pubdate>1995</pubdate>  
   <abstract>
      <para> We are given a large database of customer transactions&#44; where each transaction consists of customer&#45;id&#44; transaction time&#44; and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem&#44; and empirically evaluate their performance using synthetic data. Two of the proposed algorithms&#44; AprioriSome and AprioriAll&#44; have comparable performance&#44; albeit AprioriSome performs a little better when the
      </para>
   </abstract>
</biblioentry>
<biblioentry xreflabel="journals/ton/EryilmazS07" id="journals/ton/EryilmazS07">
   <authorgroup>
       <author><firstname>Atilla</firstname><surname>Eryilmaz</surname></author>
       <author><firstname>R.</firstname><surname>Srikant</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Fair resource allocation in wireless networks using queue&#45;length&#45;based scheduling and congestion control.</citetitle>
   <citetitle pubwork="journal">IEEE/ACM Trans. Netw.</citetitle>

   <volumenum>15</volumenum> 

   <artpagenums>1333-1344</artpagenums> 
   <pubdate>2007</pubdate>  

</biblioentry>
<biblioentry xreflabel="horngren1994" id="horngren1994">
   <authorgroup>
       <author><firstname>Charles</firstname><othername role="mi">T.</othername><surname>Horngren</surname></author>
       <author><firstname>George</firstname><surname>Foster</surname></author>
       <author><firstname>Srikant</firstname><othername role="mi">M.</othername><surname>Datar</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Cost accounting : a managerial emphasis</citetitle>



   <edition>8. ed</edition> 

   <pubdate>1994</pubdate>  

</biblioentry>
<biblioentry xreflabel="horngren2001" id="horngren2001">
   <authorgroup>
       <author><firstname>Charles</firstname><othername role="mi">T.</othername><surname>Horngren</surname></author>
       <author><firstname>George</firstname><surname>Foster</surname></author>
       <author><firstname>Srikant</firstname><othername role="mi">M.</othername><surname>Datar</surname></author>
       <author><firstname>Michaela</firstname><othername role="mi">I.</othername><surname>Kleber</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Kostenrechnung : entscheidungsorientierte Perspektive</citetitle>



   <edition>9. Aufl</edition> 

   <pubdate>2001</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/automatica/KashyapBS07" id="journals/automatica/KashyapBS07">
   <authorgroup>
       <author><firstname>Akshay</firstname><surname>Kashyap</surname></author>
       <author><firstname>Tamer</firstname><surname>Basar</surname></author>
       <author><firstname>R.</firstname><surname>Srikant</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Quantized consensus.</citetitle>
   <citetitle pubwork="journal">Automatica</citetitle>

   <volumenum>43</volumenum> 

   <artpagenums>1192-1203</artpagenums> 
   <pubdate>2007</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/tit/LinSS08" id="journals/tit/LinSS08">
   <authorgroup>
       <author><firstname>Xiaojun</firstname><surname>Lin</surname></author>
       <author><firstname>Ness</firstname><othername role="mi">B.</othername><surname>Shroff</surname></author>
       <author><firstname>R.</firstname><surname>Srikant</surname></author> 
   </authorgroup>
<citetitle pubwork="article">On the Connection&#45;Level Stability of Congestion&#45;Controlled Communication Networks.</citetitle>
   <citetitle pubwork="journal">IEEE Transactions on Information Theory</citetitle>

   <volumenum>54</volumenum> 

   <artpagenums>2317-2338</artpagenums> 
   <pubdate>2008</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/pe/LiuBS08" id="journals/pe/LiuBS08">
   <authorgroup>
       <author><firstname>Shao</firstname><surname>Liu</surname></author>
       <author><firstname>Tamer</firstname><surname>Basar</surname></author>
       <author><firstname>R.</firstname><surname>Srikant</surname></author> 
   </authorgroup>
<citetitle pubwork="article">TCP&#45;Illinois: A loss&#45; and delay&#45;based congestion control algorithm for high&#45;speed networks.</citetitle>
   <citetitle pubwork="journal">Perform. Eval.</citetitle>

   <volumenum>65</volumenum> 

   <artpagenums>417-440</artpagenums> 
   <pubdate>2008</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/ftnet/ShakkottaiS07" id="journals/ftnet/ShakkottaiS07">
   <authorgroup>
       <author><firstname>Srinivas</firstname><surname>Shakkottai</surname></author>
       <author><firstname>R.</firstname><surname>Srikant</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Network Optimization and Control.</citetitle>
   <citetitle pubwork="journal">Foundations and Trends in Networking</citetitle>

   <volumenum>2</volumenum> 

   <artpagenums>271-379</artpagenums> 
   <pubdate>2007</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/tit/YingYS08" id="journals/tit/YingYS08">
   <authorgroup>
       <author><firstname>Lei</firstname><surname>Ying</surname></author>
       <author><firstname>Sichao</firstname><surname>Yang</surname></author>
       <author><firstname>R.</firstname><surname>Srikant</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Optimal Delay&#45;Throughput Tradeoffs in Mobile Ad Hoc Networks.</citetitle>
   <citetitle pubwork="journal">IEEE Transactions on Information Theory</citetitle>

   <volumenum>54</volumenum> 

   <artpagenums>4119-4143</artpagenums> 
   <pubdate>2008</pubdate>  

</biblioentry>
</bibliography>
