Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/sigecom/CharlesCDJS10
%A Charles, Denis Xavier
%A Chickering, Max
%A Devanur, Nikhil R.
%A Jain, Kamal
%A Sanghi, Manan
%B EC
%D 2010
%E Parkes, David C.
%E Dellarocas, Chrysanthos
%E Tennenholtz, Moshe
%I ACM
%K dblp
%P 121-128
%T Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads.
%U http://dblp.uni-trier.de/db/conf/sigecom/sigecom2010.html#CharlesCDJS10
%@ 978-1-60558-822-3
@inproceedings{conf/sigecom/CharlesCDJS10,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Charles, Denis Xavier and Chickering, Max and Devanur, Nikhil R. and Jain, Kamal and Sanghi, Manan},
biburl = {https://www.bibsonomy.org/bibtex/29e43b9a61209dc135488d712a10f65ce/dblp},
booktitle = {EC},
crossref = {conf/sigecom/2010},
editor = {Parkes, David C. and Dellarocas, Chrysanthos and Tennenholtz, Moshe},
ee = {https://doi.org/10.1145/1807342.1807362},
interhash = {7ba7400782c52b68224fc0f858f2b94f},
intrahash = {9e43b9a61209dc135488d712a10f65ce},
isbn = {978-1-60558-822-3},
keywords = {dblp},
pages = {121-128},
publisher = {ACM},
timestamp = {2018-11-28T11:40:39.000+0100},
title = {Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads.},
url = {http://dblp.uni-trier.de/db/conf/sigecom/sigecom2010.html#CharlesCDJS10},
year = 2010
}