Last update: Thu Jun 20 02:01:00 MDT 2019
@Article{Bremler-Barr:2009:BOB, author = "Anat Bremler-Barr and Nir Chen and Jussi Kangasharju and Osnat Mokryn and Yuval Shavitt", title = "Bringing order to {BGP}: {Decreasing} time and message complexity", journal = j-COMP-NET-AMSTERDAM, volume = "53", number = "12", pages = "2241--2256", day = "13", month = aug, year = "2009", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Sat Apr 2 08:42:33 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", }