@inproceedings{AgrawalEtAl:96,
	title = {Fast discovery of association rules},
	author = {R. Agrawal and H. Mannila and R. Srikant and H. Toivonen and A. Verkamo},
	booktitle = {Advances in Knowledge Discovery and Data Mining},
	year = {1996},
	biburl = {http://www.bibsonomy.org/bibtex/20920961f02f44de9862d1c0bceecbe20/brefeld},
	opteditor = {U. Fayyad and G. Piatetsky-Shapiro and P. Smyth and R. Uthurusamy},
	keywords = {imported }
}

@article{journals/tit/YingYS08,
	title = {Optimal Delay-Throughput Tradeoffs in Mobile Ad Hoc Networks.},
	author = {Lei Ying and Sichao Yang and R. Srikant},
	journal = {IEEE Transactions on Information Theory},
	number = {9},
	pages = {4119-4143},
	url = {http://dblp.uni-trier.de/db/journals/tit/tit54.html#YingYS08},
	volume = {54},
	year = {2008},
	biburl = {http://www.bibsonomy.org/bibtex/2a72029914f0757e6778c6733faa6c22a/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1109/TIT.2008.928247}, date = {2008-09-01},
	keywords = {dblp }
}

@article{journals/tit/LinSS08,
	title = {On the Connection-Level Stability of Congestion-Controlled Communication Networks.},
	author = {Xiaojun Lin and Ness B. Shroff and R. Srikant},
	journal = {IEEE Transactions on Information Theory},
	number = {5},
	pages = {2317-2338},
	url = {http://dblp.uni-trier.de/db/journals/tit/tit54.html#LinSS08},
	volume = {54},
	year = {2008},
	biburl = {http://www.bibsonomy.org/bibtex/285eee27294d6ce6eb57e58539d6595ee/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1109/TIT.2008.920213}, date = {2008-08-29},
	keywords = {dblp }
}

@article{journals/pe/LiuBS08,
	title = {TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks.},
	author = {Shao Liu and Tamer Basar and R. Srikant},
	journal = {Perform. Eval.},
	number = {6-7},
	pages = {417-440},
	url = {http://dblp.uni-trier.de/db/journals/pe/pe65.html#LiuBS08},
	volume = {65},
	year = {2008},
	biburl = {http://www.bibsonomy.org/bibtex/256207f4be911cf0471f196355ca7f70d/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1016/j.peva.2007.12.007}, date = {2008-06-12},
	keywords = {dblp }
}

@article{journals/automatica/KashyapBS07,
	title = {Quantized consensus.},
	author = {Akshay Kashyap and Tamer Basar and R. Srikant},
	journal = {Automatica},
	number = {7},
	pages = {1192-1203},
	url = {http://dblp.uni-trier.de/db/journals/automatica/automatica43.html#KashyapBS07},
	volume = {43},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/2bb136f05ab21e5aae400ddfb3d730da6/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1016/j.automatica.2007.01.002}, date = {2008-06-09},
	keywords = {dblp }
}

@book{horngren1994,
	title = {Cost accounting : a managerial emphasis},
	address = {Prentice-Hall},
	annote = {XXII, 969 S},
	author = {{Charles T.} Horngren and {George} Foster and {Srikant M.} Datar},
	edition = {8. ed},
	howpublished = {Englewood Cliffs, NJ},
	url = {http://gso.gbv.de/DB=2.1/CMD?ACT=SRCHA&SRT=YOP&IKT=1016&TRM=ppn+043360637&sourceid=fbw_bibsonomy},
	year = {1994},
	biburl = {http://www.bibsonomy.org/bibtex/28d677218ae7ead4c3c8ac0a710f5e59b/fbw},
	description = {imported},
	isbn = {0-13-181066-9},
	keywords = {Kostenrechnung }
}

@book{horngren2001,
	title = {Kostenrechnung : entscheidungsorientierte Perspektive},
	address = {Oldenbourg},
	annote = {XXII, 948 S},
	author = {{Charles T.} Horngren and {George} Foster and {Srikant M.} Datar and {Michaela I.} Kleber},
	edition = {9. Aufl},
	howpublished = {München [u.a.]},
	url = {http://gso.gbv.de/DB=2.1/CMD?ACT=SRCHA&SRT=YOP&IKT=1016&TRM=ppn+319367355&sourceid=fbw_bibsonomy},
	year = {2001},
	biburl = {http://www.bibsonomy.org/bibtex/2aca27c6d206e4475e3ba3c009c61f052/fbw},
	description = {imported},
	isbn = {3-486-25570-3},
	keywords = {imported }
}

@article{journals/ton/EryilmazS07,
	title = {Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control.},
	author = {Atilla Eryilmaz and R. Srikant},
	journal = {IEEE/ACM Trans. Netw.},
	number = {6},
	pages = {1333-1344},
	url = {http://dblp.uni-trier.de/db/journals/ton/ton15.html#EryilmazS07},
	volume = {15},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/2d7085e570089d2c096a65f83a497fff8/dblp},
	description = {dblp},
	ee = {http://doi.acm.org/10.1145/1373476.1373486}, date = {2008-05-26},
	keywords = {dblp }
}

@article{journals/ftnet/ShakkottaiS07,
	title = {Network Optimization and Control.},
	author = {Srinivas Shakkottai and R. Srikant},
	journal = {Foundations and Trends in Networking},
	number = {3},
	pages = {271-379},
	url = {http://dblp.uni-trier.de/db/journals/ftnet/ftnet2.html#ShakkottaiS07},
	volume = {2},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/2bfbfab4592e007604b46f40a34e4b1c6/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1561/1300000007}, date = {2008-05-21},
	keywords = {dblp }
}

@inproceedings{agrawal95mining,
	title = {Mining sequential patterns},
	address = {Taipei, Taiwan},
	author = {Rakesh Agrawal and Ramakrishnan Srikant},
	booktitle = {Eleventh International Conference on Data Engineering},
	editor = {Philip S. Yu and Arbee S. P. Chen},
	pages = {3--14},
	publisher = {IEEE Computer Society Press},
	url = {citeseer.ist.psu.edu/agrawal95mining.html},
	year = {1995},
	biburl = {http://www.bibsonomy.org/bibtex/20a7fa171a0ea7198f21a3ef16c922fb7/dzibold},
	description = {One of the most cited papers  on Mining Sequential Patterns
One of the approaches used by Gruhl.
Two efficient algorithms for key words extraction.
Pseudo-Code of algorithms},
	abstract = { We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, 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, and empirically evaluate their performance using synthetic data. Two of the proposed algorithms, AprioriSome and AprioriAll, have comparable performance, albeit AprioriSome performs a little better when the},
	keywords = {idiom keywords pattern_mining similarity }
}