@article{epstein_robust_2014-1,
	title = {Robust algorithms for preemptive scheduling},
	volume = {69},
	issn = {0178-4617, 1432-0541},
	url = {http://link.springer.com/article/10.1007/s00453-012-9718-3},
	doi = {10.1007/s00453-012-9718-3},
	language = {en},
	urldate = {2014-04-11TZ},
	journal = {Algorithmica},
	author = {Epstein, L. and Levin, A.},
	year = {2014},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Systems Organization and Communication Networks, Data Structures, Cryptology and Information Theory, Mathematics of Computing, Migration factor, Preemptive scheduling, Robust algorithms, Theory of Computation, algorithms},
	pages = {26--57}
}

{"_id":"yEhJakYJCt8sosP8x","bibbaseid":"epstein-levin-robustalgorithmsforpreemptivescheduling-2014","downloads":0,"creationDate":"2016-12-19T20:50:58.409Z","title":"Robust algorithms for preemptive scheduling","author_short":["Epstein, L.","Levin, A."],"year":2014,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"Robust algorithms for preemptive scheduling","volume":"69","issn":"0178-4617, 1432-0541","url":"http://link.springer.com/article/10.1007/s00453-012-9718-3","doi":"10.1007/s00453-012-9718-3","language":"en","urldate":"2014-04-11TZ","journal":"Algorithmica","author":[{"propositions":[],"lastnames":["Epstein"],"firstnames":["L."],"suffixes":[]},{"propositions":[],"lastnames":["Levin"],"firstnames":["A."],"suffixes":[]}],"year":"2014","keywords":"Algorithm Analysis and Problem Complexity, Computer Systems Organization and Communication Networks, Data Structures, Cryptology and Information Theory, Mathematics of Computing, Migration factor, Preemptive scheduling, Robust algorithms, Theory of Computation, algorithms","pages":"26--57","bibtex":"@article{epstein_robust_2014-1,\n\ttitle = {Robust algorithms for preemptive scheduling},\n\tvolume = {69},\n\tissn = {0178-4617, 1432-0541},\n\turl = {http://link.springer.com/article/10.1007/s00453-012-9718-3},\n\tdoi = {10.1007/s00453-012-9718-3},\n\tlanguage = {en},\n\turldate = {2014-04-11TZ},\n\tjournal = {Algorithmica},\n\tauthor = {Epstein, L. and Levin, A.},\n\tyear = {2014},\n\tkeywords = {Algorithm Analysis and Problem Complexity, Computer Systems Organization and Communication Networks, Data Structures, Cryptology and Information Theory, Mathematics of Computing, Migration factor, Preemptive scheduling, Robust algorithms, Theory of Computation, algorithms},\n\tpages = {26--57}\n}\n\n","author_short":["Epstein, L.","Levin, A."],"key":"epstein_robust_2014-1","id":"epstein_robust_2014-1","bibbaseid":"epstein-levin-robustalgorithmsforpreemptivescheduling-2014","role":"author","urls":{"Paper":"http://link.springer.com/article/10.1007/s00453-012-9718-3"},"keyword":["Algorithm Analysis and Problem Complexity","Computer Systems Organization and Communication Networks","Data Structures","Cryptology and Information Theory","Mathematics of Computing","Migration factor","Preemptive scheduling","Robust algorithms","Theory of Computation","algorithms"],"downloads":0,"html":""},"search_terms":["robust","algorithms","preemptive","scheduling","epstein","levin"],"keywords":["algorithm analysis and problem complexity","computer systems organization and communication networks","data structures","cryptology and information theory","mathematics of computing","migration factor","preemptive scheduling","robust algorithms","theory of computation","algorithms"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}