{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:54:53Z","timestamp":1725501293042},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772194"},{"type":"electronic","value":"9783540772200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77220-0_49","type":"book-chapter","created":{"date-parts":[[2008,1,21]],"date-time":"2008-01-21T20:07:56Z","timestamp":1200946076000},"page":"540-551","source":"Crossref","is-referenced-by-count":0,"title":["Accomplishing Approximate FCFS Fairness Without Queues"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Madduri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs (1995)"},{"issue":"3","key":"49_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/71021.71026","volume":"23","author":"S.T. Levi","year":"1989","unstructured":"Levi, S.T., Tripathi, S.K., Carson, S.D., Agrawala, A.K.: The Maruti Hard Real-Time Operating System. ACM Special Interest Group on Operating Systems\u00a023(3), 90\u2013106 (1989)","journal-title":"ACM Special Interest Group on Operating Systems"},{"key":"49_CR3","volume-title":"Algorithm Design: Foundations, Analysis and Internet Examples","author":"M.T. Goodrich","year":"2002","unstructured":"Goodrich, M.T., Tamassia, R.: Algorithm Design: Foundations, Analysis and Internet Examples. John Wiley & Sons, Chichester (2002)"},{"key":"49_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: PASTE, pp. 82\u201387 (2005)","DOI":"10.1145\/1108792.1108813"},{"key":"49_CR6","unstructured":"Louden, K.C.: Programming Languages: Principles and Practice. Brooks\/Cole (2002)"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, E.M.: Automatic verification of sequential circuit designs. In: Agnew, D., Claesen, L., Camposano, R. (eds.) Proceedings of the 11th International Conference on Computer Hardware Description Languages and their Applications (CHDL 1993), Amsterdam, The Netherlands, North-Holland. IFIP Transactions A: Computer Science and Technology, vol.\u00a032, pp. 163\u2013166 (1993)","DOI":"10.1016\/B978-0-444-81641-2.50019-8"},{"issue":"2","key":"49_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science (Fundamental Study)\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science (Fundamental Study)"},{"issue":"1-3","key":"49_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(02)00334-1","volume":"300","author":"L. Aceto","year":"2003","unstructured":"Aceto, L., Bouyer, P., Burgue\u00f1o, A., Larsen, K.G.: The power of reachability testing for timed automata. Theor. Comput. Sci.\u00a0300(1-3), 411\u2013475 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"49_CR10","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C. Demtrescu","year":"2004","unstructured":"Demtrescu, C.: A new approach to dynamic all pairs shortest paths. Journal of the ACM\u00a051(6), 968\u2013992 (2004)","journal-title":"Journal of the ACM"},{"issue":"296","key":"49_CR11","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(02)00740-5","volume":"3","author":"W. Hesse","year":"2003","unstructured":"Hesse, W.: The dynamic complexity of transitive closure is in dyntc\n                    \n                      \n                    \n                    $^{\\mbox{0}}$\n                  . Theor. Comput. Sci.\u00a03(296), 473\u2013485 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1&2","key":"49_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: On the computational complexity of dynamic graph problems. Theor. Comput. Sci.\u00a0158(1&2), 233\u2013277 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"49_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/288086.288088","volume":"23","author":"P. Revesz","year":"1998","unstructured":"Revesz, P.: Safe query languages for constraint databases. ACM Transactions on Database Systems\u00a023(1), 58\u201399 (1998)","journal-title":"ACM Transactions on Database Systems"},{"key":"49_CR14","volume-title":"Introduction to Constraint Databases","author":"P. Revesz","year":"2002","unstructured":"Revesz, P.: Introduction to Constraint Databases. Springer, Heidelberg (2002)"},{"key":"49_CR15","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"49_CR16","unstructured":"Subramani, K., Madduri, K.: A randomized, queueless algorithm for breadth-first search. International Journal of Computers and their Applications (accepted, 2007)"},{"key":"49_CR17","unstructured":"Demetrescu, C., Goldberg, A., Johnson, D.: 9th DIMACS implementation challenge \u2013 Shortest Paths (2005), \n                    \n                      http:\/\/www.dis.uniroma1.it\/~challenge9\/"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: Proc. 4th SIAM Intl. Conf. on Data Mining, Florida, USA (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"49_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45643-0_10","volume-title":"Algorithm Engineering and Experiments","author":"S. Pettie","year":"2002","unstructured":"Pettie, S., Ramachandran, V., Sridhar, S.: Experimental evaluation of a new shortest path algorithm. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 126\u2013142. Springer, Heidelberg (2002)"},{"issue":"9","key":"49_CR20","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1016\/j.jpdc.2005.03.011","volume":"65","author":"D.A. Bader","year":"2005","unstructured":"Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). J. Parallel & Distributed Comput.\u00a065(9), 994\u20131006 (2005)","journal-title":"J. Parallel & Distributed Comput."},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Conway, C.L., Namjoshi, K.S., Dams, D., Edwards, S.A.: Incremental algorithms for inter-procedural analysis of safety properties. In: Computer-Aided Verification, pp. 449\u2013461 (2005)","DOI":"10.1007\/11513988_45"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2013 HiPC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77220-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:04:20Z","timestamp":1619521460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77220-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772194","9783540772200"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77220-0_49","relation":{},"subject":[]}}