%0 Conference Paper %1 BRS2011:Easy %A Biely, Martin %A Robinson, Peter %A Schmid, Ulrich %B OPODIS %D 2011 %E Anta, Antonio Fernández %E Lipari, Giuseppe %E Roy, Matthieu %I Springer %K myown %P 299-312 %T Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. %U http://dblp.uni-trier.de/db/conf/opodis/opodis2011.html#BielyRS11 %V 7109 %@ 978-3-642-25872-5

@inproceedings{BRS2011:Easy, added-at = {2011-12-14T18:59:29.000+0100}, author = {Biely, Martin and Robinson, Peter and Schmid, Ulrich}, biburl = {https://www.bibsonomy.org/bibtex/27d1e70716620e1fbfb2bd597af0442e4/monoid}, booktitle = {OPODIS}, crossref = {conf/opodis/2011}, editor = {Anta, Antonio Fernández and Lipari, Giuseppe and Roy, Matthieu}, ee = {http://dx.doi.org/10.1007/978-3-642-25873-2_21}, groups = {public}, interhash = {8c7f608b934a338e954c3b495765e0e0}, intrahash = {7d1e70716620e1fbfb2bd597af0442e4}, isbn = {978-3-642-25872-5}, keywords = {myown}, pages = {299-312}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2011-12-15T20:27:29.000+0100}, title = {Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems.}, url = {http://dblp.uni-trier.de/db/conf/opodis/opodis2011.html#BielyRS11}, username = {monoid}, volume = 7109, year = 2011 }